On the complexity of minimizing interference in ad-hoc and sensor networks

One of the most critical factors for lifetime and operability of ad-hoc and sensor networks is the limited amount of available energy. To this respect, minimizing the interference in the network (i.e., the overlapping of signals at network nodes) has certainly a positive effect, because it induces a reduction of the number of conflicting transmissions, and then results in an overall saving of energy consumption. Along this direction, in this paper we study the computational hardness of several interference minimization problems which arise while supporting some classic network communication patterns such as broadcasting (one-to-all), gossiping (all-to-all), and symmetric gossiping (symmetric all-to-all). In particular, concerning the non-approximability results, we prove that for any of the above communication patterns, the prominent problem of minimizing the maximum interference experienced by any node in the network is hard to approximate within better than a logarithmic factor, unless NP admits slightly superpolynomial time algorithms. On a positive side, we show that any approximation algorithm for the problem of minimizing the total transmission power assigned to the nodes in order to guarantee any of the above communication patterns, can be transformed, by maintaining the same performance ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network.

[1]  Steen Strub.M.  Routing in Communications Networks , 1995 .

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

[3]  Takeshi Tokuyama,et al.  Minimizing interference of a wireless ad-hoc network in a plane , 2008, Theor. Comput. Sci..

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

[5]  Friedhelm Meyer auf der Heide,et al.  Energy, congestion and dilation in radio networks , 2002, SPAA '02.

[6]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

[7]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

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

[9]  Zygmunt J. Haas,et al.  On some challenges and design choices in ad-hoc communications , 1998, IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201).

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

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

[12]  Roger Wattenhofer,et al.  Minimizing interference in ad hoc and sensor networks , 2005, DIALM-POMC '05.

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

[14]  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).

[15]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[16]  M. Steenstrup.  Routing in communications networks , 1995 .

[17]  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.

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

[19]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

[20]  Roger Wattenhofer,et al.  On Interference Reduction in Sensor Networks , 2004 .