SEARCH WITHIN CONTENT
Citation Information : International Journal on Smart Sensing and Intelligent Systems. Volume 6, Issue 1, Pages 95-119, DOI: https://doi.org/10.21307/ijssis-2017-530
License : (CC BY-NC-ND 4.0)
Received Date : 02-August-2012 / Accepted: 05-January-2013 / Published Online: 20-February-2013
opportunistic networks are sparse wireless networks where most of the time there is no complete path from the source to the destination. Many applications require delay constrained routing mechanism which can provide acceptable and resilient service in the face of challenged environments. A class of adaptive spray mechanisms which aims to achieve the delay constraint with low cost in dynamic circumstances was proposed in this paper. Adaptive spray mechanisms use relay nodes to make spray decisions in order to apperceive the change of network conditions exquisitely. These protocols are least-cost delay-bounded routing protocols under specific spray mechanisms. Theoretic analyses of adaptive spray routings at aspects of routing cost, copy redundancy and expected delay were also given in this paper. Simulation results have shown that adaptive spray mechanisms exhibit prominent superiority in routing cost, adaptability and scalability. Adaptive spray mechanisms are a class of correct and efficient delay-bounded routings for opportunistic networks.
 M. Mitzenmacher. Digital Fountains: “A Survey and Look Forward”. Information Theory Workshop, 2004.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 A. Jindal, K. Psounis, “Optimizing Multi-Copy Routing Schemes for Resource Constrained Intermittently Connected Mobile Networks”. ACSSC '06. Oct. 2006. p2142-2146
 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. 2008 Xu Jia, Feng Xin, Wang Ru Chuan, Adaptive Spray Routing For Opportunistic Networks
 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.
 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-1960
 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.
 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.
 R. Groenevelt, “Stochastic models for mobile ad hoc networks,” PhD Thesis, INRIA, April 2005.
 T. Spyropoulos, K. Psounis, and C. Raghavendra, “Performance analysis of mobility-assisted routing,” in Proceedings of ACM/IEEE MOBIHOC, 2006.
 S. Burleigh. Bundle Protocol Specification (RFC 5050) [EB/OL]. http://www.ietf.org/rfc/rfc5050.txt November 2007
 The ONE：The Opportunistic Network Environment simulator [EB/OL]. http://www.netlab.tkk.fi/tutkimus/dtn/theone/. Jan 2009