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

This article describes the organization principles for wireless mesh-networks (software-defined networks of mobile objects). The emphasis is on the questions of getting effective routing algorithms for such networks.
The mathematical model of the system is the standard transportation network. The key parameter of the routing system is the node reachability coefficient — the function depending on several basic and additional parameters (“mesh-factors”), which characterize the route between two network nodes. Each pair (arc, node) is 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 refreshing the routing tables by the network nodes are described. With the announcement from the neighbor the node gets the information about the connection energy and reliability, the announcement time of receipt, the absence of transitional nodes and also about the connection capability. On the basis of this information the node applies 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 some separate aspects:

• Penalization for the actuality of information.
• Penalization / reward for the reliability of a node.
• Penalization for the connection energy.
• Penalization for the present connection capability.

The simulator of the wireless mesh-network of mobile objects is written. It is based on the suggested heuristic algorithms. The description and characteristics of the simulator are stated in the article. The peculiarities of its program realization are also examined.