ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.

Slides:



Advertisements
Similar presentations
Bandwidth Estimation for IEEE Based Ad Hoc Networks.
Advertisements

The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.
CLOSENESS: A NEW PRIVACY MEASURE FOR DATA PUBLISHING
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Abstract There is significant need to improve existing techniques for clustering multivariate network traffic flow record and quickly infer underlying.
ABSTRACT Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes.
Secure Data Storage in Cloud Computing Submitted by A.Senthil Kumar( ) C.Karthik( ) H.Sheik mohideen( ) S.Lakshmi rajan( )
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.
On the Node Clone Detection inWireless Sensor Networks.
Toward a Statistical Framework for Source Anonymity in Sensor Networks.
Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.
A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.
Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.
Abstract Provable data possession (PDP) is a probabilistic proof technique for cloud service providers (CSPs) to prove the clients' data integrity without.
Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.
Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.
A Survey of Mobile Cloud Computing Application Models
Layered Approach using Conditional Random Fields For Intrusion Detection.
Security Evaluation of Pattern Classifiers under Attack.
Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.
Incentive Based Data Sharing in Delay Tolerant Mobile Networks.
Improving Network I/O Virtualization for Cloud Computing.
Privacy Preserving Data Sharing With Anonymous ID Assignment
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
m-Privacy for Collaborative Data Publishing
EAACK—A Secure Intrusion-Detection System for MANETs
Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.
Protecting Sensitive Labels in Social Network Data Anonymization.
Identity-Based Secure Distributed Data Storage Schemes.
ANNA UNIVERSITY, CHENNAI PROJECT VIVA FINAL YEAR MCA( ) 04/07/2013.
Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems.
Hiding in the Mobile Crowd: Location Privacy through Collaboration.
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.
Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.
A System for Denial-of- Service Attack Detection Based on Multivariate Correlation Analysis.
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.
Privacy Preserving Delegated Access Control in Public Clouds.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.
Towards Online Shortest Path Computation. Abstract The online shortest path problem aims at computing the shortest path based on live traffic circumstances.
Privacy Preserving Back- Propagation Neural Network Learning Made Practical with Cloud Computing.
Participatory Privacy: Enabling Privacy in Participatory Sensing
Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.
DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.
Supporting Privacy Protection in Personalized Web Search.
Twitsper: Tweeting Privately. Abstract Although online social networks provide some form of privacy controls to protect a user's shared content from other.
m-Privacy for Collaborative Data Publishing
A Scalable Two-Phase Top-Down Specialization Approach for Data Anonymization Using MapReduce on Cloud.
Multiparty Access Control for Online Social Networks : Model and Mechanisms.
Harnessing the Cloud for Securely Outsourcing Large- Scale Systems of Linear Equations.
Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Privacy-Preserving and Content-Protecting Location Based Queries.
Energy-Efficient Protocol for Cooperative Networks.
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud.
ONLINE INTRUSION ALERT AGGREGATION WITH GENERATIVE DATA STREAM MODELING.
Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks.
S URVIVABILITY A NALYSIS OF AD HOC NETWORK UNDER ATTACK Project Members S.Karthiga G.Asha J.Anusha Guided By Mrs. P.Prittopaul.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Intrusion Detection-An Energy Efficient Approach In Heterogeneous WSN Department Of Computer Science and Engineering ADARSH COLLEGE OF ENGINEERING CHEBROLU.
Under the Guidance of V.Rajashekhar M.Tech Assistant Professor
Hacker Detection in Wireless sensor network
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
NYMBLE: BLOCKING MISBEHAVING USERS IN ANONYMIZING NETWORKS
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Presentation transcript:

ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS

ABSTRACT Full network level privacy has often been categorized into four sub- categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). Full network level privacy has often been categorized into four sub- categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

EXISTING SYSTEM Existing privacy schemes such as, that have specifically been proposed for WSNs only provide partial network level privacy. Providing a full network level privacy is a critical and challenging issue due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor network (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and trustworthiness). Thus, an energy-efficient privacy solution is needed to address these issues. Existing privacy schemes such as, that have specifically been proposed for WSNs only provide partial network level privacy. Providing a full network level privacy is a critical and challenging issue due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor network (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and trustworthiness). Thus, an energy-efficient privacy solution is needed to address these issues. In order to achieve this goal, we incorporate basic design features from related research fields such as geographic routing and cryptographic systems. In order to achieve this goal, we incorporate basic design features from related research fields such as geographic routing and cryptographic systems. To our knowledge, we propose the first full network level privacy solution for WSNs. To our knowledge, we propose the first full network level privacy solution for WSNs.

PROPOSED SYSTEM A new Identity, Route and Location (IRL) privacy algorithm is proposed that ensures the anonymity of source nodes identity and location. It also assures that the packets will reach their destination by passing through only trusted intermediate nodes. A new Identity, Route and Location (IRL) privacy algorithm is proposed that ensures the anonymity of source nodes identity and location. It also assures that the packets will reach their destination by passing through only trusted intermediate nodes. A new reliable Identity, Route and Location (r-IRL) privacy algorithm is reposed, which is the extension of our proposed IRL algorithm. This algorithm has the ability to forward packets from multiple secure paths to increase the packet reach-ability. A new reliable Identity, Route and Location (r-IRL) privacy algorithm is reposed, which is the extension of our proposed IRL algorithm. This algorithm has the ability to forward packets from multiple secure paths to increase the packet reach-ability. A new data privacy mechanism is proposed, which is unique in the sense that it provides data secrecy and packet authentication in the presence of identity anonymity. A new data privacy mechanism is proposed, which is unique in the sense that it provides data secrecy and packet authentication in the presence of identity anonymity.

MODULES Network Model Network Model Adversary Model Adversary Model Device-rich Device-rich Resource-rich Resource-rich

SYSTEM REQUIREMENT SPECIFICATIONS HARDWARE REQUIREMENTS Processor : Pentium IV 2.6 GHz Processor : Pentium IV 2.6 GHz RAM : 256 MB RAM : 256 MB Hard Disk : 80GB Hard Disk : 80GB SOFTWARE REQUIREMENTS Language : Java RMI, SWING, J2ME Language : Java RMI, SWING, J2ME Mobile toolkit : J2ME Wireless Toolkit Mobile toolkit : J2ME Wireless Toolkit Development Tool : Net beans 5.5 Development Tool : Net beans 5.5 Operating System : Windows XP Operating System : Windows XP

THANK YOU