Abstract
Opportunistic network is a recent evolution in the wireless community; they constitute basically through cooperation & coordination a special type of wireless mobile adhoc networks. These networks are formed instantaneously in a random manner, provided the basic elements of networks exist in vicinity or approachable limits. In such networks, most of the time there does not exist an end to end path, contact is opportunity based, and, could break soon after discovery. There are many realistic scenarios fitting to this situation, like wildlife tracking sensor networks, military networks, vehicular ad hoc networks to mention a few. To transmit information under such circumstances/scenarios researchers have proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and present the findings of the said scheme by consolidating critical parameters and issues and suggest through our study the possible future options and scopes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Thrasyvoulos, S., Konstantinos, P., Raghavendra, C.S.: Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. In: Fifth Annual IEEE International Conference, Pervasive Computing and Communications Workshops, PerCom Workshop 2007, pp. 79–85. IEEE, Los Alamitos (March 2007)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Trans. on Networking 16 (2008)
Xue, J., Fan, X., Cao, Y., Fang, J., Li, J.: Spray and Wait Routing Based on Average Delivery Probability in Delay Tolerant. In: International Conference on Networks Security, Wireless Communications and Trusted Computing. IEEE Computer Society, Los Alamitos (2009)
Mathurapoj, A., Pornavalai, C., Chakraborty, G.: Fuzzy Spray: Efficient Routing in Delay Tolerant Ad-hoc network based on Fuzzy Decision Mechanism. In: FUZZ-IEEE. IEEE, Korea (2009)
Tournoux, P.-U., Leguay, J., Benbadis, F., Conan, V., de Amorim, M.D., Whitbeck, J.: The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing. In: IEEE INFOCOM 2009. IEEE Communications Society (2009)
Wang, G., Wang, B., Gao, Y.: Dynamic Spray and Wait Routing algorithm with Quality of Node in DelayTolerant Network. In: International Conference on Communications and Mobile Computing. IEEE, Los Alamitos (2010)
Fall, K.: A Delay-tolerant Network Architecture for Challenged Internets. In: SIGCOMM 2003: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 27–34. ACM, NY (2003)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks Technical Report CS-200006. Duke University, s.n. (2000)
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.S., Rubenstein, D.: Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with Zebranet. In: ASPLOS. ACM, New York (2002)
Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communications Review 7 (2003)
Widmer, J., Le Boudec, J.-Y.: Network coding for efficient communication in extreme networks. In: ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN 2005), pp. 284–291 (August 2005)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Efficient routing in intermittently connected mobile networks: The single-copy case. IEEE/ACM Trans. on Networking 16 (2008)
Leguay, J., Friedman, T., Conan, V.: DTN Routing in mobility pattern space. In: ACM SIGCOMM Workshop on DTN (2003)
Shah, R.C., Roy, S., Jain, S., Brunette, W.: Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks. In: IEEE SNPA Workshop (May 2003)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: SIGCOMM. ACM, USC (2005)
Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.-C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proc. Mobile Computing and Networking. - (1998)
Mave, M., Widmer, J., Hartenstein, H.: A Survey on Position-Based Routing in Mobile Ad-Hoc Networks. IEEE Network 15(6), 30–39 (2001)
Evan, P.C., Jones, P., Ward, A.S.: Routing Strategies for Delay-Tolerant Networks. Computer Communication Review (2006)
Frenkiel, R.H., Badrinath, B.R., Borres, J., Yates, R.D.: The infostations challenge: balancing cost and ubiquity in delivering wireless data. IEEE Personal Communications 7(2), 66–71 (2000)
Jain, S., Fall, K., Patra, R.: Routing in a Delay Tolerant Network. In: Proc. ACM SIGCOMM, pp. 145–158 (2004)
Wang, Y., Jain, S., Martonosi, M., Fall, K.: Erasure-coding based routing for opportunistic networks. In: ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 229–236. ACM, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shah, H., Kosta, Y.P. (2011). Evolution of Various Controlled Replication Routing Schemes for Opportunistic Networks. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds) Advanced Computing. CCSIT 2011. Communications in Computer and Information Science, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17881-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-17881-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17880-1
Online ISBN: 978-3-642-17881-8
eBook Packages: Computer ScienceComputer Science (R0)