International Journal of Research and Innovations in Science and Technology

♦ Call for Papers   No Publication Charges Join IJRIST in Linkdin

www.berkana-salon.kiev.ua/
designprof.com.ua/
kvartiraarenda.com/

Anonymity Preserving Routing In Location Privacy Schemes In Wireless Sensor Networks

Author(s) : R.Regin

Volume & Issue : VOLUME 2 / 2015 , ISSUE 2

Page(s) : 1-6
ISSN (Online): 2394-3858
ISSN (Print) : 2394-3866

Abstract

Location privacy measures need to be developed to prevent the opponent from determining the physical locations of source sensors and sinks. An opponent can easily intercept network traffic due to the use of a broadcast medium for routing packets and get detailed information such as packet transmission time and frequency to perform traffic analysis and infer the locations of monitored objects and data sinks. On the other hand, sensors usually have limited processing speed and energy supplies. It is very expensive to apply traditional anonymous communication techniques for hiding the communication between sensor nodes and sinks. The existing source-location privacy protects the location of monitored objects to increase the number of messages sent by the source before the object is located by the attacker. The flooding technique has the source node send each packet through numerous paths to a sink making it difficult for an opponent to trace the source. The locations of sinks can be protected from a local eavesdropper by hashing the ID field in the packet header. But opponent can track sinks by carrying out time correlation and rate monitoring attacks. Besides protection some source nodes are transferring relatively large amounts of data in existing system. As a result, these nodes run out of battery faster due to improper position of nodes and sinks. Thus in the proposed system the sinks should be located as optimally as possible to reduce traffic flow and energy consumption for sensor nodes. Hence Sink placement problem is resolved for minimizing the delay as well as maximizing the lifetime of a WSN. Thus proposed system is efficient in terms of overhead and functionality when compared to existing system.



Keywords

WSN, Anonymous, Eavesdropper, Source Location Privacy.

References

  1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless   Sensor   Networks:   A   Survey,” Computer Networks,    vol. 38, no. 4, pp. 393-422, 2002.
  2. B. Bamba, L. Liu, P. Pesti, and T. Wang, “Supporting Anonymous Location Queries in Mobile Environments with Privacygrid,” Proc. Int’l Conf. World Wide Web (WWW ’08), 2008.
  3. BlueRadios Inc., “Order and Price Info,” http://www.blueradios. com/orderinfo.htm, Feb. 2006.
  4. B. Bollobas, D. Gamarnik, O. Riordan, and B. Sudakov, “On the Value of a Random Minimum Weight Steiner Tree,”Combinatorica, vol. 24, no. 2, pp. 187-207, 2004.
  5. H. Chan, A. Perrig, and D. Song, “Random Key   Predistribution   Schemes   for   Sensor Networks,” Proc. IEEE Symp. Security and Privacy (S&P ’03), pp. 197-213, May 2003.
  6. J. Deng, R. Han, and S. Mishra, “Enhancing Base  Station  Security  in  Wireless  Sensor Networks,” Technical Report CU-CS-  951-03, Univ. of Colorado, Dept. of Computer Science, 2003.
  7. J. Deng, R. Han, and S. Mishra, “Intrusion Tolerance and Anti- Traffic Analysis Strategies for Wireless Sensor Networks,” Proc. Int’l Conf.Dependable  Systems  and  Networks (DSN ’04), June 2004.