Self-organization properties of CSMA/CA systems and their consequences on fairness
IEEE Transactions on Information Theory
IEEE 802.11s: WLAN mesh standardization and high performance extensions
IEEE Network: The Magazine of Global Internetworking
Optimal tradeoff between exposed and hidden nodes in large wireless networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Equalizing throughputs in random-access networks
ACM SIGMETRICS Performance Evaluation Review
Extra back-off flow control in multi-hop wireless networks
Performance Evaluation
Tandem queueing networks with neighbor blocking and back-offs
Queueing Systems: Theory and Applications
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
Spatial fairness in linear random-access networks
Performance Evaluation
Hi-index | 0.00 |
Multi-access networks exhibit severe unfairness in throughput. Recent studies show that this unfairness is due to local differences in the neighborhood structure: Nodes with less neighbors receive better access. We study the unfairness in tandem networks, and adapt the multi-access protocol to remove the unfairness completely, by choosing the activity rates of nodes appropriately as a function of the number of neighbors.