Ad hoc networks beyond unit disk graphs

388 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.

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].”
Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks (2008, background): “In actual practice, a wireless sensor network has unidirectional links because sensors can have different transmission ranges [11], [12], [13], [14], sensors have unstable transmission ranges [4], [15], [16], [17], [18], and a hidden terminal problem exists [14], [19], [20], [21].”
On the Complexity of Scheduling in Wireless Networks (2006, background): “We also note that the results can also be extended to some other geometric graphs including the quasi-unit-disk graphs [29].”
XTC: a practical topology control algorithm for ad-hoc networks (2004, background): “We believe that a UDG is a good first step towards understanding ad-hoc algorithms.”