Study on node preserving routing coverage algorithm for sensor networks based on compressed HMAC Online publication date: Thu, 23-Jan-2025
by Jiwei Li
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 16, No. 6, 2024
Abstract: Research on node maintenance routing coverage algorithms in sensor networks can improve node coverage and node activity in sensor networks. This paper proposes a node preserving routing coverage algorithm for sensor networks based on compressed HMAC. Firstly, based on the VGG-F network structure, high-dimensional features of the sensor network layer are extracted to maximise the amount of information carried by the hash code. Secondly, a feature extractor is designed using compressed HMAC algorithm. Then, uniform coverage of the target area is achieved according to the force balance conditions of the acting nodes. Finally, the compressed HMAC method is used to achieve target node division, and the coverage algorithm is used to optimise node retention routing and mobile coverage. The experimental results show that the coverage rate of this method can reach up to 99%, and the node utilisation rate is high.
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 Reasoning-based Intelligent Systems (IJRIS):
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