Research Of The Multipath Routing Arithmetic In Wireless AD HOC Network

The Ad Hoc network doesn't rely on fixed based stations or a wired backbone infrastructure. It has some characters: mobility nodes, limited bandwidth, finity energy , multi-hop, security, and these point challenge the Ad Hoc network, including: effective routing , Qos issues, MAC protocol, mobility management and security etc. Among those challenges above, routing schemes are the mostly focused area in Ad Hoc network.Based on the recearch of the Ad hoc routing protocols,this dissertation presents a comparative simulation study of on-demand protocols with the more traditional proactive protocols on a common platform by using NS-2. This simulation cover a range of design choices: AODV,DSR,TORA. The simulation results show that AODV has predominant performance on network cost and time delay. However, through the analysis and simulation we found that the protocol has its own srawbacks. When the road linking fails, the protocol itself does not have the capacity to heal ourselves.On-demand routing in particular is widely developed in bandwidth constrained mobile wireless Ad Hoc network because of its excellent performance. However, most proposed on-demand routing protocols use single path. These protocols need a new discovery whenever a path breaks and reduce network performance. We focus on AODV and propose an AODV-based new multipath routing protocol which named route's common nodes count for mobile Ad Hoc network. The protocol is using the repeating RREP which is incepted in AODV to build a multipath routing. The advantage of the routing is that the nodes will select a standby route when the path broken, and it does not affect the other. The protocol can ensure the communication by autochthonic repair to ensure the multipath communication.The experimental results show that the RCNC protocol achieves better performance in terms of delay than AODV.