|
J. Gao, L. J. Guibas, A. Nguyen, Distributed Proximity Maintenance in Ad Hoc Mobile Networks. International Conference on Distributed Computing in Sensor System (DCOSS'05), pp. 4-19, 2005.
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.
Bibtex:
@inproceedings{ggn-dpmahmn-05,
author="J. Gao and L. J. Guibas and A. Nguyen",
title="Distributed Proximity Maintenance in Ad Hoc Mobile Network",
booktitle="IEEE International Conference on Distributed Computing in Sensor System (DCOSS'05)",
pages="4--19",
month="June",
year="2005",
}
|
|