A Partition-Tolerant Manycast Algorithm for Disaster Area Networks

Mikael Asplund, Simin Nadjm-Tehrani
2009 2009 28th IEEE International Symposium on Reliable Distributed Systems  
Information dissemination in disaster scenarios requires timely and energy-efficient communication in intermittently connected networks. When the existing infrastructure is damaged or overloaded, we suggest the use of a manycast algorithm that runs over a wireless mobile ad hoc network, and overcomes partitions using a store-and-forward mechanism. This paper presents a random walk gossip protocol that uses an efficient data structure to keep track of already informed nodes with minimal
more » ... th minimal signalling. Avoiding unnecessary transmissions also makes it less prone to overloads. Experimental evaluation shows higher delivery ratio, lower latency, and lower overhead compared to a recently published algorithm.
doi:10.1109/srds.2009.16 dblp:conf/srds/AsplundN09 fatcat:zkcda3ah4ve4ho56yc5pqupddq