Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Towards utility-optimal random access without message passing
Wireless Communications & Mobile Computing - Recent Advances in Wireless Communications and Networks
Delay optimal queue-based CSMA
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
IEEE Transactions on Mobile Computing
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Achieving target throughputs in random-access networks
Performance Evaluation
Backlog-based random access in wireless networks: fluid limits and delay issues
Proceedings of the 23rd International Teletraffic Congress
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Hardness of Low Delay Network Scheduling
IEEE Transactions on Information Theory
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Queueing Systems: Theory and Applications
Delay performance in random-access grid networks
Performance Evaluation
Hi-index | 0.00 |
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed backlog-based random-access schemes provide the striking capability to match the optimal throughput performance of centralized scheduling mechanisms. The specific type of activation rules for which throughput optimality has been established, may however yield excessive backlogs and delays. Motivated by that issue, we examine whether the poor delay performance is inherent to the basic operation of these schemes, or caused by the specific kind of activation rules. We derive delay lower bounds for backlog-based activation rules, which offer fundamental insight in the cause of the excessive delays. For fixed activation rates we obtain lower bounds indicating that delays and mixing times can grow dramatically with the load in certain topologies as well.