.

RESEARCH PAPERS
.
SCIENCE CHINA
Information Sciences
November 2010 Vol. 53 No. 11: 23232331
doi: 10.1007/s11432-010-4079-5
c Science China Press and Springer-Verlag Berlin Heidelberg 2010 info.scichina.com www.springerlink.com
An analytical model for SMAC protocol in
multi-hop wireless sensor networks
LUO Jun, JIANG LingGe

& HE Chen
Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200240, China
Received September 11, 2009; accepted May 30, 2010; published online September 14, 2010
Abstract Considering the active/sleep dynamics and the contention backo scheme of SMAC protocol in
multi-hop wireless sensor networks (WSNs), we model each node as a nite single server queue with server
shutdown, and model each nodes states as a two-dimensional continuous-time Markov chain. Based on the
model, we derive the network performance in terms of average packet loss ratio, network throughput, average
packet delay and average power consumption. Experiment comparisons show that the analytical results match
well with the simulation results, which validates the accuracy of the analytical model. Furthermore, using
the analytical model can enable us to investigate the performance tradeo between energy eciency and QoS
requirement, and give us theoretical insight into the optimal parameters such as duty cycle, mean active period
and buer size in multi-hop wireless sensor networks.
Keywords multi-hop wireless sensor networks, Markov chain, energy eciency, QoS
Citation Luo J, Jiang L G, He C. An analytical model for SMAC protocol in multi-hop wireless sensor networks.
Sci China Inf Sci, 2010, 53: 23232331, doi: 10.1007/s11432-010-4079-5
1 Introduction
A wireless sensor network (WSN) is a special Ad Hoc network which consists of a large number of
sensor nodes to carry out data sensing and transmitting applications. Each sensor node is normally a
micro-embedded system with data sensing, information processing and wireless transmitting function.
It transmits the sensed data to the sink node in a multi-hop self-organized manner. Typically, sensor
node is very small and battery-powered with limit energy resource. Therefore making an ecient use
of the available energy is critical [1, 2]. Much work has been done to address this issue, and a lot of
energy-ecient MAC protocols [37] have been proposed. An eective way among them to improve the
energy eciency is to allow each node to enter a periodical active/sleep mode, which can largely reduce
the energy consumption for idle listening. SMAC (Sensor MAC) protocol is a typical one that uses
a periodical active/sleep mechanism under low duty cycle. It takes carrier sense multiple access with
collision avoidance (CSMA/CA) technique based on the IEEE 802.11 distributed coordination function
(DCF), and lets node work on low duty cycle state and sleep more time to reduce energy consumption.
With the development of WSN applications, it is also important to satisfy the network QoS (quality
of service) performance, such as real time and reliability. For example, the packet latency and loss ratio

Corresponding author (email: lgjiang@sjtu.edu.cn)

2324 LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11
are crucial in WSN applications for forest re monitoring and target tracking. Clearly, a tradeo exists
between energy eciency and QoS guarantees [8]. Accurate network modeling can help us to analyze
network performance and reveal the dependency of network performance on the system parameters, which
is very crucial for the network optimization and performance improvement.
So far, some work has been done on network performance modeling in WSNs. With regard to MAC
with sleep mechanism, ref. [9] proposes an elementary network analysis model; however, it is not suitable
for some special MAC protocols as it is a common model and ignores some protocol details such as
backo scheme. In [10], an M/G/1 queuing model for single-hop WSNs with SMAC protocol is proposed
using the classical Bianchi model [11] for IEEE 802.11 MAC. Although it can accurately model single-hop
WSNs with SMAC, it is not immediately applicable to multi-hop WSNs due to the modeling limitation
of Bianchi model.
Inspired by all the aforementioned work, this paper aims at developing an accurate performance model
for multi-hop WSNs with SMAC protocol, which can take the node active/sleep and contention backo
mechanism into account. In this model, each node is regarded as a nite single server queue with server
shutdown and the node state is modeled as a two-dimension continuous-time Markov chain (CTMC).
Then the performance of energy eciency and QoS can be obtained using this model. The comparison of
the analytical and simulation results shows that the proposed model enables us to investigate the network
performance including energy eciency and QoS with the SMAC parameters, and theoretically helps us
to optimize the MAC parameters.
2 System model
Consider a WSN composed of N sensor nodes randomly scattered over an area. In this paper, the node
mobility is not included. Each node transmits its sensed data information to the sink node via multi-hop
communications.
2.1 Node data ow model
As we know, each node can generate data packet as a generator and relay data packet for other nodes
as a router. We assume that sensor node i generates packets according to a Poisson process with rate

