A Hard-Core Model on a Cayley Tree: An Example of a Loss Network
Queueing Systems: Theory and Applications
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
On the fairness of large CSMA networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Spatial fairness in wireless multi-access networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
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)
Achieving target throughputs in random-access networks
Performance Evaluation
Backlog-based random access in wireless networks: fluid limits and delay issues
Proceedings of the 23rd International Teletraffic Congress
Spatial fairness in linear random-access networks
Performance Evaluation
| Hi-index | 0.00 |
Random-access algorithms such as CSMA provide a popular mechanism for distributed medium access control in largescale wireless networks. In recent years, tractable models have been shown to yield accurate throughput estimates for CSMA networks. We consider the saturated model on a general conflict graph, and prove that for each graph, there exists a vector of activation rates (or mean back-off times) that leads to equal throughputs for all users. We describe an algorithm for computing such activation rates, and discuss a few specific conflict graphs that allow for explicit characterization of these fair activation rates.