Lifetime Routing Research Articles

Lifetime maximization schemes under end‐to‐end frame‐error constraints in wireless multimedia sensor networks

AbstractOf significance in wireless multimedia sensor networks (WMSN) is the maintenance of media quality and the extension of route lifetime since media stream is more sensitive in quality requirement than data flow. In this paper, the problem of how to balance the needs on constraining end‐to‐end (e2e) quality and prolonging lifetime in an established route can be interpreted as a nonlinear optimization paradigm, which is then shown to be a max—min composite formulation when an e2e frame‐error probability is given. To solve this max—min problem, we propose two novel methods: route‐associated power management (RAPM) and link‐associated power management (LAPM). For computation‐restricted sensor nodes, the RAPM scheme with adding a simplification condition on power management can effectively reduce the power cost at computation and also rapidly determine optimum lifetime from numerous candidate routes. On the other hand, if computing power is not the major concern in a sink node, rather than using a heuristic method, we employ the LAPM algorithm to solve the lifetime maximization problem in a more accurate fashion. Solid theoretical analysis and simulation results are presented to validate our proposed schemes. Both analytical and simulation results demonstrate that the LAPM scheme is very comparable to the heuristic approach. Copyright © 2009 John Wiley & Sons, Ltd.

Lexicographically Optimal Routing for Wireless Sensor Networks With Multiple Sinks

In wireless sensor networks (WSNs), the field information (e.g., temperature, humidity, airflow) is acquired via several battery-equipped wireless sensors and is relayed toward a sink node. As the size of the WSNs increases, it becomes inefficient (in terms of power consumption) when gathering all information in a single sink. To tackle this problem, one can increase the number of sinks. The set of sensor nodes that are sending data to sink <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> is called commodity <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> . In this paper, we formulate the lexicographically optimal commodity lifetime (LOCL) routing problem. A stepwise centralized algorithm called the LOCL algorithm is proposed, which can obtain the optimal routing solution and lead to lexicographical fairness among commodity lifetimes. We then show that, under certain assumptions, the lexicographical optimality among commodity lifetimes can be achieved by providing lexicographical optimality among node lifetimes. This motivates us to propose our second algorithm, which is called the lexicographically optimal node lifetime (LONL) algorithm, which is suitable for practical implementation. Simulation results show that our proposed LOCL and LONL algorithms increase the normalized commodity and node lifetimes compared with the maximum lifetime with multiple sinks (MLMS) and lexicographical max-min fair (LMM) routing algorithms.

Bandwidth-based routing protocols in mobile ad hoc networks

In this paper, we propose a high performance routing protocol and a long lifetime routing protocol by considering the fact that the bandwidth between two mobile nodes should be different when distances are different. In the high performance routing protocol, to reduce the number of rerouting times, we take the bandwidth issue into account to choose the path with the capability to transmit the maximum amount of data with the help of the GPS. With exchanging the moving vectors and the coordinates of two adjacent mobile nodes, the possible link lifetime of two adjacent mobile nodes can be predicted. Subsequently, a path with the maximal amount of data transmission can be found. With regard to our proposed long lifetime routing protocol, to maximize the overall network lifetime, we find a path with the maximal remaining power after data transmission. With the link bandwidth and the desired amount of data transmitted, the consumption power is computed to obtain the remaining power of a mobile node. Accordingly, we can choose the path with the maximal predicted remaining power to maximize the overall network lifetime. In the simulation, we compare our high performance routing protocol with the AODV and LAWS in terms of throughput, rerouting (path breakage), and route lifetime. With respect to power consumption, we compare our proposed power-aware routing protocol with the POAD and PAMP in terms of the overall network lifetime and the ration of survival nodes to the all nodes.

A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink

We consider a noise-limited wireless sensor network that consists of battery-operated nodes which can route information to a mobile sink in a multi-hop fashion. The problem of maximizing the network's lifetime, defined as the period of time during which the network can route a feasible flow to each sink location subject to power/energy constraints, is cast into a linear program, reduced into a simpler equivalent form and solved via dual decomposition. The unknowns are the sink sojourn times and the routing flow vector for each sink location. The presence of a mobile sink presents new challenges but the problem structure can still be exploited to find the optimal solution. A distributed algorithm based on the subgradient method and using the sink as leader is proposed and its performance is evaluated through simulation for random networks. The algorithm's requirements in memory are also provided.

Fuzzy metric approach for route lifetime determination in wireless ad hoc networks

