Neighbor Discovery Algorithm Based On the Regulation of Duty-Cycle in Mobile Sensor Network

Abstract. The Neighbor Discovery is a process by which a node iden-tifies its neighbor nodes in its vicinity. We are particular interested in Neighbor Discovery problem in duty-cycle mobile sensor networks in this paper, where a mobile sensor needs to detect its neighbor nodes during its wake-up states. We proposed an algorithm which utilizes the bound-ary nodes in the communication range of the node to predict potential neighbor nodes, applies passion point process to predict the number of nodes in communication range of the node, regulates the duty-cycle of the node based on the model of balls and boxes, and then schedules the waking time of the node periodically by using the duty-cycle which is regulated to finish the detection. Finally, theoretical analysis and sim-ulation experiments indicate that the proposed algorithm can discover more neighbor nodes in the short period with less energy