Wireless Networks

, Volume 14, Issue 5, pp 715–729

Ad hoc networks beyond unit disk graphs


DOI: 10.1007/s11276-007-0045-6

Cite this article as:
Kuhn, F., Wattenhofer, R. & Zollinger, A. Wireless Netw (2008) 14: 715. doi:10.1007/s11276-007-0045-6


In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks while at the same time being 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 for unit disk graphs—the complexity results of geographic routing 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, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if \(d\ge 1/\sqrt{2}\).


Algorithmic analysisCost metricsGeographic routingNetwork modelsWireless ad hoc networks

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Fabian Kuhn
    • 1
  • Roger Wattenhofer
    • 2
  • Aaron Zollinger
    • 3
  1. 1.Microsoft ResearchMountain ViewUSA
  2. 2.ETH ZurichZurichSwitzerland
  3. 3.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaBerkeleyUSA