Open AccessUneven clustering routing protocol based on ant colony algorithm for wireless sensor networks
Author(s) -
Wenmei Zhang,
Fubao Liao
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1800/1/012003
Subject(s) - computer science , wireless routing protocol , computer network , routing protocol , zone routing protocol , path vector protocol , dynamic source routing , wireless sensor network , enhanced interior gateway routing protocol , distributed computing , cluster analysis , routing (electronic design automation) , artificial intelligence
For the energy of the wireless sensor network node is limited, an uneven clustering routing protocol is proposed for wireless sensor networks. In the protocol, cluster head election uses a competitive manner, and all nodes in the first round participate in the election. The cluster head election considers the remaining energy, the number of neighboring nodes, and the distance between node and sink. The path search from the cluster head to the base station runs the ant colony algorithm to find the optimal multi-hop route. Each round no longer clusters, and re-clustering and routing will update only when the remaining energy of the cluster head is less than the predicted energy. The protocol enables its routing establishment and maintenance more self-adaptive and dynamic. The simulation shows that the routing protocol can efficiently reduce and balance the energy consumption, and prolong the wireless sensor network survival period.