Jennifer E. Walter

Learn More
A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is presented, along with proof of correctness and simulation results. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. Experimental results indicate that adaptation to mobility can improve(More)
The problem we address is the distributed reconfiguration of a metamorphic robotic system composed of any number of two dimensional hexagonal modules from specific initial to specific goal configurations. We present a distributed algorithm for reconfiguring a straight chain of hexagonal modules at one location to any intersecting straight chain(More)
An algorithm for electing a leader in an asynchronous network with dynamically changing communication topology is presented. The algorithm ensures that, no matter what pattern of topology changes occur, if topology changes cease, then eventually every connected component contains a unique leader. The algorithm combines ideas from the Temporally Ordered(More)
The problem addressed is the distributed reconfiguration of a system of hexagonal metamorphic robots (modules) from an initial straight chain to a goal configuration that satisfies a simple admissibility condition. Our reconfiguration strategy depends on finding a contiguous path of cells that spans the goal configuration and over which modules can move(More)
This paper presents algorithms to plan the concurrent and collision-free movement of n hexagonal metamorphic robots (modules) over a contiguous surface in a hexagonal grid. The problem is complicated by the fact that the surface may include "non-concurrently traversable" segments, where narrow passages between surface cells may result in module collision,(More)
A fault-tolerant token based distributed k-mutual exclusion algorithm which adjusts to node mobility is presented. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. A \token forwarding" modi cation to the basic algorithm is shown to lower the time each node waits to enter the CS(More)
The problem addressed is the distributed reconfiguration of a metamorphic robotic system composed of an arbitrary number of two dimensional hexagonal robots (modules) from specific initial to specific goal configurations. The initial configuration considered is a straight chain of robotic modules, while the goal configurations considered satisfy a more(More)
The problem addressed is the distributed reconfiguration of a metamorphic robot system composed of any number of two dimensional robots (modules) from specific initial to specific goal configurations. The initial configuration we consider is a straight chain of modules, while the goal configuration satisfies a simple admissibility condition. Reconfiguration(More)
The problem addressed is the distributed reconfiguration of a metamorphic robot system composed of any number of two dimensional robots (modules). The initial configuration we consider is a straight chain of modules, while the goal configuration satisfies a simple admissibility condition. Our reconfiguration strategy depends on finding a contiguous path of(More)