g,i
, and relay packets according to a Poisson process with rate
r,i
. The generated and relayed data of
sensor nodes are organized into data packets with a xed size. All the packets enter the nite buer of
sensor node and wait for the immediate transmission under the rst-in-rst-out (FIFO) discipline without
prioritization. For simplicity, assume that each node is under saturated conditions that the node buer
always has data packet for transmission.
From the viewpoint of energy consumption, transceiver is the major part for energy consumption.
Energy consumption can be largely reduced by shutting down the transceiver. In SMAC, each sensor
node alternates between active (A) state and sleep (S) state. In the active state, nodes turn on their
radio transceivers to communicate with one another. In the sleep state, the transceiver is shut down
and no packet transmission can be started. Especially, we consider in this paper that the sensing and
processing units are still working in sleep state for some real-time applications. Thus from the additive
property of Poisson ows, the arrival packet of node i in active state follows a Poisson process with rate

a,i
=
g,i
+
r,i
, and that in sleep state follows a Poisson process with rate
s,i
=
g,i
.
2.2 Node queuing model
We consider each node as a nite single server queue with server shutdown. For simplicity, assume that
the time duration of the active and sleep state is exponentially distributed with mean and T
a
of T
s
. We
can use a CTMC to model the node state. a =
1
Ta
is the transition rate from active state to sleep state,
and s =
1
Ts
is the transition rate from sleep state to active state. We denote the state space of node
i by {A
k
, S
k
, k = 1, , K}, where A
k
and S
k
denote the active state and sleep state with k packets
in the node is buer. K is the maximum number of packets in its buer. Note that each node is in
LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11 2325
Figure 1 Node is state transition diagram.
the saturated condition, and the case k = 0 can be ignored. Therefore the state transition process of
node i can be represented as a two-dimension CTMC, and the state transition diagram can be shown in
Figure 1.
Let p
k
a.i
denote the probability at which node i is in active state with k packets in its buer. Corre-
spondingly, p
k
s.i
denotes the probability at which node i is asleep with k packets in its buer. From the
state transition diagram in Figure 1, we can derive the node steady-state balance equations as follows:
_
(a +
a,i
)p
1
a,i
= sp
1
s,i
+
i
p
2
a,i
,
(s +
s,i
)p
1
s,i
= ap
1
a,i
,
(1)
_
(a +
a,i
+
i
)p
k
a,i
=
a,i
p
k1
a,i
+sp
k
s,i
+
i
p
k+1
a,i
,
(s +
s,i
)p
k
s,i
= ap
k
a,i
+
s,i
p
k1
s,i
,
k = 2, . . . , K 1. (2)
_
(a +
i
)p
K
a,i
=
a,i
p
K1
a,i
+sp
K
s,i
,
sp
K
s,i
= ap
K
a,i
+
s,i
p
K1
s,i
.
(3)
2.3 Service time distribution
We dene the service time T
ser,i
for each packet at node i as the time from the moment the packet is at
the head of the queue in active state, until an acknowledgement (ACK) for this packet is received. Here
we should notice that the delay time in sleep state is not included in T
ser,i
. In the balance equations in
subsection 2.2, there are still two unknown variables:
i
and
a,i
. The state transition rate
i
can be
obtained by
i
=
1
E[Tser,i]
, related with the node contention back-o mechanism in SMAC.
a,i
is the
function of the relayed data rate
r,i
, related with the network topology and routing protocol. We give
the solution of
i
in the following, which is equivalent to the solution of the mean of T
ser,i
. The solution
of
a,i
will be given in section 3.
In this paper, we assume that no packet error occurs in the wireless transmission and there is no packet
retransmission
1)
. Dene p
t,i
as the successful transmission probability of node i in a cycle time T
cycle
. In
SMAC, if node i wins the channel in a cycle, it will immediately transmit a packet after the contention
time T
c
. The transmission rate is xed at
0
bit per second (bps), and the transmission time is
1
0
. If
node i fails to win the channel, it will sleep after the contention time T
c
. The contention time T
c
is a
xed value which includes the synchronization time, back-o time, RTS and CTS time. The ACK packet
reception time is assumed as T
ACK
. Furthermore, the timing diagram [3] of each portion in a cycle in
SMAC can be given in Figure 2.
As node is in saturated condition, the service time T
ser,i
approximately follows a geometrical distribu-
tion:
p
_
T
ser,i
=
1

