Distributed Progressive Algorithm for Maximizing Lifetime Vector in Wireless Sensor Networks

Abstract

Abstract-Maximizing the operational lifetime of a sensor network is a critical problem in practice. Many prior works define the network's lifetime as the time before the first sensor in the network runs out of energy. However, when one sensor dies, the rest of the network can still work, as long as useful data generated by other sensors can reach the sink. More appropriately, we should maximize the lifetime vector of the network, consisting of the lifetimes of all sensors, sorted in ascending order. For this problem, there exists only a centralized algorithm that solves a series of linear programming problems with high-order complexities. This paper proposes a fully distributed progressive algorithm which iteratively produces a series of lifetime vectors, each better than the previous one. Instead of giving the optimal result in one shot after lengthy computation, the proposed distributed algorithm has a result at any time, and the more time spent gives the better result. We show that when the algorithm stabilizes, its result produces the maximum lifetime vector. Furthermore, simulations demonstrate that the algorithm is able to converge rapidly towards the maximum lifetime vector with low overhead.

Lifetime maximization routing with network coding in wireless multihop networks

“…The network lifetime is the time period during which the network functions properly, in particular, all demands can be satisfied. In previous research, there have been several definitions of network lifetime proposed depending on different applications, such as the minimum lifetime of all nodes [3], and the lifetime vector [8], etc. To make the analysis more tractable, we adopt the first one and extend it to that with network coding, which uses the shortest lifetime of all nodes as that of the network.…”

“…7are the coding and decoding requirements of two-way network coding, which show that the total transfer rate of commodity c on the two-hop link (j, i, k), ∀k, should be less than the total input rates of commodity c from j to i. Energy constraints are given in (8).…”

“…Research (e.g., [6]) has shown that given communication demands in a wireless multihop network, the lifetime of the network depends on the selection of routing paths [6]. Due to the rapid development of energy constrained wireless sensor networks, lifetime maximization routing has been investigated extensively but mostly without considering network coding [4,[6][7][8].…”

Lifetime optimization for wireless multihop networks with network coding

“…In previous research, several definitions of network lifetime have been proposed for different applications, such as the minimum lifetime of all nodes [2], and the lifetime vector [19], etc. To facilitate the analysis, we adopt the first one and extend it to our current situation in which network coding is used.…”