Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks

Abstract

Data gathering is a fundamental operation in wireless sensor networks. For the online data gathering problem, we consider the key issues of balancing the load on the nodes to achieve longer network lifetime, and that of balancing the load on the network links to achieve greater reliability in the network. We model the given network as a shortest-distance DAG D, which defines a set of parent nodes for each node that determine the minimum-hops paths from the node to a sink. Data gathering in D is accomplished using a dynamic routing approach, where each node selects a parent using a parent selection function σ to forward the sensed data, which generates a dynamic forest (D, σ) in the network. We investigate a dynamic state-based routing approach where σ is defined using the current state of the network. Based on our earlier work [1], we propose two dynamic state-based routing algorithms -MPE Routing and WPE Routing, that aim to load-balance the nodes as well as the edges of D in order to achieve longer network lifetime as well as greater disjointness. We evaluate the performance of our algorithms with respect to the three goodness measures -network lifetime, nodal load-balancing and disjointness, and compare it with two benchmark algorithms as well as existing data gathering schemes. Our simulation results show that our algorithms perform consistently better with respect to our goodness measures than the benchmark algorithms and other approaches.

K-DAG Based Lifetime Aware Data Collection in Wireless Sensor Networks

“…Multiple paths from each sensor to the base station increase not only robustness, but also network lifetime. [4] considers the issues of balancing the load to achieve longer network lifetime by routing on a SPD. It proposes a modified asynchronous distributed breadth-first search method that is similar to Frederickson's algorithm [9], but without the centralized synchronization between level expansions, to build a SPD.…”

“…A SPD can be constructed by using the algorithm proposed in [4] which employs the relaxation technique proposed in [12]. A SPT can be constructed from a SPD by selecting only one parent for each sensor node.…”

“…We propose a distributed algorithm to construct a k-DAG. Our distributed algorithm constructs a k-DAG from a SPD (Shortest Path DAG) [4] by adding sibling edges. We make the following major contributions:…”

“…We have simulated our approach and the approach proposed in [4]. The simulation results show that our approach outperforms theirs by up to 82% in terms of network lifetime.…”

Utility‐driven construction of balanced data routing trees in wireless sensor networks

“…In , the online data gathering problem in WSNs was also investigated, and a dynamic state‐based routing approach was adopted, which have resulted to two algorithmic solutions, the max–min path energy routing and the weighted path energy routing algorithms, with the goal to achieve longer network lifetime through load balancing. Following the same trend, Lee et al also investigated the problem of data collection in stationary WSNs.…”