sai_review1

PowerPoint Presentation: 

M.SAI M. Tech[C.S] 10P31D0511 TECHNICAL SEMINAR Review-I

PowerPoint Presentation: 

ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS

PowerPoint Presentation: 

A sensor is a technological device or biological organ that detects, or senses, a signal or physical condition and chemical compounds. In electronic terms a sensor may be a device that detects the presence or absence of something e.g. a PIR sensor controlling security lights or a magnetic device used to sense the opening of a door on a burglar alarm system. Other types of sensor may be used to measure parameters such as light or heat or in the case of a microphone to convert audible sound into an electrical signal which can then be used to drive speakers SENSOR:

PowerPoint Presentation: 

A Wireless Sensor Network (WSN) consists of autonomous devices with inbuilt sensors for monitoring various environmental and physical conditions at various places and times. These devices have traditionally been networked using the IEEE 802.15.4 standard as the base , etc., forming the upper layers. These standards have served well the primary requirement of Wireless Sensor Nodes – a long battery life. However, they have their drawbacks - they offer limited range and throughput, they are less secure, they need special infrastructure so that they can be integrated into the existing LAN and they are affected by an already existing WLAN since they use the same frequency band WIRELESS SENSOR NETWORKS :

PowerPoint Presentation: 

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). ABSTRACT:

PowerPoint Presentation: 

Here 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. With the spreading application of Wireless Sensor Networks (WSNs) in various sensitive areas such as health-care, military, habitat monitoring, etc, the need to ensure security and privacy is becoming imperatively important. With respect to these application scenarios, network level privacy has often been categorized into four categories PROPOSED SYSTEM

PowerPoint Presentation: 

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). In order to achieve this goal, we incorporate basic design features from related research fields such as geographic routing and cryptographic systems. EXISTING SYSTEM

PowerPoint Presentation: 

Sender node identity privacy: no intermediate node can get any information about who is sending the packets except the source, its immediate neighbors and the destination Sender node location privacy: no intermediate node can have any information about the location (in terms of physical distance or number of hops) about the sender node except the source, its immediate neighbors and the destination.

PowerPoint Presentation: 

ROUTE PRIVACY: No node can predict the information about the complete path (from source to destination). Also, a mobile adversary gets no clue to trace back the source node either from the contents and/or directional information of the captured packet. DATA PACKET PRIVACY: No node can see the information inside in a payload of the data packet except the source and the destination.

PowerPoint Presentation: 

• A new Identity, Route and Location (IRL) privacy algorithm is proposed that ensures the anonymity of source node’s 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 proposed, 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.

PowerPoint Presentation: 

ROUTE PRIVACY: In initialization phase, let the node i have m neighboring nodes in which t nodes are trusted Whenever a source node wants to forwards the packet, it will first check the availability of the trusted neighboring nodes in its forward direction set If trusted nodes exists IDENTITY PRIVACY: Wheneve r a node receives the packet p from the source node or en-route node then the receiving node will replace the previous hop’s identity prevhop contained in the packet with its own . After that, the node will get the next forwarding node nexthop (as described earlier) and update the header of the packet , After modification of the two header fields, the node will forward the packet .

PowerPoint Presentation: 

The neighboring nodes which are in each other’s radio range can easily approximate the location of each other by measuring the received signal strength and the angle of Arrival . Once the packet has crossed the radio range of the original source node, then becomes very difficult for an attacker to estimate the location of the node either in terms of the physical distance or in terms of the number of hops of an original source node The main reason for this is that the path selection is random and packets are forwarded by only trusted nodes which only contain the information of the last and the next hop. LOCATION PRIVACY

PowerPoint Presentation: 

THANK Q