Clustered (Hierarchical) Ad Hoc Routing Protocol (CARP)


Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed infrastructure or centralized administration. With the increase of the number of users and large amount of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a scalable routing protocol, based on AODV protocol, called Clustered Ad Hoc Routing Protocol (CARP). CARP achieves scalability by means of two techniques. First, by dividing the network into clusters and isolating local traffic within these clusters from global connections aboard. And second, by modifying the route discovery phase of AODV and making only bases and borders involved instead of all nodes in the networks. The evaluation methodology and simulation results obtained showed the effectiveness of CARP in local communications, where it outperforms AODV in terms of Packet Delivery Fraction (PDF), Control Routing Load (CRL), and Average End-to-End Delay (AEED). On the other hand, CARP also showed its superiority in global communication, where the CRL, in all cases, was always less than that of AODV.

  • Abstract
  • Keywords
  • 1 Introduction
  • 2 Literature Review
  • 3. Clustered Ad-Hoc Routing Protocol (CARP)
  • 4. Performance Evaluation and Result Analysis
  • 5. Conclusion
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In