Random Access
Random Access
Network
×
Thus, protocols are required for sharing data on non dedicated
channels. Multiple access protocols can be subdivided further as –
1. Random Access Protocol: In this, all stations have same
superiority that is no station has more priority than another station.
Any station can send data depending on medium’s state( idle or busy).
It has two features:
1. There is no fixed time for sending data
2. There is no fixed sequence of stations sending data
The Random access protocols are further subdivided as:
(a) ALOHA – It was designed for wireless LAN but is also applicable for
shared medium. In this, multiple stations can transmit data at the
same time and can hence lead to collision and data being garbled.
Pure Aloha:
When a station sends data it waits for an acknowledgement. If the
acknowledgement doesn’t come within the allotted time then the
station waits for a random amount of time called back-off time (Tb)
and re-sends the data. Since different stations wait for different
amount of time, the probability of further collision decreases.
Vulnerable Time = 2* Frame transmission time
Throughput = G exp{-2*G}
Maximum throughput = 0.184 for G=0.5
Slotted Aloha:
It is similar to pure aloha, except that we divide time into slots and
sending of data is allowed only at the beginning of these slots. If a
station misses out the allowed time, it must wait for the next slot.
This reduces the probability of collision.
Vulnerable Time = Frame transmission time
Throughput = G exp{-*G}
Maximum throughput = 0.368 for G=1
For more information on ALOHA refer – LAN Technologies
(b) CSMA – Carrier Sense Multiple Access ensures fewer collisions as
the station is required to first sense the medium (for idle or busy)
before transmitting data. If it is idle then it sends data, otherwise it
waits till the channel becomes idle. However there is still chance of
collision in CSMA due to propagation delay. For example, if station A
wants to send data, it will first sense the medium.If it finds the channel
idle, it will start sending data. However, by the time the first bit of data
is transmitted (delayed due to propagation delay) from station A, if
station B requests to send data and senses the medium it will also find
it idle and will also send data. This will result in collision of data from
station A and B.
CSMA access modes-
1-persistent: The node senses the channel, if idle it sends the
data, otherwise it continuously keeps on checking the medium for
being idle and transmits unconditionally(with 1 probability) as soon
as the channel gets idle.
Non-Persistent: The node senses the channel, if idle it sends the
data, otherwise it checks the medium after a random amount of
time (not continuously) and transmits when found idle.
P-persistent: The node senses the medium, if idle it sends the
data with p probability. If the data is not transmitted ((1-p)
probability) then it waits for some time and checks the medium
again, now if it is found idle then it send with p probability. This
repeat continues until the frame is sent. It is used in Wifi and packet
radio systems.
O-persistent: Superiority of nodes is decided beforehand and
transmission occurs in that order. If the medium is idle, node waits
for its time slot to send data.
(c) CSMA/CD – Carrier sense multiple access with collision detection.
Stations can terminate transmission of data if collision is detected. For
more details refer – Efficiency of CSMA/CD
(d) CSMA/CA – Carrier sense multiple access with collision avoidance.
The process of collisions detection involves sender receiving
acknowledgement signals. If there is just one signal(its own) then the
data is successfully sent but if there are two signals(its own and the
one with which it has collided) then it means a collision has occurred.
To distinguish between these two cases, collision must have a lot of
impact on received signal. However it is not so in wired networks, so
CSMA/CA is used in this case.
CSMA/CA avoids collision by:
1. Interframe space – Station waits for medium to become idle and if
found idle it does not immediately send data (to avoid collision due
to propagation delay) rather it waits for a period of time called
Interframe space or IFS. After this time it again checks the medium
for being idle. The IFS duration depends on the priority of station.
2. Contention Window – It is the amount of time divided into slots. If
the sender is ready to send data, it chooses a random number of
slots as wait time which doubles every time medium is not found
idle. If the medium is found busy it does not restart the entire
process, rather it restarts the timer when the channel is found idle
again.
3. Acknowledgement – The sender re-transmits the data if
acknowledgement is not received before time-out.
2. Controlled Access:
In this, the data is sent by that station which is approved by all other
stations. For further details refer – Controlled Access Protocols
3. Channelization:
In this, the available bandwidth of the link is shared in time, frequency
and code to multiple stations to access channel simultaneously.
Frequency Division Multiple Access (FDMA) – The available
bandwidth is divided into equal bands so that each station can be
allocated its own band. Guard bands are also added so that no two
bands overlap to avoid crosstalk and noise.
Time Division Multiple Access (TDMA) – In this, the bandwidth is
shared between multiple stations. To avoid collision time is divided
into slots and stations are allotted these slots to transmit data.
However there is a overhead of synchronization as each station
needs to know its time slot. This is resolved by adding
synchronization bits to each slot. Another issue with TDMA is
propagation delay which is resolved by addition of guard bands.
For more details refer – Circuit Switching
Code Division Multiple Access (CDMA) – One channel carries all
transmissions simultaneously. There is neither division of bandwidth
nor division of time. For example, if there are many people in a
room all speaking at the same time, then also perfect reception of
data is possible if only two person speak the same language.
Similarly, data from different stations can be transmitted
simultaneously in different code languages.
Orthogonal Frequency Division Multiple Access (OFDMA) – In
OFDMA the available bandwidth is divided into small subcarriers in
order to increase the overall performance, Now the data is
transmitted through these small subcarriers. it is widely used in the
5G technology.
Advantages:
Increase in efficiency
High data rates
Good for multimedia traffic
Disadvantages:
Complex to implement
High peak to power ratio
Disadvantages :
It is complex to implement
It require the accurate information about the channel
The persistence methods can be applied to help the station take action
when the channel is busy/idle.
Unmute
In the diagram, starts sending the first bit of its frame at t1 and since C
sees the channel idle at t2, starts sending its frame at t2. C detects A’s
frame at t3 and aborts transmission. A detects C’s frame at t4 and
aborts its transmission. Transmission time for C’s frame is,
therefore, t3-t2 and for A’s frame is t4-t1
So, the frame transmission time (Tfr) should be at least twice
the maximum propagation time (Tp). This can be deduced when
the two stations involved in a collision are a maximum distance apart.
Process: The entire process of collision detection can be explained as
follows:
The basic idea behind CSMA/CA is that the station should be able to
receive while transmitting to detect a collision from different stations.
In wired networks, if a collision has occurred then the energy of the
received signal almost doubles, and the station can sense the
possibility of collision. In the case of wireless networks, most of the
energy is used for transmission, and the energy of the received signal
increases by only 5-10% if a collision occurs. It can’t be used by the
station to sense collision. Therefore CSMA/CA has been specially
designed for wireless networks.
These are three types of strategies:
1. InterFrame Space (IFS): When a station finds the channel busy it
senses the channel again, when the station finds a channel to be
idle it waits for a period of time called IFS time. IFS can also be
used to define the priority of a station or a frame. Higher the IFS
lower is the priority.
2. Contention Window: It is the amount of time divided into slots. A
station that is ready to send frames chooses a random number of
slots as wait time.
3. Acknowledgments: The positive acknowledgments and time-out
timer can help guarantee a successful transmission of the frame.
Characteristics of CSMA/CA :
1. Carrier Sense: The device listens to the channel before
transmitting, to ensure that it is not currently in use by another
device.
2. Multiple Access: Multiple devices share the same channel and can
transmit simultaneously.
3. Collision Avoidance: If two or more devices attempt to transmit at
the same time, a collision occurs. CSMA/CA uses random backoff
time intervals to avoid collisions.
4. Acknowledgment (ACK): After successful transmission, the
receiving device sends an ACK to confirm receipt.
5. Fairness: The protocol ensures that all devices have equal access
to the channel and no single device monopolizes it.
6. Binary Exponential Backoff: If a collision occurs, the device waits
for a random period of time before attempting to retransmit. The
backoff time increases exponentially with each retransmission
attempt.
7. Interframe Spacing: The protocol requires a minimum amount of
time between transmissions to allow the channel to be clear and
reduce the likelihood of collisions.
8. RTS/CTS Handshake: In some implementations, a Request-To-
Send (RTS) and Clear-To-Send (CTS) handshake is used to reserve
the channel before transmission. This reduces the chance of
collisions and increases efficiency.
9. Wireless Network Quality: The performance of CSMA/CA is
greatly influenced by the quality of the wireless network, such as
the strength of the signal, interference, and network congestion.
10. Adaptive Behavior: CSMA/CA can dynamically adjust its
behavior in response to changes in network conditions, ensuring the
efficient use of the channel and avoiding congestion.
Overall, CSMA/CA balances the need for efficient use of the shared
channel with the need to avoid collisions, leading to reliable and fair
communication in a wireless network.
Process: The entire process of collision avoidance can be explained as
follows:
Advantages of CSMA:
Disadvantages of CSMA:
Transmission Collision
Protocol Efficiency Use cases
behavior detection method
Low-traffic
Pure Sends frames No collision
Low networks
ALOHA immediately detection
Wireless
Monitors medium Collision
networks with
while transmitting, avoidance through
CSMA/CA High moderate to
adjusts behavior to random backoff
high traffic and
avoid collisions time intervals
high error rates
Advantages of CSMA/CD:
Disadvantages of CSMA/CD:
reservation.
Advantages of Reservation:
The main advantage of reservation is high rates and low rates of
data accessing time of the respective channel can be predicated
easily. Here time and rates are fixed.
Priorities can be set to provide speedier access from secondary.
Predictable network performance: Reservation-based access
methods can provide predictable network performance, which is
important in applications where latency and jitter must be
minimized, such as in real-time video or audio streaming.
Reduced contention: Reservation-based access methods can
reduce contention for network resources, as access to the network
is pre-allocated based on reservation requests. This can improve
network efficiency and reduce packet loss.
Quality of Service (QoS) support: Reservation-based access
methods can support QoS requirements, by providing different
reservation types for different types of traffic, such as voice, video,
or data. This can ensure that high-priority traffic is given preferential
treatment over lower-priority traffic.
Efficient use of bandwidth: Reservation-based access methods
can enable more efficient use of available bandwidth, as they allow
for time and frequency multiplexing of different reservation
requests on the same channel.
Support for multimedia applications: Reservation-based access
methods are well-suited to support multimedia applications that
require guaranteed network resources, such as bandwidth and
latency, to ensure high-quality performance.
Disadvantages of Reservation:
×
Highly trust on controlled dependability.
Decrease in capacity and channel data rate under light loads;
increase in turn-around time.
Polling
Polling process is similar to the roll-call performed in class. Just like
the teacher, a controller sends a message to each node in turn.
In this, one acts as a primary station(controller) and the others are
secondary stations. All data exchanges must be made through the
controller.
The message sent by the controller contains the address of the
node being selected for granting access.
Although all nodes receive the message the addressed one
responds to it and sends data if any. If there is no data, usually a
“poll reject”(NAK) message is sent back.
Problems include high overhead of the polling messages and high
dependence on the reliability of the controller.
Advantages of Polling:
The maximum and minimum access time and data rates on the
channel are fixed predictable.
It has maximum efficiency.
It has maximum bandwidth.
No slot is wasted in polling.
There is assignment of priority to ensure faster access from some
secondary.
Disadvantages of Polling:
It consume more time.
Since every station has an equal chance of winning in every round,
link sharing is biased.
Only some station might run out of data to send.
An increase in the turnaround time leads to a drop in the data rates
of the channel under low loads.
Efficiency Let Tpoll be the time for polling and Tt be the time required
for transmission of data. Then,
Efficiency = Tt/(Tt + Tpoll)
Token Passing
In token passing scheme, the stations are connected logically to
each other in form of ring and access to stations is governed by
tokens.
A token is a special bit pattern or a small message, which circulate
from one station to the next in some predefined order.
In Token ring, token is passed from one station to another adjacent
station in the ring whereas incase of Token bus, each station uses
the bus to send the token to the next station in some predefined
order.
In both cases, token represents permission to send. If a station has
a frame queued for transmission when it receives the token, it can
send that frame before it passes the token to the next station. If it
has no queued frame, it passes the token simply.
After sending a frame, each station must wait for all N stations
(including itself) to send the token to their neighbours and the other
N – 1 stations to send a frame, if they have one.
There exists problems like duplication of token or token is lost or
insertion of new station, removal of a station, which need be tackled
for correct and reliable operation of this scheme.
What is FDMA?
FDMA is an abbreviation for "Frequency Division Multiple Access". It
is a form of channelization protocol. In this system, the bandwidth is
separated into different frequency bands. Each station is assigned a band
to transmit data, and that band is always reserved for that station.
ADVERTISEMENT
Advantages
Disadvantages
ADVERTISEMENT
ADVERTISEMENT
Advantages
Disadvantages
1. The user won't be connected to a call if all of the time slots in the
current cell and the cell they are entering are already taken
because they have been allotted a specific slot.
2. In TDMA, frequency/slot allocation will be complicated.
3. In TDMA, high data rates needed equalization.
4. Network and spectrum planning is a complex and time-consuming
process requiring great expertise and resources.
5. The focus is on organization and range arranging.
What is CDMA?
CDMA is an abbreviation for "Code Division Multiple Access". It is a
combination of FDMA and TDMA in which resources are allocated based
on frequency and time. FDMA divides the frequency band across several
users for the duration of the session, whereas TDMA permits each user to
utilize the full frequency band for a defined session. On the other hand,
the CDMA system takes advantage of both systems by allowing several
users to simultaneously utilize the same frequency band defined by a
unique code.
These codes are selected in such a way that if the code is utilized for a
second time, the user who knows the code may identify that specific user
among the other users. This method may only be applied to a specific
number of users because each user is a source of noise for the receiver.
As a result, it is highly susceptible to noise. Because as the number of
user numbers increases, the noise also increases. As a result, the system
may collapse.
Advantages and Disadvantages of CDMA
There are various advantages and disadvantages of CDMA. Some main
advantages and disadvantages of CDMA are as follows:
Advantages
Disadvantages
ADVERTISEMENT
ADVERTISEMENT
1. One of the main issues with the CDMA system is channel pollution,
which occurs when a user's phone has two or more cell sites, but
only one of them is powerful.
2. It is not a mature organization because the CDMA is still new
compared to GSM.
3. CDMA needed time synchronization.
4. As the number of users rises, the CDMA system's performance
decreases.
5. It has a high price because of the greater equipment.
Rate of Data It has a low data It has a medium It has a high data rate.
rate. data rate.
Cells Capacity It has a limited cell It also has a limited It has no capac
capacity. cell capacity. restriction for a chann
although it
interference-limited.
Cost It has a high cost. It has a low cost. Its installation cost
high, but the operatio
cost is low.
Conclusion
FDMA is generally combined with SDMA (Space Division Multiple Access)
and TDMA, whereas TDMA holds the standards in fixed networks. Many
mobile networks utilize it in conjunction with SDMA or FDMA. On the other
hand, CDMA continues to face significant challenges, and it is more
complicated and has lower expectations. It will most likely be compatible
with FDMA and TDMA.