1.4 Multiple Access - Why and How

A key property of wireless networking is that it is fundamentally a broadcast technique, i.e.,

In this topic, we discuss the fundamentals of multiple access techniques. First, we take a quick look at wireless network topologies. Then we consider how to divide the channel resource into chunks that can be allocated for communications, and, finally, how the chunks are assigned to users.

Wireless Network Topologies

Common topologies:

1. Centralized (star, client-server)
2. Distributed (peer-to-peer)
3. Multi-hop

Centralized Topology

All Communication goes through the hub

Centralized Topology -- Characteristics

Distributed Topology

All nodes communicate directly with one another

Distributed Topology -- Characteristics

Multi-Hop Topology

Generalization of distributed topology -- multiple hops possible

Multi-Hop Topology -- Characteristics

Multiple Access Methods

Concept: In wireless networks, the channel resource must be shared among multiple users.

Two considerations:

-- How to split up the channel resource (multiple access method)

-- How to allocate the pieces (assignment strategy)

The channel can be divided up according to time, frequency band, or both.

Multiple Access Methods - Types

FDMA

The classic approach - divides the frequency spectrum into channels.

Frequency

TDMA

Divides time into slots (time intervals)

Frequency

Other Methods

Hybrid FDMA/TDMA - divides time-frequency plane into ``blocks'' rather than ``strips''

Frequency

There is another possibility in which the time-frequency is shared by all users simultaneously:

Comparison of Multiple Access Methods

FDMA --

TDMA --

CDMA --

Assignment Strategies (Media Access Control)

Q: How to allocate the resource, i.e.,

1. frequency channels
2. time slots
3. spreading codes
4. combinations of the above?
5. to network users?

Remark: the protocols that implement the assignment strategies are known as media access control (MAC) protocols.

Basic Concepts

Strategy can be based on

are collisions (network conflicts) avoided, or detected and then recovered from?

Strategy can be

is access unchanging or can it be modified in response to changes in network traffic and loading?

I. Fixed (static) assignment -- each user gets a fixed portion of the channel resource (permanent reservation) whether it needs it or not.

II. Demand assignment -- varied over time

1. Centralized - simple, non-robust

(a) Polling
(b) Reservation

2. Decentralized (distributed) -- complex, robust (e.g., token-based)

III. Random access -- users may transmit at any time, but the network must correct errors due to collisions: i.e., there must be feedback to the transmitters regarding the success of transmissions.

The fixed and demand assignment methods can be regarded as reservation-based methods, while random access protocols are contention-based.

The choice between reservation and contention methods is often determined primarily by network transmission delay:

Examples of Random-Access Methods

1. ALOHA -- users transmit whenever they have data, listen for collision, and re-transmit after a random wait if necessary.

2. Slotted ALOHA -- users are time-synchronized to begin fixed-length transmissions only at the beginning of periodic time slots. Thus only type of collision is total.
 

3. CSMA (Carrier Sense Multiple Access) -- users listen to channel and transmit only it is not being used.
 

4. CSMA/CD (CSMA with Collision Detection) -- users listen while transmitting.

Remark: CSMA/CD may be subject to ``hidden terminal'' problem, where a remote may not be within range of another transmitting remote that is within range of the base station. Thus CSMA is less suitable for centralized topologies.

5. DSMA (Data Sense Multiple Access) -- a hybrid scheme with both random access and collision avoidance:

 

Relationship of Topology to MAC Protocols

Natural fits:

distributed topology <--> contention-based protocols

centralized topology <--> reservation-based protocols

 
Close