On the Capacity of Oblivious Powers

We consider the problem of capacity in wireless networks in the physical model. The goal of this paper is to compare different power assignments and models from the perspective of this problem. We show a family of power assignments, including the mean power assignment, which yield larger capacity than uniform and linear power assignments, for each network instance. On the other hand, uniform and linear power assignments are not worse (in the same sense) than any power assignment, which is decreasing as a function of link-length, or increasing faster than linear power assignment. We also compare the directed and bidirectional communication models, and show upper and lower bounds on the gap between optimal capacities using any power assignment in these communication models.

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

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

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

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

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

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

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

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

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

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

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

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

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

[14]  Magnús M. Halldórsson,et al.  Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model , 2011, ICALP.

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

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

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

[18]  Amos Fiat,et al.  Algorithms - ESA 2009 , 2009, Lecture Notes in Computer Science.

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

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

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

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

[23]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[25]  Alberto Marchetti-Spaccamela,et al.  Theory and Practice of Algorithms in (Computer) Systems , 2011, Lecture Notes in Computer Science.

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