Skip to main content

Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks

  • Conference paper
  • First Online:
Information Technology and Applied Mathematics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 699))

Abstract

To get inexpensive resolution of real-world problems such as weather forecasting, measurement of underground water label, traffic monitoring, activity of enemies, animals counting in forest, and so on, wireless sensor networks (WSNs) are widely used. Energy-efficient routing protocol is needed to provide the longevity of network lifetime by reducing power consumption of sensor nodes as well as whole networks. Besides, authenticity of sensor nodes and privacy of sensed data are needed in routing protocol for WSNs to provide secure communications, i.e., sensor-to-sensor as well as sensors-to-base station. Clustering technique provides an energy-efficient topology control approach. A minimum connected dominating set (MCDS) can be discovered by applying clustering technique which reduces power consumption in inter-cluster network routing. Cluster head and route selection can be used to provide an energy-efficient outer-cluster routing in WSNs. Identity-based scheme can be used to provide a secure secret message passing mechanism in WSNs. This paper has ng in wireless sensor network framework (E2SDRSNF) which consists of three proposed components. The proposed Algorithm 1 creates a MCDS which is used to build virtual backbone for energy-efficient inter-cluster routing. Data flows through the discovered virtual backbone nodes to base station via cluster heads which is discovered by applying proposed Algorithm 2. The proposed signcryption technique is used for secure communication in WSNs. The analysis of the proposed framework shows that it can save 2720 nJ/bit/m\(^2\) energy than LEACH protocol for one communication (transmission/receiving) along with the security.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bagchi, A.: Sparse power-efficient topologies for wireless ad hoc sensor networks. In: IEEE International Symposium on Parallel Distributed Processing (IPDPS), pp. 1–10, April 2010

    Google Scholar 

  2. Maitra, T., Roy, S.: A comparative study on popular MAC protocols for mixed wireless sensor networks: from implementation viewpoint. Comput. Sci. Rev. 22(C), 107–134 (2016)

    Article  MathSciNet  Google Scholar 

  3. Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15(4), 193–205 (2002)

    Article  Google Scholar 

  4. Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 1–10, New York, NY, USA (1985)

    Google Scholar 

  5. Parthiban, N., Rajasingh, I., Rajan, R.S.: Minimum connected dominating set for certain circulant networks. Procedia Comput. Sci. 57(C), 587–591 (2015)

    Article  Google Scholar 

  6. Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Discrete mobile centers. In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, SCG ’01, pp. 188–196, New York, NY, USA (2001)

    Google Scholar 

  7. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)

    Article  MathSciNet  Google Scholar 

  8. Ortiz, C., Villanueva, M.: Maximal independent sets in caterpillar graphs. Discret. Appl. Math. 160(3), 259–266 (2012)

    Article  MathSciNet  Google Scholar 

  9. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii International Conference on System Sciences, Washington, DC, USA (2000)

    Google Scholar 

  10. Lindsey, S., Raghavendra, C.S.: PEGASIS: power-efficient gathering in sensor information systems. In: Proceedings of the IEEE Aerospace Conference, vol. 3 (2002)

    Google Scholar 

  11. Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Comput. Netw. 42(6), 697–716 (2003)

    Article  Google Scholar 

  12. Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption) << cost(signature) + cost(encryption), pp. 165–179. Springer, Berlin, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing, pp. 213–229. Springer, Berlin, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Chen, L., Lee, J.M.: Improved identity-based signcryption. In: Proceedings of the 8th International Conference on Theory and Practice in Public Key Cryptography, pp. 362–379. Springer (2005)

    Chapter  Google Scholar 

  15. Boldyreva, A., Goyal, V., Kumar, V.: Identity-based encryption with efficient revocation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 417–426. ACM (2008)

    Google Scholar 

  16. Selvi, S.S.D., Vivek, S.S., Rangan, P.C.: Identity Based Online/Offline Encryption and Signcryption Schemes Revisited, pp. 111–127. Springer, Berlin, Heidelberg (2011)

    Chapter  Google Scholar 

  17. Wu, T.-Y., Tsai, T.T., Tseng, Y.M.: Revocable ID-based signature scheme with batch verifications. In: 2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp. 49–54 (2012)

    Google Scholar 

  18. Lee, W., Seo, J.W., Lee, P.J.: Identity-Based Signcryption from Identity-Based Cryptography, pp. 70–83. Springer, Berlin, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Halgamuge, M.N., Zukerman, M., Ramamohanarao, K., Vu, H.L.: An estimation of sensor energy consumption. Prog. Electromagnet. Res. B 12, 259–295 (2009)

    Article  Google Scholar 

  20. Maitra, T., Giri, D.: An efficient biometric and password-based remote user authentication using smart card for telecare medical information systems in multi-server environment. J. Med. Syst. 38(12) (2014)

    Google Scholar 

  21. Giri, D., Sherratt, R.S., Maitra, T.: A novel and efficient session spanning biometric and password based three-factor authentication protocol for consumer usb mass storage devices. IEEE Trans. Consum. Electron. 62(3), 283–291 (2016)

    Article  Google Scholar 

  22. Amin, R., Maitra, T., Giri, D., Srivastava, P.D.: Cryptanalysis and improvement of an RSA based remote user authentication scheme using smart card. Wire. Pers. Commun. 96(3), 4629–4659 (2017)

    Article  Google Scholar 

  23. Developed by the Distributed Computing Group at eth Zurich. www.disco.ethz.ch/projects/sinalgo/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tanmoy Maitra .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maitra, T., Barman, S., Giri, D. (2019). Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks. In: Chandra, P., Giri, D., Li, F., Kar, S., Jana, D. (eds) Information Technology and Applied Mathematics. Advances in Intelligent Systems and Computing, vol 699. Springer, Singapore. https://doi.org/10.1007/978-981-10-7590-2_2

Download citation

Publish with us

Policies and ethics