GLIDER: gradient landmark-based distributed routing for sensor networks Export

@inproceedings{citeulike:927738, 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.}, author = {Fang, Qing and Gao, Jie and Guibas, L. J. and de Silva, V. and Zhang, Li}, citeulike-article-id = {927738}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1497904}, comment = {routing sensor networks}, journal = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE}, keywords = {networks, routing, sensor}, pages = {339--350 vol. 1}, posted-at = {2006-11-03 18:25:51}, priority = {3}, title = {GLIDER: gradient landmark-based distributed routing for sensor networks}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1497904}, volume = {1}, year = {2005} }

TY - CONF ID - citeulike:927738 L3 - citeulike-article-id:927738 N2 - 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. JF - INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE EP - 350 vol. 1 TI - GLIDER: gradient landmark-based distributed routing for sensor networks VL - 1 SP - 339 KW - networks KW - routing KW - sensor N1 - routing sensor networks AU - Fang, Qing AU - Gao, Jie AU - Guibas, LJ AU - de Silva, V AU - Zhang, Li PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1497904 ER -