Research Article
WSN Routing Algorithm Based on Energy Approximation Strategy
199 downloads
@INPROCEEDINGS{10.1007/978-3-319-78139-6_1, author={Yuexia Zhang and Hang Chen and Tianrun Gao}, title={WSN Routing Algorithm Based on Energy Approximation Strategy}, proceedings={Communications and Networking. 12th International Conference, ChinaCom 2017, Xi’an, China, October 10-12, 2017, Proceedings, Part II}, proceedings_a={CHINACOM}, year={2018}, month={4}, keywords={Wireless sensor network Routing algorithm Cluster head Energy approximation}, doi={10.1007/978-3-319-78139-6_1} }- Yuexia Zhang
Hang Chen
Tianrun Gao
Year: 2018
WSN Routing Algorithm Based on Energy Approximation Strategy
CHINACOM
Springer
DOI: 10.1007/978-3-319-78139-6_1
Abstract
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.
Copyright © 2017–2024 EAI
