1. 1 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

2. 2 Outline Introduction Related Work Radio Model and Topology Network Of PECRP Assumptions of PECRP and Proofs PECRP Algorithm Details Simulation and Comparison

3. Introduction Wireless Sensor Network faces a challenge in energy consumption 。 3

4. Related Work Low-Energy Adaptive Clustering Hierarchy(LEACH) Power-Efficient Gathering in Sensor Information Systems(PEGASIS) Hybrid Energy-efficient Distributed Clustering Approach(HEED) 4

5. Radio Model and Topology Network Of PECRP A. Radio Model E Tx-elec and E Rx-elec express the startup energy of transmitting and receiving separately k expresses the amount of transmitting data d expresses the transmitting distance E elec 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 E RX expresses the receiving consumption 5

6. Radio Model and Topology Network Of PECRP Topology Network 6

7. 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

8. Assumptions of PECRP and Proofs B. Proofs E TX (1,d AB )=kε fs d 2 AB =d 2 =E AB E TX (1,d AC )=kε fs d 2 AC =d 2 =E AC E TX (1,d CB )=kε fs d 2 CB =d 2 =E CB ∵ d 2 AB = d 2 AC +d 2 CB -2d AC ×d CB ×cos ∠ ACB and ∠ ACB >π/2 ∴ cos ∠ ACB <0 ∴ d 2 AB >d 2 AC +d 2 CB ∴ E AB >E AC +E CB 8

9. Assumptions of PECRP and Proofs E AB >E AD +E DB and E AD >E AC +E CD E AB >E AC +E CD +E DB 9

10. Assumptions of PECRP and Proofs (A to N i ) d 2 AN i >d 2 AN 1 +d 2 N 1 N 2 +…+d 2 N i-2 N i-1 + d 2 N i-1Ni E ANi >E AN 1 +E N 1 N 2 +…+E N i-1 N i (A to B) d 2 AB >(d 2 AN 1 +d 2 N 1 N 2 +…+d 2 N i-1 N i )+d 2 N i B E AB >(E AN 1 +E N 1 N 2 +…+ E N i-1 N i )+E N i B 10

11. PECRP Algorithm Details A. Electing CHs phase 1.In electing CHs phase, BS sends “selecting head”, its location ( ) and serial numbers of nodes to all the sensor nodes in WSN. 11

12. 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 E current expresses nodes energy E max expressed initial energy d iB expresses distance from point i to BS d BASE is 5000m 12

13. 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 to BS. If the normal nodes receive “ADD”, they join the corresponding cluster and return “REQ” to the CHs. C. Data transmissions phase 13

14. PECRP Algorithm Details 14

15. 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

16. Q&A 16