11 search results - page 2 / 3 » Greedy Connectivity of Geographically Embedded Graphs |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...