PERFORMANCE MEASUREMENT OF ROUTING ALGORITHMS IN AD-HOC NETWORKS
الموضوعات : Computer Engineering
1 - گروه مهندسی برق،واحد فسا،دانشگاه آزاد اسلامی،فسا،ایران
الکلمات المفتاحية: BF, AODVR, DSR,
ملخص المقالة :
The main aim of this article is to show the differences performance between ad-hoc routing algorithms. Here we consider the Bellman-Ford (BF), Ad hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) algorithms facing different node mobility speed. The study covers the following topics: the algorithms, simulation environment and the comparison of measured values. we can state that the modularity speed of the nodes in ad-hoc networks plays a significant role in the overall performance. We can see that different algorithms have different throughput parameters. For example the DSR is very strong at low speed but at higher speeds it is worse than the AODVR. It is seen that the AODVR and DSR are better at high speed than the BF.
