Algorithms for Scheduling with Power Control in Wireless Networks

In this work we study the following problem of scheduling with power control in wireless networks: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done in a minimum time, taking into account the signal interference of parallelly transmitting nodes. The signal interference is modeled by SINR constraints. We correct and complement one of recent papers on this theme, by giving approximation algorithms for scheduling with power control for the case, when the nodes of the network are located in a doubling metric space.

[1]  Anders Hansson,et al.  Comparison between graph-based and interference-based STDMA scheduling , 2001, MobiHoc '01.

[2]  Roger Wattenhofer,et al.  How Optimal are Wireless Scheduling Protocols? , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[4]  Roger Wattenhofer,et al.  Complexity in geometric SINR , 2007, MobiHoc '07.

[5]  Magnús M. Halldórsson,et al.  Wireless capacity with oblivious power in general metrics , 2011, SODA '11.

[6]  Chen Avin,et al.  A Note on Uniform Power Connectivity in the SINR Model , 2009, ALGOSENSORS.

[7]  Roger Wattenhofer,et al.  Wireless Communication Is in APX , 2009, ICALP.

[8]  G. Szekeres,et al.  An inequality for the chromatic number of a graph , 1968 .

[9]  J. Heinonen.  Lectures on Analysis on Metric Spaces , 2000 .

[10]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[11]  Paolo Santi,et al.  Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.

[12]  Berthold Vöcking,et al.  Improved algorithms for latency minimization in wireless networks , 2009, Theor. Comput. Sci..

[13]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[14]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Thomas Kesselheim,et al.  A constant-factor approximation for wireless capacity maximization with power control in the SINR model , 2010, SODA '11.

[16]  Thomas Erlebach,et al.  Scheduling Multicast Transmissions under SINR Constraints , 2010, ALGOSENSORS.

[17]  Roger Wattenhofer,et al.  Capacity of Arbitrary Wireless Networks , 2009, IEEE INFOCOM 2009.

[18]  Roger Wattenhofer,et al.  Protocol Design Beyond Graph-Based Models , 2006, HotNets.

[19]  Michael Dinitz,et al.  Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory , 2009, IEEE INFOCOM 2009.

[20]  Magnús M. Halldórsson.  Wireless Scheduling with Power Control , 2009, ESA.

[21]  Roger Wattenhofer,et al.  Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.

[22]  Berthold Vöcking,et al.  Oblivious interference scheduling , 2009, PODC '09.

[23]  David Peleg,et al.  SINR diagrams: towards algorithmically usable SINR models of wireless networks , 2008, PODC '09.

[24]  Aravind Srinivasan,et al.  Cross-layer latency minimization in wireless networks with SINR constraints , 2007, MobiHoc '07.

[25]  Berthold Vöcking,et al.  Distributed Contention Resolution in Wireless Networks , 2010, DISC.