MAC PROTOCOLS

TRAMA
FLAMA
PMAC
PEDAMACS

GROUP-5

Piyush Dubey - 2022H1400081G

K Sai Praneeth Reddy- 2022H1400083G
Dhiraj Mansaram Ahire- 2022H1400084G
Naman Sharma- 2022H1400087G
TRAMA

MAC – Protocol
TRAMA
TRAFFIC-ADAPTIVE MEDIUM ACCESS
PROTOCOL
 • Reduce energy consumption by reducing
idle listening and collision
• Support unicast, multicast, and broadcast
• Increasing throughput while ensuring low
Main goals latency and fairness.

of TRAMA • Supporting collision-free channel access in

wireless sensor network
• Schedule based MAC protocol
 Network Characteristics

• TDMA-based: TRAMA is a Time Division Multiple Access (TDMA) protocol,

which means that nodes transmit data during allocated time slots. This
approach reduces collisions and minimizes energy consumption.

• Traffic-adaptive: TRAMA is a traffic-adaptive protocol, which means that it

dynamically adjusts the allocation of time slots to nodes based on their traffic
load. This approach ensures that nodes with higher traffic load are allocated
more time slots, which increases network throughput and energy efficiency.
• Synchronization: TRAMA requires nodes to be synchronized with each other
to ensure that they transmit data during the correct time slot. This
synchronization is achieved through the exchange of synchronization
packets between nodes.

• Low overhead: TRAMA has a low overhead in terms of packet size and
processing requirements. This makes it suitable for resource-constrained
WSNs.
Working
• TRAMA consists of three components: the Neighbor Protocol (NP) and the
Schedule Exchange Protocol (SEP), which allow nodes to exchange two-
hop neighbor information and their schedules; and the Adaptive Election
Algorithm (AEA), which uses neighborhood and schedule information to
select the transmitters and receivers for the current time slot, leaving all
other nodes in liberty to switch to low-power mode.
• TRAMA exchange their two hop neighborhood information and the
transmission schedules specifying which nodes are the intended receivers
of their traffic in chronological order and then select the nodes that should
transmit and receive during each time slot.
• TRAMA assumes a single, time-slotted channel for both data and signaling
transmissions. Figure 1 shows the overall time-slot organization of the
protocol. Time is organized as sections of random- and scheduled-access
periods. We refer to random-access slots as signaling slots and scheduled
access slots as transmission slots.
• NP(Neighbor Protocol ) propagates one-hop neighbor information among
neighboring nodes during the random access period using the signaling slots,
to obtain consistent two-hop topology information across all nodes. As the
name suggests, during the random access period, nodes perform contention-
based channel acquisition and thus signaling packets are prone to collisions.
Transmission slots are used for collision-free data exchange and also for
schedule propagation.
 Difference between SMAC and TRAMA

• In contrast to prior MAC protocols proposed for sensor networks, TRAMA

provides support for unicast, broadcast and multicast traffic (i.e.,
transmitting to only a set of one hop neighbors). TRAMA differs from S-
MAC (which also provides explicit energy conservation mechanisms) in two
fundamental ways.

1) TRAMA is inherently collision-free as its medium access control mechanism

is schedule-based as opposed to S-MAC’s which is contention-based.
2) TRAMA’s uses an adaptive, dynamic approach based on current traffic
patterns to switch nodes to low power mode, while S-MAC’s scheme is
static based on a pre-defined duty cycle.
FLAMA

MAC – Protocol
FLAMA
FLOW - AWARE MEDIUM ACCESS
PROTOCOL
 • Schedule based MAC protocol.

• FLAMA achieves energy efficiency by

preventing idle listening, data collisions and
transmissions to a node that is not ready to
receive packets.
FLAMA
• Simple enough so that it can be run by
nodes with limited processing, memory,
communication, and power capabilities.

• It avoids explicit traffic information

exchange.
Network Characteristics

• FLAMA is a schedule-based MAC protocol that leverages traffic predictability

in sensor network applications. FLAMA uses the concept of flows to
characterize application traffic patterns.
• It requires two-hop neighborhood and flow information in the neighborhood
to perform the election.
• Flows represent one-hop traffic information and specify the transmitter, the
receiver(s).
• FLAMA achieves traffic adaptiveness by assigning slots to a node depending
on the amount of traffic generated by that node.
• This is accomplished by assigning node weights based on the incoming and
outgoing flows. Nodes with more outgoing flows are given higher weights
 Time organization

