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
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
Equalizing throughputs in random-access networks
ACM SIGMETRICS Performance Evaluation Review
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)
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Delay performance of backlog based random access
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Performance of CSMA in multi-channel wireless networks
Queueing Systems: Theory and Applications
Delays and mixing times in random-access networks
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Random access in wireless networks: how much aggressiveness can cause instability?
ACM SIGMETRICS Performance Evaluation Review
Hi-index | 0.00 |
We explore the spatio-temporal congestion dynamics of wireless networks with backlog-based random-access mechanisms. While relatively simple and inherently distributed in nature, suitably designed backlog-based access schemes provide the striking capability to match the optimal throughput performance of centralized scheduling algorithms in a wide range of scenarios. In the present paper, we show that the specific activity functions for which maximum stability has been established, may however yield excessive queue lengths and delays. The results reveal that more aggressive/persistent access schemes can improve the delay performance, while retaining the maximum stability guarantees in a rich set of scenarios. In order to gain qualitative insights and examine stability properties we will investigate fluid limits where the system dynamics are scaled in space and time. As it turns out, several distinct types of fluid limits can arise, exhibiting various degrees of randomness, depending on the structure of the network, in conjunction with the form of the activity functions. We further demonstrate that, counter to intuition, additional interference may improve the delay performance in certain cases. Simulation experiments are conducted to illustrate and validate the analytical findings.