Algorithmic aspects of topology control problems for ad hoc networks

  • Authors:

  • Errol L. Lloyd;Rui Liu;Madhav V. Marathe;Ram Ramanathan;S. S. Ravi

  • Affiliations:

  • Department of Computer and Information Sciences, University of Delaware, Newark, DE;Department of Computer and Information Sciences, University of Delaware, Newark, DE;Los Alamos National Laboratory, MS M997, P.O. Box 1663, Los Alamos, NM;Internetwork Research Department, BBN Technologies, Cambridge, MA;Department of Computer Science, University at Albany - SUNY, Albany, NY

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying some specified properties. This paper considers such problems under several optimization objectives, including minimizing the maximum power and minimizing the total power. A general approach leading to a polynomial algorithm is presented for minimizing maximum power for a class of graph properties called monotone properties. The difficulty of generalizing the approach to properties that are not monotone is discussed. Problems involving the minimization of total power are known to be NP-complete even for simple graph properties. A general approach that leads to an approximation algorithm for minimizing the total power for some monotone properties is presented. Using this approach, a new approximation algorithm for the problem of minimizing the total power for obtaining a 2-node-connected graph is developed. It is shown that this algorithm provides a constant performance guarantee. Experimental results from an implementation of the approximation algorithm are also presented.