Probability and Priority Based Routing Approach for Opportunistic Networks

  • Kiran Avhad
  • Suresh Limkar
  • Anagha Kulkarni
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 247)


Opportunistic networks are wireless networks that have sporadic network connectivity, thus rendering the existence of instantaneous end-to-end paths from a source to a destination difficult. Hence, in such networks, message delivery relies heavily on the store-and-forward paradigm to route messages. However, limited knowledge of the contact times between the nodes poses a big challenge to effective forwarding of messages. This paper describes probability and priority based approach for routing in opportunistic networks, rendering traditional routing protocols unable to deliver messages between hosts. This approach minimizes the copies of the messages in the network and ensures successful delivery of messages.


Epidemic routing Opportunistic Networks Probabilistic Routing Prioritized routing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic Routing in Intermittently Connected Networks. In: Dini, P., Lorenz, P., de Souza, J.N. (eds.) SAPIR 2004. LNCS, vol. 3126, pp. 239–254. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Huang, T.-K., Lee, C.-K., Chen, L.-J.: PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network. In: IEEE Proceedings (2011)Google Scholar
  3. 3.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (April 2000)Google Scholar
  4. 4.
    Vogels, W., van Renesse, R., Birman, K.: The power of epidemics: robust communication for large-scale distributed systems. In: Proceedings of First Workshop on Hot Topics in Networks (HotNets-I), Princeton, New Jersey, USA, October 28-29 (2002) Google Scholar
  5. 5.
    Ramanathan, R., Hansen, R., Basu, P.: Prioritized epidemic routing for opportunistic networks. In: MobiOpp 2007, San Juan, Puerto Rico, USA, pp. 978–971 (June 11, 2007), Copyright 2007 ACM 978-1-59593-688-2/07/0006Google Scholar
  6. 6.
    Avhad, K., Limkar, S., Kulkarni, A.: An Efficient Hybrid Approach for Opportunistic Networks. In: CSA 2013. LNCS, pp. 217–224 (2013)Google Scholar
  7. 7.
    Nguyen, H.A., Giordano, S.: Spatio temporal Routing Algorithm in Opportunistic Networks. 978-1-4244-2100-8/08/2008 IEEEGoogle Scholar
  8. 8.
    Tsapeli, F., Tsaoussidis, V.: Routing for Opportunistic Networks Based on Probabilistic Erasure Coding. In: Koucheryavy, Y., Mamatas, L., Matta, I., Tsaoussidis, V. (eds.) WWIC 2012. LNCS, vol. 7277, pp. 257–268. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  9. 9.
    Wang, Y., Jain, S., Martonosi, M., Fall, K.: Erasure coding based routing for opportunistic networks. In: WDTN 2005: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 229–236. ACM, New York (2005)CrossRefGoogle Scholar
  10. 10.
    Chen, X., Murphy, A.L.: Enabling disconnected transitive communication in mobile ad hoc networks. In: Proc. of Workshop on Principles of Mobile Computing, collocated with PODC 2001, Newport, RI (USA), 21 to 27, pp. 21–27 (August 2001)Google Scholar
  11. 11.
    Li, Q., Rus, D.: Communication in disconnected ad-hoc networks using message relay. Journal of Parallel and Distributed Computing (2003)Google Scholar
  12. 12.
    Marasigan, D., Rommel, P.: Mv routing and capacity building in disruption tolerant networks. In: Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, vol. 1, pp. 398–408 (March 2005)Google Scholar
  13. 13.
    Avhad, K., Limkar, S., Patil, A.: Survey of Routing Techniques in Opportunistic Networks. IJSRP 2(10) (October 2012) ISSN 2250-3153Google Scholar
  14. 14.
    Rotti, P.G.: Opportunistic lookahead routing protocol for delay tolerant networks.Thesis, Submitted to the Faculty of the Louisiana State University (December 2012)Google Scholar
  15. 15.
    Lilien, L., Kamal, Z.H., Bhuse, V., Gupta, A.: Opportunistic networks: The concept and research challenges in privacy and security. In: Proc. of the WSPWN. (2006)Google Scholar
  16. 16.
    Lindgren, A., Doria, A., Schelén, O.: Poster: Probabilistic routing in intermittently connected networks. In: Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2003 (June 2003)Google Scholar
  17. 17.
    Dvir, Vasilakos, A.V.: Backpressure-based routing protocol for dtns. In: Proceedings of the ACM SIGCOMM 2010 Conference, SIGCOMM 2010, pp. 405–406. ACM, NewYork (2010)Google Scholar
  18. 18.
    Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: Proceedings of IEEE INMIC 2001, pp. 62–68 (2001)Google Scholar
  19. 19.
    Ryu, J., Ying, L., Shakkottai, S.: Back-pressure routing for intermittently connected networks. In: Proceedings of IEEE INFOCOM 2010 (2010)Google Scholar
  20. 20.
    Glance, N., Snowdon, D., Meunier, J.-L.: Pollen: Using people as a communication medium. Computer Networks 35(4), 429–442 (2001)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computer EngineeringGHRCOEMAhmednagarIndia
  2. 2.Department of Computer EngineeringAISSMS IOITPuneIndia

Personalised recommendations