Using Set-Based Heading to Improve Mobile Agent Movement

• Published in: 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems pp. 120 - 128
• Main Authors: Prosser, Bryan, Dawes, Neal, Fulp, Errin W., McKinnon, A. David, Fink, Glenn A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2014
• Subjects: cover time; Electronic mail; Geography; heading; History; Mobile agents; random walk; Security; Time measurement; Topology
• ISSN: 1949-3673
• DOI: 10.1109/SASO.2014.24

Cover time measures the time (or number of steps) required for a mobile agent to visit each node in a network (graph) at least once. A short cover time is important for search or foraging applications that require mobile agents to quickly inspect or monitor nodes in a network, such as providing situational awareness or security. Speed can be achieved if details about the graph are known or if the agent maintains a history of visited nodes, however, these requirements may not be feasible for agents with limited resources, they are difficult in dynamic graph topologies, and they do not easily scale to large networks. This paper introduces a set-based form of heading (directional bias) that allows an agent to more efficiently explore any connected graph, static or dynamic. When deciding the next node to visit, agents are discouraged from visiting nodes that neighbor both their previous and current locations. Modifying a traditional movement method, e.g., random walk, with this concept encourages an agent to move toward nodes that are less likely to have been previously visited, reducing cover time. Simulation results with grid, scale-free, and minimum distance graphs demonstrate heading can consistently reduce cover time as compared to non-heading movement techniques.