Coverage Algorithm of K-nearest Neighbor Based on Communication Beacon in Wireless Mobile Sensor Network

Abstract

In wireless mobile sensor networks, mobile sensors are usually composed of some mobile carriers equipped with sensors. In daily life, wireless mobile sensors need to be monitored, reconnaissance, and maintenance in hazardous areas. Because there is no specific infrastructure for centralized control in this network, in order to meet coverage requirements in a particular environment, wireless mobile sensors are often required to be moved to a specific location in a decentralized manner. How to design a mobile control coverage algorithm that controls the moving direction and moving position of each mobile sensor becomes a very important research direction. In this paper, based on the existing K-nearest neighbor rules, we propose a coverage algorithm of K-nearest neighbor based on communication beacon, which can be applied to wireless sensor networks to solve the coverage problem. We propose K neighbor node determination rules, establish a neighbor model, and give the determination principle of the neighbor node connection matrix. The simulation results show that the coverage algorithm is more efficient than the traditional K-nearest neighbor algorithm, and we find that improving the transmit power and reducing the transmission bit length can improve the coverage efficiency.