2003 · 246 citations · 42 references
ComputingComputer ScienceMathematicsComputer NetworksDistributed SystemsTopologyCommunication NetworksGraph AlgorithmsMobile Ad Hoc NetworksNetwork TopologyRoutingRouting AlgorithmsAd Hoc NetworkingAd Hoc NetworksDisk GraphsGeometric RoutingMessage RoutingMobile Ad Hoc Network RoutingMobile Ad Hoc RoutingUnit Disk Graphs
In this paper we study a model for ad-hoc networks close enough to reality as to represent existing networks, being at the same time concise enough to promote strong theoretical results. The Quasi Unit Disk Graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1.We show that .in comparison to the cost known on Unit Disk Graphs .the complexity results in this model contain the additional factor 1 /d2. We prove that in Quasi Unit Disk Graphs flooding is an asymptotically message-optimal routing technique, provide a geometric routing algorithm being more efficient above all in dense networks, and show that classic geometric routing is possible with the same performance guarantees as for Unit Disk Graphs if d = 1/v2.
42
Ad-hoc on-demand distance vector routing
Charles E. Perkins, E.M. Royer · 1999 · 10.3K citations
Location-aided routing (LAR) in mobile ad hoc networks
Young‐Bae Ko, Nitin H. Vaidya · 1998 · 2K citations
A scalable location service for geographic ad hoc routing
Jinyang Li, John Jannotti, Douglas S. J. De Couto et al. · 2000 · 1.6K citations · Full text
Impact of interference on multi-hop wireless network performance
Kamal Jain, Jitendra Padhye, Venkata N. Padmanabhan et al. · 2003 · 1.6K citations