|
Q. Fang, J. Gao, L. J. Guibas, V. de Silva, L. Zhang, GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks, 24th Conference of the IEEE Communications Society (InfoCom), 2005
Abstract:
We present Gradient Landmark-Based Distributed Routing GLIDER, a
novel naming/addressing scheme and associated routing algorithm, for
a network of wireless communicating nodes. We assume that the nodes
are fixed (though their geographic locations are not necessarily
known), and that each node can communicate wirelessly with some of its
geographic neighbors---a common scenario in sensor networks. We
develop a protocol which in a preprocessing phase discovers the global
topology of the sensor field and, as a byproduct, partitions the nodes
into routable tiles---regions where the node placement is sufficiently
dense and regular that local greedy methods can work well. Such global
topology includes not just connectivity but also higher order
topological features, such as the presence of holes. We address each
node by the name of the tile containing it and a set of local
coordinates derived from connectivity graph distances between the node
and certain landmark nodes associated with its own and neighboring
tiles. We use the tile adjacency graph for global route planning and
the local coordinates for realizing actual inter- and intra-tile
routes. We show that efficient load-balanced global routing can be
implemented quite simply using such a scheme.
Bibtex:
@inproceedings{fggsz-glider-05
, author = "Q. Fang and J. Gao and L. Guibas and V. de Silva and L. Zhang"
, title = "{GLIDER}: Gradient landmark-based distributed routing for sensor networks"
, booktitle = "Proc. IEEE Conference on Computer Communications (INFOCOM)"
, year = "2005"
}
|
|