|
|
Kamil Panitzek, Tobias Bönning, Immanuel Schweizer, Gero Seipel, & Max Mühlhäuser. (2012). Enhancing robustness of first responder communication in urban environments. In Z.Franco J. R. L. Rothkrantz (Ed.), ISCRAM 2012 Conference Proceedings – 9th International Conference on Information Systems for Crisis Response and Management. Vancouver, BC: Simon Fraser University.
Abstract: Communication is crucial for first responders. Crisis management is nearly impossible without good means of communication. Unfortunately the communication technology used by first responders today does not scale well. Also most of the given infrastructure, such as cell towers, might be destroyed. In recent research ad-hoc and peer-to-peer based communication has been proposed to solve the problem of resilient communication. Most mobile devices are equipped with wireless transceivers that make them suitable to participate in ad-hoc networks. But node density might be too small for a connected topology. In this paper we, therefore, discuss the implications of an emergency switch for private wireless routers allowing them to transition to an emergency mode to create a supportive wireless mesh network. To analyze if such a network would result in a resilient topology real data from wireless routers in a city is gathered. We calculate the locations of private and public routers from GPS traces and compare the resulting networks with each other. © 2012 ISCRAM.
|
|
|
|
Thomas Plagemann, Katrine S. Skjelsvik, Matija Puzar, Aslak Johannessen, Ovidiu Drugan, Vera Goebel, et al. (2008). Cross-layer overlay synchronization in sparse MANETs. In B. V. de W. F. Fiedrich (Ed.), Proceedings of ISCRAM 2008 – 5th International Conference on Information Systems for Crisis Response and Management (pp. 546–555). Washington, DC: Information Systems for Crisis Response and Management, ISCRAM.
Abstract: Mobile Ad-Hoc Networks maintain information in the routing table about reachable nodes. In emergency and rescue operations, human groups play an important role. This is visible at the network level as independent network partitions which are for some time stable before their members change through merging or partitioning. We use the information from stable routing tables to optimize the synchronization of Mediators in a Distributed Event Notification System. In a stable partition each node has the same information, thus a single Mediator can efficiently coordinate the synchronization, while all other Mediators just receive updates. We show in our experiments that just a few seconds are needed until routing tables stabilize and all nodes have a common view of the partition. We present a heuristic to determine the proper time to synchronize. Furthermore, we show how exceptions, like disappearing coordinating Mediators and unexpected messages, can be efficiently handled.
|
|
