m phil-computer-science-parallel-and-distributed-system-projects

M.Phil Computer Science Parallel and Distributed SystemProjects

Web : www.kasanpro.com Email : [email protected]

List Link : http://kasanpro.com/projects-list/m-phil-computer-science-parallel-and-distributed-system-projects

Title :Rumor Riding Anonymizing Unstructured Peer-to-Peer SystemsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/rumor-riding-anonymizing-unstructured-peer-peer-systems

Abstract : Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try tomask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based:peers have to pre-construct an anonymous path before transmission. The overhead of maintaining and updating suchpaths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymityprotocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of loweroverhead by mainly using the symmetric cryptographic algorithm. We conduct comprehensive trace-drivensimulations to evaluate the effectiveness and efficiency of this design, and compare it with previous approaches. Wealso introduce some early experiences on RR implementations.

Title :Computing Localized Power-Efficient Data Aggregation Trees for Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/computing-localized-power-efficient-data-aggregation-trees-sensor-networks

Abstract : We propose localized, self organizing, robust, and energy-efficient data aggregation tree approaches forsensor networks, which we call Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs). They are basedon topologies, such as LMST and RNG, that can approximate minimum spanning tree and can be efficientlycomputed using only position or distance information of one-hop neighbors. The actual routing tree is constructedover these topologies. We also consider different parent selection strategies while constructing a routing tree. Wecompare each topology and parent selection strategy and conclude that the best among them is the shortest pathstrategy over LMST structure. Our solution also involves route maintenance procedures that will be executed when asensor node fails or a new node is added to the network. The proposed solution is also adapted to consider theremaining power levels of nodes in order to increase the network lifetime. Our simulation results show that by usingour power-aware localized approach, we can almost have the same performance of a centralized solution in terms ofnetwork lifetime, and close to 90 percent of an upper bound derived here.

Title :Human Mobility Enhances Global Positioning Accuracy for Mobile Phone LocalizationLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/mobile-phone-localization-withs-global-positioning-accuracy

Abstract : Global Positioning System (GPS) has enabled a number of geographical applications over many years.Quite a lot of location-based services, however, still suffer from considerable positioning errors of GPS (usually 1m to20m in practice). In this study, we design and implement a high-accuracy global positioning solution based on GPSand human mobility captured by mobile phones. Our key observation is that smartphone-enabled dead reckoningsupports accurate but local coordinates of users' trajectories, while GPS provides global but inconsistent coordinates.Considering them simultaneously, we devise techniques to refine the global positioning results by fitting the globalpositions to the structure of locally measured ones, so the refined positioning results are more likely to elicit theground truth. We develop a prototype system, named GloCal, and conduct comprehensive experiments in bothcrowded urban and spacious suburban areas. The evaluation results show that GloCal can achieve 30%improvement on average error with respect to GPS. GloCal uses merely mobile phones and requires no infrastructureor additional reference information. As an effective and light-weight augmentation to global positioning, GloCal holdspromise in real-world feasibility.

Title :Distributed Smart-home Decision-making in a Hierarchical Interactive Smart Grid Architecture

Language : C#

Project Link : http://kasanpro.com/p/c-sharp/distributed-smart-home-decision-making-smart-grid-architecture

Abstract : In this paper, we develop a comprehensive real-time interactive framework for the Utility and customers ina smart grid while ensuring grid-stability and Quality-of-Service (QoS). First, we propose a hierarchical architecture forthe Utility-customer interaction consisting of sub-components of customer load prediction, renewable generationintegration, power-load balancing and demand response (DR). Within this hierarchical architecture, we focus on theproblem of real-time scheduling in an abstract grid model consisting of one controller and multiple customer units. Ascalable solution to the real-time scheduling problem is proposed by combining solutions to two sub-problems: (1)centralized sequential decision making at the controller to maximize an accumulated reward for the whole micro-gridand (2) distributed auctioning among all customers based on the optimal load profile obtained by solving the firstproblem to coordinate their interactions. We formulate the centralized sequential decision making at the controller asa hidden mode Markov decision process (HM-MDP). Next, a Vikrey auctioning game is designed to coordinate theactions of the individual smart-homes to actually achieve the optimal solution derived by the controller under realisticgird interaction assumptions. We show that though truthful bidding is a weakly dominant strategy for all smart-homesin the auctioning game, collusive equilibria do exist and can jeopardize the effectiveness and efficiency of the tradingopportunity allocation. Analysis on the structure of the Bayesian Nash equilibrium solution set shows that the Vickreyauctioning game can be made more robust against collusion by customers (anticipating distributed smart-homes) byintroducing a positive reserve price. The corresponding auctioning game is then shown to converge to the uniqueincentive compatible truthful bidding Bayesian Nash equilibrium, without jeopardizing the auctioneer's (microgridcontroller's) profit. The paper also explicitly discusses how this two- step solution approach can be scaled to besuitable for more complicated smart grid architectures beyond the assumed abstract model.

Title :Shared Authority Based Privacy-preserving Authentication Protocol in Cloud ComputingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/privacy-preserving-authentication-protocol-shared-authority-cloud

Abstract : Cloud computing is emerging as a prevalent data interactive paradigm to realize users' data remotelystored in an online cloud server. Cloud services provide great conveniences for the users to enjoy the on-demandcloud applications without considering the local infrastructure limitations. During the data accessing, different usersmay be in a collaborative relationship, and thus data sharing becomes significant to achieve productive benefits. Theexisting security solutions mainly focus on the authentication to realize that a user's privative data cannot beunauthorized accessed, but neglect a subtle privacy issue during a user challenging the cloud server to request otherusers for data sharing. The challenged access request itself may reveal the user's privacy no matter whether or not itcan obtain the data access permissions. In this paper, we propose a shared authority based privacy-preservingauthentication protocol (SAPA) to address above privacy issue for cloud storage. In the SAPA, 1) shared accessauthority is achieved by anonymous access request matching mechanism with security and privacy considerations(e.g., authentication, data anonymity, user privacy, and forward security); 2) attribute based access control is adoptedto realize that the user can only access its own data fields; 3) proxy re-encryption is applied by the cloud server toprovide data sharing among the multiple users. Meanwhile, universal composability (UC) model is established toprove that the SAPA theoretically has the design correctness. It indicates that the proposed protocol realizingprivacy-preserving data access authority sharing, is attractive for multi-user collaborative cloud applications.