0
+T
ACK
+jT
c
_
= p
t,i
(1 p
t,i
)
j1
, j = 1, 2, . . . . (4)
From eq. (4), we can obtain the mean of the service time T
ser,i
:
E[T
ser,i
] =
1

0
+T
ACK
+
T
c
p
t,i
. (5)
1) In fact, this model can be extended to the case of packet retransmission. We do not discuss this case here due to the
paper limitation
2326 LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11
Figure 2 Timing diagram of each portion in a cycle in SMAC.
Note that the cumulative distribution function (CDF) of geometrical distribution is closer to that of
exponential distribution. For simplicity, we can approximate T
ser,i
as an exponential distribution with
the same mean E[T
ser,i
], which is given by (5).
Note that p
t,i
is unknown to eq. (5). Now we give its determination based on the SMAC contention
back-o mechanism. In SMAC [3], to keep nodes stay more in listening state and avoid the communication
disable case caused by node asynchronous sleeping, nodes form dierent virtual clusters with the nodes
in the same virtual cluster following the same active/sleep schedule and wake up at the same time.
The boundary node between two virtual clusters can follow both schedules to keep the communications
between virtual clusters. In this way, network delay can be largely reduced and the network energy
eciency can be eectively improved. For each node i in a virtual cluster, if it is in active state A, nodes
in the same virtual cluster must be in the same active state A. That is to say, if node i is in active
state and wins the channel, it will transmit a packet to its next-hop node. Thus, the case where node
i can successfully transmit a packet in a cycle is equivalent to the case where the rst node is in the
virtual cluster whose back-o counter reaches zero. SMAC takes a random back-o scheme to compete
for the channel. The back-o time is a random number with a discrete uniform distribution between 0
and CW 1 with equal probabilities, where CW is the contention window size. The back-o counter is
decreased by one when a back-o time elapses. When the back-o counter reaches zero, the node wins
the channel. Thus p
t,i
can be obtained as follows:
p
t,i
=
CW2

l=0
1
CW
_
CW1

m=l+1
1
CW
_
ni
=
CW2

l=0
1
CW
_
CW l 1
CW
_
ni
, (6)
where n
i
is the node number in the node is virtual cluster competing for the channel, which is equivalent
to the neighboring node number in the same virtual cluster in saturated condition. Note that in saturated
condition, node i cannot win the channel to transmit the packet when choosing CW 1 as its back-o
counter. This is because the back-o counter of other nodes cannot be larger than CW 1. Even for
CW 1 case, collision will happen and no node can successfully transmit a packet. Therefore in (6), the
case of CW 1 is not considered. Now we can obtain the mean of the service time T
ser,i
of node i by the
combination of (5) and (6).
3 Network performance analysis
3.1 Node steady-state probability
From the steady-state balance equations in subsection 2.2, the steady-state probability of node i can be
obtained:
(1) The probability that k (k = 1, . . . , K) packets are in the node is buer with node i in active state
and sleep state, p
k
a,i
and p
k
s,i
respectively:
_
p
1
a,i
p
1
s,i

T
= (I +G+ +G
K2
+HG
K2
)
1
_
s
a +s
a
a +s
_
T
, (7)
_
p
k
a,i
p
k
s,i

T
= G
k1
(I +G+ +G
K2
+HG
K2
)
1
_
s
a +s
a
a +s
_
T
, k = 2, . . . , K 1, (8)
_
p
K
a,i
p
K
s,i

T
= HG
K2
(I +G+ +G
K2
+HG
K2
)
1
_
s
a +s
a
a +s
_
T
, (9)
LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11 2327
where
G =

a,i

s,i

i
a
a,i
(s +
s,i
)
i
(a +
i
)
s,i
(s +
s,i
)
i

, H =

a,i

s,i

i
a
a,i
s
i
(a +
i
)
s,i
s
i

, I =
_
1 0
0 1
_
.
Note that G and H are related to
a,i
and
s,i
, also to
g,i
and
r,i
.
g,i
is determined by the network
applications and assumed to be xed in this paper.
r,i
is related to the network topology and routing
protocol mentioned in subsection 2.3, and its solution will be given in subsection 3.2.
(2) The probability that node i is in active and sleep state, p
a,i
and p
s,i
respectively:
p
a,i
=
K

