MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An energy-optimal algorithm for neighbor discovery in wireless sensor networks
Mobile Networks and Applications
Revisiting neighbor discovery with interferences consideration
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Adaptive Low Power Listening for Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
Transmission range adaptation based energy efficient neighborhood discovery
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
In most sensor networks, the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process we call continuous neighbor discovery. In this work, we distinguish between neighbor discovery during sensor network initialization and continuous neighbor discovery. We focus on the latter and view it as a joint task of all the nodes in every connected segment. Each sensor employs a simple protocol in a coordinate effort to reduce power consumption without increasing the time required to detect hidden sensors.