Wireless Sensor Networks with Secure Contact Method to Maintain Ambiguity

Authors

  • R. Hamsa Veni  Assistant Professor, Department of MCA, Sri Venkateswara College of Engineering and Technology, Chittoor, Andhra Pradesh., India
  • P. Prathap  PG Scholar, Department of MCA, Sri Venkateswara College of Engineering and Technology, Chittoor, Andhra Pradesh., India
  • P. Balachandra  PG Scholar, Department of MCA, Sri Venkateswara College of Engineering and Technology, Chittoor, Andhra Pradesh., India

Keywords:

Anonymity, Wireless, Security, Identity, Sensor Nodes

Abstract

In wireless sensor networks it's becoming a lot of and a lot of necessary for sensor nodes to maintain namelessness whereas act data as a result of security reasons. Anonymous communication among sensor nodes is very important, as a result of sensor nodes wish to conceal their identities either being a base station or being a supply node. Anonymous communication in wireless sensor networks includes various necessary aspects, as an example base station namelessness, communication association namelessness, and supply node anonymity. From the literature, we will observe that existing namelessness schemes for wireless sensor networks either cannot notice the complete anonymities, or they're full of various overheads like huge memory usage, complex computation, and long communications. This paper is presenting AN economical secure anonymity communication protocol (SACP) for wireless sensor networks that may notice complete anonymities providing minimal overheads with relevance storage, computation and communication prices. The given secure namelessness communication protocol is compared with varied existing namelessness protocols, and the performance analysis shows that our protocol accomplishes all 3 anonymities: sender node anonymity, base station anonymity, and communication association anonymity while using very little memory, low communication price, and small computation costs.

References

  1. J Shi, R. Zhang, Y. Liu and Y. Zhang, "Prisense: privacy-preserving data aggregation in people-centric urban sensing systems," in Proc. of the IEEE INFOCOM 2010, San Diego, CA, March 2010.
  2. X Chen, K. Makki, K. Yen and N. Pissinou, "Sensor network security: a survey, " IEEE Communications Surveys and Tutorials, vol. 11, no. 2, pp. 52-73, 2009.
  3. Akyildiz and E.P. Stuntebeck , “Wireless Underground Sensor Networks,” IEEE Journal on Selected Areas in Communications, vol. 4, no. 6, pp. 669-686, 2008.
  4. J Chen, B. X. Fang, L. H. Yin and S. SU, "A Source-Location Privacy Preservation Protocol in Wireless Sensor Networks Using Source-Based Restricted Flooding," Chinese Journal of Computers, vol.33, no. 9, pp. 1736-1747, 2010.
  5. J P. Sheu, J. R. Jiang and C. Tu, "Anonymous Path Routing in Wireless Sensor Networks," in Proc. of IEEE International Conference on Communications (ICC’08), 2008.
  6. Patwari, J.N. Ash, S. Kyperountas, A.O. Hero, R.L. Moses and N.S. Correal, "Locating the nodes: cooperative localization in wireless sensor networks," IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 54-69, 2005.
  7. Kang, "Protecting location privacy in large-scale wireless sensor networks," in Proc. of IEEE International Conference on Communications (ICC'09), 2009.
  8. Yang, M. Shao, S. Zhu, B. Urgaonkar and G. Cao, "Towards event source unobservability with minimum network traffic in sensor networks," in Proc. of the first ACM Conference on Wireless Network Security, 2008.
  9. T Chen and S. Zhong, "INPAC: An enforceable incentive scheme for wireless networks using network coding," in Proc. of the 29th conference on Information communications (INFOCOM'10), 2010.
  10. M. Kermarrec and G. Tan, "Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach," in Proc. of the eleventh ACM international symposium on Mobile ad hoc networking and computing, 2010.
  11. A. Nezhad, A. Miri and D. Makrakis, "Location privacy and anonymity preserving routing for wireless sensor networks," Journal of Computer Networks, vol.52, no.18, pp.3433-3452, 2008.
  12. Shao, Y. Yang, S. Zhu, and G. Cao, "Towards Statistically Strong Source Anonymity for Sensor Networks," in Proc. of IEEE INFOCOM 2008, pp. 51-55, 2008.
  13. C. Kao and R. Marculescu, "Real-time anonymous routing for mobile ad hoc networks," in Proc. of IEEE Wireless Communications and Networking Conference (WCNC’07), 2007.
  14. Zhang, W. Liu and W. Lou, "Anonymous communications in mobile ad hoc networks," in Proc. of the 24th conference on Information communications (INFOCOM'05), 2005.
  15. W. Law, J. Doumen and P. Hartel, "Survey and benchmark of block ciphers for wireless sensor networks," ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 1, pp. 65-93, 2006.
  16. Misra and G. Xue, "Efficient anonymity schemes for clustered wireless sensor networks," International Journal of Sensor Networks, vol.1, no. 1, pp.50-63, 2006.
  17. Li, M. Song and M. Alam, "Compromised sensor nodes detection: A quantitative approach," in Proc. of the 28th International Conference on Distributed Computing Systems Workshops, 2008.
  18. Song, L. Xie, S. Zhu and G. Cao, "Sensor node compromise detection: the location perspective," in Proc. of the 2007 international conference on Wireless communications and mobile computing, 2007. [19] R. Lu, X. Lin, C. Zhang, H. Zhu, P.H. Ho and X. Shen, "AICN: an efficient algorithm to identify compromised nodes in wireless sensor network," in Proc. of the IEEE International Conference on Communications(ICC'08), 2008.
  19. Zhang, W. Liu, W. Lou and Y. Fang, "Location-based compromise-tolerant security mechanisms for wireless sensor networks," IEEE Journal on Selected Areas in Communications, vol.24, no.2, pp.247-260, 2006

Downloads

Published

2018-04-30

Issue

Section

Research Articles

How to Cite

[1]
R. Hamsa Veni, P. Prathap, P. Balachandra, " Wireless Sensor Networks with Secure Contact Method to Maintain Ambiguity, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 4, Issue 7, pp.171-175, March-April-2018.