Professional Documents
Culture Documents
Error Control Borelli PDF
Error Control Borelli PDF
Error Control Borelli PDF
Marcelo E. Pellenz
Graduate Program in Computer Science
Pontifical Catholic University of Paran
PPGIA - PUCPR
marcelo@ppgia.pucpr.br
I. INTRODUCTION
NETWORKS
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2007 proceedings.
2
dn
...
sink
d1
...
PER f = 1 f ( f ) 1 p ( f ) d
0
PER r = 1 f ( r )[1 p ( r )] d r
0
(1)
H +n
=1
(7)
N = p N [n ] n
(2)
(9)
n =1
where b is the size of the packet in bits, f(f) and f(r) are the
probability density functions and f and r are the signal-tonoise ratio (SNR) of the forward and reverse channels,
respectively. The variable p( f ) is the bit error probability of
the forward channel and p( r ) is the bit error probability of
the reverse channel.
The forward channel is used to send data packets and the
reverse channel indicates the success or not of a packet
transmission (for ARQ systems). The bit error probabilities
p( f ) and p( r ) can be evaluated using an expression of
symbol error probability of the modulation used in the sensor
network. The modulation type used in a sensor network
depends on the wireless technology (Bluetooth, IEEE
802.15.4, etc.). When channel coding is used, such as block or
convolutional codes, the packet error rates PERf and PERr are
evaluated in a different manner. Some examples are given in
Section IV.
3896
Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR. Downloaded on September 11, 2009 at 02:47 from IEEE Xplore. Restrictions apply.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2007 proceedings.
H = p H [ h] h
(17)
h =1
CRC
Yes
No
Yes
Yes
Yes
No
3897
Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR. Downloaded on September 11, 2009 at 02:47 from IEEE Xplore. Restrictions apply.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2007 proceedings.
Scheme
ADP1
ADP2
Other Hops
DH1
DH1
1 2 2
p( ) = Q1 (a, b) e ( a + b ) / 2 I o ( ab )
2
k =0
Since the return packet also has an access code of 72 bits,
the probability for the event D has the same form of event A,
P[ D ] =
] [
72 T
72
k [ p ( ) ] [1 p ( ) ]
72 k
(21)
k =0
{
P[ E ] = {3 p(
}
)] }
18
(22)
(23)
)[1 p ( r )] 2 + [1 p ( r
The most probable error is that defined by event C. For
DHx, AUX1 and AUX2 packets it occurs when any of the
data bytes were received with error:
b
(24)
P[ C ] = [1 p ( f ) ] ,
where b is the size of the payload in bits. For DMx and HAMx
packets the data are protected by a Hamming code, where B is
the number of blocks with 10 bits. The probability of event C
for the DMx and HAMx packets is:
3 18
(25)
] [
(27)
PER r = 1 f ( r ) P[ D] P[ E] d r
0
(28)
(29)
(34)
E dh1 = H n pac N [nbits + nbits 0.75] p h 5
where H is the number of the remaining hops of the network,
nbits is the number of bits of the DH1 packet and ph5 is the
probability that the HAM2 packet arrives correctly at the
receiver after the fifth hop, given by:
3
(35)
p h 5 = (1 PER f ) p h 2
The number of transmitted packets with error is the sum of
errors occurred in the transmissions of the AUX2 and HAM2
packets, as the DH1 packet will always be retransmitted until
it is correctly received:
(36)
n error = n error _ aux 2 + nerror _ ham 2
The number of errors of the AUX2 packet is the product of
the total number of transmitted packets npac and the probability
of error of the AUX2 packet in two hops:
(37)
n error _ aux 2 = [1 (1 PER f ) 2 ] n pac
3898
Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR. Downloaded on September 11, 2009 at 02:47 from IEEE Xplore. Restrictions apply.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2007 proceedings.
1
0,8
B CH-30dB
0,6
B CH-20dB
B CH-10dB
0,4
A UX1-30dB
A UX1-20dB
A UX1-10dB
0,2
0
1
10
13
16
19
22
25
hops
V. ANALYTICAL RESULTS
0,8
DH1-30 dB
0,6
DH1-20dB
DH1-10dB
A DP 1-30dB
0,4
A DP 1-20dB
A DP 1-10dB
0,2
0
1
10
13
hops
16
19
22
25
3899
Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR. Downloaded on September 11, 2009 at 02:47 from IEEE Xplore. Restrictions apply.
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2007 proceedings.
DM1
DH1
0,8
AUX1
HAM
BCH
0,6
0,4
BCH2
BCH3
0,2
HAM2
AUX2
ADP1
0
10
20
30
ADP2
40
SNR (dB)
VI. CONCLUSION
In this paper the energy efficiency of error control schemes
for wireless sensor networks in Nakagami-m fading channels
was analyzed. A novel analytical model was presented and
applied to error control strategies for Bluetooth sensor
networks. The results have shown that the channel conditions
and the number of hops of the network affect the energy
efficiency. Nevertheless, the energy efficiency of Bluetooth
packets with ARQ remains constant with the increase of hops.
For good channel conditions the packets with little or no error
protection present the best energy efficiency. For low values
of SNR and m the BCH packet is the most efficient, because
of its ability to correct more errors. In intermediary situations
the adaptive schemes have the best performance. The
analytical model presented in this paper, as well as the error
control schemes, may be adapted to other technologies for
wireless sensor networks.
REFERENCES
0,8
1ho p
0,6
2 ho ps
5 ho ps
0,4
10 ho ps
15 ho ps
25 ho ps
0,2
0
10
20
SNR (dB)
30
40
0,6
5 ho ps
10 hops
15 hops
0,4
25 ho ps
0,2
0
10
20
SNR (dB)
30
40
B CH,m=0.5
B CH,m=1
B CH,m=1.5
0,4
A DP 1,m=0.5
A DP 1,m=1
A DP 1,m=1.5
0,2
0
10
20
30
40
SNR (dB)
Figure 7. Energy efficiency for BCH packet and ADP1 scheme for
different values of m
3900
Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR. Downloaded on September 11, 2009 at 02:47 from IEEE Xplore. Restrictions apply.