Skip to main content

Instrumental supporting system for developing and analysis of software-defined networks of mobile objects

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.


This article describes the organization principles for wireless mesh networks (softwaredefined networks of mobile objects). The emphasis is placed on developing effective routing algorithms for these networks. The mathematical model of the system is the standard transportation network. The key parameter of the routing system is the node reachability coefficient, i.e., the function that depends on several basic and additional parameters (mesh factors), which characterize the route between two network nodes. Each pair (arc, node) has been juxtaposed to a composite parameter, which characterizes the reachability of the node by the route, which begins with this arc. The best (shortest) route between two nodes is the route with the maximum reachability coefficient. The rules of building and updating the routing tables by the network nodes have been described. With the announcement from the neighbor, the node gets information about the connection energy and reliability, the announcement time of receipt, and the absence of transient nodes, as well as about the connection capability. This information is used by the nodes as the basis for applying the penalization (decreasing the reachability coefficient) or the reward (increasing the reachability coefficient) to all routes through this neighbor node. The penalization/reward scheme has the following separate aspects: (1) penalization for actuality of information; (2) penalization/reward for node reliability; (3) penalization for connection energy; (4) penalization for the current connection capability. The simulator of the wireless mesh network of mobile objects has been developed based on the suggested heuristic routing algorithms. The description and characteristics of the simulator have been stated in the article. The peculiarities of its program realization have also been considered.

This is a preview of subscription content, access via your institution.


  1. B.A.T.M.A.N. Advanced Documentation Overview, 2014.

  2. Conner, W.S., et al., IEEE 802.11s Tutorial, 2006.

    Google Scholar 

  3. Mobile Mesh Networks for Military, Defense and Public Safety, 2015.

  4. Shen, W.L., et al., Autonomous Mobile Mesh Networks, IEEE Trans. Mobile Comput., 2014, vol. 13, no. 2, pp. 364–376.

    Article  Google Scholar 

  5. Boukerche, A., et al., Routing protocols in ad hoc networks: A survey, Comput. Networks, 2011, vol. 55, no. 13, pp. 3032–3080.

    Article  Google Scholar 

  6. Broch, J., et al., A performance comparison of multi-hop wireless ad hoc network routing protocols, Proc. of ACM/IEEE International Conference on Mobile Computing and Networking, 1998, pp. 85–97.

    Chapter  Google Scholar 

  7. Servetto, S.D. and Barrenechea, G., Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks, Proc. of 1st ACM International Workshop on Wireless Sensor Networks and Applications, 2002, pp. 12–21.

    Chapter  Google Scholar 

  8. Nelakuditi, S., et al., Adaptive proportional routing: A localized QoS routing approach, IEEE/ACM Trans. Networking, 2002, vol. 10, no. 6, pp. 790–804.

    Article  MathSciNet  Google Scholar 

  9. Baumann, R., et al., Routing in large-scale wireless mesh networks using temperature fields, IEEE Network, 2008, pp. 25–31.

    Google Scholar 

  10. Cormen, T.H., et al., Introduction to Algorithms, MIT Press, 2009.

    MATH  Google Scholar 

  11. Perkins, Ch.E., et al., Performance comparison of two on-demand routing protocols for ad hoc networks, IEEE Pers. Commun., 2001, pp. 16–28.

    Google Scholar 

  12. Awerbuch, B., et al., On the survivability of routing protocols in ad hoc wireless networks, in CERIAS Tech Report 2005–121, 2005.

    Google Scholar 

  13. Nelakuditi, S. and Zhang, Zh.-L., On selection of paths for multipath routing, Proc. of IWQoS, 2001, pp. 170–186.

    Google Scholar 

  14. Nguyen, Ph.H., et al., Distributed routing algorithms to manage power flow in agent-based active distribution network, Innovative Smart Grid Technologies Conference Europe (ISGT Europe), 2010, pp. 1–7.

    Google Scholar 

  15. Brunsch, T., et al., Smoothed analysis of the successive shortest path algorithm, 2015. arXiv: 1501.05493v1.

    MATH  Google Scholar 

  16. Spielman, D.A. and Teng, Sh.-H., Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, J. ACM, 2004, vol. 51, no. 3, pp. 385–463.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to V. A. Sokolov.

Additional information

Original Russian Text © V.A. Sokolov, S.V. Korsakov, A.V. Smirnov, V.A. Bashkin, E.S. Nikitin, 2015, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2015, Vol. 22, No. 4, pp. 546–562.

About this article

Verify currency and authenticity via CrossMark

Cite this article

Sokolov, V.A., Korsakov, S.V., Smirnov, A.V. et al. Instrumental supporting system for developing and analysis of software-defined networks of mobile objects. Aut. Control Comp. Sci. 50, 536–545 (2016).

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI:


  • mesh network
  • network protocol
  • routing
  • penalization
  • heuristic algorithm
  • simulator