Distributed Proximity Maintenance in Ad Hoc Mobile Networks

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.

[1]  Leonidas J. Guibas,et al.  Proximity problems on moving points , 1997, SCG '97.

[2]  Sayandev Mukherjee,et al.  Network deformation: traffic-aware algorithms for dynamically reducing end-to-end delay in multi-hop wireless networks , 2004, MobiCom '04.

[3]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[4]  Leonidas J. Guibas,et al.  Kinetic Connectivity for Unit Disks , 2001, Discret. Comput. Geom..

[5]  Leonidas J. Guibas,et al.  Deformable Free-Space Tilings for Kinetic Collision Detection† , 2002, Int. J. Robotics Res..

[6]  Leonidas J. Guibas,et al.  Discrete and computational geometry , 2003 .

[7]  Leonidas J. Guibas,et al.  Collision detection for deforming necklaces , 2002, SCG '02.

[8]  Jussi Myllymaki,et al.  Buddy tracking - efficient proximity detection among mobile friends , 2007, Pervasive Mob. Comput..

[9]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[10]  Leonidas J. Guibas,et al.  Deformable spanners and applications. , 2006, Computational geometry : theory and applications.

[11]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[12]  Leonidas J. Guibas,et al.  Kinetic collision detection between two simple polygons , 2004, SODA '99.

[13]  Leonidas J. Guibas,et al.  Discrete Mobile Centers , 2003, Discret. Comput. Geom..

[14]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[15]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[16]  Gaurav S. Sukhatme,et al.  Networked Infomechanical Systems (NIMS) for Ambient Intelligence , 2005, Ambient Intelligence.

[17]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.

[18]  S. Rao Kosaraju,et al.  A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.