Mobile Agents and Exploration
- Evangelos KranakisAffiliated withDepartment of Computer Science, Carleton
- , Danny KrizancAffiliated withDepartment of Computer Science, Wesleyan University
KeywordsDistributed algorithms Graph exploration Mobile agent Navigation Rendezvous Routing Time/Memory tradeoffs
Years and Authors of Summarized Original Work
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 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.
The network model ...
Reference Work Entry Metrics
- Mobile Agents and Exploration
- Reference Work Title
- Encyclopedia of Algorithms
- pp 1338-1341
- Print ISBN
- Online ISBN
- Springer New York
- Copyright Holder
- Springer Science+Business Media New York
- Additional Links
- Distributed algorithms
- Graph exploration
- Mobile agent
- Time/Memory tradeoffs
- Industry Sectors
- eBook Packages
- Ming-Yang Kao (1)
- Editor Affiliations
- 1. Department of Electrical Engineering and Computer Science, Northwestern University
- Author Affiliations
- 1365. Department of Computer Science, Carleton, Ottawa, ON, Canada
- 1366. Department of Computer Science, Wesleyan University, Middletown, CT, USA
To view the rest of this content please follow the download PDF link above.