The document discusses various IEEE 2014 projects related to parallel and distributed systems, focusing on frameworks for jammer localization in wireless networks, hole detection in mobile sensor networks, and secure data deduplication in cloud storage. It presents methodologies and algorithms for accurately detecting jammer positions using direct measurements, addressing coverage holes in sensor networks, and ensuring secure authorized deduplication through convergent encryption. Additionally, it covers other topics including intrusion detection in medical cyber-physical systems, community-based routing in mobile social networks, and improved access control in cloud environments.

1. 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 Networks
Language : 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 information
allows the defender to actively eliminate the jamming attacks. Thus, in this paper, we aim to design a framework that
can localize one or multiple jammers with a high accuracy. Most of existing jammer-localization schemes utilize
indirect measurements (e.g., hearing ranges) affected by jamming attacks, which makes it difficult to localize jammers
accurately. Instead, we exploit a direct measurement-the strength of jamming signals (JSS). Estimating JSS is
challenging as jamming signals may be embedded in other signals. As such, we devise an estimation scheme based
on ambient noise floor and validate it with real-world experiments. To further reduce estimation errors, we define an
evaluation feedback metric to quantify the estimation errors and formulate jammer localization as a non-linear
optimization problem, whose global optimal solution is close to jammers' true positions. We explore several heuristic
search algorithms for approaching the global optimal solution, and our simulation results show that our
error-minimizing-based framework achieves better performance than the existing schemes. In addition, our error
minimizing framework can utilize indirect measurements to obtain a better location estimation compared with prior
work.
Title :An Error Minimizing Framework for Localizing Jammers in Wireless Networks
Language : 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 information
allows the defender to actively eliminate the jamming attacks. Thus, in this paper, we aim to design a framework that
can localize one or multiple jammers with a high accuracy. Most of existing jammer-localization schemes utilize
indirect measurements (e.g., hearing ranges) affected by jamming attacks, which makes it difficult to localize jammers
accurately. Instead, we exploit a direct measurement-the strength of jamming signals (JSS). Estimating JSS is
challenging as jamming signals may be embedded in other signals. As such, we devise an estimation scheme based
on ambient noise floor and validate it with real-world experiments. To further reduce estimation errors, we define an
evaluation feedback metric to quantify the estimation errors and formulate jammer localization as a non-linear
optimization problem, whose global optimal solution is close to jammers' true positions. We explore several heuristic
search algorithms for approaching the global optimal solution, and our simulation results show that our
error-minimizing-based framework achieves better performance than the existing schemes. In addition, our error
minimizing framework can utilize indirect measurements to obtain a better location estimation compared with prior
work.
Title :Localized Movement-Assisted Sensor Deployment Algorithm for Hole Detection and Healing
Language : 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 a
specified region of interest (RoI). Considering the fact that emergence of holes in the RoI is unavoidable due to the
inner nature of WSNs, random deployment, environmental factors, and external attacks, assuring that the RoI is
completely and continuously covered is very important. This paper seeks to address the problem of hole detection
and healing in mobile WSNs. We discuss the main drawbacks of existing solutions and we identify four key elements
that are critical for ensuring effective coverage in mobile WSNs: 1) determining the boundary of the RoI, 2) detecting
coverage holes and estimating their characteristics, 3) determining the best target locations to relocate mobile nodes
to repair holes, and 4) dispatching mobile nodes to the target locations while minimizing the moving and messaging

