暂无分享,去创建一个
[1] VenkataramaniArun,et al. DTN routing as a resource allocation problem , 2007 .
[2] Thrasyvoulos Spyropoulos,et al. Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing , 2010, 2010 Proceedings IEEE INFOCOM.
[3] Paul A. S. Ward,et al. Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.
[4] Marco Conti,et al. An arrival-based framework for human mobility modeling , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).
[5] Christophe Diot,et al. Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.
[6] Anders Lindgren,et al. Probabilistic routing in intermittently connected networks , 2003, MOCO.
[7] David Kotz,et al. Evaluating opportunistic routing protocols with large realistic contact traces , 2007, CHANTS '07.
[8] Jie Wu,et al. An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.
[9] Susana Sargento,et al. Study on the Effect of Network Dynamics on Opportunistic Routing , 2012, ADHOC-NOW.
[10] FallKevin,et al. Routing in a delay tolerant network , 2004 .
[11] H BloomBurton. Space/time trade-offs in hash coding with allowable errors , 1970 .
[12] Zhensheng Zhang,et al. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.
[13] Richard E. Hansen,et al. Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.
[14] Matthias Grossglauser,et al. Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.
[15] Martin Vetterli,et al. Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.
[16] Amin Vahdat,et al. Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .
[17] Susana Sargento,et al. Assessment model for opportunistic routing , 2011, 2011 IEEE Third Latin-American Conference on Communications.
[18] M. Vetterli,et al. Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.
[19] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[20] Pan Hui,et al. How Small Labels Create Big Improvements , 2007, PerCom Workshops.
[21] Susana Sargento,et al. Assessment Model for Opportunistic Routing (LatinCom) , 2014, ArXiv.
[22] Cauligi S. Raghavendra,et al. Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).
[23] Silvia Giordano,et al. Context information prediction for social-based routing in opportunistic networks , 2012, Ad Hoc Networks.
[24] K. Psounis,et al. Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.
[25] Ioannis Stavrakakis,et al. Social similarity as a driver for selfish, cooperative and altruistic behavior , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).
[26] Anders Lindgren,et al. Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.
[27] Athanasios V. Vasilakos,et al. Routing for disruption tolerant networks: taxonomy and design , 2010, Wirel. Networks.
[28] Pan Hui,et al. How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).
[29] Robin Kravets,et al. Encounter: based routing in DTNs , 2009, MOCO.
[30] Brian Gallagher,et al. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[31] Cauligi S. Raghavendra,et al. Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.
[32] Mostafa H. Ammar,et al. PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.
[33] Arun Venkataramani,et al. DTN routing as a resource allocation problem , 2007, SIGCOMM '07.
[34] Rabin K. Patra,et al. Routing in a delay tolerant network , 2004, SIGCOMM '04.
[35] Mostafa Ammar,et al. Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.
[36] Anders Lindgren,et al. The evolution of a DTN routing protocol - PRoPHETv2 , 2011, CHANTS '11.
[37] Pan Hui,et al. BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.
[38] Imrich Chlamtac,et al. A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.
[39] Johny Jose,et al. Routing Approaches in Delay Tolerant Networks: A Survey , 2010 .
[40] Cecilia Mascolo,et al. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.
[41] Mads Haahr,et al. Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.
[42] Jörg Ott,et al. The ONE simulator for DTN protocol evaluation , 2009, SimuTools.
[43] Pan Hui,et al. People are the network : experimental design and evaluation of social-based forwarding algorithms , 2008 .
[44] Susana Sargento,et al. Opportunistic routing based on daily routines , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).
[45] Jörg Ott,et al. The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.