In wireless ad hoc networks, Ad-hoc On-Demand Distance Vector (AODV) routing protocol uses static value for 'Active-Route-Timeout' (ART) which indicates the lifetime of an active route in the routing table. As accurate and dynamic ART is more suitable than static one, the fuzzy logic system is used here to obtain adaptive ART (fuzzy ART) values. Considering various parameters on fuzzy ART, three design methods are proposed, namely: fuzzy-SKP, fuzzy-Power and fuzzy-Comb. Analysis shows that the proposed methods are able to optimise ART quite efficiently and superior to the conventional method with respect to routing overhead and average end-to-end delay.

Adaptive link-weight routing protocol using cross-layer communication for MANET

Routing efficiency is one of the challenges offered by Mobile Ad-hoc Networks (MANETs). This paper proposes a novel routing technique called Adaptive Link-Weight (ALW) routing protocol. ALW adaptively selects an optimum route on the basis of available bandwidth, low delay and long route lifetime. The technique adapts a cross-layer framework where the ALW is integrated with application and physical layer. The proposed design allows applications to convey preferences to the ALW protocol to override the default path selection mechanism. The results confirm improvement over AODV in terms of network load, route discovery time and link reliability.

Fuzzy logic weighted multi-criteria of dynamic route lifetime for reliable multicast routing in ad hoc networks

In this paper, we proposed the fuzzy logic modified AODV routing (FMAR) protocol for multicast routing in mobile ad hoc networks. The fuzzy logic weighted multi-criteria of the protocol is used to dynamically evaluate the active route lifetime in order to determine the appropriate routes. Multiple routing paths are established to provide extra schemas of video streaming or multicast transmission and enhance the robust transmission against unreliability and limited bandwidth of wireless links. Due to frequent node movements, the topologies of mobile ad hoc networks change rapidly. The evaluation of dynamic route lifetime is challenging in the wireless networks. The fuzzy weighted logic multi-criteria are based on the remained energies of the nodes on the routes, the number of hop-counts and the sent controlled packages. The simulation results of the FMAR show that the protocol is quite efficient and superior to AODV with the respects to the node mobility, the packet delivery ratio, average route acquisition latency delay, the routing overhead and the average end-to-end delay.

Discovering long lifetime routes in mobile ad hoc networks

In mobile ad hoc networks, node mobility causes frequent link failures, thus invalidating the routes containing those links. Once a link is detected broken, an alternate route has to be discovered, incurring extra route discovery overhead and packet latency. The traffic is also interrupted at the transport layer, and proper traffic recovery schemes have to be applied. To reduce the frequency of costly route re-discovery procedures and to maintain continuous traffic flow for reliable transport layer protocols, we suggest discovering long lifetime routes (LLR). In this paper, we first propose g-LLR, a global LLR discovery algorithm, that discovers LLRs of different route lengths for any given pair of nodes. We then propose a distributed LLR discovery scheme (d-LLR) that discovers two of the most desirable LLRs through one best-effort route discovery procedure. Simulations show that the lifetimes of the routes discovered by d-LLR are very close to those discovered by g-LLR. Simulations also show that the performance of different transport layer protocols is greatly improved by using LLRs. More importantly, traffic can remain continuous using the provided LLRs. D-LLR can be implemented as an extension to existing ad hoc routing protocols, and it improves the performance of transport layer protocols without modifications on them.

A Revised Routing Protocol Based on Associativity

In this letter, a new routing protocol based on connectivity and link age is presented to reduce the control overhead by avoidance of frequent routes re-establishment and realize rapid route maintenance in mobile ad hoc networks. To achieve this, a new routing metric that combines node's connectivity with link age is introduced. With connectivity parameter, routes are repaired quickly; on the other hand, route lifetime can be prolonged by establishing links with younger link, which is expected to maintain long lifetime rather than older link. Simulation results identify more 20% average link residual time than previous Associativity Based Routing [2].

Data aggregated maximum lifetime routing for wireless sensor networks

In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing so that the network lifetime can be maximized. A recursive smoothing method is adopted to overcome the non-differentiability of the objective function. We derive the necessary and sufficient conditions for achieving the optimality of the optimization problem and design a distributed gradient algorithm accordingly. Extensive simulations are carried out to show that the proposed algorithm can significantly reduce the data traffic and improve the network lifetime. The convergence property of the algorithm is studied under various network configurations.

Prediction-Based Routing for Vehicular Ad Hoc Networks

