Advertisement

A Novel Key Predistribution Scheme for Minimum Angle Routing in Wireless Sensor Network

  • Monjul Saikia
  • Md. Anwar Hussain
Chapter
Part of the Studies in Computational Intelligence book series (SCI, volume 771)

Abstract

The main objective of a sensor network is to forward the information regarding any event detected by a sensor node. For efficient routing of the packets through the network, effective and portable routing is essential. We find that a minimum angle-based routing algorithm is highly efficient with low computational cost. In addition to a fast routing mechanism, security is also a major concern of any sensor network. Symmetric key encryption is widely used for this purpose, with secret keys loaded prior to deployment. In this chapter, we propose a novel key predistribution scheme especially applicable for minimum angle-based routing.

Keywords

Routing Min angle routing Security KPS Connectivity Resilience 

References

  1. 1.
    Stavrou, Eliana, and Andreas Pitsillides. 2010. A survey on secure multipath routing protocols in WSNs. Computer Networks 54 (13): 2215–2238.CrossRefGoogle Scholar
  2. 2.
    Akkaya, K., and M. Younis. 2005. A survey of routing protocols in wireless sensor networks. Ad hoc Network, Elsevier Journal 3 (3): 325–349.Google Scholar
  3. 3.
    Abd-El-Barr, M.I., M.M. Al-Otaibi, and M.A. Youssef. 2005. Wireless sensor networks. part II: routing protocols and security issues. In Canadian conference on electrical and computer engineering, 69–72, May 14.Google Scholar
  4. 4.
    Chakraborty, Ishita, and Md. Anwar Hussain. 2012. A simple joint routing and scheduling algorithm for a multi-hop wireless network. In 2012 International conference on computer systems and industrial informatics (ICCSII), 1–5. IEEE.Google Scholar
  5. 5.
    Saikia, Monjul Uddipta, K. Das, and Md. Anwar Hussain. 2017. Secure Energy Aware Multi-path Routing With Key Management in Wireless Sensor Network. Published in 4th International Conference on Signal Processing and Integrated Networks (SPIN 2017), February 2–3, Amity University Noida, India.Google Scholar
  6. 6.
    Blom, R. 1984. An optimal class of symmetric key generation systems. In Theory and application of cryptographic techniques (EUROCRYPT 84).Google Scholar
  7. 7.
    Saikia, Monjul, and Md. Anwar Hussain. 2017. Combinatorial group based approach for key predistribution scheme in wireless sensor network. In International conference on computing, communication and automation (ICCCA2017), 502–506, May 5–6, Galgotias University Noida, India.Google Scholar
  8. 8.
    Camtepe, S.A., and B. Yener. 2007. Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE-ACM Transactions on Networking 15: 346–358.CrossRefGoogle Scholar
  9. 9.
    Liu, D., and P. Ning. 2013. Location-based pairwise key establishments for static sensor networks. In Proceedings of the first ACM workshop security ad hoc and sensor networks.Google Scholar
  10. 10.
    Chan S., R. Poovendran and M. Sun. 2005. A key management scheme in distributed sensor networks using attack probabilities. In IEEE global communications conference, exhibition industry forum (Globecom).Google Scholar
  11. 11.
    Du W., J. Deng, Y.S. Han, S., Chen and P.K. Varshney. 2004. A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of the 24th IEEE conference on computer communications (INFOCOM).Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyNorth Eastern Regional Institute of Science and TechnologyNirjuliIndia

Personalised recommendations