On the stability of flow-aware CSMA

Authors:
T. Bonald;M. Feuillet
Affiliations:
Telecom ParisTech, Paris, France;INRIA, Rocquencourt, France
Venue:
Performance Evaluation
Year:
2010

Citing 10
Cited 3

Impact of fairness on Internet performance

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Insensitive Traffic Models for Communication Networks

Discrete Event Dynamic Systems
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
Low-complexity distributed scheduling algorithms for wireless networks

IEEE/ACM Transactions on Networking (TON)
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications

Stability of spatial wireless systems with random admissible-set scheduling

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Performance of CSMA in multi-channel wireless networks

Queueing Systems: Theory and Applications
Balancing lifetime and classification accuracy of wireless sensor networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow attempts to access the radio channel after some random time and transmits a packet if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable for all traffic intensities in the capacity region of the network.