An analysis of short-term fairness in wireless media access protocols (poster session)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A scalable model for channel access protocols in multihop ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Experiments of Some Performance Issues with IEEE 802.11b in Ad Hoc Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Modeling media access in embedded two-flow topologies of multi-hop wireless networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
The achievable rate region of 802.11-scheduled multihop networks
IEEE/ACM Transactions on Networking (TON)
Self-organization properties of CSMA/CA systems and their consequences on fairness
IEEE Transactions on Information Theory
Performance analysis of MAC protocols in wireless line networks using statistical mechanics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Insensitivity and stability of random-access networks
Performance Evaluation
Equalizing throughputs in random-access networks
ACM SIGMETRICS Performance Evaluation Review
On the validity of IEEE 802.11 MAC modeling hypotheses
IEEE/ACM Transactions on Networking (TON)
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
Capacity of large-scale CSMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of these protocols in small network topologies does not always persist in large topologies. In regular networks, this unfairness is essentially due to the unfair advantage of nodes at the border of the network, which have a restricted neighborhood and thus a higher probability to access the communication channel. In large 1D lattice networks these border effects do not propagate inside the network, and nodes sufficiently far away from the border have equal access to the channel; as a result the protocol is long-term fair. In 2D lattice networks, we observe a phase transition. If the access intensity of the protocol is small, the border effects remain local and the protocol behaves similarly as in one-dimensional networks. However, if the access intensity of the protocol is large enough, the border effects persist independently of the size of the network and the protocol is strongly unfair. In irregular networks, the topology is inherently unfair. This unfairness increases with the access intensity of the protocol, but in a much smoother way than in regular two-dimensional networks. Finally, in situations where the protocol is long-term fair, we provide a characterization of its short-term fairness.