Asymptotically optimal geometric mobile ad-hoc routing

298 citations recorded by the source corpus.

How researchers see this paper

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

Ad hoc networks beyond unit disk graphs (2003, methodology): “On the other hand, Unit Disk Graphs are simple enough to promote strong theoretical results (such as the cost for routing [20, 21] or topology control [1, 11, 30]).”
Worst-Case optimal and average-case efficient geometric ad-hoc routing (2003, methodology): “For completeness and reference we will first revisit Adaptive Face Routing AFR [17] briefly.”
BLR: beacon-less routing algorithm for mobile ad hoc networks (2004, background): “Unlike these topology-based routing protocols, which do not make use of location information, position-based (also called geometric or directional routing) protocols try to optimize routing by making use of geographical information available at each node (GFG [11], GPSR [12], LAR [13], TRR [14], AFR”
Geometric spanners for routing in mobile networks (2001, background): “If only local information is available, i.e., each node knows only the nodes within a constant number of hops, then Kuhn et al. [ 25 ] showed a lower bound construction in which any online algorithm finds a path of length if the shortest path has length , as shown in Fig. 13. They also proposed a ge”
Geometric ad-hoc routing: of theory and practice (2003, methodology): “In this paper we are able to drop one such assumption, the Ω(1)-model introduced in [19], which assumes that the distance between network nodes cannot fall beneath a constant minimum bound.”