A partition-tolerant manycast algorithm for disaster area networks

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2009, Pages 156-165

  Asplund, Mikael ^a   Nadjm Tehrani, Simin ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED NETWORKS; DELIVERY RATIO; DISASTER AREAS; DISASTER SCENARIO; EFFICIENT DATA STRUCTURES; ENERGY EFFICIENT; EXPERIMENTAL EVALUATION; GOSSIP PROTOCOLS; MANYCAST; RANDOM WALK; STORE AND FORWARD; WIRELESS MOBILE AD-HOC NETWORKS;

AD HOC NETWORKS; DATA STRUCTURES; MOBILE AD HOC NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

INFORMATION DISSEMINATION;

EID: 74949129422     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SRDS.2009.16     Document Type: Conference Paper

References (24)

1. N. Aschenbruck, E. Gerhards-Padilla, M. Gerharz, M. Frank, and P. Martini. Modelling mobility in disaster area scenarios. In Proc. 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems (MSWiM'07), pages 4-12, 2007. ACM.
2. Z. Bar-Yossef, R. Friedman, and G. Kliot. Rawms-random walk based lightweight membership service for wireless ad hoc networks. ACM Trans. Comput. Syst., 26(2):1-66, 2008.
3. R. Beraldi. Random walk with long jumps for wireless ad hoc networks. Ad Hoc Networks, 7(2):294-306, 2009.
4. C. Carter, S. Yi, P. Ratanchandani, and R. Kravets. Manycast: exploring the space between anycast and multicast in ad hoc networks. In Proc. 9th annual international conference on Mobile computing and networking (MobiCom), pages 273-285, 2003. ACM.
5. S. Dolev, E. Schiller, and J. Welch. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mobile Comput., 5(7):893-905, July 2006.
6. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-topeer networks: Algorithms and evaluation. Performance Evaluation, 63(3):241-263, 2006.
7. T. R. Henderson, S. Roy, S. Floyd, and G. F. Riley. ns-3 project goals. In WNS2 '06: Proceeding from the 2006 workshop on ns-2: the IP network simulator, page 13, 2006. ACM.
8. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark. Scenario-based performance analysis of routing protocols for mobile ad-hoc networks. In Proc. 5th annual ACM/IEEE international conference on Mobile computing and networking (MobiCom' 99), pages 195-206, 1999. ACM.
9. K. Jung and D. Shah. Fast gossip via non-reversible random walk. In Proc. Punta del Este Information Theory Workshop (ITW), pages 67-71. IEEE, 13-17 Mar. 2006.
10. G. Karlsson, V. Lenders, and M. May. Delay-tolerant broadcasting. In Proc. 2006 SIGCOMM workshop on Challenged networks (CHANTS), pages 197-204, 2006. ACM.
11. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. 41st Annual Symposium on Foundations of Computer Science, pages 565-574, Nov. 2000.
12. A. Khelil, P. J. Marrón, C. Becker, and K. Rothermelns. Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks. Ad Hoc Netw., 5(5):531-546, 2007.
13. J. Luo, P. Eugster, and J.-P. Hubaux. Route driven gossip: probabilistic reliable multicast in ad hoc networks. In Proc. 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 3, pages 2229-2239. IEEE, March-April 2003.
14. A. Mian, R. Beraldi, and R. Baldoni. A robust and energy efficient protocol for random walk in ad hoc networks with ieee 802.11. In Proc. IEEE International Symposium on Parallel and Distributed Processing IPDPS 2008, pages 1-8, 14-18 April 2008.
15. W. Navidi and T. Camp. Stationary distributions for the random waypoint mobility model. IEEE Trans. Mobile Comput., 3(1):99-108, 2004.
16. S. C. Nelson, I. Albert F. Harris, and R. Kravets. Event-driven, role-based mobility in disaster recovery networks. In Proc. second workshop on Challenged networks (CHANTS), pages 27-34, 2007. ACM.
17. S. Rinaldi, J. Peerenboom, and T. Kelly. Identifying, understanding, and analyzing critical infrastructure interdependencies. IEEE Control Syst. Mag., 21(6):11-25, Dec. 2001.
18. Y. Sankarasubramaniam, I. Akyildiz, and S. McLaughlin. Energy efficiency based packet size optimization in wireless sensor networks. In Proc. First IEEE Sensor Network Protocols and Applications 2003 IEEE International Workshop on, pages 1-8, 2003.
19. S. D. Servetto and G. Barrenechea. Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks. In Proc. 1st ACM international workshop on Wireless sensor networks and applications (WSNA'02), pages 12-21, 2002. ACM.
20. B. Steckler, B. L. Bradford, and S. Urrea. Hastily formed networks for complex humanitarian disasters. http://www.hfncenter.org/cms/KatrinaAAR, Sept. 2005.
21. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical report, Duke University, 2000.
22. E. Vollset and P. Ezhilchelvan. Design and performance study of crash-tolerant protocols for broadcasting and reaching consensus in manets. In Proc. 24th IEEE Symposium on Reliable Distributed Systems SRDS 2005, pages 166-175, 2005.
23. Q. Ye, L. Cheng, M. C. Chuah, and B. Davison. Os-multicast: Ondemand situation-aware multicasting in disruption tolerant networks. In Proc. VTC 2006-Spring Vehicular Technology Conference IEEE 63rd, volume 1, pages 96-100, May 2006.
24. W. Zhao, M. Ammar, and E. Zegura. Multicasting in delay tolerant networks: semantic models and routing algorithms. In Proc. 2005 ACM SIGCOMM workshop on Delay-tolerant networking (WDTN), pages 268-275, 2005. ACM.