Self-Limiting Epidemic Forwarding Technical Report LCA-REPORT-2006-126
暂无分享,去创建一个
[1] Bernard Ycart,et al. Modéles et algorithmes markoviens , 2002 .
[2] Jean-Yves Le Boudec,et al. Self-Limiting Epidemic Forwarding , 2006 .
[3] Sachin Katti,et al. The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .
[4] Pan Hui,et al. Pocket Switched Networks and the Consequences of Human Mobility in Conference Environments , 2005, SIGCOMM 2005.
[5] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[6] Cauligi S. Raghavendra,et al. Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.
[7] Joseph Y. Halpern,et al. Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.
[8] Marco Conti,et al. Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.
[9] Christian Becker,et al. An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.
[10] Donald F. Towsley,et al. Performance modeling of epidemic routing , 2006, Comput. Networks.
[11] B D Greenshields,et al. A study of traffic capacity , 1935 .
[12] Matthew Chalmers,et al. Three applications for mobile epidemic algorithms , 2005, Mobile HCI.
[13] Jie Wu,et al. Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..
[14] Patrick Thiran,et al. Reaction-diffusion based transmission patterns for ad hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[15] Yu-Chee Tseng,et al. The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.
[16] Mahtab Seddigh,et al. Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..