Abstract

Hierarchical chain communication is an efficient technique for saving sensor energy while maintaining load balance and scalability. However, the long delay caused by the formation of long chains is a significant research gap in this paradigm. In this article, a two-level hierarchical chain routing scheme based on the bee colony algorithm called PEG_ABC is proposed to reduce transmission delay and take advantage of the benefits of chain communication. Initially, the remaining sensor energy, Euclidean distance between sensors, and Euclidean distance between sensors and base station are simultaneously adjusted to the fitness function of the bee colony algorithm to select the most suitable chain leader at the first level. Also, in our proposed method at the second level, the collected data in the leader nodes of each level is transferred to the BS through end-to-end path formation between the leaders based on the bee colony algorithm. At this level, the data transmission delay and remaining energy in the leader nodes adjust the fitness function of the bee colony algorithm. Simulation results show the efficiency of the proposed PEG_ABC scheme compared to literature research in terms of energy consumption, network lifetime, number of packets sent to BS, and transmission delay. Also, this article presents a relationship based on extensive simulation results to determine the optimal number of clusters in hierarchical chain communication.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call