Parallel and Distributed System IEEE 2014 Projects

Web : www.kasanpro.com     Email : sales@kasanpro.com

List Link : http://kasanpro.com/projects-list/parallel-and-distributed-system-ieee-2014-projects

Title :An Error Minimizing Framework for Localizing Jammers in Wireless NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/error-minimizing-localizing-jammers-wireless-networks

Abstract : Jammers can severely disrupt the communications in wireless networks, and jammers' position informationallows the defender to actively eliminate the jamming attacks. Thus, in this paper, we aim to design a framework thatcan localize one or multiple jammers with a high accuracy. Most of existing jammer-localization schemes utilizeindirect measurements (e.g., hearing ranges) affected by jamming attacks, which makes it difficult to localize jammersaccurately. Instead, we exploit a direct measurement-the strength of jamming signals (JSS). Estimating JSS ischallenging as jamming signals may be embedded in other signals. As such, we devise an estimation scheme basedon ambient noise floor and validate it with real-world experiments. To further reduce estimation errors, we define anevaluation feedback metric to quantify the estimation errors and formulate jammer localization as a non-linearoptimization problem, whose global optimal solution is close to jammers' true positions. We explore several heuristicsearch algorithms for approaching the global optimal solution, and our simulation results show that ourerror-minimizing-based framework achieves better performance than the existing schemes. In addition, our errorminimizing framework can utilize indirect measurements to obtain a better location estimation compared with priorwork.

Title :An Error Minimizing Framework for Localizing Jammers in Wireless NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/error-minimizing-localizing-jammers-wireless-networks-code

Abstract : Jammers can severely disrupt the communications in wireless networks, and jammers' position informationallows the defender to actively eliminate the jamming attacks. Thus, in this paper, we aim to design a framework thatcan localize one or multiple jammers with a high accuracy. Most of existing jammer-localization schemes utilizeindirect measurements (e.g., hearing ranges) affected by jamming attacks, which makes it difficult to localize jammersaccurately. Instead, we exploit a direct measurement-the strength of jamming signals (JSS). Estimating JSS ischallenging as jamming signals may be embedded in other signals. As such, we devise an estimation scheme basedon ambient noise floor and validate it with real-world experiments. To further reduce estimation errors, we define anevaluation feedback metric to quantify the estimation errors and formulate jammer localization as a non-linearoptimization problem, whose global optimal solution is close to jammers' true positions. We explore several heuristicsearch algorithms for approaching the global optimal solution, and our simulation results show that ourerror-minimizing-based framework achieves better performance than the existing schemes. In addition, our errorminimizing framework can utilize indirect measurements to obtain a better location estimation compared with priorwork.

Title :Localized Movement-Assisted Sensor Deployment Algorithm for Hole Detection and HealingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/localized-movement-assisted-sensor-deployment-algorithm-hole-detection-healing

Abstract : One of the fundamental services provided by a wireless sensor network (WSN) is the monitoring of aspecified region of interest (RoI). Considering the fact that emergence of holes in the RoI is unavoidable due to theinner nature of WSNs, random deployment, environmental factors, and external attacks, assuring that the RoI iscompletely and continuously covered is very important. This paper seeks to address the problem of hole detectionand healing in mobile WSNs. We discuss the main drawbacks of existing solutions and we identify four key elementsthat are critical for ensuring effective coverage in mobile WSNs: 1) determining the boundary of the RoI, 2) detectingcoverage holes and estimating their characteristics, 3) determining the best target locations to relocate mobile nodesto repair holes, and 4) dispatching mobile nodes to the target locations while minimizing the moving and messaging

cost. We propose a lightweight and comprehensive solution, called holes detection and healing (HEAL), thataddresses all of the aforementioned aspects. The computation complexity of HEAL is O2 where v is the averagenumber of 1-hop neighbors. HEAL is a distributed and localized algorithm that operates in two distinct phases. Thefirst identifies the boundary nodes and discovers holes using a lightweight localized protocol over the Gabriel graph ofthe network. The second treats the hole healing, with novel concept, hole healing area. We propose a distributedvirtual forces-based local healing approach where only the nodes located at an appropriate distance from the hole willbe involved in the healing process. Through extensive simulations we show that HEAL deals with holes of variousforms and sizes, and provides a cost-effective and an accurate solution for hole detection and healing.