k=1
p
k
a,i
=
s
a +s
, (10)
p
s,i
=
K

k=1
p
k
s,i
=
a
a +s
. (11)
3.2 Network ow balance equation for
r,i
In this section, the mean of relay data rate
r,i
of node i can be solved. As we know, the choice
of next-hop node in the routing protocol has signicant eect on the relay data rate. In the routing
policy, node often chooses one node from all possible nodes as the next-hop node to minimize some costs
(such as energy consumption and hop numbers). In this paper, we consider a static WSN in which the
network initialization is nished and the topology and routing information are determined. That is to
say, the next-hop nodes are determined and have no large changes. Dene
1
and
2
as row vectors
containing
g,i
and
r,i
of all nodes (i = 1, . . . , N), respectively, that is,
1
= [
g,1
,
g,2
, . . . ,
g,N
] and

2
= [
r,1
,
r,2
, . . . ,
r,N
]. The network ow balance equation can be obtained as

2
= (
1
+
2
)T, (12)
where T is the routing matrix whose element t
ij
represents the fraction of outgoing trac of node i
forwarded to its next-hop j. When the routing policy and next-hop node are determined, t
ij
can be
obtained with the following formula:
t
ij
=
_
1, node j is the next-hop node of node i,
0, node j is not the next-hop node of node i.
(13)
By solving the ow balance equations in (12), we can obtain the
r,i
of all nodes. Therefore the steady-
state probability of all nodes in subsection 3.1 can be given.
3.3 Network performance analysis
In the above sections, the node state is modeled as a two-dimension CTMC and the node steady-state
probabilities are given. Using these results, the network performance metrics, including average packet
loss ratio, network throughput, average packet delay and average network power consumption, are de-
duced in this section.
3.3.1 Average packet loss ratio
Under the assumption of no wireless transmission error, packet loss is caused by overow of nodes buer
in our model. Thus the average packet loss ratio of the whole network can be derived as
p
loss
=

N
i=1
(p
K
a,i

a,i
+p
K
s,i

s,i
)

N
i=1

g,i
, (14)
where p
K
a,i
and p
K
s,i
can be obtained by eq. (9).
2328 LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11
3.3.2 Network throughput
Network throughput is the overall eective packet generation rate of all the nodes, denoted by C:
C =
N

i=1

g,i

N

i=1
(p
K
a,i

a,i
+p
K
s,i

s,i
). (15)
Note that the packet dropped by buer overow is subtracted in (15). Furthermore, we can see that the
network throughput in (15) and average packet loss ratio in (14) can be deduced from each other.
3.3.3 Average packet delay
Assume that the mean number of packets in the buer of node i is k
i
, which can be calculated as
k
i
=
K

k=1
kp
k
a,i
+
K

k=1
kp
k
s,i
= [1, 1](I + 2G+ + (K 1)G
K2
+KHG
K2
)
_
p
1
a,i
p
1
s,i
_
. (16)
From Littles law [12] of the whole network, the average packet delay can be given by
D
net
=

N
i=1
k
i
C
. (17)
3.3.4 Average network power consumption
In this paper we use the average network power consumption to express network energy eciency. The
average power consumption of node i can be divided into three parts. The rst part is the power
consumption of the sensing and processing units, which is PW
a
in the active state A and PW
s
in the
sleep state S. The power consumption of this part can be expressed as p
a,i
PW
a
+p
s,i
PW
s
. The second
part is the transceivers power consumption in transmission, reception and idle periods, denoted by
PW
tran
, PW
recv
and PW
idle
, respectively. Here we consider the transceiver works on half-duplex mode
which node cannot send and receive simultaneously. The third part is the power consumption during
transition from sleep state to active state, i.e. power consumption due to the start of electronic device.
As the state transition only occurs once in a cycle, the power consumption of this part can be expressed
as
Etr
T
cycle
, where E
tr
is the energy consumption caused by the start of electronic device, T
cycle
=
1
a
+
1
s
.
We focus on the power consumption of the second part.
As node i is assumed to be in saturated condition, the probability in transmission state is p
t,i
p
a,i
, and
the corresponding power consumption can be calculated as p
t,i
p
a,i
PW
tran
. And as the node transceiver is
on half-duplex state, the probability of the node i in reception and idle state is p
a,i
p
t,i
p
a,i
. In reception
state, the mean data rate relayed by node is pre-hop node is
r,i
, and the transmission data rate is
0
.
Thus the probability of node i in reception state and idle state can be calculated as (p
a,i
p
t,i
p
a,i
)
r,i
0
and (p
a,i
p
t,i
p
a,i
)(1
r,i
0
). Note that
r,i
in this paper are all less than
0
; otherwise the node queue
system will be unsteady. Then the power consumption of the second part can be calculated as
p
t,i
p
a,i
PW
tran
+ (p
a,i
p
t,i
p
a,i
)

