The article directories
- I. Theoretical basis
-
- 1. Overview of LEACH algorithm
- 2. Improved LEACH algorithm
- Second, algorithm flow chart
- 3. Simulation experiment and analysis
- Iv. References
- Five, Matlab code
I. Theoretical basis
1. Node clustering
2. Node energy consumption
3. Improved LEACH algorithm
Second, algorithm flow chart
Figure 1 Flow chart of improved LEACH algorithm
3. Simulation experiment and analysis
There are 100 nodes in the simulation network and they are randomly distributed within 100m×100m. The Sink node has a fixed position and the initial energy of each node is 0.5J. The simulation parameters are shown in Table 1.
Table 1 Simulation experiment parameters
Figure 2-4 shows the variation curves of the number of surviving nodes, residual energy of the network and the amount of data received by the base station with the rounds respectively.
Figure 2 Comparison of the life cycles of 100 nodes in 100m×100m area
FIG. 3 Relationship between network residual energy and time
FIG. 4 Relation between data received by base station and time
Iv. References
[1] Heinzelman W R , Chandrakasan A , Balakrishnan H. Energyefficient Communication Protocol for Wireless Microsensor Networks. 2000. [2] Han Guang-hui, Zhang Li-cui. [3] he shuqian, yan Chen, deng zhengjie, et al. Energy efficiency clustering algorithm for wireless sensor networks based on LEACH protocol [J]. Journal of jilin university (information science edition),2017,35(01):26-31. An Improved LEACH Algorithm for Energy Equalization in Routing Optimization of Wireless Sensor Networks [J]. Modern Electronic Technique, 2020, 043(005):6-9