A new approach to on-demand loop-free routing in ad hoc networks

Garcia-Luna-Aceves, J.J.; Mosko, Marc; Perkins, Charles E.

doi:10.1145/872035.872043

Cited by 28 publications

(22 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The routing in MANETs has attracted a significant level of interest in recent years, see e.g., [2,[10][11][12][13][14][15][16] for overviews. In general, the MANET routing protocols can be classified into proactive routing protocols, which maintain routing tables which are consulted when transmitting a packet toward its destination, and reactive routing protocols, which find a route on demand, i.e., in response to the generation of a message for a specific destination.…”

Section: A Related Workmentioning

confidence: 99%

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Ritchie

Yang

Richa

et al. 2006

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a 1-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders we formally prove that if there exists a route from a source to a destination node with a minimum hop count of ∆, then COB discovers a route with at most O(∆) hops from the source to the destination node in at most O(∆) time and by sending at most O(∆ 2 ) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing. Index Terms1-hop clustering, algorithm/protocol design and analysis, message complexity, routing protocol, scalability, time complexity, wireless mobile ad hoc network.

show abstract

Section: A Related Workmentioning

confidence: 99%

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Ritchie

Yang

Richa

et al. 2006

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…The Labeled Distance Routing (LDR) protocol [12] also uses a distance label and sequence number, but it manipulates the pair such that only the destination can increase its own sequence number and it is much more likely than AODV to find a localized repair. Because LDR uses integer distance labels, there are some cases when a RREQ/RREP operation cannot put a new path in-order because the re-labeling cannot put a new node between two adjacent integer labels.…”

Section: Introductionmentioning

confidence: 99%

Ad Hoc Routing with Distributed Ordered Sequences

Mosko¹,

Garcia-Luna-Aceves

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

Abstract-We propose a new hop-by-hop routing protocol for ad hoc wireless networks that uses a novel sequence number scheme to ensure loop-freedom at all times. We use a single large per-destination label space to order nodes in a topological sort (directed acyclic graph). Nodes manipulate the label set innetwork without needing destination-controlled resets, so path repair is localized. The label size is large enough that it should never be exhausted in the lifetime of any given network. Route request flooding is performed through a new method that exploits the inherent partial order of the network, so nodes can share RREQ floods. Whereas most previous route request pruning techniques create a request tree, the new technique creates a directed acyclic request graph. Simulation results compared to AODV, DSR and OLSR show that the new protocol has in most cases equivalent or better packet delivery ratio and latency, but with a fraction of the network load.

show abstract

“…This prevents upstream nodes from replying to any route requests. The Labeled Distance Routing (LDR) [4] protocol improves on the way in which AODV uses sequence numbers by using an additional invariant based on distance. LDR orders nodes by using the last known shortest distance (feasible distance) with respect to a destination, and the destination sequence number is used as a "reset" when no path which satisfies the distance ordering can be obtained.…”

Section: Introductionmentioning

confidence: 99%