55 search results - page 6 / 11 » Greedy Routing in Tree-Decomposed Graphs |
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...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
HICSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
COR
2008
13 years 7 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...