Full Target K-Coverage Retention at the Boundary of Smart Sensor Networks


  • Shan Hu School of Engineering, Guangzhou College of Technology and Business, Guangzhou 510850, China


The presence of a large amount of redundant data in smart wireless sensor network coverage can lead to problems such as low coverage. Hence, this study proposes a holding protocol applied to the all-target k coverage of smart sensor networks. In this study, firstly, the relationship between target nodes and sensor nodes is determined with the help of the network model, and the theorem and argument process related to coverage quality is analyzed to determine the solution of coverage expectation value in the monitoring area. Then, the energy conversion process of sensor nodes is analyzed in combination with related definitions. Finally, the MTCPP algorithm is constructed to maintain the bounded all-target k coverage of the network. Test results confirm that the MTCCP algorithm outperforms the other three network coverage algorithms. The running time of all four network
coverage algorithms gradually increased as the number of sensor nodes and the number of target nodes gradually increased. The number of sensor nodes gradually increased with the increase of network coverage, and the MTCCP algorithm improved the network coverage by 17.65%, 15.46% and 13.26% compared with the OCES, ETCA and EPDM algorithms for the same number of sensor nodes. The MTCPP algorithm has a higher network coverage and energy-consuming network survival cycle, and can be applied to smart wireless sensor networks for the monitoring of target retention, which is of great value in the fields of surveillance and transportation.

Keywords: smart sensors; k re-coverage; energy conversion; network survivability; MTCCP

Cite As

S. Hu, "Full Target K-Coverage Retention at the Boundary of Smart Sensor Networks", Engineering
Intelligent Systems,
vol. 32 no. 2, pp. 145-153, 2024.