Channel aware distributed random access

Authors:
Guowang Miao;Geoffrey Ye Li;Ananthram Swami
Affiliations:
Georgia Institute of Technology;Georgia Institute of Technology;CISD, Army Research Laboratory
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 9
Cited 0

Data networks (2nd ed.)

Data networks (2nd ed.)
MACAW: a media access protocol for wireless LAN's

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Decentralized optimization for multichannel random access

IEEE Transactions on Communications
Cochannel interference avoidance MAC in wireless cellular networks

IEEE Transactions on Communications
Wireless Networking

Wireless Networking
Optimal Channel-Aware ALOHA Protocol for Random Access in WLANs With Multipacket Reception and Decentralized Channel State Information

IEEE Transactions on Signal Processing
Opportunistic medium access for wireless networking adapted to decentralized CSI

IEEE Transactions on Wireless Communications
Power control in distributed cooperative OFDMA cellular networks

IEEE Transactions on Wireless Communications - Part 2
Exploiting decentralized channel state information for random access

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic to different users and different communication links may interfere with others. We consider heterogeneous channels, where the random channel gains of different links may have different distributions. To resolve the network contention in a distributed way, each frame is divided into contention and transmission periods. The contention period is used to resolve conflicts near optimally and to schedule users with better channel states with higher probabilities while assuring fairness among all users. The proposed scheme completely resolves contention of networks with arbitrary topologies and is robust to any channel uncertainty. Besides, it performs close to central schedulers.