Efficient routing algorithms for maximizing network lifetime in chain-type wireless sensor networks using multiple sinks
Renjie Guo, Honglie Li, Mi Yan, Yiyi Zhang, Peng Guo · 2023
Data gathering is an important research area in wireless sensor networks (WSNs), where network lifetime is an important factor affecting data gathering in WSNs. In recent years, a type of WSNs with a special structure that is fundamentally different from traditional WSNs has emerged in order to monitor infrastructure extending over hundreds of kilometers, because sensor nodes in such networks are deployed along narrow geographical areas, thus forming a network called chain-type WSNs. In order to maximize the lifetime of chain-type WSNs with multiple sink nodes, this paper proposes two routing algorithms: MMRE_EN, Chains_search. The case of data gathering without data aggregation is considered in the selection of sensor nodes, and this paper proposes an improved version of the existing MMRE algorithm: the MMRE_EN algorithm. Meanwhile, this paper proposes the Chains_search algorithm with linear computational complexity, whose core idea is to convert the problem of global route optimization into the problem of route independent optimization of multiple links. Extensive simulation results show that the two algorithms proposed in this paper can extend the lifetime of chain-type WSNs with multiple sink nodes by 18.5% and 12%, respectively, compared with the existing MMRE algorithm, while the Chains_search algorithm with linear computational complexity has only 1/200 of the running time of the MMRE algorithm.