Mobile agents algorithms for networks and geometric environments

适用于网络和几何环境的移动代理算法

• 批准号: 23992-2011
• 负责人: Czyzowicz, Jurek
• 金额: $ 1.75万
• 依托单位: Québec en Outaouais
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2015
• 资助国家: 加拿大
• 起止时间: 2015-01-01 至 2016-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=568701
• 关键词: Mobile; agents; algorithms; networks; geometric

In distributed computing portions of a computational task are assigned to several processors. To accomplish the goal of such teamwork, some means permitting the exchange of information between the participating processors are usually in place. One possibility is to send messages between the stationary processors located at some nodes of the network. Another option is to admit processors moving along the edges of the network, or travelling inside some geometric environment. Such mobile processors (agents) may exchange the information when they meet (or they are sufficiently close to each other) or they leave the information at some places of the environment so that it is available to other agents visiting such places in the future. The subject of this research project is the study of algorithms for mobile agents working in networks as well as in the geometric environments. The main objectives of the project concern the feasibility of the fundamental problems of for mobile agents as well as the efficiency of their algorithmic solutions. The measures of efficiency involve algorithmic time complexity, memory and power used by the agents. The problems include collective exploration of the environment, rendezvous or gathering, pattern formation (moving of the agents in order to form a particular arrangement in the environment, e.g. to permit execution of some specific task). The applications of mobile agents are numerous. In robotics the mobile devices perform a task of terrain exploration or some target search. The software agents migrate over the network and their typical objective is remote data collection. Other applications come from wireless and ad-hoc networks, nanotechnology, medical computing, distributed spatial control, and many others. The results of this project will permit the deployment of more efficient teams of mobile agents in distributed computations, resulting in reducing network traffic and improved network reliability. The feasibility results will provide a better understanding of what is achievable in the field of mobile agents computations.

在分布式计算中，计算任务的一部分被分配给几个处理器。为了实现这种团队合作的目标，通常会有一些允许参与处理程序之间交换信息的方法。一种可能性是在位于网络的某些节点的固定处理器之间发送消息。另一种选择是允许处理器沿着网络的边缘移动，或者在某个几何环境中移动。这样的移动处理器(代理)可以在它们相遇(或它们彼此足够接近)时交换信息，或者它们将信息留在环境的某些地方，以便将来访问这些地方的其他代理可以使用该信息。 本研究项目的主题是研究在网络和几何环境中工作的移动代理的算法。该项目的主要目标涉及移动代理基本问题的可行性及其算法解决方案的效率。效率的衡量标准包括算法的时间复杂度、内存和代理所使用的功率。这些问题包括对环境的集体探索、会合或聚集、模式形成(移动代理以便在环境中形成特定的安排，例如允许执行某些特定的任务)。 移动代理的应用非常广泛。在机器人技术中，移动设备执行地形探测或某些目标搜索的任务。软件代理通过网络迁移，其典型目标是远程数据收集。其他应用来自无线和自组织网络、纳米技术、医疗计算、分布式空间控制等许多领域。 该项目的结果将允许在分布式计算中部署更高效的移动代理团队，从而减少网络流量并提高网络可靠性。可行性结果将使人们更好地理解移动代理计算领域可以实现的目标。