Abstract: Neighbor discovery is an important part of mobile sensor networks, which is to quickly and effectively sense the neighbors in the one hop range that can communicate with nodes directly. In asymmetric asynchronous MSN, the existing neighbor discovery algorithms need a lot of time and energy to complete mutual discovery. To solve this problem, based on the separation model of beacon and active time slot, a BMCS-A algorithm for asynchronous symmetric scene is proposed. The beacon broadcasts in different time slots of the work cycle to ensure the certainty of neighbor discovery. Secondly, BMCS-A is extended and BMCS-B for persistent broadcast is proposed. The node continuously broadcasts the beacon in the first sub cycle, and the node receiving the beacon will adaptively adjust the beacon sending time to speed up the neighbor discovery process. Finally, the cooperative BMCS-B algorithm is implemented. Based on the sleep wake-up scheduling information of the discovered neighbors, the nodes actively send beacons to discover potential neighbors. Simulation results show that, compared with Searchlight, G-Nihao and Disco, collaborative BMCS-B can reduce the worst case discovery delay by 84.62%, 85.71% and 81.82% respectively.

Key words: low duty cycle, beacon message, low latency, proactive neighbor discovery, continuous broadcasting