ADDV-LCIN: An AODV-based Multipath Routing Protocol

In recent years, with the prevalence of portable computer and PDA, and the celerity develop in wireless communication area. People hope the personal communication could be used in any environments and time. The Ad Hoc network offers unique benefit and versatility for certain environment and certain application. 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. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless Ad Hoc network because of its effectiveness. However, most proposed on-demand routing protocols use single path. These protocols need a new discovery whenever a path breaks. Such frequent route discoveries cause some problem. To avoid such problem, we focus on AODV and propose an AODV-based new multipath routing protocol for mobile Ad Hoc network. The proposed routing protocol use a new method to find routing which has a little number of common intermediate nodes on its path. To count the number of common nodes on the path, we add a new field called nodecount to RREP for show the number of common nodes. 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. At last, we simulate the protocol, results show that the AODV-LCIN achieves better performance in terms of delay than AODV.