Convex Optimization
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
IEEE Transactions on Mobile Computing
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
Workload Interpretation for Brownian Models of Stochastic Processing Networks
Mathematics of Operations Research
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
Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
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
Towards utility-optimal random access without message passing
Wireless Communications & Mobile Computing - Recent Advances in Wireless Communications and Networks
Spatial fairness in wireless multi-access networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Back-of-the-envelope computation of throughput distributions in CSMA wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
Backpressure scheduling in IEEE 802.11 wireless mesh networks: Gap between theory and practice
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Distributed CSMA algorithms for link scheduling in multihop MIMO networks under SINR model
IEEE/ACM Transactions on Networking (TON)
Throughput-optimal CSMA with imperfect carrier sensing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain is "almost" time-reversible. Second, we propose transmission-length control algorithms to approach throughput-optimality in this case. Sufficient conditions are given to ensure the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.