Professional Documents
Culture Documents
A Markov Chain Based Analytical Model For Beacon Enabled IEEE 802.15.4 With Adaptive Synchronization
A Markov Chain Based Analytical Model For Beacon Enabled IEEE 802.15.4 With Adaptive Synchronization
)
Then go to step 10
else go to step 11
Step10: Set CW=2, NB=NB+1, BE=min (BE+1, MaxBE) and
check if NB=macMax Backoffs?
If yes then discard the data packet and go to step 14
else go to step 7
Step 11: Set CW=CW-1 and check if CW=0?
If yes transmit data packet and go to step 1
else go to step 8
Step 12: Set NS=0 and send data request to parent sensor
(sensor) and then wait for maxdelaytime
Step 13: Check whether the data transmission
acknowledgement is received?
If yes go to step 2
else go to step 14
Step 14: Set NS=NS+1
If NS<MaxNS, sensor moves to sleep state and after
unit BP, sensor wakes up from sleep state then go to
step 1
else go to step 15
Step 15: Send synchronization acknowledgement to the PAN
coordinator and remain in the idle state
The probability
are the probability to find the
channel idle in first clear channel assessment (CCA
1
) due to
data transmission and acknowledgement (ACK) transmission
and finding channel busy in second clear channel assessment
(CCA
2
). The term maxdelaytime for a sensor is defined as
the maximum time to wait for ACK from parent sensor. The
process of sending a data request to parent sensor and waiting
for maxdelaytime is similar with CCA so for further analysis
we will consider this process as another CCA. In the
algorithm, the value of NS denotes the number of utilized
sleep slot. The adaptive synchronization algorithm is
explained with an example in figure 2. In the figure 2, we
consider a simple network of five sensors and a PAN
coordinator. At first all the sensors are synchronized by the
beacon superframe, transmitted from the PAN coordinator.
After a certain time instant, at time t
1
data transmission takes
place between the sensor 1 and sensor 3. At time t
2
sensor 5,
sensor 2 and sensor 4 send data request to its parent sensors
respectively sensor 3, sensor 1 and sensor 2 and wait for
maxdelaytime. After maxdelaytime, data transmission
acknowledgement is received only from sensor 2. So data
transmission takes place between sensor 2 and sensor 4. As no
ACK is received from sensor 1 and sensor 3, sensor 4 and
sensor 5 moves to sleep state and increase NS by one. We
assume that for sensor 5, NS=MaxNS, so it sends
synchronization ACK to the PAN coordinator. For sensor 2, it
is assumed that NSMaxNS, so it remains in sleep state till
next data transmission and does not send any synchronization
ACK to the PAN coordinator.
Beacon Beacon
CA
CFP
Inactive Period
Beacon Interval Superframe Duration
GTS1 GTS2
Figure 2: Sample network explaining the modified protocol
III. MARKOV CHAIN MODEL
In this section, we propose an analytical model for analysis of
adaptive synchronization algorithm. For analysis we consider
a network with PAN coordinator, and N sensors with beacon
enabled slotted CSMA/CA and ACK. All sensors contend to
send data to the PAN coordinator, which is the data sink. We
assume that the network generates an unsaturated traffic. We
study the behavior of a single sensor by using a 4-dimensional
Markov chain model [11]. The analytical model is illustrated
in figure 3:
Figure 3: Markov chain model of the modified protocol
Here the idle states with data packet and without data packet
are represented as different states for easier understanding of
the proposed protocol, but for analysis both states are
considered as a generalized idle state. Let b(t), c(t), r(t) and
s(t) be the stochastic processes representing the backoff stage,
the state of the backoff counter, the state of retransmission
counter and the state of sleep slot counter at a time instant t
respectively, experienced by a sensor. By assuming a
stationary probability that a sensor attempts a first carrier
sensing in a randomly chosen time slot, which is independent
of other sensors. The states from
to
are
considered the idle state when the packet queue is empty and
the sensor has received data ACK from parent sensor. State
represents the sleep state. States and
represent CCA
1
and CCA
2
, respectively. Let be the
probability that CCA
1
is busy, the probability that CCA
2
is
busy. Let q
0
is the probability of going to the idle state Q
0
after
CCA. So the probability of going to sleep state S
0
is
.
Let P
c
be the probability that a transmitted packet encounters a
collision. The states and model the
successful transmission and packet collision, respectively. The
state transition probabilities associated with the Markov chain
model in the figure 3 are following:
|
|
Here and W
0
, m, m
b
, m
o
, n are defined in Table
1. Equation (1) is the decrement of backoff counter, which
PAN
Coordinator
Sensor 1
Sensor 2 Sensor 3
Sensor 4 Sensor 5
Beacon Superframe
Synchronization
NS=MaxNS
Data Transmission
CCA
Channel Busy or no data packets for transmission
Channel free and data packets for transmission
Sensor
without
data packet
and in idle
state Q0
Sensor with
data packet
and in idle
state Q
0
0,W
0
-1,0,0
0,0,0,0 0,-1,0,0
S
0
1
1-
S
0
m,0,n,0
S
0
m,-1,n,0
1-
m,W
0
-1,n,0
1
,
(1-),(1-)
Pc
1-q0 q0
happens with probability 1. Equation (2) represents the
probability of finding busy channel either in CCA
1
or CCA
2
which is also equal with the probability that a sensor without
any data packet doesnt receive any ACK slip after waiting for
maxdelaytime and of selecting a state uniformly in the next
backoff stage. Equation (3) gives the probability of
unsuccessful transmission after finding an idle channel in both
CCA
1
and CCA
2
, and the sensor picks uniformly a state in the
next retransmission stage. Equations (4) and (5) represent the
probability of going back to the idle stage due to the channel
access failure and retry limits, respectively. Equation (6) is the
probability of going back to the idle stage at backoff counter m
and retransmission stage n, as function of the traffic conditions
q
0
. Equation (7) models the probability of going back to the
first backoff stage from the idle stage. Equation (8) and (9)
represents the probability of going to sleep states from an idle
state. Where, L
0
is the idle state length without generating
packets. Let us assume ,
,
where P
c
is the collision probability. To derive the probability
of and we first need to calculate the value of , probability
that a sensor attempts carrier sensing in a randomly chosen
time slot. The value of depends on P
f
and P
0
, where P
f
is the
failure probability of the transmitted packet and P
0
is the
probability that the chosen sensor is in idle state. The
parameter P
0
is proposed for calculation of using the
following expression:
Similarly, using [5] [8] [12] we derive:
(12)
The value of
1
and
2
are following:
Where L and L
ack
are length of the transmitted data packet and
the length of ACK respectively. The expression for is
following:
The expression for , and form a system of non-linear
equations and should be solved by numerical methods. For
calculation of we need to know the value of
. Now,
Where P
e
is the probability that the sensor does not receive
the packet properly and it is calculated from the basic
parameters of IEEE 802.15.4 standard. From equation (11)
(16) and (17) we can calculate the value of P
f
, P
c,
P
e
and .
Therefore using iterative method we can also find out the
value of P
0
.
a) Calculation of Power Consumption
Power consumption of the backoff stage is given by:
(18)
Power consumption in sleep, P
sp
is ignored as P
sp
0. Power
consumption of the sensing state is following:
Similarly the average power consumption for packet
transmission is given by the following equation:
(
)
So the total power consumed is given by:
So in our protocol the amount of power saved is P
i
(+)
which is approximately (3-4) % of the consumed power. In the
above equations P
i
, P
sc
, P
t
, and P
r
are the average power
consumption in idle state, channel sensing, transmit and
receiving, respectively.
b) Calculation of Reliability:
The term is included in the equation (17) as
for probability and the sensor goes to sleep state.
Therefore collision due to the transmission from that sensor
can be discarded, so the probability for packet collision is
reduced by the aforementioned term. Now, the expression for
reliability is given by:
(22)
Where
and
(23)
Therefore for N number of sensors the throughput of the
system is given by:
Now according to equation (22)
So equation (25) becomes:
(24)
d) Incident of Saturation:
Theorem 1: Saturation of Reliability
Statement: For saturated value of collision probability,
reliability of a sensor network using IEEE 802.15.4 protocol
reaches a saturated value. Further change in offered load
cannot change the value of the reliability.
Proof: From the equations (21), (22) and (23) we can write
that, reliability,
)(
Now putting the values of used MAC parameters of Table 1 in
place of m and n, we get
(
Differentiating equation (27) we get,
[(
) ]
*(
)
(
)+
For the condition of minimum value of reliability R,
(28)
Now for maximum value of P
C
the value of
is closest to
zero.
Now to calculate the maximum value of P
C
we differentiate
the equation (29),
)(
For a maximum or minimum value of P
C
,
. But we
observe that there is no distinct real value of y for which we
get the maximum value of P
C
, therefore we can conclude that
a saturation in the value of
Where
As we have observed that after a certain limit of load , and
P
f
remains in same value as they reach their highest limit.
Therefore we can consider C as a constant which does not
depend on x and y. Using Taylors series expansion we get,
Now neglecting the terms with power 3 or more we get,
Differentiating equation (32) we get,
For maximum value of
. So we get the
following equation:
(34)
Solving equation (34) we get
. So both the
values of x are negative, but from the definition of x, we know
that
. So theoretically value of x cannot be
negative. So there is no distinct maxima or minima for
.
So we can conclude that
sec
A 80 bits/slots
maxdelaytime
sec
sensing time
sec
sigma 4
Figure 4: Per sensor reliability versus per sensor offered load for
20 sensors
Figure 5: Per sensor previous collision probability and
present collision probability versus per sensor offered load
for 20 sensors
Figure 6: Per sensor previous failure probability and present
failure probability versus per sensor offered load for 20
sensors
Figure 7: Per sensor previous and present power
consumption versus per sensor offered load for 20 sensors
Figure 8: Per sensor previous and present throughput versus
offered load for 20 sensors
V. CONCLUSION
0 1000 2000 3000 4000 5000 6000
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
Reliability VS Offered Load for 20 Nodes
Offered Load (bits/sec)
R
e
l
i
a
b
i
l
i
t
y
Existing.Reliability
Proposed.Reliability.simulation
Proposed.Reliability.analytical
0 1000 2000 3000 4000 5000 6000
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Collision Probability VS Offered Load for 20 Nodes
Offered Load (bits/sec)
C
o
l
l
i
s
i
o
n
P
r
o
b
a
b
i
l
i
t
y
Existing.Collision
Proposed.Collision.simulation
Proposed.Collision.analytical
0 1000 2000 3000 4000 5000 6000
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Failure Probability VS Offered Load for 20 Nodes
Offered Load (bits/sec)
F
a
i
l
u
r
e
P
r
o
b
a
b
i
l
i
t
y
Existing.Failure
Proposed.Failure.simulation
Proposed.Failure.analytical
0 1000 2000 3000 4000 5000 6000
30
40
50
60
70
80
90
100
Power consumption VS Offered Load for 20Nodes
Offered Load (bits/sec)
P
o
w
e
r
C
o
n
s
u
m
p
t
i
o
n
(
m
W
)
Existing.E.consump
Proposed.E.consump.simulation
Proposed.E.consump.analytical
0 1000 2000 3000 4000 5000 6000
0
200
400
600
800
1000
1200
1400
1600
1800
2000
Throughput VS Offered Load for 20 Nodes
Offered Load (bits/sec)
T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
)
Existing.Throughput
Proposed.Throughput.simulation
Prposed.Throughput.analytical
In this paper, we have presented an improved protocol of
wireless sensor network based on the IEEE 802.15.4 standard
which provides higher reliability, throughput i.e. Quality of
Service (QoS) and lesser power consumption. For the sake of
simplicity in calculation we have assumed that the network
generates unsaturated traffic. This assumption may differ
when the number of sensors is quite large, but in generally
personal area network does not contain huge number of
sensors so our protocol is applicable in real life scenario. The
simulation results are equivalent with the approximated
results. So the accuracy of our protocol is guaranteed in real
time applications.
REFERENCES:
[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, A
survey on sensor networks, IEEE Com. Mag., vol. 40, no. 8, pp.
102114, August 2002.
[2] IEEE Std 802.15.4-2996, September, Part 15.4: Wireless Medium
Access Control (MAC) and Physical Layer (PHY) Specifications for
Low-Rate Wireless Personal Area Networks (WPANs), IEEE, 2006.
[Online]. Available: http://www.ieee802.org/15.
[3] IEEE 802.15.4 Std: Wireless Medium Access Control (MAC) and
Physical Layer (PHY) Specifications for Low-Rate Wireless Personal
Area Networks (LR-WPANs) IEEE Computer Society Press,
pp. 1679, October 2003.
[4] G. Bianchi, Performance analysis of the IEEE 802.11 distributed
coordination function, IEEE Journal on Selected Areas in
Communications, vol. 18, March 2000.
[5] Park P., Di Marco P., Soldati P., Fischione C. and Johansson,
K.H., A Generalized Markov Chain Model for Effective Analysis of
Slotted IEEE 802.15.4, Mobile Adhoc and Sensor Systems, IEEE
6th International Conference, Macau, pp. 130-139, 2009.
[6] A.Faridi, M.R.Palattella, A.Lozano, M.Dohler, G.Boggia,
A.Grieco, and P.Camarda, Comprehensive Evaluation of the IEEE
802.15.4 MAC Layer Performance with Retransmissions IEEE
Transactions on Vehicular Technology, Volume 59 pp. 3917-3932,
2010.
[7] S. Pollin, M. Ergen, S. C. Ergen, B. Bougard, L. V. D. Perre,
F.Catthoor, I.Moerman, A.Bahai, and P. Varaiya, Performance
analysis of slotted carrier sense IEEE 802.15.4 medium access layer,
IEEE GLOBECOM, 2006, pp. 16.
[8] S. Pollin, M. Ergen, S. C. Ergen, B. Bougard, F. Catthoor,
A.Bahai, and P.Varaiya,Performance analysis of slotted carrier
sense IEEE 802.15.4 acknowledged uplink transmissions, IEEE
WCNC, 2008, pp. 15591564.
[9] P. K. Sahoo and J.P. Sheu, Modeling IEEE 802.15.4 based
wireless sensor network with packet retry limits, in PE-WASUN,
2008, pp. 6370.
[10] IEEE Std 802.11 Wireless LAN Medium Access Control (MAC)
and Physical Layer (PHY) Specifications, IEEE, 1999.
[11] X. Li, D. K. Hunter Four-dimensional Markov Chain Model of
Single-hop Data Aggregation with IEEE 802.15.4 in Wireless Sensor
Networks , Journal on Wireless Networks, Volume 18, pp 469-479,
Springer, 2012.
[12] Z. Xiao, C. He and L. Jiang, Slot-Based Model for IEEE
802.15.4 MAC with Sleep Mechanism, IEEE Communication
Letter, vol. 14, pp. 154-156, February 2010.
[13] P. Park, P. Di Marco, C.Fischione, K.H. Johansson, Modeling
and Optimization of the IEEE 802.15.4 Protocol for Reliable and
Timely Communications, IEEE Transactions on Parallel and
Distributed Systems, Volume 24, pp. 550-564, 2013.