Routing protocol based on sleep scheduling and tree cluster structure in wireless sensor network

Mishra, Surabhi; Kansal, Parul

doi:10.1109/icaccaf.2016.7748965

Cited by 3 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generally, it can reduce the path energy consumption, but it is easy to cause some nodes to exhaust prematurely due to overuse, bringing about an uneven distribution of residual energy and a short network lifetime. In addition, there are some routing algorithms that consider the sleep strategies [ 18 , 19 , 20 ]. These algorithms lessen the energy consumption rate by adjusting the “sleeping” and “awake” working modes of nodes, thus prolonging the lifetime of the entire network.…”

Section: Introductionmentioning

confidence: 99%

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

Tang

Cai

et al. 2018

Sensors

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%