Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks

• Published in: IEEE INFOCOM 2009 pp. 370 - 378
• Main Authors: Khan, M., Kumar, V. S. A., Marathe, M. V., Pandurangan, G., Ravi, S. S.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.04.2009
• Subjects: Ad hoc networks; Approximation algorithms; Bioinformatics; Communications Society; Computer science; Interference; Network topology; Peer to peer computing; Protocols; Stochastic processes
• ISBN: 1424435129; 9781424435128
• ISSN: 0743-166X
• DOI: 10.1109/INFCOM.2009.5061941

Topology control in ad hoc networks is a multi-criteria optimization problem involving (contradictory) objectives of connectivity, interference, and power minimization. Additionally, nodes can be unreliable, which adds another dimension to an already challenging problem. In this paper, we study topology control problems in ad hoc networks under node failures for arbitrary node distributions. We consider a simple and natural stochastic failure model, in which each node can fail independently with a given probability. The topology control problem under stochastic failures is to choose a power level for each node and a subset of edges such that the residual graph (i.e., the graph formed by the nodes which have not failed) is connected and can be scheduled efficiently, with high probability. We develop provably efficient bi-criteria approximation algorithms for this problem that simultaneously minimize power, reduce interference, and ensure that the surviving graph is connected with high probability. Our algorithms can be implemented efficiently in a distributed manner.