The specifics of MANET (Mobile Ad-hoc Network) wireless decentralized self-organizing network, consisting of mobile nodes, is that each node of the network acts as a terminal device or as a router for transit traffic. The constant movement of the nodes does not allow forming the fixed topology of the network. Therefore, the problem of organizing and managing the traffic in MANET arises. An important component of the traffic management and constructing the path of packets with the data and service load is routing. The approaches used in the network routing algorithms use the resource-intensive procedures to restore the route, which means that it is necessary to reduce the amount of the generated service traffic. A model of the route recovery algorithm, the time of which is known to be less than the time for constructing a new route, has been proposed. The imitation simulation of the route recovery algorithm and the route rearrangement algorithm based on the AODV algorithm has been carried out. The efficiency of the proposed route recovery procedure allows a 52% improvement (mean) compared to a similar AODV algorithm. An analytical model of the route recovery procedure in MANET and a description of the network nodes movement have been proposed.
- Counter: 3084 | Comments : 0