A Coverage Algorithm based on Key Node Scheduling

Li Zhu, Chunxiao Fan, Huarui Wu, Zhigang Wen

Abstract


Network coverage rate is a key standard of measuring the quality of network coverage. This thesis aims at solving the differences between node energy and task, which causes coverage holes and blind spots of Wireless Sensor Network, and proposes a coverage algorithm, based on key node scheduling, divides node subsets, and adjusts the states of individual nodes according to node energy and coverage rate. This algorithm ensures network connectivity while reducing coverage holes and redundancy. Simulation results show that, the proposed algorithm can effectively reduce failure nodes, energy consumption, improve network coverage rate, and demonstrates network convergence and stability.

Keywords


Wireless Sensor Network; network coverage rate; energy loss; coverage adjustment; node scheduling

Full Text:

PDF



International Journal of Online and Biomedical Engineering (iJOE) – eISSN: 2626-8493
Creative Commons License
Indexing:
Scopus logo Clarivate Analyatics ESCI logo IET Inspec logo DOAJ logo DBLP logo EBSCO logo Ulrich's logo Google Scholar logo MAS logo