0% found this document useful (0 votes)
16 views

Module 2

Uploaded by

rohit451977
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

Module 2

Uploaded by

rohit451977
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 106

Module-II

Medium Access Control Protocols for Wireless


Sensor Networks
Medium Access Control
 WSNs are typically composed of many low-cost, low-power,
multifunctional wireless devices deployed over a geographical
area.
 It is the coordinated effort of these sensing devices, however,
that bears promise for a significant impact on a wide range of
applications
 WSNs require a high level of self-organization and coordination
among the sensors to perform the tasks required to support the
underlying application.
 The design of efficient communications and network protocols
for WSNs becomes crucial for wireless sensor nodes to carry out
successfully the mission
 The choice of the medium access control protocol is the major
determining factor in WSN performance.
Medium Access Control
 The objective of the MAC protocol is to regulate access
to the shared wireless medium such that the
performance requirements of the underlying
application are satisfied.
 The physical layer (PHY) typically includes a
specification of the transmission medium and the
topology of the network.
 The major services provided by the physical layer
typically include the encoding and decoding of signals,
preamble generation and removal to achieve
synchronization, and the transmission and reception of
bits.
Video
Medium-access with  802.11 MACA
collision avoidance (MACA)

 Multiple Access with Collision


Avoidance (MACA) is a
medium access control (MAC) layer
protocol used in wireless ad hoc
network. It is used to solve the hidden
terminal problem and exposed terminal
problem. It is an alternate to Carrier-
sense multiple access (CSMA) which
have the hidden terminal problem and
the exposed terminal problem.
The whole process will work as follows:
A will send RTS frame to the B
Then b will send CTS frame to A
When CTS frame is received by A then it will start sending data frame to B
Upon receiving data successfully it will send acknowledgment frame(ACK)
  Short,fixed-length (32
MACA protocol uses RTS and CTS byte) signaling packets:
to avoid hidden and exposed
terminal problem. In hidden
RTS (Request-to-Send) and
terminal problem two nodes try CTS (Clear-to-Send).
to contact same node at a same
time which can create collision to
combat this if two nodes send
RTS to same node then the node
which receives CTS will send the
data not the other one which will
avoid the collision.

Solution to Hidden/Exposed Terminal Problem: MACA solved this


problem
 Limitations of MACA  Collisions

 MACA offered a three way  Collision
of RTS from A
handshake only.
 MACA did not provide and C at B
specifications about parameters
What are RTS, CTS packet sizes ?
 Collisions of RTS may occur when
more than one station send RTS
at same time. In that case none
of the stations gets CTS.

Problem in MACA
 The IEEE 802.11 RTS/CTS system is
MACAW
received from this protocol.

 Multiple Access with  Itutilizes RTS-CTS-DS-DATA-ACK


Collision Avoidance for Wireless frame succession for moving
(MACAW) information, once in a while went
is a before by a RTS-RRTS frame
medium access control (MAC) arrangement, in view to give answer
protocol broadly utilized in ad for the concealed node problem.
hoc network systems. Besides,  Although protocol dependent on
it is the establishment of
MACAW, are S-MAC, MACAW doesn’t
numerous other MAC protocols utilize carrier sense.
utilized in wireless sensor
systems (WSN).

MACAW
 The problem in MACA that if there are two 
sender and two receiver A, B, C and D
get stuck in a loop
respectively.
 If B has send RTS to C and D at the same
time and but only send data upon
receiving CTS from C.
 Now A wants to send data to D but will not
able to send because it will sense that D is
currently busy and will increase the
backoff counter (for how much time A will
wait before re-transmitting) value by twice
because of which it will get stuck in a loop
until the D gets free.
 Blockage data trade between pairwise
stations, prompting better clog control and
backoff approaches

MACAW
 Advantages over MACA :  Working of MACAW
 The sender detects the bearer to see
and transmits a RTS (Request To Send)  This problem is solved by Multiple Access
if no close by station transmits a RTS. with Collision Avoidance for Wireless
 The fairness of MACAW is much better protocol because it introduces packet
than MACA. containing current transmission nodes’s
 It handle hidden and exposed node backoff counter value to be copied into
problem better than MACA. the other sender node. This will reduce
 ACK signal is send to the MAC layer, the wait time very significantly.
 MACAW also introduce two new data
after every data frame.
frame DS(Data-Sending) which provides
 It also incorporate carrier detecting to
information about the length of the
additionally diminish collision incoming DATA frame and RRTS(Request
 Irregular pause and re-attempt
for Request to Send) which acts as a
transmission at each message level, proxy to RTS.
rather than at each node level.

MACAw
Example :
A successful transmission in
case of MACAW will look like
:
RTS from A to B
CTS from B to A
DS from A to B
DATA frame from A to B
ACK from B to A.

MACAW
 Difference:--

 Backoff algorithm: MACAW replaces BEB with MILD (multiplicative increase and
linear decrease) to ensure that backoff interval grows a bit slowly (1.5x instead
of 2x) and shrinks really slowly (linearly to minimum value). To enable better
congestion detection, MACAW shares backoff timers among stations by putting
this info in headers.

 Multiple stream model: MACAW uses separate queues for each stream in each
node for increased fairness. In addition, each queue runs independent backoff
algorithms. However, all stations attempting to communicate with the same
receiver should use the same backoff value.

MACAW proposes significant improvement over MACA in terms performance and fairness.
But the authors leave several issues unresolved in the paper: special RRTS scenario,
multicast, impact of mobility etc. They also propose several extensions to MACAW as future
works; what turned out of those?
 MACAW 
Four-way handshake (reliable, recover at MAC
layer)
  Five-way handshake (relieve exposed terminal
 It is refined and extended problem)
 RRTS (unfairness) It works as follows
MACA. Used Information  Sender sends Ready-to-Send (RTS)
sharing to achieve fairness.  Receiver responds with Clear-to-Send (CTS)
It supports  Sender sends DATA PACKET
 Receiver acknowledge with ACK
 RTS and CTS announce the duration of the
transfer
 Nodes overhearing RTS/CTS keep quiet for
that duration
 Sender will retransmit RTS if no ACK is
received
 If ACK is sent out, but not received by sender,
after receiving new RTS, receiver returns ACK
instead of CTS for new RTS
 state diagram for sender in the MACA.

 The sender can be either in idle state, waiting for


CTS state or waiting for acknowledgement state.

 When sender wishes to transmit, it sends RTS and


moves in to wait for CTS state.

 If the receiver is idle, it will send CTS.

 Sender will transmit and move to wait for ACK


state
 and receiver will go to wait for data state.

 If the receiver is busy or time-out for CTS has


occurred,

 sender again goes to idle state.


 On receiving the data, receiver gives ACK, sender
goes back to idle. In case of NACK, sender again
sends initiates transmission and waits for CTS.

Time State Diagram of MaCA algorithm

You might also like