Telecommunication Systems and Computer Networks

Qualification routes messaging for dynamic systems using а logical-probabilistic method

V. V. Glazunov, M. A. Kurochkin, S. G. Popov

St. Petersburg Polytechnic University

Abstract: In this paper we have considered the problem of message routes evaluation in the dynamic network of mobile subscribers. The network of mobile objects is represented by a graph with the time-varying structure. The search of the optimal route at any given time has polynomial complexity. As a solution, we suggest thelogical-probabilistic method to build estimates of the routes. This method allows obtaining an analytical expression of the message delivery probability function for a s-connected graph with the given dimension. In this case, the time of searching for an optimal route can be considered as a constant.

Keywords: function of message delivery probability, mobile object, dynamic system, route messaging, logical-probabilistic method, mesh-network.

UDC: 004.22,658.5,65.011.56

Language: English

DOI: 10.5862/JCSTCS.212.2