Distributed Proximity Maintenance in Ad Hoc Mobile Networks

  • Jie Gao
  • Leonidas J. Guibas
  • An Nguyen
Conference paper

DOI: 10.1007/11502593_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3560)
Cite this paper as:
Gao J., Guibas L.J., Nguyen A. (2005) Distributed Proximity Maintenance in Ad Hoc Mobile Networks. In: Prasanna V.K., Iyengar S.S., Spirakis P.G., Welsh M. (eds) Distributed Computing in Sensor Systems. DCOSS 2005. Lecture Notes in Computer Science, vol 3560. Springer, Berlin, Heidelberg

Abstract

We present an efficient distributed data structure, called the d-Spanner, for maintaining proximity information among communicating mobile nodes. The d-Spanner is a kinetic sparse graph spanner on the nodes that allows each node to quickly determine which other nodes are within a given distance of itself, to estimate an approximate nearest neighbor, and to perform a variety of other proximity related tasks. A lightweight and fully distributed implementation is possible, in that maintenance of the proximity information only requires each node to exchange a modest number of messages with a small number of mostly neighboring nodes. The structure is based on distance information between communicating nodes that can be derived using ranging or localization methods and requires no additional shared infrastructure other than an underlying communication network. Its modest requirements make it scalable to networks with large numbers of nodes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jie Gao
    • 1
  • Leonidas J. Guibas
    • 2
  • An Nguyen
    • 2
  1. 1.Center for the Mathematics of InformationCalifornia Institute of TechnologyPasadenaUSA
  2. 2.Department of Computer ScienceStanford UniversityStanfordUSA

Personalised recommendations