Advertisement

Routing with Dijkstra in Mobile Ad-Hoc Networks

  • Khudaydad Mahmoodi
  • Muhammet Balcılar
  • M. Fatih Amasyalı
  • Sırma Yavuz
  • Yücel Uzun
  • Feruz Davletov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8371)

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.

Keywords

Mobile ad-hoc networks Routing protocols USARSim WSS 

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Wang, Z., Liu, L., Zhou, M.: Protocols and applications of ad-hoc robot wireless communication networks: An overview. Future 10, 20 (2005)Google Scholar
  5. 5.
    Nevatia, Y.: Ad-Hoc Routing for USARSim (2007)Google Scholar
  6. 6.
    Gorantala, K.: Routing protocols in mobile ad-hoc Networks. Master’s Thesis in Computing Science (June 15, 2006)Google Scholar
  7. 7.
    de Morais Cordeiro, C., Agrawal, D.P.: Mobile ad hoc networking. Center for Distributed and Mobile Computing, ECECS. University of Cincinnati (2002)Google Scholar
  8. 8.
    Shrivastava, A., et al.: Overview of Routing Protocols in MANET’s and Enhancements in Reactive Protocols (2005)Google Scholar
  9. 9.
    Carpin, S., et al.: USARSim: a robot simulator for research and education. In: 2007 IEEE International Conference on Robotics and Automation. IEEE (2007)Google Scholar
  10. 10.
    Pfingsthorn, M.: RoboCup Rescue Virtual Robots: Wireless Simulation Server Documentation, pp. 1–8 (October 2008)Google Scholar
  11. 11.
    Giudici, F.: Broadcasting in Opportunistic Networks, Universita Degli Studi di Milano, thesis (2008)Google Scholar
  12. 12.
    Dijkstra, E.: Dijkstra’s algorithm. Dutch scientist Dr. Edsger Dijkstra network algorithm (1959), http://en.wikipedia.org/wiki/Dijkstra's_algorithm
  13. 13.
    Dijkstra’s Algorithm (2013), http://www.mathcs.emory.edu/~cheung/Courses/455/Syllabus/5a-routing/dijkstra.html (accessed May 21, 2013)

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Khudaydad Mahmoodi
    • 1
  • Muhammet Balcılar
    • 1
  • M. Fatih Amasyalı
    • 1
  • Sırma Yavuz
    • 1
  • Yücel Uzun
    • 1
  • Feruz Davletov
    • 1
  1. 1.Computer Science DepartmentYıldız Technical UniversityIstanbul

Personalised recommendations