M.Phil Computer Science Parallel and Distributed System Projects

Title :Shared Authority Based Privacy-preserving Authentication Protocol in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/shared-authority-based-privacy-preserving-authentication-protocol-cloud-computing

Abstract : Cloud computing is emerging as a prevalent data interactive paradigm to realize users' data remotelystored in an online cloud server. Cloud services provide great conveniences for the users to enjoy the on-demandcloud applications without considering the local infrastructure limitations. During the data accessing, different usersmay be in a collaborative relationship, and thus data sharing becomes significant to achieve productive benefits. Theexisting security solutions mainly focus on the authentication to realize that a user's privative data cannot beunauthorized accessed, but neglect a subtle privacy issue during a user challenging the cloud server to request otherusers for data sharing. The challenged access request itself may reveal the user's privacy no matter whether or not itcan obtain the data access permissions. In this paper, we propose a shared authority based privacy-preservingauthentication protocol (SAPA) to address above privacy issue for cloud storage. In the SAPA, 1) shared accessauthority is achieved by anonymous access request matching mechanism with security and privacy considerations(e.g., authentication, data anonymity, user privacy, and forward security); 2) attribute based access control is adoptedto realize that the user can only access its own data fields; 3) proxy re-encryption is applied by the cloud server to

provide data sharing among the multiple users. Meanwhile, universal composability (UC) model is established toprove that the SAPA theoretically has the design correctness. It indicates that the proposed protocol realizingprivacy-preserving data access authority sharing, is attractive for multi-user collaborative cloud applications.

Title :Efficient and Cost-Effective Hybrid Congestion Control for HPC Interconnection NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/efficient-cost-effective-hybrid-congestion-control

Abstract : Interconnection networks are key components in high-performance computing (HPC) systems, theirperformance having a strong influence on the overall system one. However, at high load, congestion and its negativeeffects (e.g., Head-of-line blocking) threaten the performance of the network, and so the one of the entire system.Congestion control (CC) is crucial to ensure an efficient utilization of the interconnection network during congestionsituations. As one major trend is to reduce the effective wiring in interconnection networks to reduce cost and powerconsumption, the network will operate very close to its capacity. Thus, congestion control becomes essential. ExistingCC techniques can be divided into two general approaches. One is to throttle traffic injection at the sources thatcontribute to congestion, and the other is to isolate the congested traffic in specially designated resources. However,both approaches have different, but non-overlapping weaknesses: injection throttling techniques have a slow reactionagainst congestion, while isolating traffic in special resources may lead the system to run out of those resources. Inthis paper we propose EcoCC, a new Efficient and Cost-Effective CC technique, that combines injection throttling andcongested-flow isolation to minimize their respective drawbacks and maximize overall system performance. This newstrategy is suitable for current commercial switch architectures, where it could be implemented without requiringsignificant complexity. Experimental results, using simulations under synthetic and real trace-based traffic patterns,show that this technique improves by up to 55 percent over some of the most successful congestion controltechniques.

Title :Efficient and Cost-Effective Hybrid Congestion Control for HPC Interconnection NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/efficient-cost-effective-hybrid-congestion-control-hpc-interconnection-networks

Abstract : Interconnection networks are key components in high-performance computing (HPC) systems, theirperformance having a strong influence on the overall system one. However, at high load, congestion and its negativeeffects (e.g., Head-of-line blocking) threaten the performance of the network, and so the one of the entire system.Congestion control (CC) is crucial to ensure an efficient utilization of the interconnection network during congestionsituations. As one major trend is to reduce the effective wiring in interconnection networks to reduce cost and powerconsumption, the network will operate very close to its capacity. Thus, congestion control becomes essential. ExistingCC techniques can be divided into two general approaches. One is to throttle traffic injection at the sources thatcontribute to congestion, and the other is to isolate the congested traffic in specially designated resources. However,both approaches have different, but non-overlapping weaknesses: injection throttling techniques have a slow reactionagainst congestion, while isolating traffic in special resources may lead the system to run out of those resources. Inthis paper we propose EcoCC, a new Efficient and Cost-Effective CC technique, that combines injection throttling andcongested-flow isolation to minimize their respective drawbacks and maximize overall system performance. This newstrategy is suitable for current commercial switch architectures, where it could be implemented without requiringsignificant complexity. Experimental results, using simulations under synthetic and real trace-based traffic patterns,show that this technique improves by up to 55 percent over some of the most successful congestion controltechniques.

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

Title :Coverage and Connectivity in Duty-Cycled Wireless Sensor Networks for Event MonitoringLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/coverage-connectivity-duty-cycled-wireless-sensor-networks-event-monitoring

Abstract : In duty-cycled wireless sensor networks (WSNs) for stochastic event monitoring, existing efforts are mainlyconcentrated on energy-efficient scheduling of sensor nodes to guarantee the coverage performance, ignoringanother crucial issue of connectivity. The connectivity problem is extremely challenging in the duty-cycled WSNs dueto the fact that the link connections between nodes are transient thus unstable. In this paper, we propose a new kindof network, partitioned synchronous network, to jointly address the coverage and connectivity problem. We analyzethe coverage and connectivity performances of partitioned synchronous network and compare them with those of

existing asynchronous network. We perform extensive simulations to demonstrate that the proposed partitionedsynchronous network has a better connectivity performance than that of asynchronous network, while coverageperformances of two types of networks are close.

Title :Coverage and Connectivity in Duty-Cycled Wireless Sensor Networks for Event MonitoringLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/coverage-connectivity-duty-cycled-wireless-sensor-networks-stochastic-event-monitoring

Abstract : In duty-cycled wireless sensor networks (WSNs) for stochastic event monitoring, existing efforts are mainlyconcentrated on energy-efficient scheduling of sensor nodes to guarantee the coverage performance, ignoringanother crucial issue of connectivity. The connectivity problem is extremely challenging in the duty-cycled WSNs dueto the fact that the link connections between nodes are transient thus unstable. In this paper, we propose a new kindof network, partitioned synchronous network, to jointly address the coverage and connectivity problem. We analyzethe coverage and connectivity performances of partitioned synchronous network and compare them with those ofexisting asynchronous network. We perform extensive simulations to demonstrate that the proposed partitionedsynchronous network has a better connectivity performance than that of asynchronous network, while coverageperformances of two types of networks are close.