r,i

0
PW
recv
+ (p
a,i
p
t,i
p
a,i
)
_
1

r,i

0
_
PW
idle
. (18)
The power consumption of node i can be expressed as
PW
i
= p
a,i
PW
a
+p
s,i
PW
s
+p
t,i
p
a,i
PW
tran
+ (p
a,i
p
t,i
p
a,i
)

r,i

0
PW
recv
+ (p
a,i
p
t,i
p
a,i
)
_
1

r,i

0
_
PW
idle
+
E
tr
T
cycle
. (19)
The average power consumption of the whole network can be deduced as follows:
PW
net
=
N

i=1
PW
i
N
. (20)
LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11 2329
4 Simulation results
In this section, we compare the analytical network performance results against the network simulation
results to validate the accuracy of the analytical model. The relationship between network energy e-
ciency and QoS tradeo and network protocol parameters (such as duty cycle, and buer size K) can be
also explored. The simulation results are presented on NS-2. In the simulations, 100 nodes are uniformly
deployed in a 500 m 500 m area. The maximal transmission range is set at r =100 m. We run SMAC in
the simulation and nd that the whole network is divided into 12 virtual clusters after the initialization
procedure in subsection 2.3 by analyzing the trace le. Each virtual cluster contains 810 nodes and
each node keeps the same active/sleep schedule in a same virtual cluster. We use GEAR (geographic and
energy aware routing) [13] as the routing protocol in the simulation, which is integrated in NS-2. GEAR
uses energy and distance as the criteria based on the node position. It can eectively reduce the routing
overhead and improve the network lifetime which is well suit for WSN. Other simulation parameters in the
simulations are set at: CW=64, T
c
= 16 ms, T
ACK
=0.8 ms, PW
a
= 15 mW, PW
s
=10 mW, PW
tran
=500
mW, PW
recv
=300 mW, PW
idle
= 250 mW, E
tr
=0.025 mJ,
0
= 48 packet/s,
g,1
= =
g,N
= 1
packet/s, the packet size is set at 50 bytes.
Figure 3 presents the analytical and simulation results of average packet delay and average power
consumption with dierent values of the duty cycle. The duty cycle of node i is dened as the portion of
the active time to the cycle time, which is equal to P
a,i
. In the simulation, the duty cycle is from 20%
to 90%, and the buer size is K = 14. We can see from Figure 3 that the analytical results of average
packet delay match well with the simulation results. And the analytical results of average network power
consumption can also express the simulation results although there is a gap between them. Especially,
the gap exists as we do not consider the power consumption of the control packet such as synchronization
packet, RTS and CTS packet in the analysis in subsection 3.3.4. It does not aect the accuracy of the
model as a systematic error. Thus using the analytical results can accurately predict the delay and power
consumption metrics with dierent duty cycles. Clearly, we can see from the analytical and simulations
results that as the duty cycle increases, the average packet delay decreases at the expense of higher
average power consumption, i.e. a performance tradeo. The intersection point of the analytical and
simulation curves is closely matched in axes of duty cycle, which shows the accuracy of the model in
choosing proper duty cycles for energy and delay tradeo.
Figure 4 shows the dependency of average packet loss ratio on the duty cycle. The duty cycle and
buer size is set the same as that in Figure 3. We can see that the packet loss ratio decreases with the
increase of duty cycle and buer size. This is because the decrease of the sleep time helps to reduce
the packet stay time in the queue. It can be also concluded that there is also a tradeo between packet
loss ratio and energy eciency. We can also see from Figure 4 that the analytical results of average
packet delay match well with the simulation results, which validates the accuracy of the model. Also we
can nd that the network average packet loss ratio levels out to zero when the duty cycle is larger than
50%. Using the analytical model, we can properly choose the optimal value of duty cycle for the tradeo
between energy eciency and QoS guarantees. It should be noted that the network throughput case is
not presented here as it can be deduced from the network packet loss ratio.
Figure 5 gives the dependency of the analytical and simulation results of average packet loss ratio on
the buer size K. In this simulation, the duty cycle is set at 30%. We can see that the network average
packet loss ratio decreases with the increase of the buer size K. The good match of the analytical
and simulation results also validates the accuracy of the model. From Figure 5 we can nd that in this
simulation, when the buer size K is larger than 20, the curve of average packet loss ratio levels out to
zero. Using this model, we can properly choose the buer size K for each node, which is very useful to
the buer saving and cost reducing for sensor node.
In a word, using the proposed analytical model, we can accurately obtain the network performance
of multi-hop WSN with SMAC protocol. Furthermore, it can eectively explore the tradeo between
network energy eciency and QoS performance, which provide us a theoretical way for parameter opti-
mization.
2330 LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11
Figure 3 Tradeo between average packet delay and power consumption with dierent duty cycles (K=14).
Figure 4 Impact of duty cycle on packet loss ratio (K=14). Figure 5 Impact of buer size K on average packet
loss ratio (duty cycle =30%).
5 Conclusions
In this paper, we study the multi-hop WSN with SMAC and model each sensor node as a single server
queue with server shutdown by considering the node sleep and contention back-o mechanisms. The
node state is modeled as a two-dimension CTMC and the network performance is given based on the
proposed model. By comparison with the simulation results, the model can accurately give the network
performance in terms of average packet loss ratio, network throughput, average packet delay and average
network power consumption, which validates the accuracy of the model. Furthermore, using the analytical
model, we can investigate the impact of duty cycle and node buer size K on the network performance
tradeo, which provides us strong insight into the protocol design and parameter optimization.
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant Nos. 60772100, 60872017,
60832009).
References
1 Akyildiz I F, Su W, Sankarasubramaniam Y, et al. A survey on sensor networks. IEEE Commun Mag, 2002, 40: 102114
2 Tang Q L, Yang L Q, Qin T F, et al. Energy-saving PPM scheme for WSNs. Sci China Ser F-Inf Sci, 2008, 51: 571585
LUO Jun, et al. Sci China Inf Sci November 2010 Vol. 53 No. 11 2331
3 Ye W, Heidemann J, Estrin D. Medium access control with coordinated adaptive sleeping for wireless sensor networks.
IEEE/ACM Trans Network, 2004, 12: 493506
4 Injong R, Warrier A, Aia M, et al. Z-MAC: A hybrid mac for wireless sensor networks. IEEE/ACM Trans Network,
2008, 16: 511524
5 Ye W, Silva F, Heidemann J. Ultra-low duty cycle mac with scheduled channel polling. In: Proceedings of the Fourth
ACM SenSys Conference, Boulder, Colorado, USA, 2006. 321333
6 Dam T V, Langendoen K. An adaptive energy-ecient MAC protocol for wireless sensor networks. In: The First ACM
Conference on Embedded Networked Sensor Systems, Los Angels, CA, USA, 2003. 171180
7 Jamieson K, Balakrishnan H, Tay Y C. Sift: A MAC protocol for event-driven wireless sensor networks. MIT Technical
Report, LCS-TR-894, 2003
8 Martinez J F, Garcia A B, Corredor I, et al. Trade-o between performance and energy consumption in wireless sensor
networks. Lecture Notes in Computer Science, 2007, 4725: 264271
9 Chiasserini C F, Garetto M. An analytical model for wireless sensor networks with sleeping nodes. IEEE Trans Mobile
Comput, 2006, 5: 17061718
10 Zhang Y, He C, Jiang L G. Performance analysis of S-MAC protocol under unsaturated conditions. IEEE Commun
Lett, 2008, 12: 210212
11 Bianchi G. Performance analysis of the IEEE 802.11 distributed coordinated function. IEEE J Select Areas Commun,
2000, 18: 535547
12 Robertazzi T G. Computer Networks and Systems: Queueing Theory and Performance Evaluation. New York: Springer-
Verlag World Publishing Corp., 1990
13 Yu Y, Estrin D, Govindan R. Geographical and energy-aware routing: a recursive data dissemination protocol for wireless
sensor networks. UCLA Comp. Sci. Dept. Technical Report, UCLA-CSD TR-010023, May 2001