A constant-factor approximation for wireless capacity maximization with power control in the SINR model

作者: Thomas Kesselheim

DOI: 10.5555/2133036.2133156

关键词:

摘要: In modern wireless networks devices are able to set the power for each transmission carried out. Experimental but also theoretical results indicate that such control can improve network capacity significantly. We study this problem in physical interference model using SINR constraints.In maximization problem, we given n pairs of senders and receivers, located a metric space (usually so-called fading metric). The algorithm shall select subset these choose level them with objective maximizing number simultaneous communications. This is, selected have satisfy constraints respect chosen powers.We present first achieving constant-factor approximation metrics. best previous depend on further parameters as ratio maximum minimum distance between sender its receiver. Expressed only terms n, they (trivial) Ω(n) approximations.Our still achieves an O(log n) if assume general rather than metric. Furthermore, existing approaches work well together allowing it be used singlehop multi-hop scheduling scenarios. Here, get polylog approximations.

参考文章(23)
Magnús M. Halldórsson, Wireless Scheduling with Power Control european symposium on algorithms. pp. 361- 372 ,(2009) , 10.1007/978-3-642-04128-0_33
Peng-Jun Wan, Xiaohua Jia, Frances Yao, Maximum Independent Set of Links under Physical Interference Model wireless algorithms systems and applications. ,vol. 5682, pp. 169- 178 ,(2009) , 10.1007/978-3-642-03417-6_17
Gurashish Brar, Douglas M. Blough, Paolo Santi, Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks acm/ieee international conference on mobile computing and networking. pp. 2- 13 ,(2006) , 10.1145/1161089.1161092
Devdatt Dubhashi, Desh Ranjan, Balls and bins: a study in negative dependence Random Structures and Algorithms. ,vol. 13, pp. 99- 124 ,(1998) , 10.1002/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M
T. ElBatt, A. Ephremides, Joint scheduling and power control for wireless ad hoc networks IEEE Transactions on Wireless Communications. ,vol. 3, pp. 74- 85 ,(2004) , 10.1109/TWC.2003.819032
Deepti Chafekar, V.S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Cross-layer latency minimization in wireless networks with SINR constraints Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '07. pp. 110- 119 ,(2007) , 10.1145/1288107.1288123
Pradipta Mitra, Magnús M. Halldórsson, Wireless capacity with oblivious power in general metrics symposium on discrete algorithms. pp. 1538- 1548 ,(2011) , 10.5555/2133036.2133155
Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking, Online capacity maximization in wireless networks acm symposium on parallel algorithms and architectures. pp. 92- 99 ,(2010) , 10.1145/1810479.1810499
F. T. Leighton, Bruce M. Maggs, Satish B. Rao, Packet routing and job-shop scheduling in O (congestion+dilation) steps Combinatorica. ,vol. 14, pp. 167- 186 ,(1994) , 10.1007/BF01215349
Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking, Oblivious interference scheduling principles of distributed computing. pp. 220- 229 ,(2009) , 10.1145/1582716.1582752