Title :Coverage and Connectivity in Duty-Cycled Wireless Sensor Networks using Mobile ElementLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/coverage-connectivity-duty-cycled-wireless-sensor-networks-mobile-element


Title :Coverage and Connectivity in Duty-Cycled Wireless Sensor Networks using Mobile ElementLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/coverage-connectivity-energy-efficient-duty-cycled-wireless-sensor-networks-mobile-element


Title :The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile SinksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/three-tier-security-scheme-wireless-sensor-networks-mobile-sinks-implement

Abstract : Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient dataaccumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However,in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment andauthentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates a

new security challenge: in the basic probabilistic and q-composite key predistribution schemes, an attacker can easilyobtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network bydeploying a replicated mobile sink preloaded with some compromised keys. This article describes a three-tier generalframework that permits the use of any pairwise key predistribution scheme as its basic component. The newframework requires two separate key pools, one for the mobile sink to access the network, and one for pairwise keyestablishment between the sensors. To further reduce the damages caused by stationary access node replicationattacks, we have strengthened the authentication mechanism between the sensor and the stationary access node inthe proposed framework. Through detailed analysis, we show that our security framework has a higher networkresilience to a mobile sink replication attack as compared to the polynomial pool-based scheme.

Title :The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile SinksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/the-three-tier-security-scheme-wireless-sensor-networks-mobile-sinks

Abstract : Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient dataaccumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However,in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment andauthentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates anew security challenge: in the basic probabilistic and q-composite key predistribution schemes, an attacker can easilyobtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network bydeploying a replicated mobile sink preloaded with some compromised keys. This article describes a three-tier generalframework that permits the use of any pairwise key predistribution scheme as its basic component. The newframework requires two separate key pools, one for the mobile sink to access the network, and one for pairwise keyestablishment between the sensors. To further reduce the damages caused by stationary access node replicationattacks, we have strengthened the authentication mechanism between the sensor and the stationary access node inthe proposed framework. Through detailed analysis, we show that our security framework has a higher networkresilience to a mobile sink replication attack as compared to the polynomial pool-based scheme.

Title :A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile SinksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/energy-efficient-sensory-data-collection-mobile-sinks

Abstract : A large class of Wireless Sensor Networks (WSN) applications involve a set of isolated urban areas (e.g.,urban parks or building blocks) covered by sensor nodes (SNs) monitoring environmental parameters. Mobile sinks(MSs) mounted upon urban vehicles with fixed trajectories (e.g., buses) provide the ideal infrastructure to effectivelyretrieve sensory data from such isolated WSN fields. Existing approaches involve either single-hop transfer of datafrom SNs that lie within the MS's range or heavy involvement of network periphery nodes in data retrieval, processing,buffering, and delivering tasks. These nodes run the risk of rapid energy exhaustion resulting in loss of networkconnectivity and decreased network lifetime. Our proposed protocol aims at minimizing the overall network overheadand energy expenditure associated with the multihop data retrieval process while also ensuring balanced energyconsumption among SNs and prolonged network lifetime. This is achieved through building cluster structuresconsisted of member nodes that route their measured data to their assigned cluster head (CH). CHs perform datafiltering upon raw data exploiting potential spatial-temporal data redundancy and forward the filtered information toappropriate end nodes with sufficient residual energy, located in proximity to the MS's trajectory. Simulation resultsconfirm the effectiveness of our approach against as well as its performance gain over alternative methods.


Title :A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile SinksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/energy-efficient-sensory-data-collection-mobile-sinks-code

Abstract : A large class of Wireless Sensor Networks (WSN) applications involve a set of isolated urban areas (e.g.,urban parks or building blocks) covered by sensor nodes (SNs) monitoring environmental parameters. Mobile sinks(MSs) mounted upon urban vehicles with fixed trajectories (e.g., buses) provide the ideal infrastructure to effectivelyretrieve sensory data from such isolated WSN fields. Existing approaches involve either single-hop transfer of datafrom SNs that lie within the MS's range or heavy involvement of network periphery nodes in data retrieval, processing,buffering, and delivering tasks. These nodes run the risk of rapid energy exhaustion resulting in loss of networkconnectivity and decreased network lifetime. Our proposed protocol aims at minimizing the overall network overheadand energy expenditure associated with the multihop data retrieval process while also ensuring balanced energyconsumption among SNs and prolonged network lifetime. This is achieved through building cluster structures

consisted of member nodes that route their measured data to their assigned cluster head (CH). CHs perform datafiltering upon raw data exploiting potential spatial-temporal data redundancy and forward the filtered information toappropriate end nodes with sufficient residual energy, located in proximity to the MS's trajectory. Simulation resultsconfirm the effectiveness of our approach against as well as its performance gain over alternative methods.


Title :Privacy-Preserving Decentralized Key-Policy Attribute-Based EncryptionLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-decentralized-key-policy-attribute-based-encryption

Abstract : Decentralized attribute-based encryption (ABE) is a variant of a multi-authority ABE scheme where eachauthority can issue secret keys to the user independently without any cooperation and a central authority. This is incontrast to the previous constructions, where multiple authorities must be online and setup the system interactively,which is impractical. Hence, it is clear that a decentralized ABE scheme eliminates the heavy communication cost andthe need for collaborative computation in the setup stage. Furthermore, every authority can join or leave the systemfreely without the necessity of re-initializing the system. In contemporary multi-authority ABE schemes, a user's secretkeys from different authorities must be tied to his global identifier (GID) to resist the collusion attack. However, this willcompromise the user's privacy. Multiple authorities can collaborate to trace the user by his GID, collect his attributes,then impersonate him. Therefore, constructing a decentralized ABE scheme with privacy-preserving remains achallenging research problem. In this paper, we propose a privacy-preserving decentralized key-policy ABE schemewhere each authority can issue secret keys to a user independently without knowing anything about his GID.Therefore, even if multiple authorities are corrupted, they cannot collect the user's attributes by tracing his GID.Notably, our scheme only requires standard complexity assumptions (e.g., decisional bilinear Diffie-Hellman) anddoes not require any cooperation between the multiple authorities, in contrast to the previous comparable schemethat requires non-standard complexity assumptions (e.g., q-decisional Diffie-Hellman inversion) and interactionsamong multiple authorities. To the best of our knowledge, it is the first decentralized ABE scheme with privacy-reserving based on standard complexity assumptions.

