WSN Routing Algorithm Based on Energy Approximation Strategy
In the routing protocol of wireless sensor networks, the traditional LEACH algorithm is too random, and the cluster head selection of it is not ideal. To solve this problem, it proposes a WSN routing algorithm based on energy approximation strategy. It chooses a series of nodes with high energy and high density to form cluster candidate clusters, and then selects the farthest node as the cluster head from the candidates by using the energy approximation strategy. The algorithm is simple and easy to implement, and the cluster head selection of it is ideal. Using Matlab software for simulation, the results show that it is less energy consuming than the LEACH algorithm, and the lifetime of the whole network is prolonged.
KeywordsWireless sensor network Routing algorithm Cluster head Energy approximation
- 3.Dhawan, H., Waraich, S.: A comparative study on LEACH routing protocol and its variants in wireless sensor networks: a survey. Int. J. Comput. Appl. 95(8), 21–27 (2014)Google Scholar
- 4.Lee, W.S., Ahn, T.W., Song, C.Y.: A study on improvement of energy efficiency for LEACH protocol in WSN. J. Inst. Electron. Inf. Eng. 52(3), 213–220 (2015)Google Scholar
- 14.Fu, C., Jiang, Z., Wei, W.E.I., et al.: An energy balanced algorithm of LEACH protocol in WSN. Int. J. Comput. Sci. 10(1), 354–359 (2013)Google Scholar