# Distributed Random Access Algorithm: Scheduling and Congesion Control - Computer Science > Information Theory

Distributed Random Access Algorithm: Scheduling and Congesion Control - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: This paper provides proofs of the rate stability, Harris recurrence, andepsilon-optimality of CSMA algorithms where the backoff parameter of each nodeis based on its backlog. These algorithms require only local information andare easy to implement.The setup is a network of wireless nodes with a fixed conflict graph thatidentifies pairs of nodes whose simultaneous transmissions conflict. The paperstudies two algorithms. The first algorithm schedules transmissions to keep upwith given arrival rates of packets. The second algorithm controls the arrivalsin addition to the scheduling and attempts to maximize the sum of the utilitiesof the flows of packets at the different nodes. For the first algorithm, thepaper proves rate stability for strictly feasible arrival rates and also Harrisrecurrence of the queues. For the second algorithm, the paper proves theepsilon-optimality. Both algorithms operate with strictly local information inthe case of decreasing step sizes, and operate with the additional informationof the number of nodes in the network in the case of constant step size.

Author: ** Libin Jiang, Devavrat Shah, Jinwoo Shin, Jean Walrand**

Source: https://arxiv.org/