On fair sharing of spectrum via CSMA

Authors:
Murat Alanyali;Maxim Dashouk
Affiliations:
Department of Electrical and Computer Engineering, Boston University;Department of Electrical and Computer Engineering, Boston University
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 2
Cited 0

Multicoloring Planar Graphs and Partial k-Trees

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Markov Chains and Stochastic Stability

Markov Chains and Stochastic Stability

Quantified Score

Hi-index	0.00

Visualization

Abstract

We contrast CSMA and TDMA schemes for medium access in spatially dispersed wireless networks under the primary interference model. CSMA is based on random access via dynamically tuned parameters, whereas TDMA involves periodic bursts that are offset in time so as to avoid packet collisions. We study TDMA in a framework that admits propagation delays and hidden terminals, and providea distributed algorithm that achieves feasible transmission rates.