Adaptive Spray Routing For Opportunistic Networks

[1]M. Mitzenmacher. Digital Fountains: “A Survey and Look Forward”. Information Theory Workshop, 2004.Search in Google Scholar

[2]A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding”, Technical Report UCAM-CL-TR-617, Computer Laboratory, University of Cambridge, February, 2005.Search in Google Scholar

[3]A. Pentland, R. Fletcher, and A. Hasson, “DakNet: Rethinking Connectivity in Developing Nations”, IEEE Computer, Vol. 37, No. 1. (2004), pp. 78-83. January, 2004.Search in Google Scholar

[4]Allan Beaufour, Martin Leopold, and Philippe Bonnet, “Smart-tag based data dissemination”, in Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA02), June, 2002.10.1145/570738.570749Search in Google Scholar

[5]Vahdat and D. Becker, “Epidemic routing for partially connected ad hoc networks”, Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.Search in Google Scholar

[6]D. Nain, N. Petigara, and H. Balakrishnan, “Integrated Routing and Storage for Messaging Applications in Mobile Ad Hoc Networks”, in Proceedings of WiOpt, Autiplis, France, March, 2003.10.1023/B:MONE.0000042498.60917.e8Search in Google Scholar

[7]B. Burns, O. Brock, and B. N. Levine, “MV Routing and capacity building in disruption tolerant networks”, in Proceedings of the IEEE INFOCOM 2005, Miami, FL, March, 2005.Search in Google Scholar

[8]X. Chen and A. L. Murphy, “Enabling disconnected transitive communication in mobile ad hoc networks”, in Proceedings of the Workshop on Principles of Mobile Computing (collocated with PODC’01), Newport, RI (USA), pages 21–27, August, 2001.Search in Google Scholar

[9]J. Leguay, T. Friedman, and V. Conan, “DTN Routing in a Mobility Pattern Space”, in Proceedings of the ACM SIGCOMM 2005 Workshop on delay tolerant networks, Philadelphia, PA, USA, August 22–26, 2005.10.1145/1080139.1080146Search in Google Scholar

[10]M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks”, in Proceedings of the 6th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM 2005), Taormina-Giardini Naxos, Italy, June 13-16, 2005.Search in Google Scholar

[11]T. Spyropoulos, K. Psounis, and C. Raghavendra, “Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks”, in Proceedings of the ACM SIGCOMM 2005 Workshop on delay tolerant networks, Philadelphia, PA, USA, August 22–26, 2005.10.1145/1080139.1080143Search in Google Scholar

[12]T. Spyropoulos, K. Psounis, and C. Raghavendra, “Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility,” in Proceedings of IEEE PERCOM, on the International Workshop on Intermittently Connected Mobile Ad hoc Networks (ICMAN), March 2007.10.1109/PERCOMW.2007.108Search in Google Scholar

[13]T. Spyropoulos, T. Turletti, and K. Obrazcka, “Utility-based Message Replication for Intermittently Connected Heterogeneous Wireless Networks”, in Proceedings of IEEE WoWMoM workshop on Autonomic and Opportunistic Communications (AOC), (INRIA Technical Report RR-6129), June 2007.10.1109/WOWMOM.2007.4351693Search in Google Scholar

[14]A. Jindal, K. Psounis, “Optimizing Multi-Copy Routing Schemes for Resource Constrained Intermittently Connected Mobile Networks”. ACSSC '06. Oct. 2006. p2142-214610.1109/ACSSC.2006.355147Search in Google Scholar

[15]T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Single-copy Case,” in ACM/IEEE journal of Transactions on Networking, Feb. 200810.1109/TNET.2007.897962Search in Google Scholar

[16]T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Multi-copy Case,” in ACM/IEEE journal of Transactions on Networking, Feb. 2008.10.1109/TNET.2007.897964Search in Google Scholar

[17]J. XU, Z. LI, Q. M. LI, F. Y. LIU, “An adaptive clustering routing transition protocol in ad hoc networks,” Computer Communications, 2008, 31(10): 1952-196010.1016/j.comcom.2007.12.036Search in Google Scholar

[18]J. XU, Y. L. WANG, Q. M. LI, “a stability module of path compression for on-demand ad-hoc routing”. 2008 International Seminar on Business and Information Management, 19 December 2008, Wuhan, Huibei, China: 83-88.Search in Google Scholar

[19]D. Aldous and J. Fill, “Reversible markov chains and random walks on graphs. (monograph in preparation.),” http://statwww.berkeley.edu/users/aldous/RWG/book.html.Search in Google Scholar

[20]R. Groenevelt, “Stochastic models for mobile ad hoc networks,” PhD Thesis, INRIA, April 2005.Search in Google Scholar

[21]T. Spyropoulos, K. Psounis, and C. Raghavendra, “Performance analysis of mobility-assisted routing,” in Proceedings of ACM/IEEE MOBIHOC, 2006.10.1145/1132905.1132912Search in Google Scholar

[22]S. Burleigh. Bundle Protocol Specification (RFC 5050) [EB/OL]. http://www.ietf.org/rfc/rfc5050.txtNovember2007Search in Google Scholar

[23]The ONE : The Opportunistic Network Environment simulator [EB/OL]. http://www.netlab.tkk.fi/tutkimus/dtn/theone/. Jan 2009Search in Google Scholar