NDLI: Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

Content Provider	IEEE Xplore Digital Library
Author	Jian Ni Bo Tan Srikant, R.
Copyright Year	1993
Abstract	Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, in general they may only achieve a fraction of the capacity region. In this paper, we propose a discrete-time version of the CSMA algorithm. Central to our results is a discrete-time distributed randomized algorithm that is based on a generalization of the so-called Glauber dynamics from statistical physics, where multiple links are allowed to update their states in a single timeslot. The algorithm generates collision-free transmission schedules while explicitly taking collisions into account during the control phase of the protocol, thus relaxing the perfect CSMA assumption. More importantly, the algorithm allows us to incorporate heuristics that lead to very good delay performance while retaining the throughput-optimality property.
Sponsorship	IEEE Computer Society IEEE Communications Society Association for Computing Machinery (ACM)
Starting Page	825
Ending Page	836
Page Count	12
File Size	2522726
File Format	PDF
ISSN	10636692
Volume Number	20
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Schedules Scheduling algorithm Multiaccess communication Throughput Delay Wireless networks Algorithm design and analysis wireless networks Carrier-sense multiple access (CSMA) random access scheduling algorithms
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Electrical and Electronic Engineering Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Impact of Access Probabilities on the Delay Performance of Q-CSMA Algorithms in Wireless Networks

Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling

A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

Throughput Modeling of Single Hop CSMA Networks with Non-Negligible Propagation Delay

CSMA/SF: Carrier Sense Multiple Access with Shortest First

Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks

Achieving Maximum Throughput in Random Access Protocols with Multipacket Reception

Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

Similar Documents

The Impact of Access Probabilities on the Delay Performance of Q-CSMA Algorithms in Wireless Networks

Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling

A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

Throughput Modeling of Single Hop CSMA Networks with Non-Negligible Propagation Delay

CSMA/SF: Carrier Sense Multiple Access with Shortest First

Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks

Achieving Maximum Throughput in Random Access Protocols with Multipacket Reception

Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks