research-article

Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability

Authors:

Libin Jiang,

Jean WalrandAuthors Info & Claims

MobiHoc S³ '09: Proceedings of the 2009 MobiHoc S³ workshop on MobiHoc S³

Pages 5 - 8

https://doi.org/10.1145/1540358.1540361

Published: 18 May 2009 Publication History

Get Access

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].)

References

[1]

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

[2]

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.html

Google Scholar

[3]

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.html

Google Scholar

[4]

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

[5]

S. Rajagopalan and D. Shah, "Distributed Algorithm and Reversible Network", Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA, Mar. 2008.

Crossref

Google Scholar

[6]

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

[7]

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

Cited By

View all

Nardelli BKnightly E(2021)Robust CSMA: Adapting to channel and traffic asymmetry2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2015.7338299(127-135)Online publication date: 9-Mar-2021
https://dl.acm.org/doi/10.1109/SAHCN.2015.7338299
Bonald TFeuillet M(2012)Performance of CSMA in multi-channel wireless networksQueueing Systems: Theory and Applications10.1007/s11134-012-9300-372:1-2(139-160)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1007/s11134-012-9300-3
Jiang LWalrand J(2011)Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisionsIEEE/ACM Transactions on Networking10.1109/TNET.2010.208980419:3(816-829)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1109/TNET.2010.2089804
Show More Cited By

Index Terms

Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Networks
  1. Network architectures
  2. Network types
    1. Mobile networks
    2. Wireless access networks

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 computing

This 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 computing

Recent 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

Information & Contributors

Information

Published In

MobiHoc S³ '09: Proceedings of the 2009 MobiHoc S³ workshop on MobiHoc S³

May 2009

54 pages

ISBN:9781605585215

DOI:10.1145/1540358

General Chairs:
Mung Chiang
Princeton University
,
Romit Roy
Choudhury, Duke University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 May 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiHoc '09

Sponsor:

MobiHoc '09: The Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

May 18, 2009

Louisiana, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 249 of 1,615 submissions, 15%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
309
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nardelli BKnightly E(2021)Robust CSMA: Adapting to channel and traffic asymmetry2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2015.7338299(127-135)Online publication date: 9-Mar-2021
https://dl.acm.org/doi/10.1109/SAHCN.2015.7338299
Bonald TFeuillet M(2012)Performance of CSMA in multi-channel wireless networksQueueing Systems: Theory and Applications10.1007/s11134-012-9300-372:1-2(139-160)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1007/s11134-012-9300-3
Jiang LWalrand J(2011)Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisionsIEEE/ACM Transactions on Networking10.1109/TNET.2010.208980419:3(816-829)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1109/TNET.2010.2089804
Paschalidis ILi B(2011)Energy Optimized Topologies for Distributed Averaging in Wireless Sensor NetworksIEEE Transactions on Automatic Control10.1109/TAC.2011.216387556:10(2290-2304)Online publication date: Oct-2011
https://doi.org/10.1109/TAC.2011.2163875
Lotfinezhad MMarbach P(2011)Throughput-optimal random access with order-optimal delay2011 Proceedings IEEE INFOCOM10.1109/INFCOM.2011.5935124(2867-2875)Online publication date: Apr-2011
https://doi.org/10.1109/INFCOM.2011.5935124
Kim TNi JSrikant RVaidya N(2011)On the achievable throughput of CSMA under imperfect carrier sensing2011 Proceedings IEEE INFOCOM10.1109/INFCOM.2011.5934962(1674-1682)Online publication date: Apr-2011
https://doi.org/10.1109/INFCOM.2011.5934962
Bonald TFeuillet M(2011)On flow-aware CSMA in multi-channel wireless networks2011 45th Annual Conference on Information Sciences and Systems10.1109/CISS.2011.5766120(1-6)Online publication date: Mar-2011
https://doi.org/10.1109/CISS.2011.5766120
Jiang LWalrand J(2010)A distributed CSMA algorithm for throughput and utility maximization in wireless networksIEEE/ACM Transactions on Networking10.1109/TNET.2009.203504618:3(960-972)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1109/TNET.2009.2035046
Jiang LWalrand J(2009)Convergence and stability of a distributed CSMA algorithm for maximal network throughputProceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference10.1109/CDC.2009.5400349(4840-4845)Online publication date: Dec-2009
https://doi.org/10.1109/CDC.2009.5400349

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions

Analysis and compare of slotted and unslotted CSMA in IEEE 802.15.4

CSMA over time-varying channels: optimality, uniqueness and limited backoff rate

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations