Bounds and Algorithms for Scheduling Transmissions in Wireless Networks

The topic of the thesis is medium access which is one of the fundamental problems in wireless networks: as a result of the spatial nature of wireless signals wireless transmissions experience interference from each other, thus making spatially close simultaneous transmissions conflict with each other. A naturally arising problem in this context is the problem of scheduling where the transmission requests must be organized into a small number of subgroups each of which can transmit simultaneously in one time slot, the ultimate goal being executing all transmission in the minimum time. The thesis considers scheduling problems and related problems in the well known SINR (signal-to-interference-and-noise-ratio) model and extends the current state of the art on the treatment of these problems from a theoretical point of view. Several complexity results and approximation algorithms are presented for the aforementioned problems. A graph-based framework is introduced which is used to obtain results for medium access problems in the SINR model, as well as to extend the idealistic geometric SINR model towards more realistic depiction of real-world networks.

[1]  Jens Zander,et al.  Centralized power control in cellular radio systems , 1993 .

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

[3]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

[4]  Johan Håstad,et al.  Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..

[5]  Karhan Akcoglu,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000, ArXiv.

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

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

[8]  Aravind Srinivasan,et al.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[9]  Magnús M. Halldórsson,et al.  A fully distributed algorithm for throughput performance in wireless networks , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[10]  Catherine Rosenberg,et al.  What is the right model for wireless channel interference? , 2009, IEEE Trans. Wirel. Commun..

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

[12]  Tigran Tonoyan,et al.  Comparing Schedules in the SINR and Conflict-Graph Models with Different Power Schemes , 2013, ADHOC-NOW.

[13]  Tigran Tonoyan,et al.  On Some Bounds on the Optimum Schedule Length in the SINR Model , 2012, ALGOSENSORS.

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

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

[16]  Magnús M. Halldórsson,et al.  Wireless capacity and admission control in cognitive radio , 2012, 2012 Proceedings IEEE INFOCOM.

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

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

[19]  Magnús M. Halldórsson,et al.  Nearly optimal bounds for distributed wireless scheduling in the SINR model , 2011, Distributed Computing.

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

[21]  Tigran Tonoyan.  Conflict Graphs and the Capacity of the Mean Power Scheme , 2013, ALGOSENSORS.

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

[23]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[24]  Roger Wattenhofer,et al.  The Power of Non-Uniform Wireless Power , 2013, SODA.

[25]  Magnús M. Halldórsson.  Locality in wireless scheduling , 2013, SPAA.

[26]  Thomas Kesselheim.  Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates , 2012, ESA.

[27]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[28]  Anthony Ephremides,et al.  The feasibility of matchings in a wireless network , 2004, IEEE Transactions on Information Theory.

[29]  Michael Dinitz,et al.  Distributed Algorithms for Approximating Wireless Network Capacity , 2010, 2010 Proceedings IEEE INFOCOM.

[30]  Di Yuan,et al.  A column generation method for spatial TDMA scheduling in ad hoc networks , 2004, Ad Hoc Networks.

[31]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[32]  William I. Gasarch,et al.  Guest Column: the second P =?NP poll , 2012, SIGA.

[33]  Martin Hoefer,et al.  Scheduling in Wireless Networks with Rayleigh-Fading Interference , 2015, IEEE Trans. Mob. Comput..

[34]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[35]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[36]  Roger Wattenhofer,et al.  Complexity of scheduling with analog network coding , 2008, FOWANC '08.

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

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

[39]  Magnús M. Halldórsson.  Wireless scheduling with power control , 2012, TALG.

[40]  Tigran Tonoyan.  On the Problem of Wireless Scheduling with Linear Power Levels , 2011, ArXiv.

[41]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

[43]  Tigran Tonoyan.  On the Capacity of Oblivious Powers , 2011, ALGOSENSORS.

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

[45]  Berthold Vöcking,et al.  Comparative study of approximation algorithms and heuristics for SINR scheduling with power control , 2014, Theor. Comput. Sci..

[46]  Izhak Rubin,et al.  On the performance of graph-based scheduling algorithms for packet radio networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

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

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

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