A sleep scheduling algorithm of redundant nodes in power communication sensor networks based on relative local density
by Binyuan Yan
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 15, No. 2, 2023

Abstract: In order to overcome the problems of low network coverage and short network node survival time in the traditional node sleep scheduling algorithm, a redundant node sleep scheduling algorithm based on relative local density is proposed in this paper. The composition of power communication sensor network is analysed, and the energy receiving model of redundant nodes in power communication sensor network is constructed. The sleep scheduling of network redundant nodes is realised according to the relative local density redundant node sleep algorithm. The results show that when the number of nodes is 120, the network performance of this method is 5.18 and the network coverage can reach 99.93%. At the same time, the survival time of sensor nodes under this method is longer, this method can prolong the network life cycle, and the sleep scheduling effect of redundant nodes is better.

Online publication date: Thu, 06-Apr-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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