wireless networks, dynamic routing, peer-to-peer, ad-hoc networks, MANET, Ad hoc On-Demand Distance Vector algorithm


Background. The task of building a network with a continuous mode of data transmission for mobile nodes is to build a wireless network and maintain a state of loss of the minimum number of packets during the exchange of information. One of the main problems of MANET (Mobile Ad hoc Networks) network management is their dynamics and the fact that mobile devices are limited in their computing capabilities. There is a problem of traffic routing within MANET networks and the internal hierarchy of transmitters involved in the system. These networks also have problems with bandwidth optimization and power management. Lack of fixed topology introduces new scientific problems, such as network configuration, device search and topology support, as well as special addressing and self-destruction of the network. This task is relevant for data transmission between mobile devices in terms of reconnaissance operations.

Objective. The goal of the article is the research of reducing packet delays in nodes during dynamic routing, reducing service traffic and software optimization of data transmission in MANET relative to existing methods.

Methods. To achieve this goal, we use computer simulation, statistical and empirical methods. Based on the optimization of dynamic routing using the Ad hoc On-Demand Distance Vector algorithm, four main indicators are identified: speed of path establishment, message delay in one node, occurrence of loops, the amount of service traffic. To test the proposed method, a graph of twelve vertices simulating a wireless peer-to-peer MANET network is simulated. Testing is performed in more than a hundred iterations. At each iteration, the vertices of the network graph are randomly selected and the data transfer between each vertex of the graph is modeled.

Results. The use of the created software provides the analysis of the indicators of the quality of continuous data transmission and network routing by the proposed method. The proposed method shows reducing the amount of office traffic by 15 % and the best results by 5–10 % reduction of delay time within the node and when processing messages.

Conclusions. A method is proposed to reduce the delay time within a node that changes its position when processing a message, to reduce the amount of service traffic when transmitting data between nodes in the MANET network. Computer simulation is used to study the proposed method.


P. Khanpara, “Security issues in MANETs”, in Int. J. Adv. Res. Sci. Eng., vol. 6, no. 6, pp. 220–225, 2017.

P. Khanpara and B. Trivedi, “Security in mobile ad hoc networks”, in Proc. Int. Conf. Commun. Netw., vol. 508, pp. 501-511, 2017. doi:10.1007/978-981-10-2750-5_52

Wireless ad hoc network. Routing. [Online]. Available:

T. Hara, “Data management issues in mobile ad hoc networks”, in Proc. Jpn Acad. Ser. B, vol. 93, no. 5, pp. 270–296, 2017. doi: 10.2183/pjab.93.018

L. Odedra et al., “Detection and prevention of selfish attack in MANET using dynamic learning”, IOSR J. Comput. Eng., vol. 18, no. 3, pp. 54–61, 2016.

S. Basagni et al., “Mobility-adaptive protocols for managing large ad hoc networks”, in ICC 2001. IEEE Int. Conf. Commun., vol. 5, pp. 1539–1543, 2001. doi: 10.1109/ICC.2001.937178

I.F. Akyildiz et al., “Wireless mesh networks: A survey” in Comput. Netw., vol. 47, no. 4, pp. 445–487, 2005. doi: 10.1016/j.comnet.2004.12.001

C.E. Perkins et al., “Performance comparison of two on-demand routing protocols for ad hoc networks”, IEEE Pers. Commun., vol. 8, no. 1, pp. 16–28, 2001. doi: 10.1109/98.904895

C.E. Perkins et al. (2003). Ad hoc on-demand distance vector (AODV) routing” [Online]. Available:

I.D Chakeres and L. Klein-Berndt, “AODVjr, AODV simplified”, ACM SIGMOBILE Mob. Comput. Commun. Rev., vol. 6, no. 3, pp. 100–101, 2002. doi: 10.1145/581291.581309