Performance Comparison of Table-Driven、On-Demand and Cluster Based Routing Protocols for Mobile Ad-Hoc Networks

• Main Authors: Chii-Yuan Lei, 雷啟元
• Other Authors: Hsung-Pin Chang
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/4krb9f

碩士 === 國立中興大學 === 資訊網路多媒體研究所 === 99 === Mobile ad hoc networks is a special type of wireless networks; It is a collection of wireless mobile nodes dynamically forming a temporary network without using any existing network infrastructure. The communication between mobile nodes is direct transmission. However, due to the limit of transmission range, multiple hops may be needed for one node to transmit data with a node out of its transmission range. For this reason, how to select a good path to transmit data is the most important issue in mobile ad hoc networks. Many routing protocols have been proposed in recent years and can be classified into three categories, proactive, reactive and hybrid. In this paper, we compared the performance of the three kinds of routing protocol. We select DSDV as the proactive category, DSR and AODV as the reactive category, ZRP and UDPOC as the hybrid category. We used the ns-2 simulator for the experiments. As can be seen from the simulation results, UDPOC performed well in most scenarios. DSR is good at small and static environment, but if the nodes move fast, the performance of DSR is decreased drastically. For UDP flows, the performance of reactive protocols is better than proactive protocols, but for TCP flows, the performance of proactive protocols is better than reactive protocols.