MULTIPLE ACCESS

TYPES OF MULTIPLE-ACCESS PROTOCOLS

1. Random Access Protocols 2. Controlled Access protocols 3. Channelization Protocols

RANDOM ACCESS
In random access or contention methods, no station is superior to another station and none is assigned the control over another. No station permits, or does not permit, another station to send. At each instance, a station that has data to send uses a procedure defined by the protocol to make a decision on whether or not to send.

CONTROLLED ACCESS PROTOCOLS

In controlled access, the stations consult one another to find which station has the right to send. A station cannot send unless it has been authorized by other stations.

CHANNELIZATION PROTOCOLS
Channelization is a multiple-access method in which the available bandwidth of a link is shared in time, frequency, or through code,betweendifferentstations.Three channelization protocols are: Frequency-Division Multiple Access (FDMA) Time-Division Multiple Access (TDMA) Code-Division Multiple Access (CDMA)

Types Of Random Access Protocols:

1. ALOHA 2. SLOTTED ALOHA 3. CSMA/CD

ALOHA
Simplest scheme True free-for-all. When a node needs to send, it does so. It listens for an amount of time equal to the maximum round trip delay plus a fixed increment. If it hears an acknowledgment, fine; otherwise it resends after waiting a random amount of time. After several attempts, it gives up. Low delay if light load Max. utilization: 18%

frames in a pure ALOHA network:

Vulnerable time for pure ALOHA protocol

The throughput for pure ALOHA is S = G e 2G . The maximum throughput Smax = 0.184 when G= (1/2).

12.10

A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces a. 1000 frames per second b. 500 frames per second c. 250 frames per second.

Solution The frame transmission time is 200/200 kbps or 1 ms. a. If the system creates 1000 frames per second, this is 1 frame per millisecond. The load is 1. In this case S = G e2 G or S = 0.135 (13.5 percent). This means that the throughput is 1000 0.135 = 135 frames. Only 135 frames out of 1000 will probably survive.

12.11

b.

If the system creates 500 frames per second, this (1/2) frame per millisecond. The load is (1/2). In case S = G e 2G or S = 0.184 (18.4 percent). means that the throughput is 500 0.184 = 92 and only 92 frames out of 500 will probably survive. that this is the maximum throughput percentagewise.

is this This that Note case,

c.

If the system creates 250 frames per second, this is (1/4) frame per millisecond. The load is (1/4). In this case S = G e 2G or S = 0.152 (15.2 percent). This means that the throughput is 250 0.152 = 38. Only 38 frames out of 250 will probably survive.

12.12

Slotted Aloha
1. All Frames are of same lengths. 2. Time is divided into equal size slots , time to tansmit 1 frame. 3. Nodes start to transmit frames only at the beginning of slots. 4. Nodes are synchronized. 5. If 2 or more nodes transmit in a slot,all nodes detect collision.

Frames in a slotted ALOHA network

The throughput for slotted ALOHA is S = G eG . The maximum throughput Smax = 0.368 when G = 1.

Vulnerable time for slotted ALOHA protocol

Example
A slotted ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces a. 1000 frames per second b. 500 frames per second c. 250 frames per second.

Solution The frame transmission time is 200/200 kbps or 1 ms. a. If the system creates 1000 frames per second, this is 1 frame per millisecond. The load is 1. In this case S = G eG or S = 0.368 (36.8 percent). This means that the throughput is 1000 0.0368 = 368 frames. Only 386 frames out of 1000 will probably survive.

12.17

Example
b. If the system creates 500 frames per second, this is (1/2) frame per millisecond. The load is (1/2). In this case S = G eG or S = 0.303 (30.3 percent). This means that the throughput is 500 0.0303 = 151. Only 151 frames out of 500 will probably survive. If the system creates 250 frames frame per millisecond. The load S = G e G or S = 0.195 that the throughput is 250 frames out of 250 will probably survive. per second, this is (1/4) is (1/4). In this case (19.5 percent). This means 0.195 = 49. Only 49

c.

Carrier Sense Protocols

Use the fact that in some networks you can sense the medium to check whether it is currently free
1-persistent CSMA non-persistent CSMA p-persistent protocol CSMA with collision detection (CSMA/CD): not applicable to wireless systems

1-persistent CSMA
when a station has a packet:
it waits until the medium is free to transmit the packet if a collision occurs, the station waits a random amount of time

first transmission results in a collision if several stations are waiting for the channel

Wireless Networks Spring 2005

Carrier Sense Protocols (Contd)

Non-persistent CSMA
when a station has a packet:
if the medium is free, transmit the packet otherwise wait for a random period of time and repeat the algorithm

higher delays, but better performance than pure ALOHA

p-persistent protocol
when a station has a packet wait until the medium is free:
transmit the packet with probability p wait for next slot with probability 1-p

better throughput than other schemes but higher delay

CSMA with collision Detection (CSMA/CD)

stations abort their transmission when they detect a collision e.g., Ethernet, IEEE802.3 but not applicable to wireless systems

Wireless Networks Spring 2005

Behavior of three persistence methods

CSMA

Vulnerable time in CSMA

Carrier Sense Protocols

Use the fact that in some networks you can sense the medium to check whether it is currently free
1-persistent CSMA non-persistent CSMA p-persistent protocol CSMA with collision detection (CSMA/CD): not applicable to wireless systems

1-persistent CSMA
when a station has a packet:
it waits until the medium is free to transmit the packet if a collision occurs, the station waits a random amount of time

first transmission results in a collision if several stations are waiting for the channel

Wireless Networks Spring 2005

Aloha/Slotted aloha
Mechanism
random, distributed (no central arbiter), time-multiplexed Slotted Aloha additionally uses time-slots, sending must always start at slot boundaries

Aloha
sender A sender B sender C

collision

Slotted Aloha
collision sender A sender B sender C

t
Wireless Networks Spring 2005

Aloha
Proposed for packet radio environments where every node can hear every other node Assume collision detection In Slotted Aloha, stations transmit at the beginning of a slot If collision occurs, then each station waits a random number of slots and retries
Random wait time chosen has a geometric distribution Independent of the number of retransmissions

Analysis in standard texts on networking theory

Wireless Networks Spring 2005

Slotted ALOHA
Assumptions all frames same size time is divided into equal size slots, time to transmit 1 frame nodes start to transmit frames only at beginning of slots nodes are synchronized if 2 or more nodes transmit in slot, all nodes detect collision Operation when node obtains fresh frame, it transmits in next slot no collision, node can send new frame in next slot if collision, node retransmits frame in each subsequent slot with prob. p until success

Slotted Aloha efficiency

Efficiency is the long-run fraction of successful slots when there are many nodes, each with many frames to send Suppose N nodes with many frames to send, each transmits in slot with probability p prob that node 1 has success in a slot = p(1-p)N-1 prob that any node has a success = Np(1-p)N-1

Note

The throughput for pure ALOHA is S = G e 2G . The maximum throughput Smax = 0.184 when G= (1/2).

12.31

Example 12.2
A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the requirement to make this frame collision-free?

Solution Average frame transmission time Tfr is 200 bits/200 kbps or 1 ms. The vulnerable time is 2 1 ms = 2 ms. This means no station should send later than 1 ms before this station starts transmission and no station should start sending during the one 1-ms period that this station is sending.

12.32

Figure 12.5 Vulnerable time for pure ALOHA protocol

12.33

12-1 RANDOM ACCESS

In random access or contention methods, no station is superior to another station and none is assigned the control over another. No station permits, or does not permit, another station to send. At each instance, a station that has data to send uses a procedure defined by the protocol to make a decision on whether or not to send.

Topics discussed in this section:

ALOHA Carrier Sense Multiple Access Carrier Sense Multiple Access with Collision Detection Carrier Sense Multiple Access with Collision Avoidance
12.34

Access method CDMA

CDMA (Code Division Multiple Access)
all terminals send on the same frequency probably at the same time and can use the whole bandwidth of the transmission channel each sender has a unique random number, the sender XORs the signal with this random number the receiver can tune into this signal if it knows the pseudo random number, tuning is done via a correlation function

Disadvantages:
higher complexity of a receiver (receiver cannot just listen into the medium and start receiving if there is a signal) all signals should have the same strength at a receiver

Advantages:
all terminals can use the same frequency, no planning needed huge code space (e.g. 232) compared to frequency space interferences (e.g. white noise) is not coded forward error correction and encryption can be easily integrated

Prof. Dr.-Ing. Jochen H. Schiller www.jochenschiller.de MC 2009

