A "Group-Division Multiple Access" framework for channel access to multiple destinations

Authors:
Jeffrey E. Wieselthier;Gam D. Nguyen;Anthony Ephremides
Affiliations:
Code 5521, Information Technology Division, Naval Research Laboratory, Washington, DC 20375, United States;Code 5521, Information Technology Division, Naval Research Laboratory, Washington, DC 20375, United States;Electrical and Computer Engineering Department and Institute for Systems Research, University of Maryland, College Park, MD 20742, United States
Venue:
Ad Hoc Networks
Year:
2008

Citing 6
Cited 2

Data networks

Data networks
Carrier sense access in an enviornment of two interfering channels

Computer Networks and ISDN Systems
A multi-station packet-radio network

Performance Evaluation
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Medium access control in multihop networks

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
The Design and Simulation of a Mobile Radio Network with Distributed Control

IEEE Journal on Selected Areas in Communications

General order selection allocation for decentralized multiple access networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Full length article: Selection based resource allocation for decentralized multi-user communications

Physical Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of media-access control in multiple-cell networks, such as ad hoc networks in which clusterheads take on a role similar to base stations. We assume that a single channel is used by all cells, and that the user populations that transmit to different base stations overlap, causing interference in the neighboring cells. Starting with a two-destination network, we introduce the ''Group-Division Multiple Access'' (GDMA) concept, according to which different groups of users multiplex their transmission in time while being free to use the protocol of their choice within their own group. We show that use of GDMA provides higher stable throughput than a ''free-running'' scheme (under which all slots are available to all users) when the First-Come First-Serve collision-resolution algorithm is used as the channel-access protocol, and we show how performance depends on the degree of overlap of communication and interference regions. Finally, we show that this approach can be applied to larger cellular-like networks as well.