A Partition-tolerant Manycast Algorithm for Disaster Area Networks
2009 (English)In: 28TH IEEE INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, IEEE Computer Society, 2009, 156-165 p.Conference paper (Refereed)
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 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.
Place, publisher, year, edition, pages
IEEE Computer Society, 2009. 156-165 p.
, IEEE Symposium on Reliable Distributed Systems. Proceedings, ISSN 1060-9857
ad hoc networks, disasters, information dissemination, mobile radio, telecommunication signalling
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-58433DOI: 10.1109/SRDS.2009.16ISI: 000275708000017ISBN: 978-0-7695-3826-6OAI: oai:DiVA.org:liu-58433DiVA: diva2:343185
28th International Symposium on Reliable Distributed Systems
FunderSwedish Research Council, 2008- 4667