Use this URL to cite or link to this record in EThOS:
Title: Distributed navigation
Author: Collins, Andrew
Awarding Body: University of Liverpool
Current Institution: University of Liverpool
Date of Award: 2013
Availability of Full Text:
Access from EThOS:
Access from Institution:
In this thesis, a number of problems are looked at predominately in the area of mobile agent communication protocols. Particularly, with the recent uptake of unstructured, large and dynamic networks there is a demand for cheap, ubiquitous and reliable protocols that will assist in the support of the network through tasks such as information dissemination, information search and retrieval, and network monitoring. One of the exciting new possible solutions to this is in the area of mobile agents where by a team of dedicated agents (physical or purely virtual) act independently or within a team on the network in the goal of solving simple, yet highly valuable, tasks. Independent agents may work within the bounds of their environment and without influence from their colleagues to solve simple or potentially complex tasks. Further, the agents may also act independently but in actuality work as a very complex team with simple underlying principles allowing for large scale networks and problems to be handled autonomously. In this work, two problems are investigated in detail, the Rendezvous Problem and Network Patrolling. In the rendezvous problem, the goal is to identify algorithms that will permit two agents to rendezvous within some known or unknown environment. This problem, while at first can feel trivial, it can be incredibly difficult when it is realised that all agents are expected to be identical at wake-up time, and that methods must be found that allow for the breaking of symmetry. This thesis provides an investigation into a number of models and environments and tries to provide optimal algorithms for allow rendezvous to occur. Secondly in the area of network patrolling, this work investigates the problem where there exists an environment, in which parts of it are viewed as being vital to network integrity and as such must be monitored. When there are less agents than vital regions the challenge of identifying traversal routes that minimise idle time becomes apparent. In this work an algorithm is presented that minimises this in the ring environment. Finally, this work also looks at other problems in distributed computing and provides exploratory foundation work that could provide alternative models for routing problems, distributed processing, community identification, and presents a number of open problems.
Supervisor: Gasieniec, Leszek; Kowalski, Dariusz; Czyzowicz, Jerzy Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA75 Electronic computers. Computer science