Abstract
Designing robust algorithms for mobile agents with reliable communication is difficult due to the distributed nature of computation, in mobile ad hoc networks (MANETs) the matter is exacerbated by the need to ensure connectivity. Existing distributed algorithms provide coordination but typically assume connectivity is ensured by other means. We present a connectivity service that encapsulates an arbitrary motion planner and can refine any plan to preserve connectivity (the graph of agents remains connected) and ensure progress (the agents advance towards their goal). The service is realized by a distributed algorithm that is modular in that it makes no assumptions of the motion-planning mechanism except the ability for an agent to query its position and intended goal position, local in that it uses 1-hop broadcast to communicate with nearby agents but doesn’t need any network routing infrastructure, and oblivious in that it does not depend on previous computations.
We prove the progress of the algorithm in one round is at least \({\it \Omega}(\min(d,r))\), where d is the minimum distance between an agent and its target and r is the communication radius. We characterize the worst case configuration and show that when d ≥ r this bound is tight and the algorithm is optimal, since no algorithm can guarantee greater progress. Finally we show all agents get ε-close to their targets within \(O(D_0/r+n^2/\varepsilon)\) rounds where n is the number of agents and D 0 is the sum of the initial distances to the targets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Johnson, D., Maltz, D.: Dynamic Source Routing in Ad Hoc Wireless Networks. Computer Communications Review - SIGCOMM (1996)
Perkins, C., Royer, E.: Ad-hoc On-Demand Distance Vector Routing. In: Workshop on Mobile Computing Systems and Applications (1999)
Malpani, N., Welch, J., Vaidya, N.: Leader Election Algorithms for Mobile Ad-hoc Networks. In: DIAL-M: Workshop in Discrete Algorithms and Methods for Mobile Computing and Communications (2000)
Walter, J., Welch, J., Vaidya, N.: A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. Wireless Networks (2001)
Regmi, A., Sandoval, R., Byrne, R., Tanner, H., Abdallah, C.: Experimental Implementation of Flocking Algorithms in Wheeled Mobile Robots. In: Proceedings of the American Control Conference 2005, pp. 4917–4922 (2005)
Hayes, A., Dormiani-Tabatabaei, P.: Self-organized flocking with agent failure: Off-line optimization and demonstration with real robots. In: ICRA (2002)
Fierro, R., Das, A.: A modular architecture for formation control. Robot Motion and Control (2002)
Carpin, S., Parker, L.E.: Cooperative Leader Following in a Distributed Multi-Robot System. In: ICRA (2002)
Zavlanos, M.M., Pappas, G.J.: Controlling Connectivity of Dynamic Graphs. In: CDC-ECC, pp. 6388–6393 (2005)
Savla, K., Notarstefano, G., Bullo, F.: Maintaining limited-range connectivity among second-order agents. SIAM Journal on Control and Optimization (2007)
Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobilerobots with limited visibility. ICRA 15(5), 818–828 (1999)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1-3), 147–168 (2005)
Ganguli, A., Cortés, J., Bullo, F.: Multirobot rendezvous with visibility sensors in nonconvex environments. CoRR abs/cs/0611022 (2006)
Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In: SSS, pp. 484–500 (2006)
Lee, G., Chong, N.Y., Defago, X.: Robust Self-Deployment for a Swarm of Autonomous Mobile Robots with Limited Visibility Range. In: Robot and Human interactive Communication (2007)
Maja, A.H., Howard, A., Matari, M.J., Sukhatme, G.S.: An Incremental Self-Deployment Algorithm for Mobile Sensor Networks. Autonomous Robots, Special Issue on Intelligent Embedded Systems 13, 113–126 (2001)
Cornejo, A., Lynch, N.: Connectivity Service for Mobile Ad-Hoc Networks. In: Spatial Computing Workshop (2008)
Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18(3), 259–278 (1969)
Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4), 261–268 (1980)
Li, N., Hou, J.C., Sha, L.: Design and analysis of an MST-based topology control algorithm. INFOCOM 3, 1702–1712 (2003)
Cornejo, A., Kuhn, F., Lynch, N., Ley-Wild, R.: Keeping mobile robot swarms connected. MIT-CSAIL-TR-2009-027 (2009), http://hdl.handle.net/1721.1/45568
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cornejo, A., Kuhn, F., Ley-Wild, R., Lynch, N. (2009). Keeping Mobile Robot Swarms Connected. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-04355-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04354-3
Online ISBN: 978-3-642-04355-0
eBook Packages: Computer ScienceComputer Science (R0)