On the Problem of Wireless Scheduling with Linear Power Levels

In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender node the power is constant times the path loss between the sender and corresponding receiver. This is the minimal power for a successful transmission. We present a constant factor deterministic approximation algorithm, which works for at least Euclidean fading metrics. Simultaneously we obtain the approximate value of the optimal schedule length with error at most a constant factor. To give an insight into the complexity of the problem, we show that in some metric spaces the problem is NP-hard and cannot be approximated within a factor less than 1.5.

[1]  Tigran Tonoyan.  Algorithms for Scheduling with Power Control in Wireless Networks , 2011, TAPAS.

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

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

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

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

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

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

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

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

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

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

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

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

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

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