Mikael Asplund
Department of Computer and Information Science, Linköping Universit, Sweden
Simin Nadjm-Tehrani
Department of Computer and Information Science, Linköping Universit, Sweden
Download article
Published in: NODES 09: NOrdic workshop and doctoral symposium on DEpendability and Security; Linköping; Sweden; April 27; 2009
Linköping Electronic Conference Proceedings 41:8, p. 65-66
Published: 2009-07-14
ISBN:
ISSN: 1650-3686 (print), 1650-3740 (online)
[1] M. Asplund and S. Nadjm-Tehrani. A partition-tolerant manycast algorithm for disaster area networks. In 28th International Symposium on Reliable Distributed Systems. IEEE; Sept. 2009.
[2] Z. Haas; J. Halpern; and L. Li. Gossip-based ad hoc routing. IEEE/ACM Trans. Networking; 14(3):479-491; June 2006.
[3] A. Khelil; P. J. Marron; C. Becker; and K. Rothermelns. Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks. Ad Hoc Netw.; 5(5531-546; 2007.
[4] A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical report; Duke University; 2000.
