Neighbor Discovery in Ad hoc Networks


The following two references are close, but do not solve same problem
(not competing solutions). Search literature (last ten years) to
identify other close and competing solutions.

[LRJ] An Energy-Efficient Neighbor Discovery Protocol for Low
Duty-Cycled Wireless Sensor Networks
Shouwen Lai
Binoy Ravindran
Seong-Soon Joo

[LRJ] presents p-Grid, an asynchronous neighbor discovery protocol for
low duty-cycled WSNs. Sensors stay awake as little as possible while
guaranteeing that neighbors are discovered within bounded latency. p-rid
is based on quorum systems where read and write quorums have a non-empty
intersection, based on Chinese reminder theorem.
As authors observe, compared to existing protocols where sensors are
awake all the time, neighbors can be discovered without continuous
sending probing packets.

[AKWW] G. Alonso, E. Kranakis, R. Wattenhofer, P. Widmayer,
Probabilistic protocols for node discovery in ad hoc, single broadcast
channel networks, Proc. IEEE Int. Parallel and Distributed Processing
Symp. Workshops, Nice, France, 2003.

Alonso, Kranakis, Wattenhofer, and Widmayer [AKWW] proposed a protocol
for node discovery in single-hop ad hoc networks, where each node is
within transmission radius of any other node. The protocol discovers one
edge in the network, which is considered detected after one node was a
single transmitter in one step, followed by the other node being single
transmitted in the next step with the edge confirmation. Therefore the
protocol remains short of achieving larger goal, recognizing all edges
and all nodes in the network, since repeated application of one of
described protocols may not lead to an efficient and terminating scheme
for that goal.

Use the order calculator below and get started! Contact our live support team for any assistance or inquiry.