MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Hardware design experiences in ZebraNet
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
Neighbor discovery in wireless networks and the coupon collector's problem
Proceedings of the 15th annual international conference on Mobile computing and networking
U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
IEEE Transactions on Computers
Hi-index | 0.00 |
In this paper, aiming at the problem that the node discovers its neighbor nodes, when it is moving in mobile sensor network, we propose an algorithm for dynamical regulating the duty cycle of the node which needs to discover it neighbor node. This algorithm uses the boundary 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 simulation experiments show that the proposed algorithm can discover more neighbor nodes in the short period of time with less energy.