2. cost. We propose a lightweight and comprehensive solution, called holes detection and healing (HEAL), that
addresses all of the aforementioned aspects. The computation complexity of HEAL is O2 where v is the average
number of 1-hop neighbors. HEAL is a distributed and localized algorithm that operates in two distinct phases. The
first identifies the boundary nodes and discovers holes using a lightweight localized protocol over the Gabriel graph of
the network. The second treats the hole healing, with novel concept, hole healing area. We propose a distributed
virtual forces-based local healing approach where only the nodes located at an appropriate distance from the hole will
be involved in the healing process. Through extensive simulations we show that HEAL deals with holes of various
forms and sizes, and provides a cost-effective and an accurate solution for hole detection and healing.
Title :A Hybrid Cloud Approach for Secure Authorized Deduplication
Language : 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 of
repeating data, and has been widely used in cloud storage to reduce the amount of storage space and save
bandwidth. To protect the confidentiality of sensitive data while supporting deduplication, the convergent encryption
technique has been proposed to encrypt the data before outsourcing. To better protect data security, this paper
makes the first attempt to formally address the problem of authorized data deduplication. Different from traditional
deduplication systems, the differential privileges of users are further considered in duplicate check besides the data
itself.We also present several new deduplication constructions supporting authorized duplicate check in a hybrid cloud
architecture. Security analysis demonstrates that our scheme is secure in terms of the definitions specified in the
proposed security model. As a proof of concept, we implement a prototype of our proposed authorized duplicate
check scheme and conduct testbed experiments using our prototype. We show that our proposed authorized
duplicate check scheme incurs minimal overhead compared to normal operations.
Title :Behavior Rule Specification-based Intrusion Detection for Safety Critical Medical Cyber Physical Systems
Language : 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 medical
devices embedded in a medical cyber physical system (MCPS) in which the patient's safety is of the utmost
importance. We propose a methodology to transform behavior rules to a state machine, so that a device that is being
monitored for its behavior can easily be checked against the transformed state machine for deviation from its behavior
specification. Using vital sign monitor medical devices as an example, we demonstrate that our intrusion detection
technique can effectively trade false positives off for a high detection probability to cope with more sophisticated and
hidden attackers to support ultra safe and secure MCPS applications. Moreover, through a comparative analysis, we
demonstrate that our behavior-rule specificationbased IDS technique outperforms two existing anomaly-based
techniques 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 Networks
Language : 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 mobile
nodes that move around and share information with each other through their carried short-distance wireless
communication devices. A main characteristic of MSNs is that mobile nodes in the networks generally visit some
locations (namely, community homes) frequently, while visiting other locations less frequently. In this paper, we
propose a novel zero-knowledge multi-copy routing algorithm, homing spread (HS), for homogeneous MSNs, in which
all mobile nodes share all community homes. HS is a distributed and localized algorithm. It mainly lets community
homes spread messages with a higher priority. Theoretical analysis shows that HS can spread a given number of
message copies in an optimal way when the inter-meeting time between any two nodes and between a node and a
community home follows independent and identical exponential distributions, respectively. We also extend HS to the
heterogeneous MSNs, where mobile nodes have different community homes. In addition, we calculate the expected
delivery delay of HS, and conduct extensive simulations. Results show that community homes are important factors in
message spreading. By using homes to spread messages faster, HS achieves a better performance than existing
zero-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

3. 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 supports
anonymous authentication. In the proposed scheme, the cloud verifies the authenticity of the ser without knowing the
user's identity before storing data. Our scheme also has the added feature of access control in which only valid users
are 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 access
control scheme is decentralized and robust, unlike other access control schemes designed for clouds which are
centralized. The communication, computation, and storage overheads are comparable to centralized approaches.
Title :Exploiting Service Similarity for Privacy in Location Based Search Queries
Language : 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 current
location of a user, and customize query results to include neighboring points of interests. However, location
knowledge is often perceived as personal information. One of the immediate issues hindering the wide acceptance of
location-based applications is the lack of appropriate methodologies that offer fine grain privacy controls to a user
without vastly affecting the usability of the service. While a number of privacy-preserving models and algorithms have
taken shape in the past few years, there is an almost universal need to specify one's privacy requirement without
understanding its implications on the service quality. In this paper, we propose a user-centric location- based service
architecture where a user can observe the impact of location inaccuracy on the service accuracy before deciding the
geo-coordinates to use in a query. We construct a local search application based on this architecture and
demonstrate how meaningful information can be exchanged between the user and the service provider to allow the
inference of contours depicting the change in query results across a geographic area. Results indicate the possibility
of large default privacy regions (areas of no change in result set) in such applications.
http://kasanpro.com/ieee/final-year-project-center-tiruvannamalai-reviews
Title :Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud Storage
Language : 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 outsourcing
and 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 data
access control in cloud storage, because it gives data owners more direct control on access policies. However, it is
difficult to directly apply existing CP-ABE schemes to data access control for cloud storage systems because of the
attribute revocation problem. In this paper, we design an expressive, efficient and revocable data access control
scheme for multi-authority cloud storage systems, where there are multiple authorities co-exist and each authority is
able to issue attributes independently. Specifically, we propose a revocable multi-authority CP-ABE scheme, and
apply it as the underlying techniques to design the data access control scheme. Our attribute revocation method can
efficiently achieve both forward security and backward security. The analysis and simulation results show that our
proposed data access control scheme is secure in the random oracle model and is more efficient than previous
works.
Title :Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage
Language : 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 which
produce constant-size ciphertexts such that efficient delegation of decryption rights for any set of ciphertexts are
possible. 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

4. constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the other encrypted files outside
the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in a smart
card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We
also describe other application of our schemes. In particular, our schemes give the first public-key patient-controlled
encryption 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 Networks
Language : 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, an
Efficient 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. By
increasing the packet size for high PHY rate radios, it significantly improves the transmission efficiency. Second, it
employs 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 eligible
senders so that the largest impact sender is most likely to transmit. We implement ECD based on TinyOS and
evaluate its performance extensively via testbed experiments and simulations. Results show that ECD outperforms
state-of-the-art protocols, Deluge and MNP, in terms of completion time and data traffic (e.g., about 20 percent less
traffic and 20-30 percent shorter completion time compared to Deluge).
Title :On the Security of Trustee-Based Social Authentications
Language : 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) has
been shown to be a promising backup authentication mechanism. A user in this system is associated with a few
trustees that were selected from the user's friends. When the user wants to regain access to the account, the service
provider sends different verification codes to the user's trustees. The user must obtain at least k (i.e., recovery
threshold) verification codes from the trustees before being directed to reset his or her password. In this paper, we
provide the first systematic study about the security of trusteebased social authentications. In particular, we first
introduce a novel framework of attacks, which we call forest fire attacks. In these attacks, an attacker initially obtains a
small number of compromised users, and then the attacker iteratively attacks the rest of users by exploiting
trustee-based social authentications. Then, we construct a probabilistic model to formalize the threats of forest fire
attacks and their costs for attackers. Moreover, we introduce various defense strategies. Finally, we apply our
framework to extensively evaluate various concrete attack and defense strategies using three real-world social
network datasets. Our results have strong implications for the design of more secure trustee-based social
authentications.
Title :QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks
Language : 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 for
mission-critical monitoring and surveillance systems which requires timely and reliable data delivery. Existing work
exploits multipath routing to guarantee both reliability and delay QoS constraints in WSNs. However, the multipath
routing 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 protocols
are 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 QoS
provisioning in WSNs, which can be formulated as a multiobjective multiconstraint optimization problem. Based on the
analysis 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 an
efficient manner, which is suitable for WSNs in respect of energy efficiency, latency, and time complexity. We
comprehensively evaluate EQGOR by comparing it with the multipath routing approach and other baseline protocols
through ns-2 simulation and evaluate its time complexity through measurement on the MicaZ node. Evaluation results
demonstrate the effectiveness of the GOR approach for QoS provisioning in WSNs. EQGOR significantly improves
both the end-to-end energy efficiency and latency, and it is characterized by the low time complexity.

5. Title :Secure Deduplication with Efficient and Reliable Convergent Key Management
Language : 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 in
cloud storage to reduce storage space and upload bandwidth. Promising as it is, an arising challenge is to perform
secure deduplication in cloud storage. Although convergent encryption has been extensively adopted for secure
deduplication, a critical issue of making convergent encryption practical is to efficiently and reliably manage a huge
number of convergent keys. This paper makes the first attempt to formally address the problem of achieving efficient
and reliable key management in secure deduplication. We first introduce a baseline approach in which each user
holds 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 of
users and requires users to dedicatedly protect the master keys. To this end, we propose Dekey, a new construction
in which users do not need to manage any keys on their own but instead securely distribute the convergent key
shares across multiple servers. Security analysis demonstrates that Dekey is secure in terms of the definitions
specified in the proposed security model. As a proof of concept, we implement Dekey using the Ramp secret sharing
scheme and demonstrate that Dekey incurs limited overhead in realistic environments.