Neighbor discovery in mobile ad hoc networks using an abstract MAC layer

Authors:
Alejandro Cornejo;Nancy Lynch;Saira Viqar;Jennifer L. Welch
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Department of Computer Science and Engineering, Texas A&M University, College Station, TX;Department of Computer Science and Engineering, Texas A&M University, College Station, TX
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 10
Cited 7

A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
LLS: a locality aware location service for mobile ad hoc networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Distributed Token Circulation in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)

The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Neighbor discovery in wireless networks and the coupon collector's problem

Proceedings of the 15th annual international conference on Mobile computing and networking
The abstract MAC layer

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Decomposing broadcast algorithms using abstract MAC layers

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Reliable neighbor discovery for mobile ad hoc networks

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
MAC design for analog network coding

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Asynchronous leader election and MIS using abstract MAC layer

FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
On efficient neighbor sensing in vehicular networks

Computer Communications
Decomposing broadcast algorithms using abstract MAC layers

Ad Hoc Networks
Reliable neighbor discovery for mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the problem of neighbor discovery in a mobile ad hoc network environment. We describe a protocol for learning about neighboring nodes in such an environment. The protocol is used for establishing and tearing down communication links with neighboring nodes as they move from one region of the network to another. The protocol is implemented on top of the abstract MAC layer service presented in [4], which provides reliable message delivery within the local neighborhood and also provides the sender with an acknowledgment when all neighboring nodes have received a message. There is an upper bound, guaranteed by the abstract MAC layer service, on the worst case delay that a message can experience before it is received or acknowledged. We determine the time complexity of the neighbor discovery protocol in terms of the bounded delays provided by the underlying abstract MAC layer.