Skip to main content

Advertisement

Log in

Secure Coverage Tree Construction Scheme for Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In wireless sensor networks, nodes usually construct tree structure in any monitored area to enable data aggregation and to transmit aggregated data by multi-hopping through neighbors to a remote sink (BS) which results in significant energy savings. Further- more, a captured sensor node might generate a fictitious data and misguide the Sink (BS). Hence, secure communication between nodes have generally vital importance. Secret shared keys are needed to be established among sensor nodes for secure communication among them. In the present work a new algorithm is introduced to construct such a tree of sensor nodes in wireless sensor networks. This algorithm implements a sleep/wake scheduling technique to keep redundant nodes inactive while maintaining initial sensing coverage with active nodes. Redundant nodes can replace the failure nodes to keep network tasks that enhances the network lifetime by efficient utilization. Hence the objective of this research work is to jointly design the scheme for sensor scheduling, tree construction with active nodes, and secret pair-wise keys establishment with their parent and children such that the network lifetime can be maximized. Thereafter, sensor nodes communicate with each other securely using secret pair-wise keys.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Carman, D. W., Kruus, P. S., & Matt, B. J. (2000). Constraints and approaches for distributed sensor networks security, Technical Report No. 00-010, NAT Labs, Network associates Inc., Glenwood, MD, USA.

  2. Singh, S. K., Singh, M.P., & Singh, D.K. (2010). Applications, classifications, and selections of energy-efficient routing protocols for wireless sensor networks, International Journal of Advanced Engineering Sciences and Technologies (IJAEST), 1(2), ISSN: 2230–7818.

  3. Ye, F., Zhong, G., Lu, S., & Zhhang, L. (2003). Peas: A robust energy conserving protocol for long-lived sensor networks, In The 23nd international conference on distributed computing systems (ICDCS), 2003.

  4. Hsin, C.-F., & Liu, M. (2004). Network coverage using low duty-cycled sensors: Random and coordinated sleep algorithms”, IPSN’04, on Information Processing in Sensor Networks. California, USA: Berkeley.

    Book  Google Scholar 

  5. Tian, D., & Georganas, N. D. (2002). A coverage-preserving node scheduling scheme for large wireless sensor networks. In First ACM International workshop on Wireless Sensor Networks and Applications, pp 32–41

  6. Hill, J., Szewczyk, R., Woo, A., Hollar, S., & Pister, D.C.K. (2000). System architecture directions for networked sensors, In Proceedings of the 9th international conference on architectural support for programming languages and operating systems.

  7. Kiran M., Kamal K., & Nitin G. (2011). Wireless sensor network: A review on data aggregation, International Journal of Scientific and Engineering Research 2(4), ISSN 2229–5518.

  8. Madden, S., Szewczyk, R., Franklin, M., & Culler, D. (2002). Supporting aggregate queries over ad-hoc sensor networks, In Workshop on mobile computing and systems applications (WMCSA), (pp. 49–58) Callicoon, NY, June.

  9. Wagner, D. (2004). Resilient aggregation in sensor networks, In SASN ’04: Proceedings of the 2nd ACM workshop on Security of adhoc and sensor networks (pp. 78–87) ACM Press, New York, USA.

  10. Intanagonwiwat, C., Estrin, D., Govindan, R., & Heidemann, J. (2002). Impact of network density on data aggregation in wireless sensor networks, In proceedings of the 22nd international conference on distributed computing systems.

  11. Madden, S., Franklin, M.J., & Hellerstein, J.M. (2002). TAG: A tiny AGgregation service for ad-hoc sensor networks, OSDI.

  12. Wu, K., Dreef, D., Sun, B., & Xiao, Y. (2007). Secure data aggregation without persistent cryptographic operation in wireless sensor networks. Ad Hoc Networks, 5(1), 100–111.

    Article  Google Scholar 

  13. Cheng, Y., & Agrawal, D. P. (2007). An improved key distribution mechanism for large scale hierarchical wireless sensor networks. Ad Hoc Networks, 5(1), 35–48.

    Article  Google Scholar 

  14. WSNet simulator, available: http://wsnet.gforge.inria.fr/

  15. Karri, R., & Mishra, P. (2002). Minimizing the secure wireless energy, Journal of Mobile Network and Applications (MONET).

  16. Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2000). Energy- efficient communication protocol for wireless micro-sensor networks, proceedings of the 33rd Hawaii international conference on system sciences.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pardeep Kumar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Memon, I., Kumar, P., Memon, N.A. et al. Secure Coverage Tree Construction Scheme for Wireless Sensor Networks. Wireless Pers Commun 82, 659–674 (2015). https://doi.org/10.1007/s11277-014-2246-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-2246-5

Keywords

Navigation