On the scalability of ad hoc routing protocols

Santivañez, Cesar; McDonald, Bruce A.; Stavrakakis, Ioannis; Ramanathan, Ram

doi:10.1109/infcom.2002.1019422

Cited by 102 publications

(71 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Specifically, the complexity for route discovery can be proportional to the shortest source-to-destination distance, and independent of the overall network size. This complexity is significantly lower than those of previously formally analyzed routing protocols which had complexities directly proportional to the overall network size [1][2][3][4][5][6][7] (which can be much larger than the shortest source-to-destination distance).…”

Section: R E L At E D W O R Kmentioning

confidence: 91%

“…Indeed, a large number of studies have contributed to a better understanding of MANET routing. However, the formal analysis of the complexity of MANET routing has only recently attracted some attention, see e.g., [1][2][3][4][5][6][7]. It has been found that the complexity of the existing MANET routing algorithms is typically proportional to the overall network size, e.g., the total number of nodes in the network, unless restrictive assumptions about the node locations or their mobility patterns are made.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

Yang

Ritchie

Richa

et al. 2007

Wireless Pers Commun

View full text Add to dashboard Cite

Abstract. As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.

show abstract

Section: R E L At E D W O R Kmentioning

confidence: 91%

Section: Introductionmentioning

confidence: 99%

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

Yang

Ritchie

Richa

et al. 2007

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…As flat routing and managing protocols are not suitable for it because of the process and message overheads they induce [33], a well known solution is to introduce a hierarchy. So, we proposed a clustering algorithm motivated by the fact that in a multi-hop wireless environment, the less information exchanged or/and stored, the better.…”

Section: The Link Density Metricmentioning

confidence: 99%

Distributed Node Location in Clustered Multi-hop Wireless Networks

Mitton

Fleury

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract:Ad hoc routing protocols proposed in the MANET working group are all flat routing protocols and are thus not suitable for large scale or very dense networks because of bandwidth and processing overheads they generate. A common solution to this scalability problem is to gather terminals into clusters and then to apply a hierarchical routing, which means, in most of the literature, using a proactive routing protocol inside the clusters and a reactive one between the clusters. We previously introduced a cluster organization to allow a hierarchical routing and scalability, which have shown very good properties. Nevertheless, it provides a constant number of clusters when the intensity of nodes increases. Therefore we apply a reactive routing protocol inside the clusters and a proactive routing protocol between the clusters. In this way, each cluster has O(1) routes to maintain toward other ones. When applying such a routing policy, a node u also needs to locate its correspondent v in order to pro-actively route toward the cluster owning v. In this paper, we propose a localization scheme, based on Distributed Hashed Tables and Interval Routing

show abstract

“…However, a large number of nodes coupled with the inherent limits of the endto-end throughput of ad hoc networks lead to potential bandwidth starvation, unless extra care is taken to develop highly scalable algorithms. For some services/tasks, such as routing in homogenous networks [6], even the best solutions cannot prevent bandwidth starvation when the network size exceeds a certain size (the "curse of dimensionality").…”

Section: Introductionmentioning

confidence: 99%

Towards Adaptable Ad Hoc Networks: The Routing Experience

Santivañez¹,

Stavrakakis

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Network users not only demand new and versatile application support by the networks but they themselves are becoming part of the network (network routers, caches, processors, etc) by contributing their resources to it and being engaged in ad hoc networking structures. As the large and diverse user population becomes more and more part of the networking infrastructure it is clear that networks will be dominated by a new type of network nodes which are much more nomadic, diverse and autonomic than in traditional networks, creating a fairly diverse -in size and characteristics -networking environment. For instance, low cost/high availability/convenience of wireless devices are expected to lead to the deployment of a plethora of wireless networks for diverse applications: from rescue missions to military communications, from collaborative computing and sensor networks to web browsing and e-mail exchange to real time voice and video communications. Each with different constraints and requirements. And, for each type of application there is also a high degree of variability in the networking context: from a low mobile network of a few nodes to a highly mobile network with thousands of nodes.This high degree of variability in the networking environment calls for a new design paradigm where network elements (nodes) should be able to adapt to totally different scenarios, engaging in a different behavior depending on the situation. Thus, next generation networks should be able to learn their environment/context and adapt their behavior accordingly in order to achieve their goals. In this paper we introduce some key mechanisms required to enable broad adaptability. Although these mechanisms are general and common to a large variety of tasks/services (e.g. service discovery, location management, cooperative computing, clustering, etc.) we will discuss them in the context of the routing service, leveraging our past experience on the area. This will allow us to ground the discussion in concrete terms and the reader to better visualize the concepts.

show abstract

On the scalability of ad hoc routing protocols

Cited by 102 publications

References 10 publications

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

Distributed Node Location in Clustered Multi-hop Wireless Networks

Towards Adaptable Ad Hoc Networks: The Routing Experience

Contact Info

Product

Resources

About