Optimization of Information Exchange in a Network of Autonomous Participants

Suboptimal algorithms for planning a sequence of information messages in the communication network of mobile autonomous participants are proposed. The algorithms use as optimality criteria the upper bounds of either the total delivery time of all messages from the transmitted sequence or the average...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer & systems sciences international 2022-12, Vol.61 (6), p.935-943
Main Authors: Gruzlikov, A. M., Kolesov, N. V., Litunenko, E. G., Skorodumov, Yu. M.
Format: Article
Language:English
Subjects:
Algorithms
Communications networks
Computer Methods
Control
Engineering
Mechatronics
Optimality criteria
Optimization
Robotics
Upper bounds
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Suboptimal algorithms for planning a sequence of information messages in the communication network of mobile autonomous participants are proposed. The algorithms use as optimality criteria the upper bounds of either the total delivery time of all messages from the transmitted sequence or the average delivery time over the messages. Several formulations of the problem are considered, which differ in the presence or absence of preliminary ordering for the set of messages.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230722060107