Unit 2
Unit 2
Unit 2
S1 and S2 are hidden from each other & they transmit simultaneously to R1 which leads to collision
The exposed terminal problem refers to the inability of a node, which is blocked due to transmission by
a nearby transmitting node, to transmit to another node
If S1 is already transmitting to R1, then S3 cannot interfere with on-going transmission & it cannot
transmit to R2.
The hidden & exposed terminal problems reduce the through put of a network when traffic load is high
Error-prone shared broadcast channel
When a node is receiving data, no other node in its neighborhood should transmit
A node should get access to the shared medium only when its transmission do not affect any ongoing
session
MAC protocol should grant channel access to nodes in such a manner that collisions are minimized
Protocol should ensure fair BW allocation
Distributed nature/lack of central coordination
Do not have centralized coordinators
Nodes must be scheduled in a distributed fashion for gaining access to the channel
MAC protocol must make sure that additional overhead, in terms of BW consumption, incurred due to
this control information is not very high
Mobility of nodes
Nodes are mobile most of the time
The protocol design must take this mobility factor into consideration so that the performance of the
system is not affected due to node mobility
CONTENTIONBASED PROTOCOLS
Explain in detail MACA for wireless LAN (MACAW) and floor acquisition multiple access
protocol (FAMA)
MACAW(MACA for Wireless) is a revision of MACA.
• The sender senses the carrier to see and transmits a RTS (Request To Send) frame if no nearby station
transmits a RTS.
• The receiver replies with a CTS (Clear To Send) frame.
• The MACAW protocol uses one more control packet called the request-for-request-to-send (RRTS)
• Neighbors
• see CTS, then keep quiet.
• see RTS but not CTS, then keep quiet until the CTS is back to the sender.
• The receiver sends an ACK when receiving an frame.
• Neighbors keep silent until see ACK.
• Collisions
• There is no collision detection.
• The senders know collision when they don’t receive CTS.
• They each wait for the exponential back-off time.
Explain MACA by invitation protocol and media access with reduced handshake protocol.
MACA-By Invitation Protocol
It is a receiver-initiated protocol
It reduces the number of control packets used in the MACA protocol
It eliminated the need for the RTS packet
In MACA-BI, the receiver node initiates data transmission by transmitting a ready-to-receive (RTR)
control packet to the sender as shown in the figure
• Each frame is composed of s slots and each slot consists of m mini slots
• Each mini slot is further divided into two control fields, RTS/BI and CTS/BI
• These control fields are used for slot reservation and for overcoming the hidden terminal problem
• All nodes having packets ready for transmission contend for the first mini slot of each slot
• The remaining (m-1) mini slots are granted to the node that wins the contention.
• Also, the same slot in each subsequent frame can be reserved for this winning terminal until it
completes its packet transmission session
• Within a reserved slot, communication between the source and receiver nodes takes by means of either
time division duplexing (TDD) or frequency division duplexing(FDD)
• Any node that wants to transmit packets has tfirst reserve slots
• A certain period at the beginning of each mini slot is reserved for carrier sensing
• In order to prioritize nodes transmitting voice traffic over nodes transmitting normal data traffic, two
rules are followed in D-PRMA
1st rule voice nodes are allowed to start contending from mini slot 1 with probability
p=1. Others with p<1
2nd rule only if the node winning the mini slot contention is a voice node, it is
permitted to reserve the same slot in each subsequent frame until the end of the
session
In order to avoid the hidden terminal problem, all nodes hearing the CTS sent by the receiver are not
allowed to transmit during the remaining period of that same slot
In order to avoid the exposed terminal problem, a node hearing the RTS but not the CTS is still allowed
to transmit
Requirement 1 when a node wins the contention in min slot 1, other terminals must be prevented
from using any of the remaining (m-1) mini slots in the same slot for contention
Requirement 2 when a slot is reserved in subsequent frames, other nodes should be prevented from
contending for those reserved slots
D-PRMA is more suited for voice traffic than for data traffic applications
Each node that receives data during the DMS of the current slot transmits a slot reservation (SR) packet
during the CMS1 of the slot
This serves to inform other neighboring potential sender nodes about the currently active
reservations
The SR packet is either received without error at the neighboring nodes or causes noise at those
nodes, preventing them from attempting to reserve the current slot
Every node that transmits data during the DMS of the current slot transmits a request-to-send packet
The receiver node of a unicast session transmits a clear-to-send packet
On receiving this packet, the source node clearly understands that the reservation was successful and
transmits data during the DMS of that slot until unicast flow gets terminated
Once the reservation has been made successfully in a slot, from the next slot onward, both the sender
and receiver do not transmit anything during CMS3 and during CMS4 the sender node alone transmits
ant- to-send (NTS) packet
The not-to-send (NTS) packet serves as a negative acknowledgement
A potential multicast or broadcast source node that receives the NTS packet or that detects noise,
understands that its reservation request has failed & does not transmit during DMS of current slot
The length of the frame is very important in CATA
The worst case value of the frame-length = Min(d2+1, N) , where d is the maximum degree of a node in
the network and N is the total number of nodes in the network
CATA works well with simple single-channel half-duplex radios
It is simple and provides support for collision-free broadcast and multicast traffic