A local-update tree-based routing algorithm for WSNs
To address premature node failure in wireless sensor networks (WSNs) caused by limited energy and uneven energy consumption, this article proposes a tree-based routing algorithm with local update capability. Building upon traditional tree-based routing architecture, this algorithm classifies nodes into different tiers according to their residual energy, geographical location, and current connectivity status. These tiers undergo real-time dynamic updates to adapt to packet transmission demands. Routing paths are adaptively adjusted based on tier variations: when a node’s tier rapidly decreases, its associated routes undergo local updates to minimize energy consumption, thereby prolonging the life time of lower-tier nodes as effectively as possible. Simulation results demonstrate that compared with three other algorithms, the proposed algorithm achieves a more balanced energy consumption distribution among nodes, significantly extends the network’s stability period, and further enhances the overall network lifetime.