Title :Cut Detection in Wireless Sensor NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/cut-detection-wireless-sensor-networks

Abstract : A wireless sensor network can get separated into multiple connected components due to the failure ofsome of its nodes, which is called a "cut." In this paper, we consider the problem of detecting cuts by the remainingnodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when theconnectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to thespecial node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: everynode needs to communicate with only those nodes that are within its communication range. The algorithm is based onthe iterative computation of a fictitious "electrical potential" of the nodes. The convergence rate of the underlyingiterative scheme is independent of the size and structure of the network. We demonstrate the effectiveness of theproposed algorithm through simulations and a real hardware implementation.

Title :Cut Detection in Wireless Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/cut-detection-wireless-sensor-network

Abstract : A wireless sensor network can get separated into multiple connected components due to the failure ofsome of its nodes, which is called a "cut." In this paper, we consider the problem of detecting cuts by the remainingnodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when theconnectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to thespecial node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: everynode needs to communicate with only those nodes that are within its communication range. The algorithm is based onthe iterative computation of a fictitious "electrical potential" of the nodes. The convergence rate of the underlyingiterative scheme is independent of the size and structure of the network. We demonstrate the effectiveness of theproposed algorithm through simulations and a real hardware implementation.

Title :Cut detection in Wireless sensors network using Distributed Source Separation Detection (DSSD) ApproachLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/cut-detection-wireless-sensors-network-distributed-source-separation-detection

Abstract : A classical problem caused by separation of network is partitioning. Predicting those positioning fromwhere the network get separated into the different partition could be a very useful feature that can be provided toapplications in a wireless sensors network environment. Indeed, being aware of a future disconnection in the networkcan help to ensure a better quality of service by adapting the application behavior. We propose a distributed algorithmto detect "cuts" in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or morecomponents. The algorithm consists of a simple iterative scheme in which every node updates a scalar state bycommunicating with its nearest neighbors. In the absence of cuts, the states converge to values that are equal topotentials in a fictitious electrical network. When a set of nodes gets separated from a special node, that we call a"source node", their states converge to 0 because "current is extracted" from the component but none is injected.These trends are used by every node to detect if a cut has occurred that has rendered it disconnected from thesource. Although the algorithm is iterative and involves only local communication, its convergence rate is quite fastand is independent of the size of the network.


Title :Cut detection in Wireless sensors network using Distributed Source Separation Detection (DSSD) ApproachLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/cut-detection-wireless-sensors-networks-distributed-source-separation-detection

Abstract : A classical problem caused by separation of network is partitioning. Predicting those positioning fromwhere the network get separated into the different partition could be a very useful feature that can be provided toapplications in a wireless sensors network environment. Indeed, being aware of a future disconnection in the networkcan help to ensure a better quality of service by adapting the application behavior. We propose a distributed algorithmto detect "cuts" in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or morecomponents. The algorithm consists of a simple iterative scheme in which every node updates a scalar state bycommunicating with its nearest neighbors. In the absence of cuts, the states converge to values that are equal topotentials in a fictitious electrical network. When a set of nodes gets separated from a special node, that we call a"source node", their states converge to 0 because "current is extracted" from the component but none is injected.These trends are used by every node to detect if a cut has occurred that has rendered it disconnected from thesource. Although the algorithm is iterative and involves only local communication, its convergence rate is quite fastand is independent of the size of the network.

Title :Distributed Randomized Algorithms for the PageRank ComputationLanguage : ASP.NET with C#

Project Link : http://kasanpro.com/p/asp-net-with-c-sharp/distributed-randomized-algorithms-pagerank-computation

Abstract : In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the search results.The algorithm quantifies the importance of each web page based on the link structure of the web. We first provide anoverview of the original problem setup. Then, we propose several distributed randomized schemes for thecomputation of the PageRank, where the pages can locally update their values by communicating to those connectedby links. The main objective of the paper is to show that these schemes asymptotically converge in the mean-squaresense to the true PageRank values. A detailed discussion on the close relations to the multi-agent consensusproblems is also given.

Title :Privacy-Preserving Decentralized Key-Policy Attribute-Based EncryptionLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/privacy-preserving-decentralized-key-policy-attribute-based-encryption-code

Abstract : Decentralized attribute-based encryption (ABE) is a variant of a multi-authority ABE scheme where eachauthority can issue secret keys to the user independently without any cooperation and a central authority. This is incontrast to the previous constructions, where multiple authorities must be online and setup the system interactively,which is impractical. Hence, it is clear that a decentralized ABE scheme eliminates the heavy communication cost andthe need for collaborative computation in the setup stage. Furthermore, every authority can join or leave the systemfreely without the necessity of re-initializing the system. In contemporary multi-authority ABE schemes, a user's secretkeys from different authorities must be tied to his global identifier (GID) to resist the collusion attack. However, this willcompromise the user's privacy. Multiple authorities can collaborate to trace the user by his GID, collect his attributes,

then impersonate him. Therefore, constructing a decentralized ABE scheme with privacy-preserving remains achallenging research problem. In this paper, we propose a privacy-preserving decentralized key-policy ABE schemewhere each authority can issue secret keys to a user independently without knowing anything about his GID.Therefore, even if multiple authorities are corrupted, they cannot collect the user's attributes by tracing his GID.Notably, our scheme only requires standard complexity assumptions (e.g., decisional bilinear Diffie-Hellman) anddoes not require any cooperation between the multiple authorities, in contrast to the previous comparable schemethat requires non-standard complexity assumptions (e.g., q-decisional Diffie-Hellman inversion) and interactionsamong multiple authorities. To the best of our knowledge, it is the first decentralized ABE scheme with privacy-reserving based on standard complexity assumptions.

Title :Decentralized Key Policy attribute based Encryption Scheme with Ciphertext SizeLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/decentralized-key-policy-attribute-based-encryption-scheme-ciphertext-size-module

Abstract :


Title :Decentralized Key Policy attribute based Encryption Scheme with Ciphertext SizeLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/decentralized-key-policy-attribute-based-encryption-scheme-ciphertext-size

Abstract :


Title :User Click based Web PageRank Computation using Distributed AlgorithmsLanguage : ASP.NET with C#

Project Link : http://kasanpro.com/p/asp-net-with-c-sharp/user-click-based-web-pagerank-computation-distributed-algorithms

