Critical path routing (CPR) protocol for mobile ad hoc networks

  • Authors:

  • Ihab El Kabary;Said Ghoniemy;Amal Elnahas

  • Affiliations:

  • Faculty of Computer and Information Sciences, Ain Shams University, Egypt;Faculty of Computer and Information Sciences, Ain Shams University, Egypt;Faculty of Media Engineering & Technology, German University in Cairo, Egypt

  • Venue:
  • PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a hybrid adaptive ad hoc routing protocol, named Critical Path Routing (CPR) that strives to incorporate the merits of both reactive and proactive ad hoc routing algorithms. The genuine aspect of CPR is that it initially starts-off as a conventional reactive Dynamic Source Routing (DSR) protocol. The network traffic is monitored in attempt to gradually discover pairs of highly interactive nodes that engage in sending data to each other more often than other nodes in the network. CPR then constructs Critical Paths (CPs) between these pairs of nodes and proactively safe guards these CPs. The aim of our work is to achieve low latency between highly active pairs of nodes, thus increasing the overall performance of the network. Simulation results showed that CPR outclassed DSR with a decrease of 23.7% in end-to-end delay when nodes were in a high degree of mobility, but with a relatively high overhead cost. An enhancement is added to our CPR protocol to decrease the relatively high overhead by decreasing the engagement of intermediate nodes in the proactive monitoring of CPs. The total overhead decreased to only 14.74%.