Minimizing interference in ad hoc and sensor networks

Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds to the number of other nodes whose transmission range covers v. At the cost of communication links being dropped, interference can be reduced by decreasing the node's transmission power. In this paper, we study the problem of minimizing the average interference while still maintaining desired network properties, such as connectivity, point-to-point connections, or multicast trees. In particular, we present a greedy algorithm that computes an O(log n) approximation to the interference problem with connectivity requirement, where n is the number of nodes in the network. We then show the algorithm to be asymptotically optimal by proving a corresponding Ω(log n) lower bound that holds even in a more restricted interference model. Finally, we show how the algorithm can be generalized towards solving the interference problem for network properties that can be formulated as a 0-1 proper function.

[1]  Ioannis Caragiannis,et al.  Energy-Efficient Wireless Network Design , 2005, Theory of Computing Systems.

[2]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[3]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[4]  Roger Wattenhofer,et al.  Does topology control reduce interference? , 2004, MobiHoc '04.

[5]  R. Wattenhofer,et al.  Interference arises at the receiver , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[6]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[7]  Miroslav Chlebík,et al.  Approximation Hardness of Dominating Set Problems , 2004, ESA.

[8]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[10]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

[11]  Xiang-Yang Li,et al.  Low-Interference Topology Control for Wireless Ad Hoc Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[12]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[13]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[14]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[15]  Christian Scheideler,et al.  On local algorithms for topology control and routing in ad hoc networks , 2003, SPAA '03.

[16]  Stefan Schmid,et al.  A robust interference model for wireless ad-hoc networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[17]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[18]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.