Download d 2 AB

Power-efficient Clustering Routing Protocol Based
on Applications in Wireless Sensor Network
Authors: Tao Liu and Feng Li
Form: International Conferecnce Wireless Communications
Networking and Mobile Computing, pp.1-6, 24-26 Sept.
2009.
Speaker： Zheng-Feng Yang
Date：2013/05/23
1
Outline
Introduction
Related Work
Radio Model and Topology Network Of PECRP
Assumptions of PECRP and Proofs
PECRP Algorithm Details
Simulation and Comparison
2
Introduction
Wireless Sensor Network faces a challenge in energy
consumption。
3
Related Work
Low-Energy Adaptive Clustering Hierarchy(LEACH)
Power-Efficient Gathering in Sensor Information
Systems(PEGASIS)
Hybrid Energy-efficient Distributed Clustering
Approach(HEED)
4
Radio Model and Topology Network Of PECRP
A. Radio Model
ETx-elec and ERx-elec express the startup energy of transmitting and receiving separately
k expresses the amount of transmitting data
d expresses the transmitting distance
Eelec express the startup energy of transmitting and receiving separately
ΕTX-amp depends on the transmission distance and data size
εfs express amount of energy consumption for free space
εmp express amount of energy consumption for multipath fading
ERX expresses the receiving consumption
5
Radio Model and Topology Network Of PECRP
Topology Network
6
Assumptions of PECRP and Proofs
A. Assumptions of PECRP
1) To BS, this paper assumes that the energy supplied to
BS is limitless.
2) To sensor nodes, this paper assumes that the initial
energy in nodes is the same.
3) All the nodes in WSN are fixed and far to BS, or the
landform is complex.
4) PECRP is a routing protocol in network layer, and
this paper only discusses in network layer.
7
Assumptions of PECRP and Proofs
B. Proofs
ETX(1,dAB)=kεfsd2AB=d2=EAB
ETX(1,dAC)=kεfsd2AC=d2=EAC
ETX(1,dCB)=kεfsd2CB=d2=ECB
∵ d2AB= d2AC+d2CB-2dAC ×dCB ×cos ∠ACB
and ∠ACB >π/2
∴cos ∠ACB <0
∴d2AB>d2AC+d2CB
∴EAB>EAC+ECB
8
Assumptions of PECRP and Proofs
EAB>EAD+EDB and EAD>EAC+ECD
EAB>EAC+ECD+EDB
9
Assumptions of PECRP and Proofs
(A to Ni)
d2ANi>d2AN1+d2N1N2+…+d2Ni-2Ni-1+ d2Ni-1Ni
EANi>EAN1+EN1N2+…+ENi-1Ni
(A to B)
d2AB>(d2AN1+d2N1N2+…+d2Ni-1Ni)+d2NiB
EAB>(EAN1+EN1N2+…+ ENi-1Ni )+ENiB
10
PECRP Algorithm Details
A. Electing CHs phase
1.In electing CHs phase, BS sends “selecting head”, its
location (<XBS,YBS>) and serial numbers of nodes to
all the sensor nodes in WSN.
diB 
( Xi  XBS ) 2  (Yi YBS ) 2
11
PECRP Algorithm Details
p expresses the percentage of
CHs in all nodes
r expresses the rounds
G expresses a set that contains
the nodes which did not shoulder
CHs ever before
b expresses the serial numbers of
nodes
Ecurrent expresses nodes energy
Emax expressed initial energy
diB expresses distance from point
i to BS
dBASE is 5000m
12
PECRP Algorithm Details
B. Formatting cluster phase
After electing CHs based on TPECRP (n), each CH sends the information that
contains being CH and its location <Xi ,Yi> to BS.
If the normal nodes receive “ADD”, they join the corresponding cluster and return
“REQ” to the CHs.
C. Data transmissions phase
13
PECRP Algorithm Details
14
Simulation and Comparison
In summary, we can get that PECRP has better
performances than LEACH in lifetime of WSN, the
amount of data transmission and transmitting
efficiency.
15
Q&A
16