Abstract :

Title :User Click based Web PageRank Computation using Distributed AlgorithmsLanguage : ASP.NET with VB

Project Link : http://kasanpro.com/p/asp-net-with-vb/user-click-based-web-pagerank-computation-distributed-algorithms-code

Abstract :

Title :User Click based Web PageRank Computation using Distributed AlgorithmsLanguage : PHP

Project Link : http://kasanpro.com/p/php/user-click-based-web-pagerank-computation-distributed-algorithms-implement

Abstract :

Title :User Click based Web PageRank Computation using Distributed AlgorithmsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/user-click-based-web-pagerank-computation-distributed-algorithms-module

Abstract :

Title :Catching Packet Droppers and Modifiers in Wireless Sensor NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/catching-packet-droppers-modifiers-wireless-sensor-networks

Abstract : Packet dropping and modification are common attacks that can be launched by an adversary to disruptcommunication in wireless multihop sensor networks. Many schemes have been proposed to mitigate or tolerate suchattacks, but very few can effectively and efficiently identify the intruders. To address this problem, we propose asimple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets. Extensiveanalysis and simulations have been conducted to verify the effectiveness and efficiency of the scheme.


Title :Catching Packet Droppers and Modifiers in Wireless Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/catching-packet-droppers-modifiers-wireless-sensor-network

Abstract : Packet dropping and modification are common attacks that can be launched by an adversary to disruptcommunication in wireless multihop sensor networks. Many schemes have been proposed to mitigate or tolerate suchattacks, but very few can effectively and efficiently identify the intruders. To address this problem, we propose asimple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets. Extensiveanalysis and simulations have been conducted to verify the effectiveness and efficiency of the scheme.

Title :A Highly Scalable Key Pre-distribution Scheme for Wireless Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/key-pre-distribution-scheme-wireless-sensor-networks

Abstract : Given the sensitivity of the potential WSN applications and because of resource limitations, key manage-ment emerges as a challenging issue for WSNs. One of the main concerns when designing a key managementscheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a largescale deployment of the network. In this paper, we propose a new highly scalable key management scheme forWSNs which provides a good secure connectivity coverage. For this purpose, we make use for the first time of theunital design theory. We show that the basic mapping from unitals to key pre-distribution allows to achieve anextremely high network scalability. Nonetheless, this naive mapping does not guarantee a high key sharingprobability. Therefore, we propose an enhanced unital-based key pre-distribution scheme providing high networkscalability and good key sharing probability lower bounded by 1 ? e?1 ? 0.632. We conduct analytical analysis andsimulations to compare our solution to main existing ones regarding different criteria including storage overhead,network scalability, network connectivity, average secure path length and network resiliency. The obtained resultsshow that our approach enhances considerably the network scalability while providing high secure connectivitycoverage and good overall performances. Moreover, the obtained results show that at equal network size, oursolution reduces significantly the storage overhead compared to main existing solutions.


Title :A Highly Scalable Key Pre-distribution Scheme for Wireless Sensor NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/key-pre-distribution-scheme-wireless-sensor-networks-code

Abstract : Given the sensitivity of the potential WSN applications and because of resource limitations, key manage-ment emerges as a challenging issue for WSNs. One of the main concerns when designing a key managementscheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a large

scale deployment of the network. In this paper, we propose a new highly scalable key management scheme forWSNs which provides a good secure connectivity coverage. For this purpose, we make use for the first time of theunital design theory. We show that the basic mapping from unitals to key pre-distribution allows to achieve anextremely high network scalability. Nonetheless, this naive mapping does not guarantee a high key sharingprobability. Therefore, we propose an enhanced unital-based key pre-distribution scheme providing high networkscalability and good key sharing probability lower bounded by 1 ? e?1 ? 0.632. We conduct analytical analysis andsimulations to compare our solution to main existing ones regarding different criteria including storage overhead,network scalability, network connectivity, average secure path length and network resiliency. The obtained resultsshow that our approach enhances considerably the network scalability while providing high secure connectivitycoverage and good overall performances. Moreover, the obtained results show that at equal network size, oursolution reduces significantly the storage overhead compared to main existing solutions.

Title :A Privacy Leakage Upper-bound Constraint based Approach for Cost-effective Privacy Preserving ofIntermediate Datasets in CloudLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-leakage-constraint-based-privacy-preserving-intermediate-datasets-cloud

Abstract : Cloud computing provides massive computation power and storage capacity which enable users to deploycomputation and data intensive applications without infrastructure investment. Along the processing of suchapplications, a large volume of intermediate datasets will be generated, and often stored to save the cost ofre-computing them. However, preserving the privacy of intermediate datasets becomes a challenging problembecause adversaries may recover privacy-sensitive information by analyzing multiple intermediate datasets.Encrypting ALL datasets in cloud is widely adopted in existing approaches to address this challenge. But we arguethat encrypting all intermediate datasets are neither efficient nor cost- effective because it is very time consuming andcostly for data-intensive applications to en/decrypt datasets frequently while performing any operation on them. In thispaper, we propose a novel upper-bound privacy leakage constraint based approach to identify which intermediatedatasets need to be encrypted and which do not, so that privacy-preserving cost can be saved while the privacyrequirements of data holders can still be satisfied. Evaluation results demonstrate that the privacy-preserving cost ofintermediate datasets can be significantly reduced with our approach over existing ones where all datasets areencrypted.

Title :A Privacy Leakage Upper-bound Constraint based Approach for Cost-effective Privacy Preserving ofIntermediate Datasets in CloudLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/privacy-leakage-constraint-based-privacy-preserving-intermediate-datasets-cloud-code

Abstract : Cloud computing provides massive computation power and storage capacity which enable users to deploycomputation and data intensive applications without infrastructure investment. Along the processing of suchapplications, a large volume of intermediate datasets will be generated, and often stored to save the cost ofre-computing them. However, preserving the privacy of intermediate datasets becomes a challenging problembecause adversaries may recover privacy-sensitive information by analyzing multiple intermediate datasets.Encrypting ALL datasets in cloud is widely adopted in existing approaches to address this challenge. But we arguethat encrypting all intermediate datasets are neither efficient nor cost- effective because it is very time consuming andcostly for data-intensive applications to en/decrypt datasets frequently while performing any operation on them. In thispaper, we propose a novel upper-bound privacy leakage constraint based approach to identify which intermediatedatasets need to be encrypted and which do not, so that privacy-preserving cost can be saved while the privacyrequirements of data holders can still be satisfied. Evaluation results demonstrate that the privacy-preserving cost ofintermediate datasets can be significantly reduced with our approach over existing ones where all datasets areencrypted.


