NDLI: Distributed Random Access Algorithm: Scheduling and Congestion Control

Content Provider	IEEE Xplore Digital Library
Author	Libin Jiang Shah, D. Jinwoo Shin Walrand, J.
Copyright Year	1963
Abstract	This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier sense multiple access (CSMA) algorithms where the random access (or backoff) parameter of each node is adjusted dynamically. These algorithms require only local information and they are easy to implement. The setup is a network of wireless nodes with a fixed conflict graph that identifies pairs of nodes whose simultaneous transmissions conflict. The paper studies two algorithms. The first algorithm schedules transmissions to keep up with given arrival rates of packets. The second algorithm controls the arrivals in addition to the scheduling and attempts to maximize the sum of the utilities, in terms of the rates, of the packet flows at different nodes. For the first algorithm, the paper proves rate stability for strictly feasible arrival rates and also Harris recurrence of the queues. For the second algorithm, the paper proves the ε-optimality in terms of the utilities of the allocated rates. Both algorithms are iterative and we study two versions of each of them. In the first version, both operate with strictly local information but have relatively weaker performance guarantees; under the second version, both provide stronger performance guarantees by utilizing the additional information of the number of nodes in the network.
Sponsorship	IEEE Information Theory Society
Starting Page	6182
Ending Page	6207
Page Count	26
File Size	541548
File Format	PDF
ISSN	00189448
Volume Number	56
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-12-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	Access protocols Algorithm design and analysis Wireless communication Throughput Iterative algorithm Wireless sensor networks Multiaccess communication scheduling Congestion control distributed medium access positive recurrent random access
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

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

Distributed approaches for exploiting multiuser diversity in wireless networks

A Survey of Congestion Control Mechanisms in Wireless Sensor Networks

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

A distributed CSMA algorithm for throughput and utility maximization in wireless networks

Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability

A List-Based Medium Access Control algorithm in IEEE 802.11 wireless mesh networks

Hybrid channel access scheduling in ad hoc networks

Wireless multicast: theory and approaches

Throughput-Optimal CSMA With Imperfect Carrier Sensing

Distributed Random Access Algorithm: Scheduling and Congestion Control

Similar Documents

Distributed approaches for exploiting multiuser diversity in wireless networks

A Survey of Congestion Control Mechanisms in Wireless Sensor Networks

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

A distributed CSMA algorithm for throughput and utility maximization in wireless networks

Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability

A List-Based Medium Access Control algorithm in IEEE 802.11 wireless mesh networks

Hybrid channel access scheduling in ad hoc networks

Wireless multicast: theory and approaches

Throughput-Optimal CSMA With Imperfect Carrier Sensing

Distributed Random Access Algorithm: Scheduling and Congestion Control