Scribd
Upload
26 views25 pages

Unit-IV Multiple Access Controlled Access

Uploaded by

lonewarrior0707
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
26 views25 pages

Unit-IV Multiple Access Controlled Access

Uploaded by

lonewarrior0707
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 25

MULTIPLE ACCESS

by

DR. ABDUL QUAIYUM ANSARI


Department of Electrical Engineering
Jamia Millia Islamia
New Delhi-110025
Taxonomy of multiple-access protocols
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.

1. Reservation
2. Polling
3. Token Passing
Reservation access method
If there are N stations in the system, there are exactly N reservation minislots in the reservation
frame. Each minislot belongs to a station. When a station needs to send a dataframe, it makes a
reservation in its own minislot. The stations that have made reservations can send their data
frames after the reservation frame.
Select and poll functions in polling access method
Polling works with topologies in which one device is designated as a Primary Station and the other devices are
Secondary Stations. All data exchanges must be made through the primary device even when the ultimate
destination is a secondary device. The primary device controls the link and the secondary devices follow its
instructions.
Poll Function: If the primary wants to receive data, it asks the secondaries if they have anything to send; this is
called poll function.
Select Function: If the primary wants to send data, it tells the secondary to get ready to receive; this is called select
function.
It is upto the primary device to determine which device is allowed to use the channel at a given time.

The Primary device, therefore, is always the initiator of a session.


Token-passing access method

In this method, the stations in a network are organised in a logical ring.

In other words, for each station, there is a predecessor and a successor.

The right to access is passed to the current station by its predecessor.

Then the current station passes the right to the successor when it has no more data
to send.

Logical Ring: In a token-passing network, stations do not have to be physically


connected in a ring. There can be a logical one. Four different
physical topologies that can create a logical ring are –

1. Physical Ring
2. Dual Ring
3. Bus Ring
4. Star Ring
Logical ring and physical topology in token-passing access method
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.

Frequency-Division Multiple Access (FDMA)


Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)
Frequency-division multiple access (FDMA)
Note

In FDMA, the available bandwidth


of the common channel is divided into
bands that are separated by guard bands.
Time-division multiple access (TDMA)
Note

In TDMA, the bandwidth is just one channel


that is timeshared between different
stations.
Note

In CDMA, one channel carries all


transmissions simultaneously.

• CDMA differs from FDMA because only one channel occupies the
entire bandwidth of the link.

• It differs from TDMA because all stations can send data


simultaneously. There is no time sharing.
Simple idea of communication with code
Chip sequences
Data representation in CDMA
Sharing channel in CDMA
Digital signal created by four stations in CDMA
Decoding of the composite signal for one in CDMA
General rule and examples of creating Walsh tables
Note

The number of sequences in a Walsh table


needs to be N = 2m.
Example 1

Find the chips for a network with


a. Two stations b. Four stations

Solution
We can use the rows of W2 and W4 in Figure 12.29:
a. For a two-station network, we have
[+1 +1] and [+1 −1].

b. For a four-station network we have


[+1 +1 +1 +1], [+1 −1 +1 −1],
[+1 +1 −1 −1], and [+1 −1 −1 +1].
Example 2

What is the number of sequences if we have 90 stations in our network?

Solution
The number of sequences needs to be 2m. We need to choose m = 7 and N = 27 or 128. We
can then use 90
of the sequences as the chips.
Example 3

Prove that a receiving station can get the data sent by a specific sender if it multiplies the
entire data on the channel by the sender’s chip code and then divides it by the number of
stations.

Solution
Let us prove this for the first station, using our previous four-station example. We can say
that the data on the channel
D = (d1 ⋅ c1 + d2 ⋅ c2 + d3 ⋅ c3 + d4 ⋅ c4).
The receiver which wants to get the data sent by station 1 multiplies these data by c1.
Example 3 (continued)

When we divide the result by N, we get d1 .

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy