100% found this document useful (1 vote)
2K views2 pages

Contention Based - PAMAS

Download as pdf or txt
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Contention-Based MAC Protocols

  These protocols do not rely on transmission schedules, instead they require


other mechanisms to resolve contention when it occurs!
  The main advantage of contention-based techniques is their simplicity
compared to most schedule-based techniques!
  schedule-based MAC protocols must save and maintain schedules or
tables indicating the transmission order!
  most contention-based protocols do not require to save, maintain, or
share state information!
  this also allows contention-based protocols to adapt quickly to changes
in network topologies or traffic characteristics!
  However, they typically result in higher collision rates and overheads due to
idle listening and overhearing (overheads usually refer to additional bits in a
packet or additional packets such as control packets)!
  They may also suffer from fairness issues (i.e., some nodes may be able to
obtain more frequent channel accesses than others)

Fundamentals of Wireless Sensor Networks: Theory and Practice


Waltenegus Dargie and Christian Poellabauer © 2010 John Wiley & Sons Ltd.
70!

Power Aware Multi-Access with Signaling



  The PAMAS protocol attempts to avoid unnecessary energy expenditure
caused by overhearing!

  PAMAS uses two separate channels to prevent collisions among data


transmissions: one for data frames and one for control frames (ready-to-
send or RTS and clear-to-send or CTS)!
  The separate signaling channel allows nodes to determine when and how
long to power down their wireless transceivers!
  devices transmit busy tones on the control channel to ensure that
devices that did not overhear either RTS or CTS will not access the
data channel for transmissions

Fundamentals of Wireless Sensor Networks: Theory and Practice


Waltenegus Dargie and Christian Poellabauer © 2010 John Wiley & Sons Ltd.
71!

Power Aware Multi-Access with Signaling



  Initiating a data transfer!
  a PAMAS device sends an RTS message over the control channel to
the receiver!
  receiver responds with CTS if it does not detect activity on the data
channel and has not overheard other recent RTS or CTS messages!
  if the source does not receive a CTS within a specific timeout interval, it
will attempt to transmit again after a back-off time (exponential back-off
algorithm)!
  otherwise, it begins data transmission and the receiver node issues a
busy tone over the control channel (whose length is greater than twice
the length of a CTS)!
  the receiver device also issues a busy tone over the control channel
whenever it receives an RTS message or detects noise on the control
channel while it receives a frame!
 done to corrupt possible CTS message replies to the detected RTS,
thereby blocking any data transmission of the receiverʼs neighbors!
Fundamentals of Wireless Sensor Networks: Theory and Practice
Waltenegus Dargie and Christian Poellabauer © 2010 John Wiley & Sons Ltd.
72!

24!
Power Aware Multi-Access with Signaling

  Every node in a PAMAS network independently decides when to power off
its transceiver!
  Specifically, a node decides to turn off its transceiver whenever one of two
conditions holds:!
  a neighbor begins a transmission and the node has no frames to
transmit!
  a neighbor transmits a frame to another neighbor, even if the node has
frames to transmit!
  A node can easily detect either condition by !
  overhearing its neighborʼs transmissions (condition 1) or!
  overhearing its neighborʼs busy tone (condition 2)!
  A node can identify how long to power down its transceiver by embedding
the size or expected transmission duration into messages!

Fundamentals of Wireless Sensor Networks: Theory and Practice


Waltenegus Dargie and Christian Poellabauer © 2010 John Wiley & Sons Ltd.
73!

Power Aware Multi-Access with Signaling



  However, when a transmission begins while a node is still asleep, it does
not know how long this transmission will last and how long it should
continue to sleep!
  Therefore, the node issues a probe frame (containing a certain time interval)
over the control channel to all transmitting nodes in its neighborhood!
  all transmitters that will complete during this interval respond with their
predicted completion time!
  if such a response is received by the awakening node without collision,
it can return to the sleep mode until the completion time indicated by the
transmitting node!
  if multiple transmitters respond and their responses collide, the node
reissues the probe frame with a shorter time interval!
  similarly, if the node did not receive a response, it can reissue the probe
with a different time interval!
  in effect, the node chooses time intervals to perform a binary search to
identify when the last ongoing transmission will end!
Fundamentals of Wireless Sensor Networks: Theory and Practice
Waltenegus Dargie and Christian Poellabauer © 2010 John Wiley & Sons Ltd.
74!

Sensor MAC

  The goal of the S-MAC protocol is!
  to reduce unnecessary energy consumption!
  while providing good scalability and collision avoidance mechanism!
  S-MAC adopts a duty-cycle approach!
  nodes periodically transition between a listen state and a sleep state!
  each node chooses its own schedule, although it is preferred when
nodes synchronize their schedules such that nodes listen or sleep at the
same time!
  nodes using the same schedule are considered to belong to the same
virtual cluster (but no real clustering takes place)!
 all nodes are free to communicate with nodes outside their clusters!

Fundamentals of Wireless Sensor Networks: Theory and Practice


Waltenegus Dargie and Christian Poellabauer © 2010 John Wiley & Sons Ltd.
75!

25!

You might also like