Libin Jiang
ABSTRACT
It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions [1]. One 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 model and give an explicit throughput formula, which has a simple product-form due to the quasi-reversibility structure of the model. Second, we show that the algorithm in [1] can be extended to approach throughput optimality in this case. Finally, sufficient conditions are given to ensure the convergence and stability of the proposed algorithm. Such conditions are also provided for the algorithm in [1] to achieve throughput-optimality. (Detailed proofs of all theorems here can be found in [2, 3].)
- L. Jiang, J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," the 46th Annual Allerton Conference on Communication, Control, and Computing, Sep. 2008.Google Scholar
- L. Jiang, J. Walrand, "Approaching throughput-optimality in a Distributed CSMA Algorithm with Contention Resolution," Technical Report, UC berkeley, Mar. 2009. URL: http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-37.htmlGoogle Scholar
- L. Jiang, J. Walrand, "Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput," Technical Report, UC Berkeley, Mar. 2009. URL: http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-43.htmlGoogle Scholar
- X. Wang, K. Kar, "Throughput Modeling and Fairness Issues in CSMA/CA Based Ad-Hoc Networks," Proceedings of IEEE Infocom 2005, Miami, Mar. 2005.Google Scholar
- S. Rajagopalan and D. Shah, "Distributed Algorithm and Reversible Network", Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA, Mar. 2008.Google ScholarCross Ref
- J. Ni, R. Srikant, "Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks," in Proc. of Information Theory and Applications Workshop, Feb. 2009.Google Scholar
- J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H.V. Poor, "Convergence and Tradeoff of Utility-Optimal CSMA," http://arxiv.org/abs/0902.1996.Google Scholar
Index Terms
- Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability
Recommendations
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
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 ...
Analysis and compare of slotted and unslotted CSMA in IEEE 802.15.4
WiCOM'09: Proceedings of the 5th International Conference on Wireless communications, networking and mobile computingThis paper analyzes the non-persistent Carrier Sense Multiple Access (CSMA) mechanism, and simulates its application in IEEE 802. 15. 4. We find that throughputs are relevant to the normalized propagation delay and the Basic Time Period (BTP) of slotted ...
CSMA over time-varying channels: optimality, uniqueness and limited backoff rate
MobiHoc '13: Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computingRecent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) algorithms can be throughput optimal for arbitrary wireless network topology. However, these results are highly sensitive to the underlying assumption on `static' or `...
Comments