Development in short-range wireless LAN (WLAN) and long-range wireless WAN (WWAN) technologies have motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Vehicles with only WLAN radios can use other vehicles that have both WLAN and WWAN radios as mobile gateways and connect to the Internet while on the road. The most difficult challenge in the scenario is to deal with frequent route breakages due to dynamic mobility of vehicles on the road. Existing routing protocols that are widely used for mobile ad hoc networks are reactive in nature and wait until existing routes break before constructing new routes. The frequent route failures result in a significant amount of time needed for repairing existing routes or reconstructing new routes. In spite of the dynamic mobility, the motion of vehicles on highways is quite predictable compared to other mobility patterns for wireless ad hoc networks, with location and velocity information readily available. This can be exploited to predict how long a route will last between a vehicle requiring Internet connectivity and the gateway that provides a route to the Internet. Successful prediction of route lifetimes can significantly reduce the number of route failures. In this paper, we introduce a prediction-based routing (PBR) protocol that is specifically tailored to the mobile gateway scenario and takes advantage of the predictable mobility pattern of vehicles on highways. The protocol uses predicted route lifetimes to preemptively create new routes before existing ones fail. We study the performance of this protocol through simulation and demonstrate significant reductions in route failures compared to protocols that do not use preemptive routing. Moreover, we find that the overhead of preemptive routing is kept in check due to the ability of PBR to predict route lifetimes.

Cross-Layer Path Configuration for Energy-Efficient Communication over Wireless Ad Hoc Networks

We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ) mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

Modeling static and dynamic behavior of routes in mobile ad hoc networks

Ad hoc networking research needs meaningful models to describe the behavior of multihop routes. We survey existing static models to describe the distribution of link and path distances as well as dynamic models describing the lifetime of links, paths, and routes. Next, we enhance and combine selected models to form a combined model describing both, the static and dynamic aspects of multihop ad hoc routes. In particular, our model allows for prediction of lifetimes for single and multipath routes for a bounded and an unbounded modeling area. As a proof-of-concept, the model is applied to analyze the efficiency of different usage strategies of multipath routes: based on the lifetime predictions of our model we estimate the transport capacity of the routes.

An online heuristic for maximum lifetime routing in wireless sensor networks

We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online heuristic to maximize network lifetime. Our heuristic, which performs two shortest path computations to route each message, is superior to previously published heuristics for lifetime maximization - our heuristic results in greater lifetime and its performance is less sensitive to the selection of heuristic parameters. Additionally, our heuristic is superior on the capacity metric

Distributed algorithms for maximum lifetime routing in wireless sensor networks

A sensor network of nodes with wireless transceiver capabilities and limited energy is considered. We propose distributed algorithms to compute an optimal routing scheme that maximizes the time at which the first node in the network drains out of energy. The problem is formulated as a linear programming problem and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms have low computational complexity and are guaranteed to converge to an optimal routing scheme that maximizes the network lifetime. The algorithms are illustrated by an example in which an optimal flow is computed for a network of randomly distributed nodes. We also show how our approach can be used to obtain distributed algorithms for many different extensions to the problem. Finally, we extend our problem formulation to more general definitions of network lifetime to model realistic scenarios in sensor networks

Book-ahead call routing for flexible lifetime

Recently, Sun et al., proposed a practical E-mail protocol providing perfect forward secrecy, but Dent showed that their protocol does not actually provide perfect forward secrecy. In this letter, we propose two new robust E-mail protocols, which indeed guarantee perfect forward secrecy.

Book-ahead call routing for flexible lifetime

For persistent and guaranteed quality of service (QoS), a book-ahead (BA) call connection is required to declare its exact lifetime in advance, which is not always possible for many BA applications. In this letter, we present a model for extendable BA lifetime through adoption of a new BA routing scheme based on the calculation of call extension failure probability of BA call(s) for each link in the network

A Utility-Based Distributed Maximum Lifetime Routing Algorithm for Wireless Networks

Energy-efficient routing is a critical problem in multihop wireless networks due to the severe power constraint of wireless nodes. Despite its importance and many research efforts toward it, a distributed routing algorithm that maximizes network lifetime is still missing. To address this problem, this paper proposes a novel utility-based nonlinear optimization formulation to the maximum lifetime routing problem. Based on this formulation, a fully distributed localized routing algorithm is further presented, which is proved to converge at the optimal point, where the network lifetime is maximized. Solid theoretical analysis and simulation results are presented to validate the proposed solution

ε-Optimal Minimal-Skew Battery Lifetime Routing in Distributed Embedded Systems

ε-Optimal Minimal-Skew Battery Lifetime Routing in Distributed Embedded Systems

Constructing Longest Lifetime Route in Mobile Ad-hoc Networks

Constructing Longest Lifetime Route in Mobile Ad-hoc Networks