A simple routing scheme for improving ad hoc network survivability

Domingo, Mari Carmen; Remondo, David; León, Olga

doi:10.1109/glocom.2003.1258332

Cited by 17 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Power-efficient paths can be acquired as a result of such collective behavior at intermediate nodes. In [10], Domingo et al designed a simple energy-aware DSR protocol (SEADSR) by considering the remaining energy levels at nodes in route discovery. It works to discover energy-aware routes in a way such that an intermediate node x, ∀x ∈ V (G)-{s,t}, defers its retransmissions of a non-duplicate RREQ that it receives proportional to E max −E x E max · τ max , where E max represents the battery capacity and τ max is a design parameter that represents the maximum delay introduced.…”

Section: Energy-aware Routingmentioning

confidence: 99%

“…This requirement can consume bandwidth and burn energy for gathering such information at nodes constantly in dynamic networks. To avoid such proactive overhead, some other on-demand protocols (e.g., [8,9,10]) work without assuming any topological knowledge at nodes and they are desirable in particular in networks wherein the request rate is not very high. Existing protocols falling into this aspect can lead to energy-efficient paths.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Energy-aware on-demand routing protocols for wireless ad hoc networks

Zhang¹,

Mouftah²

2006

Wireless Netw

View full text Add to dashboard Cite

Energy use is a crucial design concern in wireless ad hoc networks since wireless terminals are typically battery-operated. The design objectives of energy-aware routing are two folds: Selecting energy-efficient paths and minimizing the protocol overhead incurred for acquiring such paths. To achieve these goals simultaneously, we present the design of several on-demand energy-aware routing protocols. The key idea behind our design is to adaptively select the subset of nodes that are required to involve in a routesearching process in order to acquire a high residual-energy path and/or the degree to which nodes are required to participate in the process of searching for a low-power path in networks wherein nodes have transmission power adjusting capability. Analytical and simulation results are given to demonstrate the high performance of the designed protocols in energy-efficient utilization as well as in reducing the protocol overhead incurred in acquiring energy-efficient routes.

show abstract

Section: Energy-aware Routingmentioning

confidence: 99%

mentioning

confidence: 99%

Energy-aware on-demand routing protocols for wireless ad hoc networks

Zhang¹,

Mouftah²

2006

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…It is commonly used for improving the performance of the routing protocols in many later approaches. This mechanism is inventive but depends on the way it is implemented (in [6] e.g., the proposed SEADSR protocol is bias towards highly powered routes: it does not execute a monitoring function and a lot of traffic can be forwarded by nodes which at the time the route was selected were highly powered).…”

Section: Local Routingmentioning

confidence: 99%

A Survey of Routing Protocols for Energy Constrained Ad Hoc Wireless Networks

Vassileva

Barcelo-Arroyo

2007

Future Generation Communication and Networking (FGCN 2007)

View full text Add to dashboard Cite

show abstract

“…Most of the survivability schemes in literature address the unicast [1] and multicast/broadcast [2] communication modes. In general, survivability mechanisms are divided into three main classes, 1) protection schemes [3][4] [5][6] [7] [8]. 2) restoration schemes [9][10], and 3) hybrid schemes [11] [12].…”

Section: Introductionmentioning

confidence: 99%

Network coding-based protection of many-to-one wireless flows

Al-Kofahi

Kamal

2009

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of survivability of many-to-one flows in wireless networks, such as wireless mesh networks (WMNs) and wireless sensor networks (WSNs). Traditional protection schemes are either resource-hungry like the (1 + 1) protection scheme, or introduce a delay and interrupt the network operation like the (1 : N ) protection scheme. In this paper, we present a network coding-based protection technique that overcomes the deficiencies of the traditional schemes. We derive and prove the necessary and sufficient conditions for our solution on a restricted network topology. Then we relax these connectivity requirements and show how to generalize the sufficient and necessary conditions to work with any other topology. We also show how to perform deterministic coding with {0,1} coefficients to achieve linear independence. Moreover, we discuss some of the practical considerations related to our approach. Specifically, we show how to adapt our solution when the network has a limited min-cut; we therefore define a more general problem that takes this constraint into account, which prove to be NP-complete. Furthermore, we discuss the decoding process at the sink, and show how to make use of our solution in the upstream communication (from sink to sources). We also study the effect of the proposed scheme on network performance. Finally, we consider the implementation of our approach when all network nodes have single transceivers, and we solve the problem through a greedy algorithm that constructs a feasible schedule for the transmissions from the sources.

show abstract

A simple routing scheme for improving ad hoc network survivability

Cited by 17 publications

References 9 publications

Energy-aware on-demand routing protocols for wireless ad hoc networks

Energy-aware on-demand routing protocols for wireless ad hoc networks

A Survey of Routing Protocols for Energy Constrained Ad Hoc Wireless Networks

Network coding-based protection of many-to-one wireless flows

Contact Info

Product

Resources

About