2015, Vol.18, No.1, pp.99-104
The problem of message routes evaluation in a dynamic network of mobile subscribers is investigated. The network of mobile objects is represented by a graph with varying in time structure. The searching of the optimal route at any given time has polynomial complexity. As a solution, logical-probabilistic method to build the estimates of routes has been proposed. This method allows to obtain an analytical expression of the message delivery probability function for s-connected graph with a given dimension. In this case, the time of searching the optimal route can be considered as a constant.
Key words:
Message delivery probability function, mobile object, dynamic system, route messaging,
logical-probabilistic method, mesh-network
Full text: Acrobat PDF (136KB) Open Access
Copyright © Nonlinear Phenomena in Complex Systems. Last updated: May 25, 2015