Title :Dynamic Resource Allocation using Virtual Machines for Cloud Computing EnvironmentLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/dynamic-resource-allocation-virtual-machines-cloud-computing-environment

Abstract : Cloud computing allows business customers to scale up and down their resource usage based on needs.Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. In this

paper, we present a system that uses virtualization technology to allocate data center resources dynamically basedon application demands and support green computing by optimizing the number of servers in use. We introduce theconcept of "skewness" to measure the unevenness in the multi-dimensional resource utilization of a server. Byminimizing skewness, we can combine different types of workloads nicely and improve the overall utilization of serverresources. We develop a set of heuristics that prevent overload in the system effectively while saving energy used.Trace driven simulation and experiment results demonstrate that our algorithm achieves good performance.

Title :Dynamic Resource Allocation using Virtual Machines for Cloud Computing EnvironmentLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/dynamic-resource-allocation-virtual-machines-cloud-computing-environment-code

Abstract : Cloud computing allows business customers to scale up and down their resource usage based on needs.Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. In thispaper, we present a system that uses virtualization technology to allocate data center resources dynamically basedon application demands and support green computing by optimizing the number of servers in use. We introduce theconcept of "skewness" to measure the unevenness in the multi-dimensional resource utilization of a server. Byminimizing skewness, we can combine different types of workloads nicely and improve the overall utilization of serverresources. We develop a set of heuristics that prevent overload in the system effectively while saving energy used.Trace driven simulation and experiment results demonstrate that our algorithm achieves good performance.

Title :Enabling Data Dynamic and Indirect Mutual Trust for Cloud Computing Storage SystemsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/enabling-data-dynamic-indirect-mutual-trust-cloud-computing-storage-systems

Abstract : Currently, the amount of sensitive data produced by many organizations is outpacing their storage ability.The management of such huge amount of data is quite expensive due to the requirements of high storage capacityand qualified personnel. Storage-as-a-Service (SaaS) offered by cloud service providers (CSPs) is a paid facility thatenables organizations to outsource their data to be stored on remote servers. Thus, SaaS reduces the maintenancecost and mitigates the burden of large local data storage at the organization's end. A data owner pays for a desiredlevel of security and must get some compensation in case of any misbehavior committed by the CSP. On the otherhand, the CSP needs a protection from any false accusation that may be claimed by the owner to get illegalcompensations. In this paper, we propose a cloud-based storage scheme that allows the data owner to benefit fromthe facilities offered by the CSP and enables indirect mutual trust between them. The proposed scheme has fourimportant features: (i) it allows the owner to outsource sensitive data to a CSP, and perform full block-level dynamicoperations on the outsourced data, i.e., block modification, insertion, deletion, and append, (ii) it ensures thatauthorized users (i.e., those who have the right to access the owner's file) receive the latest version of the outsourceddata, (iii) it enables indirect mutual trust between the owner and the CSP, and (iv) it allows the owner to grant orrevoke access to the outsourced data. We discuss the security issues of the proposed scheme. Besides, we justify itsperformance through theoretical analysis and experimental evaluation of storage, communication, and computationoverheads.

Title :Enabling Data Dynamic and Indirect Mutual Trust for Cloud Computing Storage SystemsLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/enabling-data-dynamic-indirect-mutual-trust-cloud-computing-storage-systems-code

Abstract : Currently, the amount of sensitive data produced by many organizations is outpacing their storage ability.The management of such huge amount of data is quite expensive due to the requirements of high storage capacityand qualified personnel. Storage-as-a-Service (SaaS) offered by cloud service providers (CSPs) is a paid facility thatenables organizations to outsource their data to be stored on remote servers. Thus, SaaS reduces the maintenancecost and mitigates the burden of large local data storage at the organization's end. A data owner pays for a desiredlevel of security and must get some compensation in case of any misbehavior committed by the CSP. On the otherhand, the CSP needs a protection from any false accusation that may be claimed by the owner to get illegalcompensations. In this paper, we propose a cloud-based storage scheme that allows the data owner to benefit fromthe facilities offered by the CSP and enables indirect mutual trust between them. The proposed scheme has fourimportant features: (i) it allows the owner to outsource sensitive data to a CSP, and perform full block-level dynamicoperations on the outsourced data, i.e., block modification, insertion, deletion, and append, (ii) it ensures thatauthorized users (i.e., those who have the right to access the owner's file) receive the latest version of the outsourceddata, (iii) it enables indirect mutual trust between the owner and the CSP, and (iv) it allows the owner to grant orrevoke access to the outsourced data. We discuss the security issues of the proposed scheme. Besides, we justify its

performance through theoretical analysis and experimental evaluation of storage, communication, and computationoverheads.

Title :Mobi-Sync: Efficient Time Synchronization for Mobile Underwater Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/mobi-sync-efficient-time-synchronization-mobile-underwater-sensor-networks-implement

Abstract : Time synchronization is an important requirement for many services provided by distributed networks. A lotof time synchronization protocols have been proposed for terrestrial Wireless Sensor Networks (WSNs). However,none of them can be directly applied to Underwater Sensor Networks (UWSNs). A synchronization algorithm forUWSNs must consider additional factors such as long propagation delays from the use of acoustic communicationand sensor node mobility. These unique challenges make the accuracy of synchronization procedures for UWSNseven more critical. Time synchronization solutions specifically designed for UWSNs are needed to satisfy these newrequirements. This paper proposes Mobi-Sync, a novel time synchronization scheme for mobile underwater sensornetworks. Mobi-Sync distinguishes itself from previous approaches for terrestrial WSN by considering spatialcorrelation among the mobility patterns of neighboring UWSNs nodes. This enables Mobi-Sync to accurately estimatethe long dynamic propagation delays. Simulation results show that Mobi-Sync outperforms existing schemes in bothaccuracy and energy efficiency.


Title :Mobi-Sync: Efficient Time Synchronization for Mobile Underwater Sensor NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/mobi-sync-efficient-time-synchronization-mobile-underwater-sensor-networks

