Advertisement

Organizing Rescue Agents Using Ad-Hoc Networks

  • Toru Takahashi
  • Yasuhiko Kitamura
  • Hiroyoshi Miwa
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 156)

Abstract

When a disaster happens, rescue teams are organized. They firstly search for victims in the disaster area, then share information about the found victims among the members, and finally save them. Disasters often make conventional communication networks unusable, and we employ rescue agents using ad-hoc networks, which enable the agents to directly communicate with other agents in a short distance. A team of rescue agents have to deal with a trade-off issue between wide search activities and information sharing activities among the agents. We propose two organizational strategies for rescue agents using ad-hoc networks. In the Rendezvous Point Strategy, the wide search activities have priority over the information sharing activities. On the other hand, in the Serried Ranks Strategy, the information sharing activities have priority over the wide search activities. We evaluate them through agent-based simulations, comparing to a naïve and unorganized strategy named Random Walk Strategy. We confirm that Random Walk Strategy shows a poor performance because information sharing is difficult. We then reveal the two organizational strategies show better performance than Random Walk Strategy. Furthermore, the Rendezvous Point Strategy saves more victims in the early stages, but gradually the Serried Ranks Strategy outperforms it.

Keywords

Communication Range Organizational Strategy Disaster Area Route Protocol Rescue Agent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Epstein, J., Axtell, R.: Growing Artificial Societies. MIT Press (1996)Google Scholar
  2. 2.
    Axelrod, R.: The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton Univ. Press (1997)Google Scholar
  3. 3.
    Johansson, P., Larsson, T., Hedman, N., Mielczarek, B., Degermark, M.: Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks. In: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 195–206 (1999)Google Scholar
  4. 4.
    Perkins, C., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: Proceedings of the SIGCOM 1994 Conference on Communications Architecture, Protocols and Applications, pp. 234–244 (1994)Google Scholar
  5. 5.
    Perkins, C.: Ad Hoc On Demand Distance Vector (AODV) Routing. Internet draft, draft-ietf-manetaodv-01.txt (August 1998)Google Scholar
  6. 6.
    Johnson, D., Maltz, D.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, T., Korth, H. (eds.) Mobile Computing, ch. 5, pp. 153–181. Kluwer Academic Publishers (1996)Google Scholar
  7. 7.
    Shih, T.-F., Yen, H.-C.: Location-aware Routing Protocol with Dynamic Adaptation of Request Zone for Mobile Ad Hoc Networks. Wireless Networks 14(3) (2008)Google Scholar
  8. 8.
    Shinoda, K., Noda, I., Ohta, M., Kunifuji, S.: Large-scale Ad-hoc Networking with Social Human Relationship. In: Proc. of IEEE PACRIM 2003, vol. 1, pp. 330–333 (2003)Google Scholar
  9. 9.
    Singh, S., Woo, M., Raghavendra, C.S.: Power-Aware Routing in Mobile Ad Hoc Networks. In: Proc. ACM/IEEE MOBICOM 1998, pp. 181–190 (1998)Google Scholar
  10. 10.
    Toh, C.K.: Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks. IEEE Communications Magazine 39(6), 138–147 (2001)CrossRefGoogle Scholar
  11. 11.
    Zussman, G., Segall, A.: Energy Efficient Routing in Ad Hoc Disaster Recovery Networks. Ad Hoc Networks 1(4), 405–421 (2003)CrossRefGoogle Scholar
  12. 12.
    Liang, B., Haas, Z.: Predictive Distance-based Mobility Management for PCS Networks. In: Proceedings of INFOCOM 1999 (1999)Google Scholar
  13. 13.
    Aschenbruck, N., Gerhards-Padilla, E., Martini, P.: Modelling Mobility in Disaster Area Scenarios. Performance Evaluation 66(12), 773–790 (2009)CrossRefGoogle Scholar
  14. 14.
    Sugiyama, H., Tsujioka, T., Murata, M.: Coordination of Rescue Robots for Real-Time Exploration over Disaster Areas. In: Proc. 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC), pp. 170–177 (2008)Google Scholar
  15. 15.
    Nguyen, H.G., Pezeshkian, N., Gupta, A., Farrington, N.: Maintaining Communication Link for a Robot Operating in a Hazardous Environment. In: 10th Int. Conf. on Robotics and Remote Systems for Hazardous Environments, pp. 28–31 (2004)Google Scholar
  16. 16.
    Ulam, P., Arkin, R.C.: When good comms go bad: Communications recovery for multi-robot teams. In: Proceedings 2004 IEEE International Conference on Robotics and Automation, pp. 3727–3734 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Toru Takahashi
    • 1
  • Yasuhiko Kitamura
    • 1
  • Hiroyoshi Miwa
    • 1
  1. 1.Kwansei Gakuin UniversitySandaJapan

Personalised recommendations