Title :A Hybrid Cloud Approach for Secure Authorized DeduplicationLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/hybrid-cloud-secure-authorized-deduplication

Abstract : Data deduplication is one of important data compression techniques for eliminating duplicate copies ofrepeating data, and has been widely used in cloud storage to reduce the amount of storage space and savebandwidth. To protect the confidentiality of sensitive data while supporting deduplication, the convergent encryptiontechnique has been proposed to encrypt the data before outsourcing. To better protect data security, this papermakes the first attempt to formally address the problem of authorized data deduplication. Different from traditionaldeduplication systems, the differential privileges of users are further considered in duplicate check besides the dataitself.We also present several new deduplication constructions supporting authorized duplicate check in a hybrid cloudarchitecture. Security analysis demonstrates that our scheme is secure in terms of the definitions specified in theproposed security model. As a proof of concept, we implement a prototype of our proposed authorized duplicatecheck scheme and conduct testbed experiments using our prototype. We show that our proposed authorizedduplicate check scheme incurs minimal overhead compared to normal operations.

Title :Behavior Rule Specification-based Intrusion Detection for Safety Critical Medical Cyber Physical SystemsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/behavior-rule-specification-based-intrusion-detection-cyber-physical-systems

Abstract : We propose and analyze a behavior-rule specification-based technique for intrusion detection of medicaldevices embedded in a medical cyber physical system (MCPS) in which the patient's safety is of the utmostimportance. We propose a methodology to transform behavior rules to a state machine, so that a device that is beingmonitored for its behavior can easily be checked against the transformed state machine for deviation from its behaviorspecification. Using vital sign monitor medical devices as an example, we demonstrate that our intrusion detectiontechnique can effectively trade false positives off for a high detection probability to cope with more sophisticated andhidden attackers to support ultra safe and secure MCPS applications. Moreover, through a comparative analysis, wedemonstrate that our behavior-rule specificationbased IDS technique outperforms two existing anomaly-basedtechniques for detecting abnormal patient behaviors in pervasive healthcare applications.

Parallel and Distributed System IEEE 2014 Projects

Title :Community-home-based Multi-copy Routing in Mobile Social NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/community-home-based-multi-copy-routing-mobile-social-networks

Abstract : A mobile social network (MSN) is a special kind of delay tolerant network (DTN) composed of mobilenodes that move around and share information with each other through their carried short-distance wirelesscommunication devices. A main characteristic of MSNs is that mobile nodes in the networks generally visit somelocations (namely, community homes) frequently, while visiting other locations less frequently. In this paper, wepropose a novel zero-knowledge multi-copy routing algorithm, homing spread (HS), for homogeneous MSNs, in whichall mobile nodes share all community homes. HS is a distributed and localized algorithm. It mainly lets communityhomes spread messages with a higher priority. Theoretical analysis shows that HS can spread a given number ofmessage copies in an optimal way when the inter-meeting time between any two nodes and between a node and acommunity home follows independent and identical exponential distributions, respectively. We also extend HS to theheterogeneous MSNs, where mobile nodes have different community homes. In addition, we calculate the expecteddelivery delay of HS, and conduct extensive simulations. Results show that community homes are important factors inmessage spreading. By using homes to spread messages faster, HS achieves a better performance than existingzero-knowledge MSN routing algorithms, including Epidemic (with a given number of copies), and Spray&Wait.

Title :Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds

Language : C#

Project Link : http://kasanpro.com/p/c-sharp/decentralized-access-control-anonymous-authentication-data-stored-clouds

Abstract : We propose a new decentralized access control scheme for secure data storage in clouds, that supportsanonymous authentication. In the proposed scheme, the cloud verifies the authenticity of the ser without knowing theuser's identity before storing data. Our scheme also has the added feature of access control in which only valid usersare able to decrypt the stored information. The scheme prevents replay attacks and supports creation, modification,and reading data stored in the cloud. We also address user revocation. Moreover, our authentication and accesscontrol scheme is decentralized and robust, unlike other access control schemes designed for clouds which arecentralized. The communication, computation, and storage overheads are comparable to centralized approaches.

