TOWARDS A PREDICTIVE MODELING OF SELF-CONTROL MOBILE NETWORKS
The problems of investigations of routing algorithms and data transfer algorithms in mobile self-controlled networks by simulation methods are considered. This class of networks has specific properties: dynamically moving nodes, "limited distance" between nodes, and the absence of a centralized node. The mathematical model of such a network is a dynamic graph. It is important to predict the conditions when the connection failure of nodes occurs during the execution of various routing algorithms. Simulation experiments are performed in the AnyLogic environment.