Dynamic key distribution method for wireless sensor networks based on exponential algorithm Online publication date: Fri, 17-Mar-2023
by Yun Zhao; Yong Xiao; Weibin Lin; Chao Cui; Di Xu
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 16, No. 1, 2023
Abstract: The purpose of this paper is to overcome the problems of high communication failure probability, high energy cost, low global connectivity and poor network robustness, a dynamic key distribution method based on exponential algorithm is proposed. In this method, the collusion characteristics of newly added nodes and revoked nodes in wireless sensor networks are used to establish a wireless sensor security model. The exponential algorithm is used to initialise, broadcast, self repair session key and mutual session key It can help repair, add nodes and cancel nodes to realise dynamic key distribution. The experimental results show that when the number of dynamic key nodes is 600, the probability of communication failure is 47%; when the number of hops is 10, the energy cost is only 1.64 mJ, and the network robustness is high. It reduces the pressure of wireless sensor network and plays a positive role in the root cause location of massive alarm information fault.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook