Research On Routing Algorithm Based On Link Stability Prediction In Ad Hoc Network

Mobile Ad Hoc network is a kind of mobile multi-hop, self-organized and distributed wireless network. There is no network administration and static infrastructure. For Ad Hoc network characteristics, many protocols have been proposed by scholars both at home and abroad. Backup path routing protocols can meet the requirements of fault tolerance, routing durability better than the single routing protocols, so that they are being hot issues around the world.In this paper, we optimize the classical routing protocol AODV(Ad Hoc On-Demand Distance Vector) and introduce an improved routing protocol based on link stability and backup path routing selection. The protocol consider backup path selection and link stability as important performance index, it can improve the performance of whole network, and fix the link by backup paths when interruption happens.The algorithm based on cost function to select a backup path only reflects the status of the link in the present time and can not reflect the status of the link in the next moment because nodes frequently move in Ad Hoc network. Effective current link maybe becomes unstable in the next moment. In order to solve this problem, this paper mixs link stability prediction mechanism with algorithm based on cost function to select a backup path. This paper proposes LS-BPR (Link Stability Prediction based on Backup Path Routing) algorithm. This mechanism selects primary path routing based on minimum delay.This mechanism uses cost function as standard of selecting backup path, and then adds ARMIA model prediction algorithm of link stability to further choose backup path. If this link has smaller similarity with primary path and the better stability, it will have been selected as backup path.Using the QualNet simulation platform, this paper compares the performance of AODV based on LS-BPR and AODV. Simulation results show that LS-BPR AODV improves network performance, reduces the number of route discovery of the source node, reduce the number of route fracture, and reduces the loss rate and network delay. The throughput is also improved. Improvement of network performance reflects the superiority of the LS-BPR algorithm. In most cases, compared with the AODV, AODV based on LS-BPR has better performance.