Download now Free registration required
Communication is vital for successful cooperation in the event of a disaster. Such a situation calls for dissemination methods that provide partition-tolerant, energy-efficient, timely, and reliable delivery. The authors present a protocol that meets these requirements by combining a novel random walk gossip with a partition detection mechanism. The protocol is able to guarantee that at least M nodes will be reached by the message without having to know which nodes are in the system. When the communication infrastructure is needed the most - in the event of a disaster - it is the most likely that it is not available. They consider how rescue personnel working in such conditions can be supported by networking protocols which are tolerant to dis-connectivity and unstructured topologies.
- Format: PDF
- Size: 95.33 KB