Title :Exploiting Service Similarity for Privacy in Location Based Search QueriesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/exploiting-service-similarity-privacy-location-based-search-queries

Abstract : Location-based applications utilize the positioning capabilities of a mobile device to determine the currentlocation of a user, and customize query results to include neighboring points of interests. However, locationknowledge is often perceived as personal information. One of the immediate issues hindering the wide acceptance oflocation-based applications is the lack of appropriate methodologies that offer fine grain privacy controls to a userwithout vastly affecting the usability of the service. While a number of privacy-preserving models and algorithms havetaken shape in the past few years, there is an almost universal need to specify one's privacy requirement withoutunderstanding its implications on the service quality. In this paper, we propose a user-centric location- based servicearchitecture where a user can observe the impact of location inaccuracy on the service accuracy before deciding thegeo-coordinates to use in a query. We construct a local search application based on this architecture anddemonstrate how meaningful information can be exchanged between the user and the service provider to allow theinference of contours depicting the change in query results across a geographic area. Results indicate the possibilityof large default privacy regions (areas of no change in result set) in such applications.

http://kasanpro.com/ieee/final-year-project-center-tiruppur-reviews

Title :Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud StorageLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/expressive-efficient-revocable-data-access-control-multi-authority-cloud-storage

Abstract : Data access control is an effective way to ensure the data security in the cloud. Due to data outsourcingand untrusted cloud servers, the data access control becomes a challenging issue in cloud storage systems.Ciphertext-Policy Attribute-based Encryption (CP-ABE) is regarded as one of the most suitable technologies for dataaccess control in cloud storage, because it gives data owners more direct control on access policies. However, it isdifficult to directly apply existing CP-ABE schemes to data access control for cloud storage systems because of theattribute revocation problem. In this paper, we design an expressive, efficient and revocable data access controlscheme for multi-authority cloud storage systems, where there are multiple authorities co-exist and each authority isable to issue attributes independently. Specifically, we propose a revocable multi-authority CP-ABE scheme, andapply it as the underlying techniques to design the data access control scheme. Our attribute revocation method canefficiently achieve both forward security and backward security. The analysis and simulation results show that ourproposed data access control scheme is secure in the random oracle model and is more efficient than previousworks.

Title :Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud StorageLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/key-aggregate-cryptosystem-scalable-data-sharing-cloud-storage

Abstract : Data sharing is an important functionality in cloud storage. In this article, we show how to securely,efficiently, and flexibly share data with others in cloud storage. We describe new public-key cryptosystems whichproduce constant-size ciphertexts such that efficient delegation of decryption rights for any set of ciphertexts arepossible. The novelty is that one can aggregate any set of secret keys and make them as compact as a single key,but encompassing the power of all the keys being aggregated. In other words, the secret key holder can release a

constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the other encrypted files outsidethe set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in a smartcard with very limited secure storage. We provide formal security analysis of our schemes in the standard model. Wealso describe other application of our schemes. In particular, our schemes give the first public-key patient-controlledencryption for flexible hierarchy, which was yet to be known.

Parallel and Distributed System IEEE 2014 Projects

Title :Link Quality Aware Code Dissemination in Wireless Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/link-quality-aware-dissemination-wireless-sensor-networks

Abstract : Wireless reprogramming is a crucial technique for software deployment in wireless sensor networks(WSNs). Code dissemination is a basic building block to enable wireless reprogramming. We present ECD, anEfficient Code Dissemination protocol leveraging 1-hop link quality information based on the TinyOS platform.Compared to prior works, ECD has three salient features. First, it supports dynamically configurable packet sizes. Byincreasing the packet size for high PHY rate radios, it significantly improves the transmission efficiency. Second, itemploys an accurate sender selection algorithm to mitigate transmission collisions and transmissions over poor links.Third, it employs a simple impact-based backoff timer design to shorten the time spent in coordinating multiple eligiblesenders so that the largest impact sender is most likely to transmit. We implement ECD based on TinyOS andevaluate its performance extensively via testbed experiments and simulations. Results show that ECD outperformsstate-of-the-art protocols, Deluge and MNP, in terms of completion time and data traffic (e.g., about 20 percent lesstraffic and 20-30 percent shorter completion time compared to Deluge).