• Time is organized in periods of random- and scheduled-access intervals.

• During random access, neighbor discovery, time synchronization and implicit traffic information
exchange are performed.

• Application-specific traffic information is exchanged among nodes during random access to

reflect the driving application’s specific traffic patterns, or flows.

• Data transmission happens during scheduled access.

 Random-Access Period

• Nodes running FLAMA start in random access mode and the radio is in either
transmit or receive state.
• During the random access period the following tasks that are performed:
(1)network-wide time synchronization(2) data forwarding tree formation (3)
traffic flow information exchange (4) two-hop neighborhood information.
• The length of the random access period is fixed based on the time required to
complete the synchronization.
• FLAMA uses node weights to adjust transmission schedules.
Node weight calculation
 Scheduled-Access Period

• During scheduled-access, channel access is time-slotted. The number of slots

in the scheduled-access period is decided based on the duty cycle for
scheduled access.
• FLAMA uses a distributed election algorithm to schedule collision-free
transmissions.
• FLAMA’s election algorithm requires that each node maintains a list of one-
and two-hop neighbors and their corresponding weights, and parent
information.
• A node can transmit if it has the highest two-hop priority for the given time
slot and it has data to send. A node should be in receive mode if it is not the
highest two-hop priority node, Otherwise a node can go to sleep.
 Comparison

• In terms of reliability, queuing delay and energy savings, FLAMA outperforms

TRAMA.
• FLAMA achieves significantly smaller delays when compared to TRAMA.
• FLAMA avoids explicit traffic information exchange and employs a much
simpler election algorithm than TRAMA.
• FLAMA achieves significant energy savings when compared to TRAMA and S-
MAC. This is because FLAMA exchanges lesser information thanTRAMA
during scheduled access periods.
PEDAMACS

• POWER EFFICIENT AND DELAY

AWARE MEDIA ACCESS PROTOCOL
FOR SENSOR NETWORKS
 • Quantitative reduction in the power
consumption compared to the random
access network
• Schedule transmission in a way that
eliminates collisions and puts a node in
sleep mode during a time slot when it is
PEDAMACS not scheduled to receive or transmit a
packet
• Moreover the PEDAMACS protocol
guarantees a bounded delay, fairness,
and eliminates congestion
Network Characteristics • We use Pedamacs with network with
two types of characteristics
• The nodes periodically generate data
and have limited energy and power, but
the access point, which ‘consumes’
these data, is not energy or power
limited.
• Consequently, packets from nodes must
travel over several hops to reach the
access point, but packets from the
access point can reach all nodes in a
single hop.
Working • Pedamacs is a MAC based protocol
• The protocol first enables the access
point to gather information about the
network topology. It then calculates and
broadcasts a periodic schedule, which
determines when each node should
listen for incoming packets and when it
should transmit its own packets or those
received from ‘upstream’ nodes; the
rest of the time the node ‘sleeps’.
• When it detects a change in network
topology, the access point repeats the
process of topology discovery and
schedule determination.
• The optimum schedule is the one that minimizes delay—the time needed
for the data generated in one period from all nodes to reach the access
point.
• Therefore, instead of finding the optimum schedule, PEDAMACS
incorporates a polynomial-time scheduling algorithm that achieves a
delay proportional to the number of nodes.
Protocol Phases There are three phases
1.Topology Learning Phase :
Each node identifies its neighbors, its interferers, and
its parent node in a shortest-path tree rooted at the
AP.
2.Topology Collection Phase:
In the topology collection phase, each node sends this
(local) topology information to the AP so, at the end
of this phase, the AP knows the full network topology
3.Scheduling Phase:
At the beginning of the scheduling phase, the AP
broadcasts a schedule. Each node then follows the
schedule: In particular, the node sleeps when it is not
scheduled either to transmit a packet or to listen for
one
Pedamac vs SMAC • PEDAMACS and SMAC are MAC
protocols designed for WSNs
• They differ in their approach to
minimizing energy consumption and
improving performance.
• PEDAMACS uses a contention-based
approach and adaptive listen/sleep
schedules
• While SMAC uses a duty-cycling
approach and synchronization with low-
power listening.