Professional Documents
Culture Documents
4 MODIFIED CSMA/CA
PROTOCOL ON NS3
N’Guessan Jean-Francois DEKI1, Dr Suchithra. R2
djfngs@aol.com1, suchithra.suriya@gmail.com2
JAIN
Deemed To be university
Department of Master Science (Information Technology)
Abstract--The 802.15.4 IEEE standard is one Extended IPS (EIFS), which correspond to,
among the Low Rate Wireless Personal Area for example, ACK frames, PCF control
Network (LR-WPAN) standard designed by frames, data frames, and retransmission
IEEE. the Carrier Sensing Multiple Access- frames, respectively. In 802.15.4, to avoid the
Collision Avoidance (CSMA-CA) protocol
collision of data the backoff procedure is
manage the medium access controller (MAC)
process for this standard. CSMA/CA is an
used, where each station gets a random time
algorithm that handle all packets with equal interval before its frame transmission
probability to access the data transmission CSMA-CA makes each node use a
channel. A compliant implementation of randomized waiting time before trying to
CSMA-CA protocol which follows the IEEE access the communication medium. To
802.15.4 specifications is important in order to reduce the interferences and collision in the
obtain the best quality of service (QoS). Some network the random mechanism is used. The
of the well-known Wireless Sensor Networks CSMA-CA of IEEE 802.15.4 is very widely
(WSNs) on NS3 simulation tool do not provide used in MAC protocols that are based on
a compliant. This work proposed an carrier sensing. In this algorithm, the node
implementation of the IEEE 802.15.4 modified
waits for a random time called backoff
CSMA-CA protocol.
period. The backoff period is in a range [0,
Keywords: IEEE 802.15.4 MAC, CSMA, 2BE -1], where BE (backoff exponent) that
BackOff, hidden nodes. determine the number of backoff period the
device shall wait before trying to access the
medium [16]. The CSMA-CA algorithm
I- INTRODUCTION mainly use a very small range of BE
(macMinBE – macMaxBE), where the
The 802.15.4 IEEE standard has two ways of minimum BE (macMinBE = 3) and the
access mechanisms channel: The unslotted maximum (macMaxBE = 5). This random
carrier sense multiple access with collision time variation is producing a loss of data in
avoidance (CSMA-CA) and the slotted transmission which will be retransmitted and
CSMA algorithm with a super frame create a waste of bandwidth in the network.
structure. The CSMA-CA is a contention- The proposed algorithm is implemented and
based multiple access technology that simulated in ns3 to compare its performance
requires each station to sense the medium to with the original 802.15.4 standard. The rest
be idle for a period of time before sending of the paper is organized as follow. In section
each frame. The period of time is called inter- II, the review of the recent literature for
frame space (IFS) whose length is related to research contributions that targeted on
the frame priority. The level of frame modifying the 802.15.4 standard. Section III
priorities is classified as Short IFS (SIFS), provides an overview of the modified
PCF IFS (PIPS), DCF IPS (DIPS) and CSMA-CA (RTS/CTS as well as proposed
CSMA-CA). In Section IV, the simulations mechanisms to enhance energy efficiency
conducted to analyze the performance of our and throughput of beacon-enabled mode
proposed algorithm. Finally, the conclusion 802.15.4. These mechanisms are enhanced
and future work is provided in Section V. collision resolution and enhanced backoff.
The first mechanism focuses on adjusting the
II- RELATED WORK range of backoff exponent (BE) based on
In [1], The authors propose an extension to both clear channel assessment results and
802.15.4. Their enhancements target on how packet transmission while the second
to achieve efficient power saving as well as mechanism proposes enhancement to the
reliability and channel utilization in WSNs. backoff period by shifting the range of
Basically, during channel access procedure, backoff counters to reduce unneeded backoff
the nodes try to access the wireless medium durations. However, their details can be
to initialize transmitting its packets. Once a found in [8]. Through this work, simulation
node captures the medium and completes results shown that CSMA-CA was not
sending the packets, the node should enter properly design for some characteristics and
standby state for some duration of time can be improved by the above-mentioned
denoted as LSB. The details of calculating mechanisms.
LSB can be found in [1]. This behavior can In [4], A model of discrete Markov chain that
achieve power saving and effectively reduce can dynamically represent different network
the number of contending nodes in the loads is proposed to evaluate the IEEE
network and thus reduce the level of 802.15.4 slotted CSMA/CA algorithm. By
collisions. On the other hand, the simulation computing the steady-state distribution
results show the performance of Standby probability of the Markov chain, authors
state only without comparing its results with present an evaluation formula for throughput,
802.15.4 standard or any other algorithm. energy consumption, and access latency.
In [2], The knowledge-based Exponential They further analyze the parameters that
Backoff (KEB) scheme is proposed. The influence performance like packet arrival
authors proposed KEB algorithm to enhance rate, initial backoff exponent and maximum
throughput and channel utilization based on number of backoffs. To validate the proposed
channel state information locally to each model, NS2 simulator is used to evaluate the
available node. In addition, the Exponential performance of the 802.15.4 CSMA/CA
Weighted Moving Average (EWMA) algorithm under different scenarios.
scheme is used to compute the collision rate
at any time. Backoff exponent decrease or In [6], Using OMNeT++ simulator, authors
increase based on the level of collision low or present the results of performance evaluation
high compared with a predefined threshold. of four scheduling algorithms: Random
Analytical model by using Markov Chain Select (RS), Destination Priority Queueing
model have been proposed to simulate KEB (DPQ), Longest Queue First (LQF), and
and compare its performance with BEB. The Shortest Packet First (SPF) designed for the
simulation and analytical results show the unslotted CSMA/CA algorithm to address the
improvement of KEB’s performance in terms issues of fairness and bandwidth efficiency.
of saturation throughput. From the simulation results, they showed that
under uniform traffic conditions, the LQF
In [3], The authors tackle the packet with buffer size of 13 and 78 bytes has the
collision’s problem during the slotted best performance in terms of fairness, while
CSMA-CA period and introduced two novel for throughput and packet delay, the DPQ
with the maximum buffer size of 1538 bytes Vector) is the time of occupation of node
gives the best result. Analytical studies and transmission. This mechanism helps to avoid
evaluation by simulation often fail to take the collision of data between 3 nodes trying
into account the architecture of the operating to exchange data each other. If a CTS packets
system and the stack overhead on the network is not sent, the backoff mechanism will start
protocols. On the other hand, simulators such and set a time for retransmission of data.
as Cooja and TOSSIM emulate the operation
system constraint (Contiki and TinyOS, • Proposed CSMA-CA
respectively) during the execution of the In the proposed CSMA/CA, for channel
protocols. access control three factors are maintained.
The backoff stage for the transmission of a
III- IMPLEMENTING THE frame (NB = number of backoff trials). To
MODIFIED CSMA-CA generate a time which the devices have to
• Overview RTS/CTS wait before attempting transmission (backoff
exponent = BE). The value of the slots for
When a node transmit data to another node, clear channel assessment (CCA) after the
an RTS 'Request to Send' packet is send out backoff time (contention window = CW). Let
first. The receiver node replies with a CTS n the backoff stage NB of a device, wn = 2 BEn
'Cleared to Send' packet. After the node the backoff window at backoff stage k of a
receive the CTS packet, it sends the data device, where backoff exponent BEn =1,2,3...
packets. Encoded with the RTS/CTS packets and 6 for 0 ≤ k ≤m (m = 5). Given a uniform
a field of duration. The duration field is that distribution of backoff times, the expected
the data transmission completed within the backoff time is the mean of the possibilities.
specific time period. If sender node does not That is, after c collisions, the number of
receive a CTS packet then the exponential backoff slots is in [0, 1, ..., N], where N = 2c
back off mode is executed and retransmission − 2 and the expected backoff time (in slots) is
is retried.
2