Abstract
It is important that robot teams have an effective communication infrastructure, especially for robots making rescue operations in debris areas. The robots making rescue operation in a large area of disaster are not always directly connected with central operator. In such large areas robots can move around without losing communication with each other only by passing messages from one to another up to the central operator. Routing methods determine from which node to which node the messages are conveyed. In this work blind flooding and table-based routing methods are tested for three different scenarios to measure their effectiveness using the simulation environment USARSIM and its wireless simulation server WSS. Message delay times and maximum data packet streaming rates are considered for measuring the effectiveness. Although it has some deficiencies, it was observed that table-based approach is more advantageous than blind flooding.
Chapter PDF
Similar content being viewed by others
References
Wang, Z., Zhou, M., Ansari, N.: Ad-hoc robot wireless communication. In: IEEE International Conference on Systems, Man and Cybernetics 2003, vol. 4. IEEE (2003)
Zeiger, F., Kraemer, N., Schilling, K.: Commanding mobile robots via wireless ad-hoc networks—A comparison of four ad-hoc routing protocol implementations. In: IEEE International Conference on Robotics and Automation, ICRA 2008. IEEE (2008)
Wahi, C., Sonbhadra, S.K.: Mobile Ad Hoc Network Routing Protocols: A Comparative Study. International Journal of Ad Hoc, Sensor & Ubiquitous Computing 3(2) (2012)
Wang, Z., Liu, L., Zhou, M.: Protocols and applications of ad-hoc robot wireless communication networks: An overview. Future 10, 20 (2005)
Nevatia, Y.: Ad-Hoc Routing for USARSim (2007)
Gorantala, K.: Routing protocols in mobile ad-hoc Networks. Master’s Thesis in Computing Science (June 15, 2006)
de Morais Cordeiro, C., Agrawal, D.P.: Mobile ad hoc networking. Center for Distributed and Mobile Computing, ECECS. University of Cincinnati (2002)
Shrivastava, A., et al.: Overview of Routing Protocols in MANET’s and Enhancements in Reactive Protocols (2005)
Carpin, S., et al.: USARSim: a robot simulator for research and education. In: 2007 IEEE International Conference on Robotics and Automation. IEEE (2007)
Pfingsthorn, M.: RoboCup Rescue Virtual Robots: Wireless Simulation Server Documentation, pp. 1–8 (October 2008)
Giudici, F.: Broadcasting in Opportunistic Networks, Universita Degli Studi di Milano, thesis (2008)
Dijkstra, E.: Dijkstra’s algorithm. Dutch scientist Dr. Edsger Dijkstra network algorithm (1959), http://en.wikipedia.org/wiki/Dijkstra's_algorithm
Dijkstra’s Algorithm (2013), http://www.mathcs.emory.edu/~cheung/Courses/455/Syllabus/5a-routing/dijkstra.html (accessed May 21, 2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahmoodi, K., Balcılar, M., Amasyalı, M.F., Yavuz, S., Uzun, Y., Davletov, F. (2014). Routing with Dijkstra in Mobile Ad-Hoc Networks. In: Behnke, S., Veloso, M., Visser, A., Xiong, R. (eds) RoboCup 2013: Robot World Cup XVII. RoboCup 2013. Lecture Notes in Computer Science(), vol 8371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44468-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-662-44468-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44467-2
Online ISBN: 978-3-662-44468-9
eBook Packages: Computer ScienceComputer Science (R0)