Constant density spanners for wireless ad-hoc networks

  • Authors:

  • Kishore Kothapalli;Christian Scheideler;Melih Onus;Andrea Richa

  • Affiliations:

  • Johns Hopkins University, Baltimore, MD;Johns Hopkins University, Baltimore, MD;Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ

  • Venue:
  • Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

An important problem for wireless ad hoc networks has been todesign overlay networks that allow time- and energy-efficientrouting. Many local-control strategies for maintaining such overlaynetworks have already been suggested, but most of them are based onan oversimplified wireless communication model.In this paper, we suggest a model that is much more general thanprevious models. It allows the path loss of transmissions tosignificantly deviate from the idealistic unit disk model and doesnot even require the path loss to form a metric. Also, our model isapparently the first proposed for algorithm design that does notonly model transmission and interference issues but also aims atproviding a realistic model for physical carrier sensing. Physicalcarrier sensing is needed so that our protocols do not requireany prior information (not even an estimate onthe number of nodes) about the wireless network to runefficiently.Based on this model, we propose a local-control protocol forestablishing a constant density spanner among a set of mobilestations (or nodes) that are distributed in anarbitrary way in a 2-dimensional Euclidean space. More precisely,we establish a backbone structure by efficiently electing clusterleaders and gateway nodes so that there is only a constant numberof cluster leaders and gateway nodes within the transmission rangeof any node and the backbone structure satisfies the properties ofa topological spanner.Our protocol has the advantage that it is locallyself-stabilizing, i.e., it can recover from anyinitial configuration, even if adversarial nodes participate in it,as long as the honest nodes sufficiently far away from adversarialnodes can in principle form a single connected component.Furthermore, we only need constant size messages and a constantamount of storage at the nodes, irrespective of the distribution ofthe nodes. Hence, our protocols would even work in extremesituations such as very simple wireless devices (like sensors) in ahostile environment.