TY  - JOUR
AU  - Shaar, Said A. 
AU  - Masoud, Fawaz A.M. 
AU  - Murad, Ayman 
AU  - Al-Shalabi, Riyad 
AU  - Kanaan, Ghassan 
PY  - 2006
TI  - Analysis of Enhanced Associativity Based Routing Protocol
JF  - Journal of Computer Science
VL  - 2
IS  - 12
DO  - 10.3844/jcssp.2006.853.858
UR  - https://thescipub.com/abstract/jcssp.2006.853.858
AB  - 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.