An asynchronous neighbor discovery algorithm for wireless sensor networks

Authors:
Steven A. Borbash;Anthony Ephremides;Michael J. McGlynn
Affiliations:
National Information Assurance Research Laboratory, Fort Meade, MD 20755-6516, United States;ECE Department, University of Maryland, College Park, MD 20742, United States;Department of Defense, Washington, DC, United States
Venue:
Ad Hoc Networks
Year:
2007

Citing 7
Cited 13

Randomized Initialization Protocols for Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection

IEEE Transactions on Parallel and Distributed Systems
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
Multiuser Detection

Multiuser Detection
Service Discovery 101

IEEE Internet Computing
Asynchronous wakeup for ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

On neighbor discovery in cognitive radio networks

Journal of Parallel and Distributed Computing
Neighbor discovery in wireless networks and the coupon collector's problem

Proceedings of the 15th annual international conference on Mobile computing and networking
Compressed neighbor discovery for wireless ad hoc networks: the Rayleigh fading case

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the design of resilient heterogeneous wireless sensor networks based on small world concepts

Computer Networks: The International Journal of Computer and Telecommunications Networking
Coloring spatial point processes with applications to peer discovery in large wireless networks

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Neighbor discovery with reception status feedback to transmitters

INFOCOM'10 Proceedings of the 29th conference on Information communications
Rendezvous MAC protocols for use in cognitive radio networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A reinforcement learning based framework for prediction of near likely nodes in data-centric mobile wireless networks

EURASIP Journal on Wireless Communications and Networking
Coloring spatial point processes with applications to peer discovery in large wireless networks

IEEE/ACM Transactions on Networking (TON)
Neighborhood discovery in a wireless sensor networks

Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Neighbor discovery in wireless networks with multipacket reception

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Full length article: Neighbor discovery in wireless networks: A multiuser-detection approach

Physical Communication
Efficient algorithms for neighbor discovery in wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is presented that permits each node in the network to develop a list of its neighbors, which may be incomplete. The algorithm is analyzed and parameter settings are derived which maximize the fraction of neighbors discovered in a fixed running time. A companion distributed algorithm is also described which allows all the nodes in the network to execute that neighbor discovery algorithm without the need to agree on a common start time.