Example 12.3
A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces a. 1000 frames per second b. 500 frames per second c. 250 frames per second.

Solution The frame transmission time is 200/200 kbps or 1 ms. a. If the system creates 1000 frames per second, this is 1 frame per millisecond. The load is 1. In this case S = G e2 G or S = 0.135 (13.5 percent). This means that the throughput is 1000 0.135 = 135 frames. Only 135 frames out of 1000 will probably survive.

12.36

Example 12.3 (continued)

b. If the system creates 500 frames per second, this (1/2) frame per millisecond. The load is (1/2). In case S = G e 2G or S = 0.184 (18.4 percent). means that the throughput is 500 0.184 = 92 and only 92 frames out of 500 will probably survive. that this is the maximum throughput percentagewise. is this This that Note case,

c.

If the system creates 250 frames per second, this is (1/4) frame per millisecond. The load is (1/4). In this case S = G e 2G or S = 0.152 (15.2 percent). This means that the throughput is 250 0.152 = 38. Only 38 frames out of 250 will probably survive.

12.37

Note

The throughput for slotted ALOHA is S = G eG . The maximum throughput Smax = 0.368 when G = 1.

12.38

Figure 12.5 Vulnerable time for pure ALOHA protocol

12.39

Figure 12.7 Vulnerable time for slotted ALOHA protocol

12.40

Example 12.4
A slotted ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces a. 1000 frames per second b. 500 frames per second c. 250 frames per second.

Solution The frame transmission time is 200/200 kbps or 1 ms. a. If the system creates 1000 frames per second, this is 1 frame per millisecond. The load is 1. In this case S = G eG or S = 0.368 (36.8 percent). This means that the throughput is 1000 0.0368 = 368 frames. Only 386 frames out of 1000 will probably survive.

12.41

Example 12.4 (continued)

b. If the system creates 500 frames per second, this is (1/2) frame per millisecond. The load is (1/2). In this case S = G eG or S = 0.303 (30.3 percent). This means that the throughput is 500 0.0303 = 151. Only 151 frames out of 500 will probably survive. If the system creates 250 frames frame per millisecond. The load S = G e G or S = 0.195 that the throughput is 250 frames out of 250 will probably survive. per second, this is (1/4) is (1/4). In this case (19.5 percent). This means 0.195 = 49. Only 49

c.

12.42

Figure 12.9 Vulnerable time in CSMA

12.43

Figure 12.10 Behavior of three persistence methods

12.44

Example 12.5
A network using CSMA/CD has a bandwidth of 10 Mbps. If the maximum propagation time (including the delays in the devices and ignoring the time needed to send a jamming signal, as we see later) is 25.6 s, what is the minimum size of the frame?

Solution The frame transmission time is Tfr = 2 Tp = 51.2 s. This means, in the worst case, a station needs to transmit for a period of 51.2 s to detect the collision. The minimum size of the frame is 10 Mbps 51.2 s = 512 bits or 64 bytes. This is actually the minimum size of the frame for Standard Ethernet.

12.45

12-2 CONTROLLED ACCESS

In controlled access, the stations consult one another to find which station has the right to send. A station cannot send unless it has been authorized by other stations. We discuss three popular controlled-access methods.

Topics discussed in this section:

Reservation Polling Token Passing

12.46

12-3 CHANNELIZATION

Channelization is a multiple-access method in which the available bandwidth of a link is shared in time, frequency, or through code, between different stations. In this section, we discuss three channelization protocols.

Topics discussed in this section:

Frequency-Division Multiple Access (FDMA) Time-Division Multiple Access (TDMA) Code-Division Multiple Access (CDMA)
12.47

Schedule-based access methods

FDMA (Frequency Division Multiple Access)
assign a certain frequency to a transmission channel between a sender and a receiver permanent (e.g., radio broadcast), slow hopping (e.g., GSM), fast hopping (FHSS, Frequency Hopping Spread Spectrum)

TDMA (Time Division Multiple Access)

assign the fixed sending frequency to a transmission channel between a sender and a receiver for a certain amount of time

CDMA (Code Division Multiple Access)

signals are spread over a wideband using pseudo-noise sequences codes generate signals with good-correlation properties signals from another user appear as noise the receiver can tune into this signal if it knows the pseudo random number, tuning is done via a correlation function

Wireless Networks Spring 2005