1 / 27

Load-Balanced Clustering in Wireless Sensor Networks

Load-Balanced Clustering in Wireless Sensor Networks. Gaurav Gupta and Mohamed Younis IEEE International Conference on Communications, 2003. (ICC 2003) Bao-Hua Yang. Outline. Introduction Network model Load-Balanced clustering Simulation Conclusion. Introduction.

bobby
Télécharger la présentation

Load-Balanced Clustering in Wireless Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Load-Balanced Clustering in Wireless Sensor Networks Gaurav Gupta and Mohamed Younis IEEE International Conference on Communications, 2003. (ICC 2003) Bao-Hua Yang

  2. Outline • Introduction • Network model • Load-Balanced clustering • Simulation • Conclusion

  3. Introduction • In sensor network, sensor node has constrained energy • When the topology is cluster, cluster head • Act as the manager • May die quickly • Objective • Balance the load between cluster heads • Prolong the lifetime of cluster heads

  4. Introduction • Basic idea • Balance the number of the sensor nodes in each cluster • Consider on communication cost between gateway and sensors

  5. Network model • Assumption • Two kind of nodes • Sensor node • Sensing data • Energy-constrained • Gateway node • Cluster manager • High-energy • All gateways form their own subnet • All nodes have • Location information---GPS • Not mobile

  6. Network model

  7. Network model • Sensor energy dissipation model transmitter receiver

  8. Load-Balanced Clustering • Define Range set(Rset), Exclusive set(Eset), the reach of sensor node 7 1 9 4 G1 11 G2 6 2 8 5 3 10

  9. Load-Balanced Clustering • Define Range set(Rset), Exclusive set(Eset), the reach of sensor node 7 1 9 4 G1 11 G2 1.Location 2.energy reserve 6 2 8 5 3 10 RsetG1{1,2,3,4,5,6,7}

  10. Load-Balanced Clustering • Define Range set(Rset), Exclusive set(Eset), the reach of sensor node 7 1 9 4 G1 11 G2 6 2 8 5 3 10 RsetG2{6,7,8,9,10,11} RsetG1{1,2,3,4,5,6,7}

  11. Load-Balanced Clustering • Define Range set(Rset), Exclusive set(Eset), the reach of sensor node 7 1 9 4 G1 11 G2 6 2 8 5 3 10 RsetG2{6,7,8,9,10,11} RsetG1{1,2,3,4,5,6,7}

  12. Load-Balanced Clustering • Define Range set(Rset), Exclusive set(Eset), the reach of sensor node 7 1 9 4 G1 11 G2 6 2 8 5 3 10 RsetG2{6,7,8,9,10,11} EsetG2 {8,9,10,11} RsetG1{1,2,3,4,5,6,7} EsetG1 {1,2,3,4,5}

  13. Load-Balanced Clustering • Define Range set(Rset), Exclusive set(Eset), the reach of sensor node 7 1 9 4 G1 11 G2 6 2 8 5 3 10 RsetG2{6,7,8,9,10,11} EsetG2 {8,9,10,11} RsetG1{1,2,3,4,5,6,7} EsetG1 {1,2,3,4,5} Reach: reach1=1,reach6=2

  14. Load-Balanced Clustering 1 15 Rset{1,2,3,5,4,6,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15,12, 13,10} 5 6 12 9 13 7 8 G3 Rset{7,8,9,4,6,12,13,10}

  15. Load-Balanced Clustering 1 15 Rset{1,2,3,5,4,6,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15,12, 13,10} 5 6 12 9 13 7 8 G3 Rset{7,8,9,4,6,12,13,10}

  16. Load-Balanced Clustering • Define critical distance • The median of distances in Eset Rset{1,2,3,5,4,6,10 } 1 G1 Eset {2,3,1,5 } 10 2 3 4 5 6

  17. Load-Balanced Clustering • Define critical distance • The median of distances in Eset Rset{1,2,3,5,4,6,10 } 1 G1 Eset {2,3,1,5 ,4} 10 2 3 4 5 6 Critical distance

  18. Load-Balanced Clustering 1 15 Rset{1,2,3,5,6,4,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15 12,13,10} 5 6 12 9 13 7 8 G3 Rset{7,8,9,12,13,6,10}

  19. Load-Balanced Clustering • The cardinality of per cluster • Objective function minimizes the variance of the cardinality • The cost between gateway and sensor node Where G: number of gateways X: cardinality of gateway Gi X’: average cardinality including the node under consideration

  20. Load-Balanced Clustering 1 15 Rset{1,2,3,5,6,4,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15 12,13,10} 5 6 12 9 13 7 8 G3 Rset{7,8,9,6,12,13,10}

  21. Load-Balanced Clustering 1 15 Rset{1,2,3,5,6,4,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15 12,13,10} 5 6 12 9 13 If add 6 to G1 7 8 G3 Rset{7,8,9,12,13,6,10}

  22. Load-Balanced Clustering 1 15 Rset{1,2,3,5,6,4,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15 12,13,10} 5 6 12 9 13 If add 6 to G1 7 8 G3 Rset{7,8,9,12,13,6,10} If add 6 to G2

  23. Load-Balanced Clustering 1 15 Rset{1,2,3,5,6,4,10 } G1 14 10 2 3 11 G2 4 Rset{11,14,15 12,13,10} 5 6 12 9 13 7 8 G3 Rset{7,8,9,12,13,6,10}

  24. Simulation • Environmental setup • Sensing area:1000*1000 square meter • Number of sensors: 100 to 500 • Number of gateways: 2 to 10 • Each node has initial energy: 5 joules

  25. Simulation Gateways:5 Sensor nodes:100~500

  26. Simulation

  27. Conclusion • This paper introduced an approach to balance the load among cluster head • Future work • Fault tolerance by providing backup gateway • WCNC2003 • Dynamic gateway

More Related