A Framework for Evaluating the Best Achievable Performance by Distributed Lifetime-Efficient Routing Schemes in Wireless Sensor Networks

Abstract

This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes in order to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for the majority of the existing schemes. A framework is provided in this work to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest-path approach. Given a network configuration and an energy consumption model, the presented framework provides the optimal link cost assignment which yields the maximum lifetime in a distributed shortestpath routing strategy. The results are extended to the case of variable link cost assignment as well. A heuristic algorithm is also developed to obtain approximate solutions to the best performance problem with limited computational complexity. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.Index Terms-Distributed shortest-path routing, Lifetime maximization, Minimum-cost routing, Multi-parametric programming, Wireless sensor networks.

Fuzzy Logic-Based Routing Algorithm for Lifetime Enhancement in Heterogeneous Wireless Sensor Networks

“…In [3], Habibi et al provide a framework to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest path approach. The proposed framework can be used as a benchmark to evaluate the energy efficiency of the existing routing algorithms.…”

“…Extensive research has been dedicated to maximum lifetime routing in multi-hop wireless sensor networks. These routing strategies can be widely categorized into optimization-based and shortest path (or minimum cost) methods [3]. In the optimization-based methods, routing is modelled as a network flow problem with the assumption that data transmitted by a node can be divided arbitrarily between the nodes on the selected routes to the sink.…”

“…In the optimization-based methods, routing is modelled as a network flow problem with the assumption that data transmitted by a node can be divided arbitrarily between the nodes on the selected routes to the sink. These methods greatly improve lifetime, however, they are not feasible for distributed implementation which limit their practicality [3]. On the other hand, shortest path methods support distributed implementation.…”

“…These methods assign energy-related cost values to all the links of the network and then utilize shortest path strategies, such as Bellman-Ford algorithm, to select the optimal routes with the minimum total cost. As link costs directly influence the route selection and the performance, the issue of designing an effective cost function, that calculates the cost of a link based on the network status, is vital for achieving the best performance [3].…”

Weak node protection to maximize the lifetime of wireless sensor networks

“…Kim [26] proposed a load balancing scheme that balances the energy consumption of the sensor nodes and maximum network lifetime by applying the sub-network management in WSNs. The anthors in [28] proposed an evaluation framework as a benchmark for performance evaluation of routing algorithms based on its ability to specify the optimal performance of increasing network lifetime through the distributed routing strategy. Hou et al [29] considered a two-tier WSN, and proposed multisession flow routing solutions which split flows to different paths during transmission to extend network lifetime.…”