TECHNOLOGY Defend the Locations in WSN from Snoopers

In detector network several protocols are exploitat ion for privacy and preservation of knowledge again st aggressor. Such connected data will be manipulate b y associate mortal to derive sensitive data like th e locations of observe objects and information receivers within th e field. Attacks on these elements will considerabl y undermine any network application.The snooper, is realistic a nd may defeat these existing technique. It initial formalizes the situation privacy problems in detector networks und erneath this robust mortal model and computes a bound on the communication overhead required for achieving a given level of location privacy. It proposes 2 techniq ues to produce location privacy to sender-location privacy —periodic assortment and sender simulation—and 2 techniques to produce location privacy to Receiver-location pr ivacy—Receiver simulation and backbone flooding. These techniques give trade-offs between privacy, communication value, and latency. Use of those propose tec hniques, it improves location privacy for each sender and recei ver locations.

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[3]  Shivakant Mishra,et al.  Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks , 2004, International Conference on Dependable Systems and Networks, 2004.

[4]  Wade Trappe,et al.  Enhancing Source-Location Privacy in Sensor Network Routing , 2005, ICDCS.

[5]  Mike Horton,et al.  The platforms enabling wireless sensor networks , 2004, CACM.

[6]  Ling Liu,et al.  Supporting anonymous location queries in mobile environments with privacygrid , 2008, WWW.

[7]  Shivakant Mishra,et al.  Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks , 2006, Pervasive Mob. Comput..

[8]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Béla Bollobás,et al.  On the Value of a Random Minimum Weight Steiner Tree , 2004, Comb..

[10]  Fillia Makedon,et al.  Entrapping adversaries for source protection in sensor networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[11]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[12]  Sencun Zhu,et al.  Towards event source unobservability with minimum network traffic in sensor networks , 2008, WiSec '08.

[13]  Liang Zhang,et al.  Protecting Receiver-Location Privacy in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[15]  Mimoza Durresi,et al.  Routing through Backbone Structures in Sensor Networks , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[16]  Panos Kalnis,et al.  Private queries in location based services: anonymizers are not necessary , 2008, SIGMOD Conference.

[17]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.