The quickly switching routing algorithm based on multi-path in mobile Ad Hoc networks

1Introduction Thenavyandcommerceareallconcentratingtheiref fortstoresearchformobileAdHocnetworks,including itsstructure,networktopology,protocols.Modernma rinejustdependsonresearchingonwirelessmobileAd Hocnetworkstokeeptechnicallyadvanced.Commer cialappli…

The quickly switching routing algorithm based on multi-path in mobile Ad Hoc networks

This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.