𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Jeffrey E. Wieselthier; Gam D. Nguyen; Anthony Ephremides


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
392 KB
Volume
6
Category
Article
ISSN
1570-8705

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


A 3.1 to 5 GHZ CMOS RF transmitter for d
✍ Bon-Hyun Ku; Bonghyuk Park; Songcheol Hong 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

## Abstract An ultra‐wideband RF transmitter with local oscillator (LO) leakage reduction method for direct‐sequence code division multiple access (DS‐CDMA) is presented. To achieve ultra‐wideband gain flatness, the method of combining two shunt‐peaking loads with different resonant frequencies is

Constructions of generalized superimpose
✍ Annalisa De Bonis; Ugo Vaccaro 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 310 KB

In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their construction and provide non-existential results. We apply our new combinatorial structures to the e cient solution of new group testing problems and access coordination issue