Study On AODV Protocol With Backup Routing Algorithm

Mobile Ad Hoc Network is defined as a distributed peer network without a center and fixed network structure. The traditional route protocols, such as RIP and OSPF, fail to meet the practical needs, largely because nodes of the Ad Hoc network are moving and because of the continuous variation of the network topology. Therefore, the focus of studies on the Ad Hoc network has all the way been on the appropriate route protocols. The on-demand route protocols are the mainstream route protocols that have been widely employed in the mobile Ad Hoc network. Ad Hoc on-demand distance vector, as a typical on-demand route protocol, has the advantages of simplicity of the operation, on-demand route, lack of the route loop and excellent scalability. However, there is only one available route in the course of data session, so the transmitting data will be simply dropped when this route switches off. As a consequence, the performance and the communication quality of the network will be drastically impacted.Based on a relatively comprehensive account of the principles and characteristics of the AODV route protocol, improved methods were brought forward here to deal with the deficiencies of the AODV route protocol, the improved protocol called the AODV with Backup Routing (AODV-BR). This protocol, based on broadcasting properties of wireless transmission, can establish several alternative routes to the destination node through forming mesh structures but do not create additional control information, therefore enhancing the performance and communication quality of the network.Additionally, we used the Network Simulator 2 (NS2) to perform the simulations of the proposed AODV-BR route protocol and the traditional AODV route protocol. Our simulation results showed that, compared to the traditional AODV route protocol, the AODV-BR route protocol could effectively enhance the delivery rate of the data packets, decrease the average end-to-end delay, and reduce control overhead.