Adaptive repair algorithm for TORA routing protocol based on flood control strategy

2020 
Abstract Temporally Ordered Routing Algorithms (TORA) is one of the most representative on-demand routing protocols in Mobile Ad Hoc Networks (MANET). This protocol is widely used in high-speed mobile MANET because of its robust topology. In order to improve the shortcomings of TORA in routing maintenance, such as high overhead and delay, and make the routing more suitable for emergency and disaster relief network, an adaptive repair algorithm for TORA routing protocol based on flood control strategy (AR-TORA-FCS) is proposed. Firstly, according to the characteristics of the uniform deployment of the nodes in the network, the self-repair process of the self-repair nodes in the directed acyclic graph (DAG) of TORA is transformed into the optimal search problem for the optimal nodes, and the formula is established. According to Ray-Algorithm to search for the optimal node, it is proved that the search result is the optimal solution of the process of searching for the optimal node. Then, a conditional algorithm to determine the self-repair process is given, and the conditional threshold to initiate the self-repair process is determined. The mapping relationship between the repair process of self-repair nodes and the distance between the nodes is established, and the path repair is carried out before the path fails. In order to reduce control overhead, the definition of optimization region is given, and the algorithm to determine the optimization region is proposed. Simulation results show that the algorithm reduces control overhead, improves the packet delivery rate, and improves average end-to-end delay. The mobile device, which is subject to unified deployment, is used as a network node to test the proposed adaptive repair algorithm in the actual rescue and disaster relief environment. The results show that it is basically consistent with the simulation results, and the overall performance is improved significantly.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    58
    References
    30
    Citations
    NaN
    KQI
    []