Abstract : Time synchronization is an important requirement for many services provided by distributed networks. A lotof time synchronization protocols have been proposed for terrestrial Wireless Sensor Networks (WSNs). However,none of them can be directly applied to Underwater Sensor Networks (UWSNs). A synchronization algorithm forUWSNs must consider additional factors such as long propagation delays from the use of acoustic communicationand sensor node mobility. These unique challenges make the accuracy of synchronization procedures for UWSNseven more critical. Time synchronization solutions specifically designed for UWSNs are needed to satisfy these newrequirements. This paper proposes Mobi-Sync, a novel time synchronization scheme for mobile underwater sensornetworks. Mobi-Sync distinguishes itself from previous approaches for terrestrial WSN by considering spatialcorrelation among the mobility patterns of neighboring UWSNs nodes. This enables Mobi-Sync to accurately estimatethe long dynamic propagation delays. Simulation results show that Mobi-Sync outperforms existing schemes in bothaccuracy and energy efficiency.

Title :Privacy Preserving Back-Propagation Neural Network Learning Over Arbitrarily Partitioned DataLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-back-propagation-neural-network-learningin-partitioned-data

Abstract : Neural Networks have been an active research area for decades. However, privacy bothers many whenthe training dataset for the neural networks is distributed between two parties, which is quite common nowadays.Existing cryptographic approaches such as secure scalar product protocol provide a secure way for neural networklearning when the training dataset is vertically partitioned. In this paper we present a privacy preserving algorithm forthe neural network learning when the dataset is arbitrarily partitioned between the two parties. We show that ouralgorithm is very secure and leaks no knowledge (except the final weights learned by both parties) about other party'sdata. We demonstrate the efficiency of our algorithm by experiments on real world data.

Title :Privacy Preserving Back-Propagation Neural Network Learning Over Arbitrarily Partitioned DataLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/privacy-preserving-back-propagation-neural-network-learningin-partitioned-data-code

Abstract : Neural Networks have been an active research area for decades. However, privacy bothers many whenthe training dataset for the neural networks is distributed between two parties, which is quite common nowadays.

Existing cryptographic approaches such as secure scalar product protocol provide a secure way for neural networklearning when the training dataset is vertically partitioned. In this paper we present a privacy preserving algorithm forthe neural network learning when the dataset is arbitrarily partitioned between the two parties. We show that ouralgorithm is very secure and leaks no knowledge (except the final weights learned by both parties) about other party'sdata. We demonstrate the efficiency of our algorithm by experiments on real world data.

Title :Secure and Efficient Data Transmission for Cluster-based Wireless Sensor NetworksLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/secure-efficient-data-transmission-cluster-based-wireless-sensor-networks

Abstract : Secure data transmission is a critical issue for wireless sensor networks (WSNs). Clustering is an effectiveand practical way to enhance the system performance of WSNs. In this paper, we study a secure data transmissionfor cluster-based WSNs (CWSNs), where the clusters are formed dynamically and periodically. We propose twoSecure and Efficient data Transmission (SET) protocols for CWSNs, called SET-IBS and SET-IBOOS, by using theIdentity-Based digital Signature (IBS) scheme and the Identity-Based Online/Offline digital Signature (IBOOS)scheme, respectively. In SET-IBS, security relies on the hardness of the Diffie-Hellman problem in the pairing domain.SET-IBOOS further reduces the computational overhead for protocol security, which is crucial for WSNs, while itssecurity relies on the hardness of the discrete logarithm problem. We show the feasibility of the SET-IBS andSET-IBOOS protocols with respect to the security requirements and security analysis against various attacks. Thecalculations and simulations are provided to illustrate the efficiency of the proposed protocols. The results show that,the proposed protocols have better performance than the existing secure protocols for CWSNs, in terms of securityoverhead and energy consumption.

Title :Secure and Efficient Data Transmission for Cluster-based Wireless Sensor NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/secure-efficient-data-transmission-cluster-based-wireless-sensor-networks-code

Abstract : Secure data transmission is a critical issue for wireless sensor networks (WSNs). Clustering is an effectiveand practical way to enhance the system performance of WSNs. In this paper, we study a secure data transmissionfor cluster-based WSNs (CWSNs), where the clusters are formed dynamically and periodically. We propose twoSecure and Efficient data Transmission (SET) protocols for CWSNs, called SET-IBS and SET-IBOOS, by using theIdentity-Based digital Signature (IBS) scheme and the Identity-Based Online/Offline digital Signature (IBOOS)scheme, respectively. In SET-IBS, security relies on the hardness of the Diffie-Hellman problem in the pairing domain.SET-IBOOS further reduces the computational overhead for protocol security, which is crucial for WSNs, while itssecurity relies on the hardness of the discrete logarithm problem. We show the feasibility of the SET-IBS andSET-IBOOS protocols with respect to the security requirements and security analysis against various attacks. Thecalculations and simulations are provided to illustrate the efficiency of the proposed protocols. The results show that,the proposed protocols have better performance than the existing secure protocols for CWSNs, in terms of securityoverhead and energy consumption.


Title :Towards Differential Query Services in Cost-Efficient CloudsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/towards-differential-query-services-cost-efficient-clouds

Abstract : Cloud computing as an emerging technology trend is expected to reshape the advances in informationtechnology. In a cost- efficient cloud environment, a user can tolerate a certain degree of delay while retrievinginformation from the cloud to reduce costs. In this paper, we address two fundamental issues in such an environment:privacy and efficiency. We first review a private keyword-based file retrieval scheme that was originally proposed byOstrovsky. Their scheme allows a user to retrieve files of interest from an untrusted server without leaking anyinformation. The main drawback is that it will cause a heavy querying overhead incurred on the cloud, and thus goesagainst the original intention of cost efficiency. In this paper, we present a scheme, termed efficient informationretrieval for ranked query (EIRQ), based on an aggregation and distribution layer (ADL), to reduce querying overheadincurred on the cloud. In EIRQ, queries are classified into multiple ranks, where a higher ranked query can retrieve ahigher percentage of matched files. A user can retrieve files on demand by choosing queries of different ranks. Thisfeature is useful when there are a large number of matched files, but the user only needs a small subset of them.Under different parameter settings, extensive evaluations have been conducted on both analytical models and on areal cloud environment, in order to examine the effectiveness of our schemes.

Title :Towards Differential Query Services in Cost-Efficient CloudsLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/towards-differential-query-services-cost-efficient-clouds-code

