Research Article Open Access

Analysis of Enhanced Associativity Based Routing Protocol

Said A. Shaar, Fawaz A.M. Masoud, Ayman Murad, Riyad Al-Shalabi and Ghassan Kanaan

Abstract

This study introduces an analysis to the performance of the Enhanced Associativity Based Routing protocol (EABR ) based on two factors; Operation complexity (OC) and Communication Complexity (CC). OC can be defined as the number of steps required in performing a protocol operation, while CC can be defined as the number of messages exchanged in performing a protocol operation[1]. The values represent the worst-case analysis. The EABR has been analyzed based on CC and OC and the results have been compared with another routing technique called ABR. The results have shown that EABR can perform better than ABR in many circumstances during the route reconstruction.

Journal of Computer Science
Volume 2 No. 12, 2006, 853-858

DOI: https://doi.org/10.3844/jcssp.2006.853.858

Submitted On: 26 June 2006 Published On: 31 December 2006

How to Cite: Shaar, S. A., Masoud, F. A., Murad, A., Al-Shalabi, R. & Kanaan, G. (2006). Analysis of Enhanced Associativity Based Routing Protocol. Journal of Computer Science, 2(12), 853-858. https://doi.org/10.3844/jcssp.2006.853.858

  • 2,706 Views
  • 3,220 Downloads
  • 3 Citations

Download

Keywords

  • ABR
  • EABR
  • wireless network
  • mobile ad-hoc networks