Geometric spanners for routing in mobile networks

By Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. IEEE Journal on Selected Areas in Communications, 2001

406 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/c78e3a1afdc20f8d82957cc1fea723a92f4ca740

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

GPS free coordinate assignment and routing in wireless sensor networks (2005, methodology): “To this purpose, routing protocols based on geographic information of the sensors [9], [10], [11], [12] have been proposed as a viable alternative to existing routing protocols for wireless ad hoc networks such as [13], [14], in order to reduce the burden of maintaining routing tables in the…”
Geographic routing made practical (2005, background): “including GFG [2], GPSR [13], and the GOAFR+ family of algorithms [17]; to refinements of these proposals for efficiency [7], robustness under real network conditions [18, 24], and even routing geographically when node location information is unavailable [21,22].”
Ad hoc networks beyond unit disk graphs (2003, background): “For finding planar subgraphs, various constructions of different quality and complexity have been conceived [9, 11, 28].”
Geographic routing without location information (2003, background): “There have been many geographic routing algorithms, such as [3, 6, 7, 9, 17, 19, 20] and others.”
Geometric ad-hoc routing: of theory and practice (2003, background): “Accordingly [10] proposed local approximation of the Delaunay Graph, however without improving performance bounds for routing.”
Mobility models for ad hoc network simulation (2004, methodology): “For instance, we can analyze the robustness of an ad hoc network routing protocol by considering the amount of work needed to be done when an elementary change in the transmission graph occurs; that is, when an edge is removed or added or the neighborhood of a node changes [26], [27].”
Locating and bypassing routing holes in sensor networks (2004, background): “(Notice the restricted delaunay graph defined in [12] may contain edges that are not in the Delaunay triangulation, as long as the graph is still planar.”
Worst-Case optimal and average-case efficient geometric ad-hoc routing (2003, methodology): “Consequently, local approximation of the Delaunay Graph has been suggested [10], providing however no better bound on the performance of routing algorithms.”
Geographic Routing Using Hyperbolic Space (2007, neutral): “An alternative planarization of unit disk graphs with better stretch properties is introduced in [ 10 ].”
Self-organized routing for wireless microsensor networks (2005, background): “Against this background, our goal is to maximize not just the length of time that sensors remain active, but also the active area over which the sensor network is recording data (as motivated in Section I).”
Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks (2008, methodology): “GPSR [1] forwards the packet to a neighbor having a smaller Euclidean distance to the destination, and uses the FACE algorithm to forward the packet if no neighbor is closer to the destination.”
Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions (neutral): “The r-Delaunay graph has been studied in [13, 20] and the r-limited Delaunay graph has been proposed in [12] to develop approximations of geometric objects in the Euclidean space.”