Abstract : Cloud computing as an emerging technology trend is expected to reshape the advances in informationtechnology. In a cost- efficient cloud environment, a user can tolerate a certain degree of delay while retrievinginformation from the cloud to reduce costs. In this paper, we address two fundamental issues in such an environment:privacy and efficiency. We first review a private keyword-based file retrieval scheme that was originally proposed byOstrovsky. Their scheme allows a user to retrieve files of interest from an untrusted server without leaking anyinformation. The main drawback is that it will cause a heavy querying overhead incurred on the cloud, and thus goesagainst the original intention of cost efficiency. In this paper, we present a scheme, termed efficient informationretrieval for ranked query (EIRQ), based on an aggregation and distribution layer (ADL), to reduce querying overheadincurred on the cloud. In EIRQ, queries are classified into multiple ranks, where a higher ranked query can retrieve ahigher percentage of matched files. A user can retrieve files on demand by choosing queries of different ranks. Thisfeature is useful when there are a large number of matched files, but the user only needs a small subset of them.Under different parameter settings, extensive evaluations have been conducted on both analytical models and on areal cloud environment, in order to examine the effectiveness of our schemes.

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 :The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile SinksLanguage : Matlab

Project Link : http://kasanpro.com/p/matlab/three-tier-security-scheme-wireless-sensor-networks-mobile-sinks

Abstract : Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient dataaccumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However,in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment andauthentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates anew security challenge: in the basic probabilistic and q-composite key predistribution schemes, an attacker can easilyobtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network bydeploying a replicated mobile sink preloaded with some compromised keys. This article describes a three-tier generalframework that permits the use of any pairwise key predistribution scheme as its basic component. The newframework requires two separate key pools, one for the mobile sink to access the network, and one for pairwise keyestablishment between the sensors. To further reduce the damages caused by stationary access node replicationattacks, we have strengthened the authentication mechanism between the sensor and the stationary access node inthe proposed framework. Through detailed analysis, we show that our security framework has a higher networkresilience to a mobile sink replication attack as compared to the polynomial pool-based scheme.


Title :E-SmallTalker: A Distributed Mobile System for Social Networking in Physical ProximityLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/e-smalltalker-distributed-mobile-system-social-networking-physical-proximity

Abstract : Small talk is an important social lubricant that helps people, especially strangers, initiate conversations andmake friends with each other in physical proximity. However, due to difficulties in quickly identifying significant topicsof common interest, real-world small talk tends to be superficial. The mass popularity of mobile phones can helpimprove the effectiveness of small talk. In this paper, we present E-SmallTalker, a distributed mobile communicationssystem that facilitates social networking in physical proximity. It automatically discovers and suggests topics such ascommon interests for more significant conversations. We build on Bluetooth Service Discovery Protocol (SDP) toexchange potential topics by customizing service attributes to publish non-service-related information withoutestablishing a connection. We propose a novel iterative Bloom filter protocol that encodes topics to fit in SDPattributes and achieves a low false-positive rate. We have implemented the system in Java ME for ease ofdeployment. Our experiments on real-world phones show that it is efficient enough at the system level to facilitatesocial interactions among strangers in physical proximity. To the best of our knowledge, E-SmallTalker is the firstdistributed mobile system to achieve the same purpose.

Title :Enhancing data security in ad hoc networks based on multipath routingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/enhancing-data-security-ad-hoc-networks-based-multipath-routing

Abstract : An ad hoc network is a self-organizing network of wireless links connecting mobile nodes. The mobilenodes can communicate without an infrastructure. They form an arbitrary topology, where the nodes play the role ofrouters and are free to move randomly. Ad hoc networks proved their efficiency being used in different fields but theyare highly vulnerable to security attacks and dealing with this is one of the main challenges of these networks today.Recently, some solutions are proposed to provide authentication, confidentiality, availability, secure routing andintrusion detection in ad hoc networks. Implementing security in such dynamically changing networks is a hard task.Ad hoc network characteristics should be taken into consideration to be able to design efficient solutions. In this study,we focus on improving the flow transmission confidentiality in ad hoc networks based on multipath routing. Indeed, wetake advantage of the existence of multiple paths between nodes in an ad hoc network to increase the confidentialityrobustness of transmitted data. In our approach the original message to secure is split into shares that are encryptedand combined then transmitted along different disjointed existing paths between sender and receiver. Even if anattacker succeeds to obtain one or more transmitted shares, the probability that the original message will bereconstituted is very low. We compare our approach with existing ad hoc multipath security solutions and presentperformance evaluations of our protocol SDMP (Securing Data based Multipath Routing).

Title :Enhancing data security in ad hoc networks based on multipath routingLanguage : Java

Project Link : http://kasanpro.com/p/java/enhancing-data-security-ad-hoc-networks-based-multipath-routing-code

Abstract : An ad hoc network is a self-organizing network of wireless links connecting mobile nodes. The mobilenodes can communicate without an infrastructure. They form an arbitrary topology, where the nodes play the role of

routers and are free to move randomly. Ad hoc networks proved their efficiency being used in different fields but theyare highly vulnerable to security attacks and dealing with this is one of the main challenges of these networks today.Recently, some solutions are proposed to provide authentication, confidentiality, availability, secure routing andintrusion detection in ad hoc networks. Implementing security in such dynamically changing networks is a hard task.Ad hoc network characteristics should be taken into consideration to be able to design efficient solutions. In this study,we focus on improving the flow transmission confidentiality in ad hoc networks based on multipath routing. Indeed, wetake advantage of the existence of multiple paths between nodes in an ad hoc network to increase the confidentialityrobustness of transmitted data. In our approach the original message to secure is split into shares that are encryptedand combined then transmitted along different disjointed existing paths between sender and receiver. Even if anattacker succeeds to obtain one or more transmitted shares, the probability that the original message will bereconstituted is very low. We compare our approach with existing ad hoc multipath security solutions and presentperformance evaluations of our protocol SDMP (Securing Data based Multipath Routing).

Title :Multiple-Variant jammer loacalization in Wireless Sensor NetworksLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/multiple-variant-jammer-loacalization-wireless-sensor-networks

Abstract :

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 messagingcost. 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.

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 CloudsLanguage : 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 the

geo-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.


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 aconstant-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.

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.

m phil-computer-science-parallel-and-distributed-system-projects

Education