Limitations of current wireless link scheduling algorithms
We consider the following basic scheduling problem in wireless networks: partition a given set of unit demand communication links into the minimum number of feasible subsets. A subset is feasible if all communications can be done simultaneously, subject to mutual interference. We use the so-called p...
Saved in:
| Published in | Theoretical computer science Vol. 840; pp. 154 - 165 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
06.11.2020
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0304-3975 1879-2294 |
| DOI | 10.1016/j.tcs.2020.07.033 |
Cover
| Abstract | We consider the following basic scheduling problem in wireless networks: partition a given set of unit demand communication links into the minimum number of feasible subsets. A subset is feasible if all communications can be done simultaneously, subject to mutual interference. We use the so-called physical model to formulate feasibility.
We consider the two families of approximation algorithms that are known to guarantee O(logn) approximation for the scheduling problem, where n is the number of links. We present network constructions showing that the approximation ratios of those algorithms are no better than logarithmic, both in n and in Δ, where Δ is a geometric parameter – the ratio of the maximum and minimum link lengths. |
|---|---|
| AbstractList | We consider the following basic scheduling problem in wireless networks: partition a given set of unit demand communication links into the minimum number of feasible subsets. A subset is feasible if all communications can be done simultaneously, subject to mutual interference. We use the so-called physical model to formulate feasibility.
We consider the two families of approximation algorithms that are known to guarantee O(logn) approximation for the scheduling problem, where n is the number of links. We present network constructions showing that the approximation ratios of those algorithms are no better than logarithmic, both in n and in Δ, where Δ is a geometric parameter – the ratio of the maximum and minimum link lengths. |
| Author | Tonoyan, Tigran Konrad, Christian Halldórsson, Magnús M. |
| Author_xml | – sequence: 1 givenname: Magnús M. surname: Halldórsson fullname: Halldórsson, Magnús M. email: mmh@ru.is organization: ICE-TCS, Computer Science Department, Reykjavik University, Menntavegur 1, 101 Reykjavik, Iceland – sequence: 2 givenname: Christian surname: Konrad fullname: Konrad, Christian email: christiankonrad77@gmail.com organization: Computer Science Department, University of Bristol, United Kingdom – sequence: 3 givenname: Tigran surname: Tonoyan fullname: Tonoyan, Tigran email: ttonoyan@gmail.com organization: Computer Science Department, Technion – Israel Institute of Technology, Israel |
| BookMark | eNp9kMtOwzAQRS1UJErhA9jlBxL8iOMaVqjiJVViA2vLGU9alzRBtgvi73HVrlh0NjObM7r3XJLJMA5IyA2jFaOsud1UCWLFKacVVRUV4oxM2VzpknNdT8iUClqXQit5QS5j3NA8UjVTcrf0W59s8uMQi7ErYBcCDqn48QF7jLHo_fBZRFij2-VzVdh-NQaf1tt4Rc4720e8Pu4Z-Xh6fF-8lMu359fFw7IErlUqFSouJFrKOtuAk9pKwdoGamyF0y0KSVE6TkHNHepao-PQQi2hs52jrhUzog5_IYwxBuwMHBOnYH1vGDV7BWZjsgKzV2CoMllBJtk_8iv4rQ2_J5n7A4O50rfHYCJ4HABdNgLJuNGfoP8Aryt4lw |
| CitedBy_id | crossref_primary_10_1137_19M1275085 |
| Cites_doi | 10.1145/2390176.2390183 10.1002/jgt.3190120212 10.1137/S0097539793250767 10.1109/TWC.2003.819032 10.1016/j.tcs.2007.04.025 10.1016/j.tcs.2014.05.014 10.1145/2339123.2339125 10.1016/j.ipl.2015.05.007 10.1109/18.825799 10.1109/TNET.2013.2258036 10.1109/TMC.2014.2352278 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2020.07.033 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 165 |
| ExternalDocumentID | 10_1016_j_tcs_2020_07_033 S0304397520304151 |
| GrantInformation_xml | – fundername: Icelandic Research Fund grantid: 120032011; 152679-051; 174484-051 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FGOYB G-2 HZ~ R2- SEW SSZ TAE WUQ XJT ZY4 ~HD |
| ID | FETCH-LOGICAL-c297t-7e7235ea01fa6cd59a531b6c4eb3d9be350e5d20c78de949ed2cbc45cfafd0db3 |
| IEDL.DBID | .~1 |
| ISSN | 0304-3975 |
| IngestDate | Thu Oct 09 00:23:39 EDT 2025 Thu Apr 24 23:02:49 EDT 2025 Fri Feb 23 02:49:21 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Link scheduling Lower bound Wireless network |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-7e7235ea01fa6cd59a531b6c4eb3d9be350e5d20c78de949ed2cbc45cfafd0db3 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_tcs_2020_07_033 crossref_primary_10_1016_j_tcs_2020_07_033 elsevier_sciencedirect_doi_10_1016_j_tcs_2020_07_033 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-06 |
| PublicationDateYYYYMMDD | 2020-11-06 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-06 day: 06 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2020 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Halldórsson, Mitra (br0020) 2012 Jurdzinski, Kowalski, Rozanski, Stachowiak (br0100) 2014 Katz, Völker, Wagner (br0160) 2010 Halldórsson, Wattenhofer (br0230) 2009 Maheshwari, Jain, Das (br0190) 2008 Halldórsson (br0280) 2012; 9 Tonoyan (br0290) 2012 Caragiannis, Fishkin, Kaklamanis, Papaioannou (br0370) 2007; 384 Kesselheim, Vöcking (br0080) 2010 Halldórsson, Mitra (br0040) 2011 Gyárfás, Lehel (br0360) 1988; 12 Goussevskaia, Halldórsson, Wattenhofer (br0050) 2014; 22 Fu, Liew, Huang (br0270) 2009 Halldórsson, Tonoyan (br0310) 2015 Dams, Hoefer, Kesselheim (br0220) 2015; 14 Kesselheim (br0240) 2012 Son, Krishnamachari, Heidemann (br0180) 2006 Gudmundsdottir, Ásgeirsson, Bodlaender, Foley, Halldórsson, Vigfusson (br0210) 2014 Gupta, Kumar (br0140) 2000; 46 Kesselheim (br0030) 2011 Panconesi, Srinivasan (br0390) 1997; 26 Bodlaender, Halldórsson (br0200) 2014 Halldórsson, Konrad (br0380) 2014 Bang-Jensen, Halldórsson (br0300) 2015; 115 Halldórsson, Holzer, Mitra, Wattenhofer (br0330) 2013 Avin, Emek, Kantor, Lotker, Peleg, Roditty (br0060) 2012; 59 Cruz, Santhanam (br0110) 2003 Impagliazzo, Kabanets (br0400) 2010 Chafekar, Kumar, Marathe, Parthasarathy, Srinivasan (br0130) 2007 Halldórsson, Tonoyan (br0320) 2015 Dinitz (br0070) 2010 Moscibroda, Wattenhofer (br0010) 2006 Lin, Schalekamp (br0170) 2012 Halldórsson, Mitra (br0260) 2011 Goussevskaia, Oswald, Wattenhofer (br0150) 2007 ElBatt, Ephremides (br0120) 2004; 3 Belke, Kesselheim, Koster, Vöcking (br0250) 2014; 553 Daum, Gilbert, Kuhn, Newport (br0090) 2013 Rappaport (br0340) 2002 Fanghänel, Kesselheim, Räcke, Vöcking (br0350) 2009 Halldórsson (10.1016/j.tcs.2020.07.033_br0230) 2009 Fanghänel (10.1016/j.tcs.2020.07.033_br0350) 2009 Moscibroda (10.1016/j.tcs.2020.07.033_br0010) 2006 Kesselheim (10.1016/j.tcs.2020.07.033_br0240) 2012 Fu (10.1016/j.tcs.2020.07.033_br0270) 2009 Kesselheim (10.1016/j.tcs.2020.07.033_br0080) 2010 Daum (10.1016/j.tcs.2020.07.033_br0090) 2013 Dams (10.1016/j.tcs.2020.07.033_br0220) 2015; 14 Gupta (10.1016/j.tcs.2020.07.033_br0140) 2000; 46 Jurdzinski (10.1016/j.tcs.2020.07.033_br0100) 2014 Chafekar (10.1016/j.tcs.2020.07.033_br0130) 2007 Lin (10.1016/j.tcs.2020.07.033_br0170) 2012 Katz (10.1016/j.tcs.2020.07.033_br0160) 2010 Gudmundsdottir (10.1016/j.tcs.2020.07.033_br0210) 2014 Kesselheim (10.1016/j.tcs.2020.07.033_br0030) 2011 Panconesi (10.1016/j.tcs.2020.07.033_br0390) 1997; 26 Belke (10.1016/j.tcs.2020.07.033_br0250) 2014; 553 Son (10.1016/j.tcs.2020.07.033_br0180) 2006 Halldórsson (10.1016/j.tcs.2020.07.033_br0020) 2012 Halldórsson (10.1016/j.tcs.2020.07.033_br0040) 2011 Goussevskaia (10.1016/j.tcs.2020.07.033_br0050) 2014; 22 Cruz (10.1016/j.tcs.2020.07.033_br0110) 2003 Halldórsson (10.1016/j.tcs.2020.07.033_br0310) 2015 Gyárfás (10.1016/j.tcs.2020.07.033_br0360) 1988; 12 Bodlaender (10.1016/j.tcs.2020.07.033_br0200) 2014 Maheshwari (10.1016/j.tcs.2020.07.033_br0190) 2008 Rappaport (10.1016/j.tcs.2020.07.033_br0340) 2002 Halldórsson (10.1016/j.tcs.2020.07.033_br0260) 2011 ElBatt (10.1016/j.tcs.2020.07.033_br0120) 2004; 3 Halldórsson (10.1016/j.tcs.2020.07.033_br0280) 2012; 9 Bang-Jensen (10.1016/j.tcs.2020.07.033_br0300) 2015; 115 Halldórsson (10.1016/j.tcs.2020.07.033_br0380) 2014 Dinitz (10.1016/j.tcs.2020.07.033_br0070) 2010 Halldórsson (10.1016/j.tcs.2020.07.033_br0330) 2013 Tonoyan (10.1016/j.tcs.2020.07.033_br0290) 2012 Halldórsson (10.1016/j.tcs.2020.07.033_br0320) 2015 Impagliazzo (10.1016/j.tcs.2020.07.033_br0400) 2010 Goussevskaia (10.1016/j.tcs.2020.07.033_br0150) 2007 Avin (10.1016/j.tcs.2020.07.033_br0060) 2012; 59 Caragiannis (10.1016/j.tcs.2020.07.033_br0370) 2007; 384 |
| References_xml | – start-page: 220 year: 2009 end-page: 229 ident: br0350 article-title: Oblivious interference scheduling publication-title: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing – start-page: 1530 year: 2009 end-page: 1538 ident: br0270 article-title: Power controlled scheduling with consecutive transmission constraints: complexity analysis and algorithm design publication-title: INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies – volume: 3 start-page: 74 year: 2004 end-page: 85 ident: br0120 article-title: Joint scheduling and power control for wireless ad hoc networks publication-title: IEEE Trans. Wirel. Commun. – start-page: 347 year: 2014 end-page: 356 ident: br0200 article-title: Beyond geometry: towards fully realistic wireless models publication-title: ACM Symposium on Principles of Distributed Computing – volume: 384 start-page: 152 year: 2007 end-page: 160 ident: br0370 article-title: A tight bound for online colouring of disk graphs publication-title: Theor. Comput. Sci. – start-page: 516 year: 2012 end-page: 526 ident: br0020 article-title: Wireless connectivity and capacity publication-title: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms – start-page: 525 year: 2009 end-page: 536 ident: br0230 article-title: Wireless communication is in APX publication-title: Automata, Languages and Programming, 36th International Colloquium, Proceedings, Part I – volume: 22 start-page: 745 year: 2014 end-page: 755 ident: br0050 article-title: Algorithms for wireless capacity publication-title: IEEE/ACM Trans. Netw. – volume: 12 start-page: 217 year: 1988 end-page: 227 ident: br0360 article-title: On-line and first fit colorings of graphs publication-title: J. Graph Theory – start-page: 659 year: 2012 end-page: 670 ident: br0240 article-title: Approximation algorithms for wireless link scheduling with flexible data rates publication-title: Algorithms - ESA 2012 - 20th Annual European Symposium, Proceedings – year: 2002 ident: br0340 article-title: Wireless Communications: Principles and Practice – start-page: 358 year: 2013 end-page: 372 ident: br0090 article-title: Broadcast in the ad hoc SINR model publication-title: Distributed Computing - 27th International Symposium. Proceedings – year: 2003 ident: br0110 article-title: Optimal routing, link scheduling, and power control in multi-hop wireless networks publication-title: Proceedings IEEE INFOCOM 2003, the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies – start-page: 23 year: 2006 end-page: 29 ident: br0010 article-title: The complexity of connectivity in wireless networks publication-title: INFOCOM 2006. 25th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies – start-page: 1538 year: 2011 end-page: 1548 ident: br0040 article-title: Wireless capacity with oblivious power in general metrics publication-title: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms – start-page: 120 year: 2012 end-page: 131 ident: br0290 article-title: On some bounds on the optimum schedule length in the SINR model publication-title: Algorithms for Sensor Systems, 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities – volume: 59 start-page: 18 year: 2012 ident: br0060 article-title: SINR diagrams: convexity and its applications in wireless networks publication-title: J. ACM – volume: 14 start-page: 1503 year: 2015 end-page: 1514 ident: br0220 article-title: Scheduling in wireless networks with Rayleigh-fading interference publication-title: IEEE Trans. Mob. Comput. – volume: 46 start-page: 388 year: 2000 end-page: 404 ident: br0140 article-title: The capacity of wireless networks publication-title: IEEE Trans. Inf. Theory – volume: 115 start-page: 791 year: 2015 end-page: 796 ident: br0300 article-title: Vertex coloring edge-weighted digraphs publication-title: Inf. Process. Lett. – start-page: 100 year: 2007 end-page: 109 ident: br0150 article-title: Complexity in geometric SINR publication-title: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing – start-page: 617 year: 2010 end-page: 631 ident: br0400 article-title: Constructive proofs of concentration bounds publication-title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, Proceedings – volume: 9 start-page: 7 year: 2012 ident: br0280 article-title: Wireless scheduling with power control publication-title: ACM Trans. Algorithms – start-page: 141 year: 2008 end-page: 154 ident: br0190 article-title: A measurement study of interference modeling and scheduling in low-power wireless networks publication-title: Proceedings of the 6th International Conference on Embedded Networked Sensor Systems – volume: 26 start-page: 350 year: 1997 end-page: 368 ident: br0390 article-title: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds publication-title: SIAM J. Comput. – start-page: 1595 year: 2013 end-page: 1606 ident: br0330 article-title: The power of non-uniform wireless power publication-title: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms – start-page: 160 year: 2010 end-page: 169 ident: br0160 article-title: Energy efficient scheduling with power control for wireless networks publication-title: 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks – start-page: 163 year: 2010 end-page: 178 ident: br0080 article-title: Distributed contention resolution in wireless networks publication-title: Distributed Computing, 24th International Symposium, Proceedings – start-page: 237 year: 2006 end-page: 250 ident: br0180 article-title: Experimental study of concurrent transmission in wireless sensor networks publication-title: Proceedings of the 4th International Conference on Embedded Networked Sensor Systems – start-page: 529 year: 2015 end-page: 542 ident: br0320 article-title: The price of local power control in wireless scheduling publication-title: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science – start-page: 625 year: 2011 end-page: 636 ident: br0260 article-title: Nearly optimal bounds for distributed wireless scheduling in the SINR model publication-title: Automata, Languages and Programming - 38th International Colloquium, Proceedings, Part II – start-page: 80 year: 2012 end-page: 81 ident: br0170 article-title: Brief announcement: on the complexity of the minimum latency scheduling problem on the Euclidean plane publication-title: 24th ACM Symposium on Parallelism in Algorithms and Architectures – start-page: 357 year: 2014 end-page: 366 ident: br0100 article-title: On the impact of geometry on ad hoc communication in wireless networks publication-title: ACM Symposium on Principles of Distributed Computing – start-page: 1397 year: 2010 end-page: 1405 ident: br0070 article-title: Distributed algorithms for approximating wireless network capacity publication-title: INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies – start-page: 454 year: 2014 end-page: 468 ident: br0380 article-title: Distributed algorithms for coloring interval graphs publication-title: Distributed Computing - 28th International Symposium, Proceedings – volume: 553 start-page: 64 year: 2014 end-page: 73 ident: br0250 article-title: Comparative study of approximation algorithms and heuristics for SINR scheduling with power control publication-title: Theor. Comput. Sci. – start-page: 110 year: 2007 end-page: 119 ident: br0130 article-title: Cross-layer latency minimization in wireless networks with SINR constraints publication-title: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing – start-page: 275 year: 2014 end-page: 284 ident: br0210 article-title: Extending wireless algorithm design to arbitrary environments via metricity publication-title: 17th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems – start-page: 1549 year: 2011 end-page: 1559 ident: br0030 article-title: A constant-factor approximation for wireless capacity maximization with power control in the SINR model publication-title: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms – start-page: 635 year: 2015 end-page: 644 ident: br0310 article-title: How well can graphs represent wireless interference? publication-title: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing – start-page: 525 year: 2009 ident: 10.1016/j.tcs.2020.07.033_br0230 article-title: Wireless communication is in APX – start-page: 120 year: 2012 ident: 10.1016/j.tcs.2020.07.033_br0290 article-title: On some bounds on the optimum schedule length in the SINR model – start-page: 110 year: 2007 ident: 10.1016/j.tcs.2020.07.033_br0130 article-title: Cross-layer latency minimization in wireless networks with SINR constraints – volume: 9 start-page: 7 issue: 1 year: 2012 ident: 10.1016/j.tcs.2020.07.033_br0280 article-title: Wireless scheduling with power control publication-title: ACM Trans. Algorithms doi: 10.1145/2390176.2390183 – start-page: 275 year: 2014 ident: 10.1016/j.tcs.2020.07.033_br0210 article-title: Extending wireless algorithm design to arbitrary environments via metricity – start-page: 1530 year: 2009 ident: 10.1016/j.tcs.2020.07.033_br0270 article-title: Power controlled scheduling with consecutive transmission constraints: complexity analysis and algorithm design – volume: 12 start-page: 217 issue: 2 year: 1988 ident: 10.1016/j.tcs.2020.07.033_br0360 article-title: On-line and first fit colorings of graphs publication-title: J. Graph Theory doi: 10.1002/jgt.3190120212 – volume: 26 start-page: 350 issue: 2 year: 1997 ident: 10.1016/j.tcs.2020.07.033_br0390 article-title: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds publication-title: SIAM J. Comput. doi: 10.1137/S0097539793250767 – volume: 3 start-page: 74 issue: 1 year: 2004 ident: 10.1016/j.tcs.2020.07.033_br0120 article-title: Joint scheduling and power control for wireless ad hoc networks publication-title: IEEE Trans. Wirel. Commun. doi: 10.1109/TWC.2003.819032 – start-page: 635 year: 2015 ident: 10.1016/j.tcs.2020.07.033_br0310 article-title: How well can graphs represent wireless interference? – start-page: 1397 year: 2010 ident: 10.1016/j.tcs.2020.07.033_br0070 article-title: Distributed algorithms for approximating wireless network capacity – start-page: 529 year: 2015 ident: 10.1016/j.tcs.2020.07.033_br0320 article-title: The price of local power control in wireless scheduling – start-page: 220 year: 2009 ident: 10.1016/j.tcs.2020.07.033_br0350 article-title: Oblivious interference scheduling – volume: 384 start-page: 152 issue: 2–3 year: 2007 ident: 10.1016/j.tcs.2020.07.033_br0370 article-title: A tight bound for online colouring of disk graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.04.025 – start-page: 163 year: 2010 ident: 10.1016/j.tcs.2020.07.033_br0080 article-title: Distributed contention resolution in wireless networks – start-page: 237 year: 2006 ident: 10.1016/j.tcs.2020.07.033_br0180 article-title: Experimental study of concurrent transmission in wireless sensor networks – volume: 553 start-page: 64 year: 2014 ident: 10.1016/j.tcs.2020.07.033_br0250 article-title: Comparative study of approximation algorithms and heuristics for SINR scheduling with power control publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2014.05.014 – start-page: 454 year: 2014 ident: 10.1016/j.tcs.2020.07.033_br0380 article-title: Distributed algorithms for coloring interval graphs – start-page: 1595 year: 2013 ident: 10.1016/j.tcs.2020.07.033_br0330 article-title: The power of non-uniform wireless power – start-page: 347 year: 2014 ident: 10.1016/j.tcs.2020.07.033_br0200 article-title: Beyond geometry: towards fully realistic wireless models – start-page: 625 year: 2011 ident: 10.1016/j.tcs.2020.07.033_br0260 article-title: Nearly optimal bounds for distributed wireless scheduling in the SINR model – start-page: 358 year: 2013 ident: 10.1016/j.tcs.2020.07.033_br0090 article-title: Broadcast in the ad hoc SINR model – volume: 59 start-page: 18 issue: 4 year: 2012 ident: 10.1016/j.tcs.2020.07.033_br0060 article-title: SINR diagrams: convexity and its applications in wireless networks publication-title: J. ACM doi: 10.1145/2339123.2339125 – start-page: 516 year: 2012 ident: 10.1016/j.tcs.2020.07.033_br0020 article-title: Wireless connectivity and capacity – year: 2002 ident: 10.1016/j.tcs.2020.07.033_br0340 – start-page: 80 year: 2012 ident: 10.1016/j.tcs.2020.07.033_br0170 article-title: Brief announcement: on the complexity of the minimum latency scheduling problem on the Euclidean plane – volume: 115 start-page: 791 issue: 10 year: 2015 ident: 10.1016/j.tcs.2020.07.033_br0300 article-title: Vertex coloring edge-weighted digraphs publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2015.05.007 – volume: 46 start-page: 388 issue: 2 year: 2000 ident: 10.1016/j.tcs.2020.07.033_br0140 article-title: The capacity of wireless networks publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.825799 – start-page: 1538 year: 2011 ident: 10.1016/j.tcs.2020.07.033_br0040 article-title: Wireless capacity with oblivious power in general metrics – volume: 22 start-page: 745 issue: 3 year: 2014 ident: 10.1016/j.tcs.2020.07.033_br0050 article-title: Algorithms for wireless capacity publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2013.2258036 – start-page: 141 year: 2008 ident: 10.1016/j.tcs.2020.07.033_br0190 article-title: A measurement study of interference modeling and scheduling in low-power wireless networks – start-page: 1549 year: 2011 ident: 10.1016/j.tcs.2020.07.033_br0030 article-title: A constant-factor approximation for wireless capacity maximization with power control in the SINR model – start-page: 659 year: 2012 ident: 10.1016/j.tcs.2020.07.033_br0240 article-title: Approximation algorithms for wireless link scheduling with flexible data rates – start-page: 23 year: 2006 ident: 10.1016/j.tcs.2020.07.033_br0010 article-title: The complexity of connectivity in wireless networks – volume: 14 start-page: 1503 issue: 7 year: 2015 ident: 10.1016/j.tcs.2020.07.033_br0220 article-title: Scheduling in wireless networks with Rayleigh-fading interference publication-title: IEEE Trans. Mob. Comput. doi: 10.1109/TMC.2014.2352278 – year: 2003 ident: 10.1016/j.tcs.2020.07.033_br0110 article-title: Optimal routing, link scheduling, and power control in multi-hop wireless networks – start-page: 100 year: 2007 ident: 10.1016/j.tcs.2020.07.033_br0150 article-title: Complexity in geometric SINR – start-page: 357 year: 2014 ident: 10.1016/j.tcs.2020.07.033_br0100 article-title: On the impact of geometry on ad hoc communication in wireless networks – start-page: 160 year: 2010 ident: 10.1016/j.tcs.2020.07.033_br0160 article-title: Energy efficient scheduling with power control for wireless networks – start-page: 617 year: 2010 ident: 10.1016/j.tcs.2020.07.033_br0400 article-title: Constructive proofs of concentration bounds |
| SSID | ssj0000576 |
| Score | 2.3054385 |
| Snippet | We consider the following basic scheduling problem in wireless networks: partition a given set of unit demand communication links into the minimum number of... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 154 |
| SubjectTerms | Link scheduling Lower bound Wireless network |
| Title | Limitations of current wireless link scheduling algorithms |
| URI | https://dx.doi.org/10.1016/j.tcs.2020.07.033 |
| Volume | 840 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1879-2294 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Free Content customDbUrl: eissn: 1879-2294 dateEnd: 20211103 omitProxy: true ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: IXB dateStart: 19750601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] - NZ customDbUrl: eissn: 1879-2294 dateEnd: 20211012 omitProxy: true ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIKHN dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1879-2294 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection Journals customDbUrl: eissn: 1879-2294 dateEnd: 20211012 omitProxy: true ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: ACRLP dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1879-2294 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AKRWK dateStart: 19750601 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqssDAo4Aoj8oDE1Kok9hxwlYQVQtqF6jUzYpfUFTaqg0rv51zHgUkYGCLo7OUXOzvzrm77xA65-B0xLGyniRGepRL7aWAlZ72LSwXAMRUunrnwTDqjejdmI1r6KaqhXFplSX2F5ieo3V5p11qs72YTNoPLqgH1pQF7sLPy6gp5a6LweX7Z5oH-CNFvNJFAEC6imzmOV6ZcozdAcn5O8PwZ9v0xd50d9F26SjiTvEse6hmZg20UzVhwOWebKCtwZp4dbWPrvKCpeIvHJ5brAr6JewYiacAatgFbDGcaMHCuEJ0nE6f5stJ9vy6OkCj7u3jTc8r2yN4Kkh45nHDg5CZlPg2jZRmSQr7SUaKwvlYJ9KEjBimA6J4rE1CE6MDJRVlyqZWEy3DQ1SfzWfmCOFYRuCJ-IF2dOywJaVk3DLNQDoMLQ-aiFSKEap8C9fCYiqqJLEXAboUTpeCcAG6bKKL9ZRFQZzxlzCttC2-fX0BwP77tOP_TTtBm26UVxRGp6ieLd_MGbgWmWzla6eFNjr9-94QRv3x9QecM888 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqMgADjwKiPD0wIYW6ThwnbKiiKtB2oZW6WfELikpbtWHlt3POo4AEDGxRYkvJxffdne_uM0IXHJyOKFLWk8RIL-BSewlgpaebFpYLAGIiXb9zrx92hsH9iI0qqFX2wriyygL7c0zP0Lq40yik2ZiPx41Hl9QDa8qou2i6Nuq1gFHuIrCr9886D3BI8oSlSwHA8DK1mRV5pcpRdlOSEXj6_s_G6YvBae-grcJTxDf5y-yiipnW0HZ5CgMulLKGNnsr5tXlHrrOOpbybTg8s1jl_EvYURJPANWwy9hiCGnBxLhOdJxMnmaLcfr8utxHw_btoNXxivMRPEVjnnrccOozk5CmTUKlWZyAQslQBRAg61ganxHDNCWKR9rEQWw0VVIFTNnEaqKlf4Cq09nUHCIcyRBckSbVjo8ddFJKxi3TDEb7vuW0jkgpGKGKr3BnWExEWSX2IkCWwslSEC5AlnV0uZoyz5kz_hoclNIW336_AGT_fdrR_6ado_XOoNcV3bv-wzHacE-y9sLwBFXTxZs5BT8jlWfZOvoAunjPzQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Limitations+of+current+wireless+link+scheduling+algorithms&rft.jtitle=Theoretical+computer+science&rft.au=Halld%C3%B3rsson%2C+Magn%C3%BAs+M.&rft.au=Konrad%2C+Christian&rft.au=Tonoyan%2C+Tigran&rft.date=2020-11-06&rft.issn=0304-3975&rft.volume=840&rft.spage=154&rft.epage=165&rft_id=info:doi/10.1016%2Fj.tcs.2020.07.033&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2020_07_033 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |