Reliable neighbor discovery for mobile ad hoc networks

  • Authors:

  • Alejandro Cornejo;Saira Viqar;Jennifer L. Welch

  • Affiliations:

  • CSAIL, Massachusetts Institute of Technology, Cambridge, MA;Texas A&M University, College Station, TX;Texas A&M University, College Station, TX

  • Venue:
  • Proceedings of the 6th International Workshop on Foundations of Mobile Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define a reliable neighbor discovery layer for mobile adhoc networks and present two algorithms that implement this layer as a service with varying progress guarantees. Our algorithms are implemented atop an abstract MAC layer [13], which deals with the lower level details of collision detection and contention. Specifically, we first describe a basic region-based neighbor discovery protocol with weak progress guarantees. Informally speaking, this protocol does not guarantee communication links when nodes move quickly across region boundaries. To overcome this limitation, we describe a technique that uses a basic neighbor discovery protocol as a black box and boosts its progress guarantees. The key idea behind this technique is to use multiple partitions overlayed in a specific way, and associate with each partition an instance of the basic neighbor discovery protocol. We show the output of these instances can be composed in a way that provides stronger progress guarantees. In the last section of the paper we discuss different user layer algorithms which would benefit from the reliable neighbor discovery layer described in this paper.