Motion Coordination using Virtual Nodes

We describe how a virtual node abstraction layer can be used to coordinate the motion of real mobile nodes on a 2D plane. In particular, we consider how nodes in a mobile ad hoc network can arrange themselves along a predetermined curve in the plane, and can maintain themselves in such a configuration in the presence of changes in the underlying mobile ad hoc network, specifically, when nodes may join or leave the system or may fail. Our strategy is to allow the mobile nodes to implement a virtual layer consisting of mobile client nodes, stationary Virtual Nodes (VNs) for predetermined zones in the plane, and local broadcast communication. The VNs coordinate among themselves to distribute the client nodes between zones based on the length of the curve through those zones, while each VN directs its zone’s local client nodes to move themselves to equally spaced locations on the local portion of the target curve.

[1]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[2]  Nancy A. Lynch,et al.  GeoQuorums: implementing atomic memory in mobile ad hoc networks , 2003, Distributed Computing.

[3]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[4]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[5]  Nancy A. Lynch,et al.  Virtual Mobile Nodes for Mobile Ad Hoc Networks , 2004, DISC.

[6]  Nancy A. Lynch,et al.  Timed Virtual Stationary Automata for Mobile Networks , 2005, OPODIS.

[7]  Kevin M. Passino,et al.  Stability analysis of swarms , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[8]  Nancy A. Lynch,et al.  Virtual Stationary Automata for Mobile Networks , 2005 .

[9]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[10]  Nancy A. Lynch,et al.  Hybrid I/O automata , 1995, Inf. Comput..

[11]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[12]  Masafumi Yamashita,et al.  Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..

[13]  Michael Merritt,et al.  Time-Constrained Automata (Extended Abstract) , 1991, CONCUR.

[14]  Jie Lin,et al.  Towards mobility as a network control primitive , 2004, MobiHoc '04.

[15]  F. Bullo,et al.  ON ROBUST RENDEZVOUS FOR MOBILE AUTONOMOUS AGENTS , 2005 .