Reference Work Entry

Encyclopedia of Algorithms

pp 1338-1341

Date:

Mobile Agents and Exploration

  • Evangelos KranakisAffiliated withDepartment of Computer Science, Carleton
  • , Danny KrizancAffiliated withDepartment of Computer Science, Wesleyan University

Keywords

Distributed algorithms Graph exploration Mobile agent Navigation Rendezvous Routing Time/Memory tradeoffs

Years and Authors of Summarized Original Work

  • 1952; Shannon

Problem Definition

How can a network be explored efficiently with the help of mobile agents? This is a very broad question and to answer it adequately it will be necessary to understand more precisely what mobile agents are, what kind of networked environment they need to probe, and what complexity measures are interesting to analyze.

Mobile Agents

Mobile agents are autonomous, intelligent computer software that can move within a network. They are modeled as automata with limited memory and computation capability and are usually employed by another entity (to which they must report their findings) for the purpose of collecting information. The actions executed by the mobile agents can be discrete or continuous and transitions from one state to the next can be either deterministic or non-deterministic, thus giving rise to various natural complexity measures depending on the assumptions being considered.

Network Model

The network model ...

This is an excerpt from the content