This paper addresses the maintenance of a communication network in which mobile agents are connected to their nearest neighbours. While all agents are able to move individually, the geometrical relation to each other changes along their trajectories. The main idea is to develop distributed algorithms which enable the agents to monitor and to switch communications links in real time so that the overall network topology equals a Delaunay triangulation at any time. It is shown which information has to be stored locally by each agent and exchanged among the agents via digital communication. The paper closes with an experimental evaluation of the proposed methods.

本文讨论了通信网络的维护，其中移动代理与其最近的邻居相连。虽然所有代理都能够单独移动，但彼此之间的几何关系会沿其轨迹发生变化。主要思想是开发分布式算法，使代理能够实时监控和切换通信链路，从而使整个网络拓扑结构在任何时候都等于 Delaunay 三角剖分。它显示了哪些信息必须由每个代理本地存储并通过数字通信在代理之间交换。论文最后对所提出的方法进行了实验评估。