Results 1 - 10
of
33
Split Multi-path Routing with Maximally Disjoint Paths in Ad Hoc Networks
- In Proc. Int. IEEE Conf. on Comm., 2001
"... Abstract – In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols however ..."
Abstract
-
Cited by 220 (4 self)
- Add to MetaCart
Abstract – In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols however, build and rely on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process. In QoS routing for wired networks, multiple path routing is popularly used. Multiple routes are however, constructed using link-state or distance vector algorithms which are not well-suited for ad hoc networks. We propose an on-demand routing scheme called Split Multipath Routing (SMR) that establishes and utilizes multiple routes of maximally disjoint paths. Providing multiple routes helps minimizing route recovery process and control message overhead. Our protocol uses a per-packet allocation scheme to distribute data packets into multiple paths of active sessions. This traffic distribution efficiently utilizes available network resources and prevents nodes of the route from being congested in heavily loaded traffic situations. We evaluate the performance of our scheme using extensive simulation. I.
On-demand Multipath Distance Vector Routing in Ad Hoc Networks
- in Proceedings of IEEE International Conference on Network Protocols (ICNP
, 2001
"... We develop an on-demand, multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The resulting protocol is referred to as Ad hoc Ondemand Multipath Di ..."
Abstract
-
Cited by 148 (3 self)
- Add to MetaCart
We develop an on-demand, multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The resulting protocol is referred to as Ad hoc Ondemand Multipath Distance Vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loopfreedom is guaranteed by using a notion of "advertised hopcount." Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a remarkable improvement in the end-to-end delay --- often more than a factor of two, and is also able to reduce routing overheads by about 20%. 1
AODV-BR: Backup Routing in Ad hoc Networks
, 2000
"... Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multihop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multihop network communications. A recent t ..."
Abstract
-
Cited by 88 (3 self)
- Add to MetaCart
Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multihop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multihop network communications. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. In this paper, we propose a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes. Our algorithm establishes the mesh and multipaths without transmitting any extra control message. We apply our scheme to the Ad-hoc On-Demand Distance Vector (AODV) protocol and evaluate the performance improvements by simulation.
A Framework for Reliable Routing in Mobile Ad Hoc Networks
- IEEE INFOCOM
, 2003
"... Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. We first propose a modified version of the popular AODV protocol that allows us to discover ..."
Abstract
-
Cited by 68 (1 self)
- Add to MetaCart
Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. We first propose a modified version of the popular AODV protocol that allows us to discover multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network for efficient operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases considerably even with a low percentage of reliable nodes when we control their positions and trajectories in accordance with our algorithm.
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.
Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks
, 2001
"... The on-demand routing protocols that have been proposed to date use either path information (e.g., DSR) or distance information (e.g., AODV). We present SOAR, an on-demand link-state protocol based on partial link-state information in which a wireless router communicates to its neighbors the link st ..."
Abstract
-
Cited by 15 (6 self)
- Add to MetaCart
The on-demand routing protocols that have been proposed to date use either path information (e.g., DSR) or distance information (e.g., AODV). We present SOAR, an on-demand link-state protocol based on partial link-state information in which a wireless router communicates to its neighbors the link states of only those links in its source tree that belong to the paths it chooses to advertise for reaching destinations with which it has active flows. SOAR does not require periodic link-state advertisements when there are no link connectivity changes in the network. Simulation studies for several scenarios of node mobility and traffic flows reveal that SOAR performs more efficiently than DSR, which is one of the best performing on-demand routing approaches based on path information. Keywords---Mobile Networks, Wireless Networks, On-Demand Routing, Ad-Hoc networks, Link-State Routing I.
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.
Survivable mobile wireless networks: issues, challenges, and research directions
- Proc. ACM workshop on Wireless security
, 2002
"... In this paper we survey issues and challenges in enhancing the survivability of mobile wireless networks, with particular emphasis on military requirements �. Research focus on three key aspects can significantly enhance network survivability: (i) establishing and maintaining survivable topologies t ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
In this paper we survey issues and challenges in enhancing the survivability of mobile wireless networks, with particular emphasis on military requirements �. Research focus on three key aspects can significantly enhance network survivability: (i) establishing and maintaining survivable topologies that strive to keep the network connected even under attack, (ii) design for endto-end communication in challenging environments in which the path from source to destination is not wholly available at any given instant of time, (iii) the use of technology to enhance survivability such as adaptive networks and satellites.
Dynamically Adaptive Multipath Routing based on AODV
- In Med-Hoc-Net
, 2004
"... Abstract — Mobile ad hoc networks are typically characterized by high mobility and frequent link failures that result in low throughput and high end-to-end delay. To reduce the number of route discoveries due to such broken paths, multipath routing can be utilized so that alternate paths are availab ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
Abstract — Mobile ad hoc networks are typically characterized by high mobility and frequent link failures that result in low throughput and high end-to-end delay. To reduce the number of route discoveries due to such broken paths, multipath routing can be utilized so that alternate paths are available. Current approaches to multipath routing make use of pre-computed routes determined during route discovery. These solutions, however, suffer during high mobility because the alternate paths are not actively maintained. Hence, precisely when needed, the routes are often broken. To overcome this problem, we present an adaptive multipath solution. In this approach, multiple paths are formed during the route discovery process. All the paths are maintained by means of periodic update packets unicast along each path. These update packets measure the signal strength of each hop along the alternate paths. At any point of time, only the path with the strongest signal strength is used for data transmission. In this paper, we present two variations of our protocol and evaluate both with respect to two previously published multipath routing protocols. Simulation results show that the proposed solutions result in significant performance improvement. I.
A New Approach to On-Demand Loop-Free Routing in Ad Hoc Networks
- in Ad Hoc Networks,” Proc. PODC 2003
, 2003
"... A new protocol is presented for on-demand loop-free routing in ad hoc networks. The new protocol, called labeled distance routing (LDR) protocol, uses a distance invariant to establish an ordering criterion and per-destination sequence numbers to reset the invariant resulting in loop-freedom at ever ..."
Abstract
-
Cited by 10 (3 self)
- Add to MetaCart
A new protocol is presented for on-demand loop-free routing in ad hoc networks. The new protocol, called labeled distance routing (LDR) protocol, uses a distance invariant to establish an ordering criterion and per-destination sequence numbers to reset the invariant resulting in loop-freedom at every instant. The distance invariant allows nodes to change their next hops or distances to destinations without creating routing-table loops. The destination sequence number, which only the destination may increment, permits nodes to reset the values of their distance invariants. The performance of LDR is compared against the performance of three other protocols that are representative of the state-of-theart, namely AODV, DSR and OLSR.

