Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Online estimation of RF interference
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
CENTAUR: realizing the full potential of centralized wlans through a hybrid data path
Proceedings of the 15th annual international conference on Mobile computing and networking
IEEE/ACM Transactions on Networking (TON)
Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic
IEEE/ACM Transactions on Networking (TON)
Performance of random access scheduling schemes in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Distributed throughput maximization in wireless networks via random power allocation
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Low-complexity distributed scheduling algorithms for wireless networks
IEEE/ACM Transactions on Networking (TON)
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Throughput optimal distributed power control of stochastic wireless networks
IEEE/ACM Transactions on Networking (TON)
WiLdnet: design and implementation of high performancewifi based long distance networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The capacity of wireless networks
IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
On Throughput Optimality With Delayed Network-State Information
IEEE Transactions on Information Theory
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Designing efficient scheduling and power control algorithms for distributed wireless communication has been a challenging issue, especially in the physical interference model based on SINR constraints. In this paper, we discuss the first local distributed scheduling and power control algorithm in the SINR model that achieves an O(g(L)) approximation factor of the rate region, where O(g(L)) denotes the link diversity. As an intermediate step, we develop a scheduling algorithm in a k-hop interference model, which is used in the analysis of the more general model. Our algorithms are based on random-access and use local queue size information. Exchanging queue size information is challenging, and the complexity of this step is often ignored in prior local distributed algorithms. A novel aspect of our paper is the use of stale and infrequently updated queue size info, which significantly improves the complexity of our algorithms.