Results 1 - 10
of
30
A High-Throughput Path Metric for Multi-Hop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract
-
Cited by 507 (5 self)
- Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput. This
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks
- In Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5
, 2001
"... The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastruc ..."
Abstract
-
Cited by 370 (9 self)
- Add to MetaCart
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The use of source routing allows packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant experimentation in a physical outdoor ad hoc networking testbed we have constructed in Pittsburgh, and have demonstrated the excellent performance of the protocol. In this chapter, we describe the design of DSR and provide a summary of some of our simulation and testbed implementation results for the protocol. 1
Performance of multihop wireless networks: shortest path is not enough
- SIGCOMM COMPUT. COMMUN. REV
, 2003
"... Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count r ..."
Abstract
-
Cited by 103 (0 self)
- Add to MetaCart
Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss rates low enough that the routing protocol is willing to use them, but high enough that much of the capacity is consumed by retransmissions. These observations suggest that more attention be paid to link quality when choosing ad hoc routes; the paper presents measured link characteristics likely to be useful in devising a better path quality metric.
Security-Aware Ad hoc Routing for Wireless Networks
, 2001
"... We propose a new routing technique called Security-Aware ad hoc Routing (SAR) that incorporates security attributes as parameters into ad hoc route discovery. SAR enables the use of security as a negotiable metric to improve the relevance of the routes discovered by ad hoc routing protocols. We deve ..."
Abstract
-
Cited by 97 (0 self)
- Add to MetaCart
We propose a new routing technique called Security-Aware ad hoc Routing (SAR) that incorporates security attributes as parameters into ad hoc route discovery. SAR enables the use of security as a negotiable metric to improve the relevance of the routes discovered by ad hoc routing protocols. We develop a two-tier classi cation of routing protocol security metrics, and propose a framework to measure and enforce security attributes on ad hoc routing paths. Our framework enables applications to adapt their behavior according to the level of protection available on communicating nodes in an ad hoc network.
A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks
- IEEE Network
, 1999
"... Bandwidth and power constraints are the main concerns in current wireless networks because multihop, ad hoc mobile wireless networks rely on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power, and computation demands on mobile hosts which must b ..."
Abstract
-
Cited by 47 (6 self)
- Add to MetaCart
Bandwidth and power constraints are the main concerns in current wireless networks because multihop, ad hoc mobile wireless networks rely on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power, and computation demands on mobile hosts which must be taken into account when choosing the best routing protocol. In recent years, protocols that build routes based "on demand" have been proposed. The major goal of on-demand routing protocols is to minimize control traffic overhead. In this paper, we perform a simulation and performance study on some routing protocols for ad hoc networks. Distributed Bellman-Ford, a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless networks. In addition, two on-demand routing protocols (Dynamic Source Routing and Associativity-Based Routing) with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and co...
Routing and Multicasting Strategies in Wireless Mobile Ad hoc Networks
, 2000
"... Ad hoc networks are gaining increasing popularity in recent years because of their ease of deployment. No wired base station or infrastructure is supported, and each host communicasts one another via packet radios. In ad hoc networks, routing protocols are challenged with establishing and maintainin ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
Ad hoc networks are gaining increasing popularity in recent years because of their ease of deployment. No wired base station or infrastructure is supported, and each host communicasts one another via packet radios. In ad hoc networks, routing protocols are challenged with establishing and maintaining multihop routes in the face of mobility, bandwidth limitation and power constraints. In this dissertation, we study the routing strategies for ad hoc networks. On-demand routing protocols and table-driven algorithms are analyzed and compared against each other. Our study shows that on-demand protocols are better suited for mobile networks because they generate less control overhead and manage the mobility in a more efficient manner. Simulation experiments also indicate that providing multiple routes is beneficial in increasing the robustness against mobility.
Cooperative Packet Caching and Shortest Multipath Routing In Mobile Ad hoc Networks
- in Proceedings of IEEE INFOCOM, March-April 2003
, 2003
"... A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their ability to cope quickly against topological changes. In this paper, we propose a new routing protocol called Caching and ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their ability to cope quickly against topological changes. In this paper, we propose a new routing protocol called Caching and Multipath (CHAMP) Routing Protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route breakdowns. Simulation results reveal that by using a five-packet data cache, CHAMP exhibits excellent improvement in packet delivery, outperforming AODV and DSR by at most 30% in stressful scenarios. Furthermore, end-to-end delay is significantly reduced while routing overhead is lower at high mobility rates.
Ensuring Cache Freshness in On-Demand Ad Hoc Network Routing Protocols
, 2002
"... In a wireless ad hoc network, nodes cooperate to forward packets for each other over possibly multi-hop paths, to allow nodes not within direct wireless transmission range to communicate. Many routing protocols have been proposed for the ad hoc network environment, several of which operate on-demand ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
In a wireless ad hoc network, nodes cooperate to forward packets for each other over possibly multi-hop paths, to allow nodes not within direct wireless transmission range to communicate. Many routing protocols have been proposed for the ad hoc network environment, several of which operate on-demand and utilize a route cache listing links that this node has learned. In such protocols, aggressive caching of overheard routes can significantly improve performance; in particular, overhead can be reduced by leveraging information received in packets overheard or forwarded from other nodes, including other routing packets and the source routes on other data packets. Unfortunately, such information sharing can substantially increase the risk of cache cross-pollution, since stale routing information in one node's cache, representing a link that no longer exists, can easily be added into the caches of other nodes. Even when a node has actually learned that a link no longer exists, it is still possible for that node to again hear the stale information. In this paper, we present a new mechanism which we call epoch numbers, to reduce this problem of cache staleness, by preventing the re-learning of stale knowledge of a link after having earlier heard that the link has broken. Our scheme does not rely on ad hoc mechanisms such as short-lived negative caching; rather, we allow a node having heard both of a broken link and a discovery of the same link to sequence the two events in order to determine whether the link break or the link discovery occurred before the other.
Analysis of multipath routing-part I: The effect on the packet delivery ratio
- IEEE Transactions on Wireless Communications
, 2004
"... Abstract—In this paper, we develop an analytical framework for evaluating multipath routing in mobile ad hoc networks. The instability of the topology (e.g., failure of links) in this type of network due to nodal mobility and changes in wireless propagation conditions makes transmission of time-sens ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
Abstract—In this paper, we develop an analytical framework for evaluating multipath routing in mobile ad hoc networks. The instability of the topology (e.g., failure of links) in this type of network due to nodal mobility and changes in wireless propagation conditions makes transmission of time-sensitive information a challenging problem. To combat the inherent unreliability of these networks, we propose a routing scheme that uses multiple paths simultaneously by splitting the information between a multitude of paths, so as to increase the probability that the essential portion of the information is received at the destination without incurring excessive delay. Our scheme works by adding an overhead to each packet, which is calculated as a linear function of the original packet bits. The resulting packet (information and overhead) is fragmented into smaller blocks and distributed over the available paths. The probability of reconstructing the original information at the destination is derived in an analytical form and its behavior is studied for some special cases. It is shown that, under certain constraints, the packet dropping probability decreases as the number of used paths is increased. Index Terms—Ad hoc networks, ad hoc routing, alternative path routing, diversity coding, multipath routing, network fault tolerance, quality of service. I.
Effects of Loss Rate on Ad Hoc Wireless Routing
, 2002
"... This paper uses measurements from two deployed wireless ad hoc networks to illustrate the effects of link loss rates on routing protocol performance. Measurements of these networks show that the radio links between the majority of nodes have substantial loss rates. These loss rates are high enough t ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
This paper uses measurements from two deployed wireless ad hoc networks to illustrate the effects of link loss rates on routing protocol performance. Measurements of these networks show that the radio links between the majority of nodes have substantial loss rates. These loss rates are high enough to decrease forwarding performance, but not high enough to prevent existing ad hoc routing protocols from using the links. Link-level retransmission can mask high loss rates, at the cost of substantial decreases in throughput. Simulations, driven by the observed loss rates, show that the shortest paths chosen by existing routing protocols tend to find routes with much less capacity than is available along the best route.

