Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks

By M. J. McGlynn, S. Borbash. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2001

456 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On neighbor discovery in wireless networks with directional antennas (2005, methodology): “While the algorithm in [9] can be made asynchronous in the manner described in this paper, synchronization is a requirement for the algorithm described in [5].”
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications (2008, background): “The problem is also simple with some external assistance: a node attempts to discover and join a network just after being powered on or reset by a human operator or just after being initially deployed [17].”
Aggregation in sensor networks: an energy-accuracy trade-off (2003, unknown): “When a node gets a reading from another node (say X ), it only checks for those nodes (in the estimate_table) that are in its own neighborhood but not in the neighborhood of X . Thus, in the above example when K (or J ) gets the reading from I, it does not broadcast as it realizes that J (or K) is a”
Optimizing Sensor Networks in the Energy-Latency-Density Design Space (2002, background): “Similar observations hold for applications such as surveillance of battlefields, machine failures, room occupancy, or other reactive scenarios, where the user needs to be informed once a condition is satisfied.”