Nearly optimal bounds for distributed wireless scheduling in the SINR model
- 7 June 2014
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 29 (2) , 77-88
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Algorithms for Wireless CapacityIEEE/ACM Transactions on Networking, 2013
- The Power of Non-Uniform Wireless Power2013
- Wireless scheduling with power controlACM Transactions on Algorithms, 2012
- A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model2011
- Wireless Capacity with Oblivious Power in General Metrics2011
- Distributed Contention Resolution in Wireless NetworksLecture Notes in Computer Science, 2010
- Improved Algorithms for Latency Minimization in Wireless Networks2009
- Wireless Communication Is in APX2009
- Cross-layer latency minimization in wireless networks with SINR constraints2007
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000