Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Hardness of Low Delay Network Scheduling
IEEE Transactions on Information Theory
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
Backlog-based random access in wireless networks: fluid limits and delay issues
Proceedings of the 23rd International Teletraffic Congress
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
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
CSMA over time-varying channels: optimality, uniqueness and limited backoff rate
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Random access in wireless networks: how much aggressiveness can cause instability?
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
In the past year or so, an exciting progress has led to throughput optimal design of CSMA-based algorithms for wireless networks. However, such an algorithm suffers from very poor delay performance. A recent work suggests that it is impossible to design a CSMA-like simple algorithm that is throughput optimal and induces low delay for any wireless network. However, wireless networks arising in practice are formed by nodes placed, possibly arbitrarily, in some geographic area. In this paper, we propose a CSMA algorithm with per-node average-delay bounded by a constant, independent of the network size, when the network has geometry (precisely, polynomial growth structure) that is present in any practical wireless network. Two novel features of our algorithm, crucial for its performance, are (a) choice of access probabilities as an appropriate function of queue-sizes, and (b) use of local network topological structures. Essentially, our algorithm is a queue-based CSMA with a minor difference that at each time instance a very small fraction of frozen nodes do not execute CSMA. Somewhat surprisingly, appropriate selection of such frozen nodes, in a distributed manner, lead to the delay optimal performance.