Title :On the Security of Trustee-Based Social AuthenticationsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/on-security-trustee-based-social-authentications

Abstract : Recently, authenticating users with the help of their friends (i.e., trustee-based social authentication) hasbeen shown to be a promising backup authentication mechanism. A user in this system is associated with a fewtrustees that were selected from the user's friends. When the user wants to regain access to the account, the serviceprovider sends different verification codes to the user's trustees. The user must obtain at least k (i.e., recoverythreshold) verification codes from the trustees before being directed to reset his or her password. In this paper, weprovide the first systematic study about the security of trusteebased social authentications. In particular, we firstintroduce a novel framework of attacks, which we call forest fire attacks. In these attacks, an attacker initially obtains asmall number of compromised users, and then the attacker iteratively attacks the rest of users by exploitingtrustee-based social authentications. Then, we construct a probabilistic model to formalize the threats of forest fireattacks and their costs for attackers. Moreover, we introduce various defense strategies. Finally, we apply ourframework to extensively evaluate various concrete attack and defense strategies using three real-world socialnetwork datasets. Our results have strong implications for the design of more secure trustee-based socialauthentications.

Title :QoS Aware Geographic Opportunistic Routing in Wireless Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/qos-aware-geographic-opportunistic-routing-wireless-sensor-networks

Abstract : QoS routing is an important research issue in wireless sensor networks (WSNs), especially formission-critical monitoring and surveillance systems which requires timely and reliable data delivery. Existing workexploits multipath routing to guarantee both reliability and delay QoS constraints in WSNs. However, the multipathrouting approach suffers from a significant energy cost. In this work, we exploit the geographic opportunistic routing(GOR) for QoS provisioning with both end-to-end reliability and delay constraints in WSNs. Existing GOR protocolsare not efficient for QoS provisioning in WSNs, in terms of the energy efficiency and computation delay at each hop.To improve the efficiency of QoS routing in WSNs, we define the problem of efficient GOR for multiconstrained QoSprovisioning in WSNs, which can be formulated as a multiobjective multiconstraint optimization problem. Based on theanalysis and observations of different routing metrics in GOR, we then propose an Efficient QoS-aware GOR(EQGOR) protocol for QoS provisioning in WSNs. EQGOR selects and prioritizes the forwarding candidate set in anefficient manner, which is suitable for WSNs in respect of energy efficiency, latency, and time complexity. Wecomprehensively evaluate EQGOR by comparing it with the multipath routing approach and other baseline protocolsthrough ns-2 simulation and evaluate its time complexity through measurement on the MicaZ node. Evaluation resultsdemonstrate the effectiveness of the GOR approach for QoS provisioning in WSNs. EQGOR significantly improvesboth the end-to-end energy efficiency and latency, and it is characterized by the low time complexity.

Title :Secure Deduplication with Efficient and Reliable Convergent Key ManagementLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/secure-deduplication-efficient-reliable-convergent-key-management

Abstract : Data deduplication is a technique for eliminating duplicate copies of data, and has been widely used incloud storage to reduce storage space and upload bandwidth. Promising as it is, an arising challenge is to performsecure deduplication in cloud storage. Although convergent encryption has been extensively adopted for securededuplication, a critical issue of making convergent encryption practical is to efficiently and reliably manage a hugenumber of convergent keys. This paper makes the first attempt to formally address the problem of achieving efficientand reliable key management in secure deduplication. We first introduce a baseline approach in which each userholds an independent master key for encrypting the convergent keys and outsourcing them to the cloud. However,such a baseline key management scheme generates an enormous number of keys with the increasing number ofusers and requires users to dedicatedly protect the master keys. To this end, we propose Dekey, a new constructionin which users do not need to manage any keys on their own but instead securely distribute the convergent keyshares across multiple servers. Security analysis demonstrates that Dekey is secure in terms of the definitionsspecified in the proposed security model. As a proof of concept, we implement Dekey using the Ramp secret sharingscheme and demonstrate that Dekey incurs limited overhead in realistic environments.