On channel access delay of CSMA policies in wireless networks with primary interference constraints

Authors:
Mahdi Lotfinezhad;Peter Marbach
Affiliations:
Department of Computer Science, University of Toronto;Department of Computer Science, University of Toronto
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 2
Cited 0

The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

CSMA policies are examples of simple distributed scheduling algorithms in wireless networks. In this paper, we study the delay properties of CSMA in the limit of large networks. We first define an ideal network under which CSMA becomes memoryless in that the delay to access the channel becomes an exponential r.v. independent of the past. We then show that, in the limit of large bipartite graphs with primary interference constraints, simple CSMA policies become memoryless.