Abstract

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.

中文翻译：

---

自治参与者网络中信息交换的优化

摘要

提出了用于在移动自治参与者的通信网络中规划信息消息序列的次优算法。这些算法使用来自传输序列的所有消息的总传递时间或消息的平均传递时间的上限作为最优性标准。考虑了该问题的几种表述，它们的不同之处在于消息集是否存在初步排序。