Efficient algorithms for neighbor discovery in wireless networks

Authors:
Sudarshan Vasudevan;Micah Adler;Dennis Goeckel;Don Towsley
Affiliations:
Bell Labs Research, Alcatel-Lucent, Murray Hill, NJ;Fiksu, Inc., Boston, MA;University of Massachusetts Amherst, Amherst, MA;University of Massachusetts Amherst, Amherst, MA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 15
Cited 0

On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Randomized algorithms

Randomized algorithms
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing
Efficient memoryless protocol for tag identification (extended abstract)

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A new approach to channel access scheduling for Ad Hoc networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A cone-based distributed topology-control algorithm for wireless multi-hop networks

IEEE/ACM Transactions on Networking (TON)
An asynchronous neighbor discovery algorithm for wireless sensor networks

Ad Hoc Networks
Neighbor discovery with reception status feedback to transmitters

INFOCOM'10 Proceedings of the 29th conference on Information communications
An Integrated Neighbor Discovery and MAC Protocol for Ad Hoc Networks Using Directional Antennas

IEEE Transactions on Wireless Communications
Neighbor discovery in mobile ad hoc self-configuring networks with directional antennas: algorithms and comparisons

IEEE Transactions on Wireless Communications - Part 1
Ad hoc networking with directional antennas: a complete system solution

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of n nodes, we propose a Θ(n ln n) ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and an order-optimal Θ(n) receiver feedback-based algorithm when nodes can detect collisions. Our algorithms neither require nodes to have a priori estimates of the number of neighbors nor synchronization between nodes. Our algorithms allow nodes to begin execution at different time instants and to terminate neighbor discovery upon discovering all their neighbors. We finally show that receiver feedback can be used to achieve a Θ(n) running time, even when nodes cannot detect collisions. We then analyze neighbor discovery in a general multihop setting. We establish an upper bound of O(Δ ln n) on the running time of the ALOHA-like algorithm, where Δ denotes the maximum node degree in the network and n the total number of nodes. We also establish a lower bound of Ω(Δ + ln n) on the running time of any randomized neighbor discovery algorithm. Our result thus implies that the ALOHA-like algorithm is at most a factor min (Δ, ln n) worse than optimal.