Abstract
In this paper we introduce an approach to describing the interaction of subscribers – carriers of sensors in information and reconnaissance systems. The approach is based on the use of a special class of graphs – dynamic graphs, defined as a sequence of "classical" static graphs, the transition between which is carried out by various graph operations (deleting / adding an edge, deleting / adding a vertex, replacing the vertex with a seed, priority joining vertices and edges, and etc.). The paper also formulated the task of forming an optimal topology in the network of subscribers – information and reconnaissance systems, taking into account the dynamics of communications between subscribers. Specific cases of the problem and their solutions are described, in which heredity is observed, i. e. the preservation of the solution with specified deviations in conditions of changing communications between subscribers of the network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.