Journal of Computer Science | |
Analysis of Enhanced Associativity Based Routing Protocol | Science Publications | |
Ayman Murad1  Ghassan Kanaan1  Riyad A. Shalabi1  Fawaz A.M. Masoud1  Said A. Shaar1  | |
关键词: ABR; EABR; wireless network; mobile ad-hoc networks; | |
DOI : 10.3844/jcssp.2006.853.858 | |
学科分类:计算机科学(综合) | |
来源: Science Publications | |
【 摘 要 】
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.
【 授权许可】
Unknown
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201911300983050ZK.pdf | 81KB | download |