Comparing Schedules in the SINR and Conflict-Graph Models with Different Power Schemes

The scheduling problem in wireless networks asks to split a set of links (transmission requests) into the minimum number of “feasible” subsets. In this paper the theoretical gap between the schedule length in the SINR model and in the corresponding conflict-graph model is evaluated, considering three different power schemes. It is shown that this gap depends largely on the power scheme used and on the metric space where the network is located. While in metric spaces of small doubling dimension (such as Euclidean metrics) certain upper bounds can be proven for the difference between the two models, in general metrics the difference can be arbitrary.

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

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

[3]  Prosenjit Bose,et al.  Algorithms for Sensor Systems , 2015, Lecture Notes in Computer Science.

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

[5]  Paulo Cardieri,et al.  Modeling Interference in Wireless Ad Hoc Networks , 2010, IEEE Communications Surveys & Tutorials.

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

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

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

[9]  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).

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

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

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

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

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

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

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

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