In this paper, we propose an extension of the grammar of an application deployment constraints description language from a cloud computing platform.
To do this, we draw a meta data model proposed by [1] for an application deployment in a cloud. This meta model, we extend j-ASD for the consideration of compatibility constraints or conformity between the virtual image data file formats used by the components of the virtual machines and those target sites that are deploying Smartphones, pc, etc ...
Indeed for a full deployment of applications from a cloud environment on high mobility rate (Smartphone, PC, etc ...), it occurs to ensure compliance of the data formats of these environments to that of Cloud platform. This conformity proves a prerequisite for deployment on a device from a cloud.
To address these compliance constraints, we formalize them in matrix form and propose the use of a constraint solver.

Keywords— application deployment, software component description language constraint, Cloud computing, deployment plan

MANET is a collection of number of nodes that formulates; either, a temporary or permanent, self-organized wireless network that don’t rely on any pivotal central architecture or control. They are designed to use in situations where infrastructure network is either non-existent or its extremely costly to deploy. MANETs require a distinctive, unique and insistent identity for each node for its security protocols to be ef1'ective; Sybil attacks present a grave threat to such networks. We can create large number of logical identities in a Sybil attack on a single physical device by a selfish malicious node which gives a false impression to the network that they are different benign nodes and uses them to launch a harmonized attack against the network or a node. Node cooperation is very important for detection of Sybil attack, but unfortunately nodes may not always behave cooperatively and may collude in hostile environments for disrupting the detection accuracy of such systems. Sybil nodes cannot be accurately detected in the presence of malicious collusion which results in serious impact on detection accuracy of Sybil attacks. This paper proposed a novel scheme in order to detect a Sybil attack resistant to collusion by incorporating a trust based mechanism that would mitigate the benefit (the payof1' gained) from collusion. Experimental results show that our proposed scheme detects Sybil or whitewashers new identities accurately and reduces the benefits of collusion in the presence of mobility. Index Terms-Collusion Attack, Sybil Attack, Recommendation model, Malicious Recommendations. Fully self-controlled mobile ad hoc networks represent a complex system. Due to the broadcast nature of wireless channel, MANET has many security issues. Especially, Sybil Attack is a very serious threat to the MANET as it creates multiple virtual fake identities per entity, there by affecting the routing table. The multiple virtual identities are obtained by spoofing the victim’s node or by creating an arbitrary node as there is no restriction to create an arbitrary node in MANET. In the existing system,   used RSSI as a parameter to detect the Sybil node because of its lightweight but it has failed to detect the fast moving Sybil nodes. The proposed system works considering the Certification Authority as one parameter and RSSI as the other parameter. The RSSI is used to form the cluster and to elect the cluster head. The CA’s responsibility is given to the CH. Whenever huge variations occur in RSSI on neighbor’s entry and exit behavior, the Certification Authority comes into play. The CA checks the certification of a node. If it is not valid, its certificate is revoked otherwise it is free to communicate in the network. 
Keywords—Identity-based attacks, Mobility based d-hop cluster, intrusion detection, Certification Authority, Digital Certificate, Sybil attacks, component; formatting; style; styling; insert (key words)

Cloud computing has become a new platform for personal computing. Cloud computing provides high performance computing resources and mass storage resources.Data Deduplication involves finding and removing duplication within data without compromising its integrity. A practical multi-user cloud storage system needs the secure client-side cross-user Deduplication technique, which allows a user to skip the uploading process and obtain the ownership of the files immediately, when other owners of the same files have uploaded them to the cloud server. To the best of our knowledge, none of the existing dynamic PoSs can support this technique. In this paper, we introduce the concept of deduplicatable dynamic proof of storage and propose an efficient construction called DeyPoS, to achieve dynamic PoS and secure cross-user Deduplication, simultaneously. Considering the challenges of structure diversity and private tag generation, we exploit a novel tool called Homomorphic Authenticated Tree (HAT). We prove the security of our construction, and the theoretical analysis and experimental results show that our construction is efficient in practice.

Keywords— Structure Diversity, Cloud Storage, Deduplication, Dynamic Proof of Storage.

Exchanging data streams to an advantage rich cloud server for internal thing evaluation, a basic building frustrate in various standard stream applications (e.g., quantifiable watching), is addressing various associations and individuals. On the other hand, checking the delayed consequence of the remote count accept an essential part in tending to the issue of trust. Since the outsourced data amassing likely starts from different data sources, it is needed for the structure to have the ability to pinpoint the originator of bungles by administering each data source a unique secret key, which requires the inward thing check to be performed under any two social occasions' differing keys. Regardless, the present game plans either depend on upon a lone key supposition or powerful yet practically inefficient totally homomorphic cryptosystems. In this paper, we focus on the all the more troublesome multi-key circumstance where data streams are exchanged by various data sources with unmistakable keys. We first present a novel homomorphic clear name framework to transparently affirm the outsourced inward thing count on the dynamic data streams, and after that extend it to support the check of network thing count. We exhibit the security of our arrangement in the discretionary prophet model. Furthermore, the exploratory result similarly shows the practicability of our arrangement.

Keywords— Data stream, Computation outsourcing, Storage outsourcing, Multiple keys, Public verifiability

Data cleaning is the method of adjusting or eradicating information that is wrong, unfinished, inappropriately formatted or reproduced. A business in a data-intensive profession like banking, insurance, trade and telecommunication might use a data cleaning engine to methodically inspect data for errors by using set of laws, business rules and algorithms. Data cleaning is a vital undertaking for data warehouse experts, database managers and developers in insurance industry. In today's competitive environment, there is a need to make available a program for insurance industry which emphasizes on data quality by using methods and techniques for data cleaning. This will help companies to improve data preparation and reporting capabilities. This paper aims to facilitate the data cleaning process by addressing the problem of duplicate records detection pertaining to the name attributes of the data sets. It provides a sequence of algorithms through a novel framework for identifying duplicity in the 'name' attributes of the data sets of an already existing data warehouse.y