Scalability study of the ad hoc on‐demand distance vector routing protocol

@article{Lee2003ScalabilitySO,
  title={Scalability study of the ad hoc on‐demand distance vector routing protocol},
  author={Sung-Ju Lee and Elizabeth M. Belding-Royer and Charles E. Perkins},
  journal={International Journal of Network Management},
  year={2003},
  volume={13}
}
As mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc routing have certain characteristics that may limit their scalability to large networks. This paper examines five different combinations of modifications that may be incorporated into virtually any on‐demand protocol in order to improve its scalability. The scalability of current on‐demand routing protocols is… 
Ad hoc on-demand distance-vector routing scalability
TLDR
This paper examines five different combinations of modifications which may be incorporated into virtually any on-demand protocol in order to improve its scalability.
Performance of routing protocols in very large-scale mobile wireless ad hoc networks
  • Xin Zhang, G. Riley
  • Computer Science
    13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
  • 2005
TLDR
A comprehensive simulation study is conducted of the performance of an on-demand routing protocol on a very large-scale, with as many as 50,000 nodes in the network, and addresses the scalability analysis based on various network sizes, traffic load, and mobility.
Scalability study of the CADV (congestion aware distance vector) routing protocol in mobile ad-hoc networks
TLDR
This paper examines the scalability issues pertinent to CADV protocol and provides some valuable data, which can cater to the operational concerns about CADV, but also to the needs of efficient, reliable and economical deployment, functioning and maintenance of the systems using it.
Scalability of an Ad Hoc On-Demand Routing Protocol in Very Large-Scale Mobile Wireless Networks
TLDR
A comprehensive simulation study is conducted of the performance of an on-demand routing protocol on a very large scale, with as many as 50,000 nodes in the network, and tries to exhaust the scalability boundary of the on- demand routing protocol for wireless ad hoc networks.
Performance of the Ad-hoc On-Demand Distance Vector Routing Protocol
TLDR
This paper presents the performance and scalability of the AODV protocol both in small and large networks.
Analysis on Scalability of Proactive Routing Protocols in Mobile Ad Hoc Networks
TLDR
The DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, the FSR performance decreased according to the increase of overhead corresponding to increasing number of nodes, and the OLSR with the shortest convergence time shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.
Limiting Control Overheads Based on Link Stability for Improved Performance in Mobile Ad Hoc Networks
TLDR
Two mechanisms are introduced – L-REQ (Limited forwarding of Route Requests) and L-REP (Limited initiation of Route Replies by intermediate nodes) – which make use of link stability to dynamically adapt the characteristic behaviour of existing protocols to achieve better network performance.
On Demand Routing Protocols for Mobile Ad Hoc Networks: A Review
TLDR
An overview of the existing on demand routing protocols is given and a parametric comparison is made with the recently developed protocols, proposed in the literature, including Scalable Multipath On Demand Routing (SMORT) etc.
Analyzing the Impact of Scalability on QoS-aware Routing for MANETs
TLDR
The impact of scalability on various QoS Parameters for MANETs routing protocols one proactive protocol (DSDV) and two prominent ondemand source initiated routing protocols are analyzed.
Adaptive cluster-based approach for reducing routing overheads in MANETs
  • I. Er, W. Seah
  • Computer Science
    2010 16th Asia-Pacific Conference on Communications (APCC)
  • 2010
TLDR
This paper presents an extension of a typical MANET routing protocol that integrates an adaptive clustering mechanism and shows that it is able to significantly reduce the communications overheads of routing protocols, thus paving the way for greater scalability.
...
...

References

SHOWING 1-10 OF 42 REFERENCES
Performance comparison of two on-demand routing protocols for ad hoc networks
  • Samir R Das, C. Perkins, E. Belding-Royer
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
It is demonstrated that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials.
Query localization techniques for on-demand routing protocols in ad hoc networks
TLDR
This work utilizes prior routing histories to localize the query flood to a limited region of the network, which contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.
A performance comparison study of ad hoc wireless multicast protocols
  • Sung-Ju Lee, W. Su, J. Hsu, M. Gerla, R. Bagrodia
  • Computer Science, Business
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
This study simulates a set of representative wireless ad hoc multicast protocols and evaluates them in various network scenarios, finding the relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations.
Ad-hoc on-demand distance vector routing
  • C. Perkins, E. Belding-Royer
  • Computer Science
    Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
TLDR
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Associativity-Based Routing for Ad Hoc Mobile Networks
  • C. Toh
  • Computer Science, Business
    Wirel. Pers. Commun.
  • 1997
TLDR
A new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment that is free from loops, deadlock and packet duplicates and has scalable memory requirements is presented.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TLDR
This paper investigates modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP, to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks.
Multicast operation of the ad-hoc on-demand distance vector routing protocol
TLDR
Ad-hoc On-Demand Distance Vector Routing is extended to offer novel multicast capabilities which follow naturally from the way AODV establishes unicast routes.
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
TLDR
This study is a comparison of three routing protocols proposed for wireless mobile ad-hoc networks, and in most simulations the reactive protocols (AODV and DSR) performed significantly better than DSDV.
RDMAR: a bandwidth-efficient routing protocol for mobile ad hoc networks
TLDR
A loop-free routing protocol for ad hoc mobile networks that is highly adaptive, efficient and scaleable; and is well-suited in large mobile networks whose rate of topological changes is moderate.
Dynamic Source Routing in Ad Hoc Wireless Networks
TLDR
This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
...
...