The effectiveness and the simple implementation of physical layer jammers make them an essential threat for wireless networks. In a multihop wireless network, where jammers can interfere with the transmission of user messages at intermediate nodes along the path, one can employ jamming oblivious routing and then employ physical-layer techniques (e.g., spread spectrum) to suppress jamming. However, whereas these approaches can provide significant gains, the residual jamming can still severely limit system performance. This motivates the consideration of routing approaches that account for the differences in the jamming environment between different paths. First, we take a straightforward approach where an equal outage probability is allocated to each link along a path and develop a minimum energy routing solution. Next, we demonstrate the shortcomings of this approach and then consider the joint problem of outage allocation and routing by employing an approximation to the link outage probability. This yields an efficient and effective routing algorithm that only requires knowledge of the measured jamming at each node. Numerical results demonstrate that the amount of energy saved by the proposed methods with respect to a standard minimum energy routing algorithm, especially for parameters appropriate for terrestrial wireless networks, is substantial.
In order to minimize energy consumption in wireless networks, numerous energy-efficient routing algorithms have been studied @cite_8 @cite_21 @cite_36 @cite_33 @cite_23 @cite_42 . For instance, in @cite_42 energy-efficient routing with an end-to-end probability of error constraint is considered. However, @cite_42 does not consider any kind of jamming and or spatially non-uniform interference. Instead of the total energy usage of the network nodes, some works consider the battery usage of each node, or balanced energy dissipation in the network as their criteria @cite_44 @cite_11 @cite_16 . For example, in @cite_44 , instead of choosing one source-destination path, the algorithm chooses several paths and uses them alternatively to avoid quick energy depletion of each path. While minimum energy routing has been studied extensively, a few works (e.g. see @cite_15 @cite_14 ) considered security-aware routing. However, unlike our work, they considered routing in the presence of passive eavesdroppers, which is different from the problem considered in this work with active jammers.
@cite_14 @cite_33 @cite_8 @cite_36 @cite_21 @cite_42 @cite_44 @cite_23 @cite_15 @cite_16 @cite_11
2107221998 2133937062 1994027334 2106087555
The energy-efficiency usage is relative to each layer of wireless sensor networks. In order to improve the ZigBee mesh routing protocol for energy-efficiency usage, we propose a routing algorithm combining AODVjr with the node residual energy. To reduce the energy consumption of bottleneck nodes and extend network lifetime, the improved routing algorithm aims to build a new balancing method between the energy-aware routing metric and the shortest path. Based on the energy model of CC2430 RF transceiver, the implemented routing protocol is simulated using NS2 (Network Simulator version 2). Simulation result shows that this improved protocol can extend the network lifetime very efficiently. In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware routing protocols were proposed to seek the power efficiency of routes. Among them, several geographical localized routing protocols were proposed to help making smarter routing decision using only local information and reduce the routing overhead. However, most of the proposed localized routing methods cannot theoretically guarantee the power efficiency of their routes. In this paper, we give the first localized routing algorithm, called localized energy aware restricted neighborhood routing (LEARN), which can guarantee the power efficiency of its route asymptotically almost sure. Given destination node t, an intermediate node v will only select a certain neighbor v such that pi alpha, our LEARN routing protocol will find the route for any pair of nodes asymptotically almost sure. When the transmission range rn = radicbet alnl pin for some beta < pi alpha, the LEARN routing protocol will not be able to find the route for any pair of nodes asymptotically almost sure. We also conducted simulations to study the performance of LEARN and compare it with a typical localized routing protocol (GPSR) and a global ad hoc routing protocol (DSR) There is a rich recent literature on how to assist secure communication between a single transmitter and receiver at the physical layer of wireless networks through techniques such as cooperative jamming. In this paper, we consider how these single-hop physical layer security techniques can be extended to multi-hop wireless networks and show how to augment physical layer security techniques with higher layer network mechanisms such as coding and routing. Specifically, we consider the secure minimum energy routing problem, in which the objective is to compute a minimum energy path between two network nodes subject to constraints on the end-to-end communication secrecy and goodput over the path. This problem is formulated as a constrained optimization of transmission power and link selection, which is proved to be NP-hard. Nevertheless, we show that efficient algorithms exist to compute both exact and approximate solutions for the problem. In particular, we develop an exact solution of pseudo-polynomial complexity, as well as an o-optimal approximation of polynomial complexity. Simulation results are also provided to show the utility of our algorithms and quantify their energy savings compared to a combination of (standard) security-agnostic minimum energy routing and physical layer security. In the simulated scenarios, we observe that, by jointly optimizing link selection at the network layer and cooperative jamming at the physical layer, our algorithms reduce the network energy consumption by half. Energy efficiency is a key issue in wireless ad hoc and sensor networks. Several directions have been explored to maximize network lifetime, among them energy efficient routing. In this paper, we show how to extend the standardized OLSR routing protocol, in order to make it energy efficient. To take into account residual node energy, three new selection algorithms of multipoint relays, based on the minimum residual energy are evaluated, the best one is chosen. This OLSR extension selects the path minimizing the energy consumed in the end-to-end transmission of a flow packet and avoids nodes with low residual energy. We compare this extension with a two-path source routing strategy (with different links or different nodes). An extensive performance evaluation shows that this energy efficient extension maximizes both network lifetime and user data delivered.