A Fast Response Neighbor Discovery Algorithm in Low-Duty-Cycle Mobile Sensor Networks

With the rapid development of the Internet of Things, wireless sensor network, one of its important supporting technologies, has attracted more and more attention. We will work in the low duty cycle wireless sensor network, called low duty cycle wireless sensor network. Neighbor discovery is the most initial but essential work in low duty cycle wireless sensor networks. Although some neighbor discovery algorithms can also achieve neighbor discovery, the average discovery delay is long, and it is difficult to achieve the ability to respond quickly. How to make the nodes in the network quickly realize neighbor discovery is a difficult problem in current research. This paper proposes a group-based fast-response neighbor discovery algorithm (GBFR, in short). At the beginning of the time period, the nodes search for their neighbors by sending a short beacon message, so that the nodes group in pairs. By exchanging neighbor work schedules, nodes know ahead of time some other grouped potential neighbors. Combining the relative distance-based algorithm and node movement, it can selectively recommend suitable neighbors so that nodes can wake up actively and determine whether they are neighbors, thereby speeding up neighbor discovery, reducing communication energy consumption, and improving network life. In this paper, a large number of simulation experiments show that the algorithm has achieved good results in reducing the discovery delay and network energy consumption.