An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks

Abstract

In energy-constrained wireless sensor networks (WSNs), the design of an energy-efficient smart strategy is a key to extend the network lifetime, but the unbalance of energy consumption and node load severely restrict the long-term operation of the network. To address these issues, a novel routing algorithm which considers both energy saving and load balancing is proposed in this paper. First of all, the transmission energy consumption, node residual energy and path hops are considered to create the link cost, and then a minimum routing graph is generated based on the link cost. Finally, in order to ensure the balance of traffic and residual energy of each node in the network, an “edge-cutting” strategy is proposed to optimize the minimum routing graph and turn it into a minimum routing tree. The simulation results show that, the proposed algorithm not only can balance the network load and prolong the lifetime of network, but meet the needs of delay and packet loss rate.

Energy Efficient and Reliable Routing Algorithm for Wireless Sensors Networks

“…In response to the above problems, in some algorithms for solving load balancing [12][13][14], Zhang D et al [12] proposed a forward-aware factor-based energy balance routing protocol (FAF-EBRM), which uses the energy density of the forward region and the traffic on the link to alleviate congestion. However, without minimizing the energy consumption of the path, it will lead to energy loss due to detours.…”

“…However, without minimizing the energy consumption of the path, it will lead to energy loss due to detours. For this reason, some algorithms minimize the path energy consumption as much as possible while ensuring the energy balance of nodes [13,14]. The ACOHCM proposed by Ailian J et al [13] combines the advantages of the ant colony optimization algorithm and minimum hop routing strategy to effectively reduce network energy consumption.…”

“…The ACOHCM proposed by Ailian J et al [13] combines the advantages of the ant colony optimization algorithm and minimum hop routing strategy to effectively reduce network energy consumption. The ESRA proposed by Tang L et al [14] first constructs the minimum energy consumption tree and then propose the "cut edge" strategy to balance the load between nodes, which can effectively utilize the energy and extend the network lifetime. However, the computational complexity and communication overhead required by the two algorithms are large and may consume too many resources in practical applications.…”

Multiparameter Fusion Decision Routing Algorithm for Energy-Constrained Wireless Sensor Networks

“…Considering a packet located at node i, to transmit data against the sink without backhaul, the packet should be sent to a forward neighbor of node i. Based on the model in [35,36], the forward neighbor set FN(i) of node i can be expressed as follows:…”

“…where e ij is the energy consumption of single-hop between node i and j. e R is the energy consumption by transmitted to the maximum range. The communication energy consumption model used in this paper comes from [35,36]. Assuming that the communication distance threshold of sensor nodes is d o , when d is less than d o , the free-space channel model is adopted.…”