DECOR: Distributed construction of load balanced routing trees for many to one sensor networks

Kleerekoper, Anthony; Filer, Nick

doi:10.1016/j.adhoc.2013.12.014

Cited by 11 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kleerekoper and Filer present a distributed scheme as degree‐constrained routing (DECOR) through load balancing technique by limiting the node degree without rebalancing the random tree. To maximize the global balance, all the nodes adopt the same number of children like each other since the local balance or redistribution of loads needs larger computation and communication overhead.…”

Section: Related Workmentioning

confidence: 99%

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Natarajan¹,

Subapriya

Thangavel³

2020

Int J Communication

View full text Add to dashboard Cite

Summary Sensor node energy conservation is the primary design parameters in wireless sensor networks (WSNs). Energy efficiency in sensor networks directly prolongs the network lifetime. In the process of route discovery, each node cooperates to forward the data to the base station using multi‐hop routing. But, the nodes nearer to the base station are loaded more than the other nodes that lead to network portioning, packet loss and delay as a result nodes may completely loss its energy during the routing process. To rectify these issues, path establishment considers optimized substance particle selection, load distribution, and an efficient slot allocation scheme for data transmission between the sensor nodes in this paper. The selection of forwarders and conscious multi‐hop path is selected based on the route cost value that is derived directly by taking energy, node degree and distance as crucial metrics. Load distribution based slot allocation method ensures the balance of data traffic and residual energy of the node in areal‐time environment. The proposed LSAPSP simulation results show that our algorithm not only can balance the real‐time environment load and increase the network lifetime but also meet the needs of packet loss and delay.

show abstract

Section: Related Workmentioning

confidence: 99%

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Natarajan¹,

Subapriya

Thangavel³

2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…ECB problems have been addressed with other techniques like scheduling, mobile sinks, deploying multiple sinks and routing, which are surveyed in . A large body of research in ECB focuses on designing power‐aware routing protocols . Routing protocols try to redirect flows to less‐loaded divergent paths or transmit them from multiple paths .…”

Section: Motivation and Related Workmentioning

confidence: 99%

Game of energy consumption balancing in heterogeneous sensor networks

Khanmirza

Yazdani

2015

Wireless Communications

View full text Add to dashboard Cite

In a multi-hop sensor network, sensors largely rely on other nodes as a traffic relay to communicate with targets that are not reachable by one hop. Depending on the topology and position of nodes, some sensors receive more relaying traffic and lose their energy faster. Such imbalanced energy consumption may lead to server problems like network partitioning. In this paper, we study the problem of energy consumption balancing (ECB) in heterogeneous sensor networks by assuming general any-to-any traffic pattern. We consider both factors of transmission power and forwarding load in measuring energy consumption. To find a solution, we formulate the problem as a strategic network formation game with a new utility function. We show that this game is guaranteed to converge to strongly connected topologies which have better ECB and bounded inefficiency. We propose a localized algorithm in which every node knows only about its k-hop neighbourhood. Through simulations on uniform and clustered networks with various densities, we show that the performance of our algorithm is comparable with global and centralized algorithms.

show abstract

“…For the above problems, some routing algorithms that consider the load balancing are proposed in [ 21 , 22 , 23 , 24 , 25 , 26 ]. Among them, SLDD [ 21 ] uses the evaluation function to select a super-link to redistribute network load through nodes with large energy and communication capacity on the super-link.…”

Section: Introductionmentioning

confidence: 99%

“…In order to avoid the nodes in hot spot from taking too many forwarding tasks, in [ 22 ], the transmission power is controlled to balance the load, which can shrink the difference of residual energy of each node and achieve the purpose of extending the network lifetime, but for the network performance optimization, such as the network throughput and transmission delay, it is irrationally overlooked. DECOR [ 23 ] proposes a degree-limited routing, in which the load-balanced routing tree is established by limiting the degree of each node, but the required overhead of the computation and communication in this algorithm are large. To ensure the load balancing of node communication, a heuristic multi-path algorithm is proposed in [ 24 ], but it ignores the energy consumption caused by the distance factor.…”

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

DECOR: Distributed construction of load balanced routing trees for many to one sensor networks

Cited by 11 publications

References 22 publications

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Game of energy consumption balancing in heterogeneous sensor networks

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

Contact Info

Product

Resources

About