Skip to main content
SpringerLink
Log in

Sharing spray and wait routing algorithm in opportunistic networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Due to the instability and intermittent connectivity of links among the nodes and the lack of connectivity in opportunistic network, it is not feasible to use common routing for delivering messages . The only practical method for routing and delivering messages is to use the store-carry-forward routing method. As a case in point, spray and wait is considered to be one of the most appropriate routing methods. The efficiency of this method depends directly on the proper selection of the next hop and the number of copies when it encounters a node. In this paper, a method was proposed that constantly selects the next node and considers the number of copies a node can deliver. In the proposed method, the selection of the next node and the number of message copies to be transmitted by the next hop are based on message carrying time and the probability of message delivery. The network model, based on Markov chain, is extended for analysis. Simulation and analysis results showed that significant enhancement is obtained with the proposed method when measuring metrics such as delay, delivery ratio and copy do comparisons with similar methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Woungang, I., et al. (2013). Routing in opportunistic networks. New York: Springer.

    Book  MATH  Google Scholar 

  2. Li, P., et al. (2012) CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM, 2012 proceedings IEEE.

  3. Rahimi, M. R., et al. (2014). Mobile cloud computing: A survey, state of art and future directions. Mobile Networks and Applications, 19(2), 133–143.

    Article  Google Scholar 

  4. Zhang, X. M., et al. (2015). Interference-based topology control algorithm for delay-constrained mobile Ad hoc networks. IEEE Transactions on Mobile Computing, 14(4), 742–754.

    Article  Google Scholar 

  5. Zeng, Y., et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  6. Dvir, A., & Vasilakos, A. V. (2011). Backpressure-based routing protocol for DTNs. ACM SIGCOMM Computer Communication Review, 41(4), 405–406.

    Google Scholar 

  7. Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2011). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press.

    Google Scholar 

  8. Spyropoulos, T., et al. (2010). Routing for disruption tolerant networks: taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  9. Liu, Y., et al. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810–816.

    Article  Google Scholar 

  10. Liu, L., et al. (2015). Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks. IEEE Transactions on Computers, 64(3), 819–832.

    MathSciNet  Google Scholar 

  11. Wang, X., et al. (2012). A survey of green mobile networks: Opportunities and challenges. Mobile Networks and Applications, 17(1), 4–20.

    Article  Google Scholar 

  12. Yang, M., et al. (2014). Software-defined and virtualized future mobile and wireless networks: A survey. Mobile Networks and Applications, 20(1), 4–18.

    Article  Google Scholar 

  13. Pal, R., Kosta, S., & Hui, P. (2011). Settling for less: A qos compromise mechanism for opportunistic mobile networks. ACM SIGMETRICS Performance Evaluation Review, 39(3), 49–51.

    Article  Google Scholar 

  14. Song, Y., et al. (2014). A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Transactions on Network and Service Management, 11(3), 417–430.

    Article  Google Scholar 

  15. Meng, T., et al. (2015). Spatial reusability-conscious routing in multi-hop wireless networks. IEEE Transactions on Computers, PP(99), 1.

    Google Scholar 

  16. Youssef, M., et al. (2014). Routing metrics of cognitive radio networks: A survey. IEEE on Communications Surveys and Tutorials, 16(1), 92–109.

    Article  Google Scholar 

  17. Hsu, C.-J., Liu, H.-I., & Seah, W. K. (2011). Opportunistic routing—A review and the challenges ahead. Computer Networks, 55(15), 3592–3603.

    Article  Google Scholar 

  18. Baldoni, R., et al. (2011). The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost. Theoretical Computer Science, 412(12), 1066–1080.

    Article  MathSciNet  MATH  Google Scholar 

  19. Zhang, J., & Luo, G. (2012). Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications, 66(1), 217–233.

    Article  Google Scholar 

  20. Li, P., et al. (2014). Reliable multicast with pipelined network coding using opportunistic feeding and routing. IEEE Transactions on Parallel and Distributed Systems, 25(12), 3264–3273.

    Article  Google Scholar 

  21. Yen, Y.-S., et al. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53(11), 2238–2250.

    Article  Google Scholar 

  22. Conti, M., et al. (2009). Routing issues in opportunistic networks. In: Middleware for network eccentric and mobile applications (pp. 121–147). Heidelberg: Springer Berlin.

  23. Acampora, G., et al. (2010). Interoperable and adaptive fuzzy services for ambient intelligence applications. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 5(2), 8.

    Article  Google Scholar 

  24. Vasilakos, A. V., et al. (2015). Information centric network: Research challenges and opportunities. Journal of Network and Computer Applications, 52, 1–10.

    Article  Google Scholar 

  25. Zhou, L., et al. (2010). Context-conscious middleware for multimedia D; Services in heterogeneous networks. IEEE Computer Society.

  26. Quan, W., et al. (2014). TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. In networking conference, 2014 IFIP. IEEE.

  27. Xia, F., et al. (2013). Socially conscious networking: A survey.

  28. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. 2000, technical report CS-200006, Duke University.

  29. Spyropoulos, T., Psounis, K.,& Raghavendra C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Fifth annual IEEE international conference on pervasive computing and communications workshops, 2007. PerCom workshops’ 07, IEEE.

  30. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90.

    Article  Google Scholar 

  31. Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating congestion + dilation in networks via” quality of routing”; games. IEEE Transactions on Computers, 61(9), 1270–1283.

    Article  MathSciNet  Google Scholar 

  32. Musolesi, M., & Mascolo, C. (2009). CAR: Context-conscious adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing, 8(2), 246–260.

    Article  Google Scholar 

  33. Chachulski, S., et al. (2007). Trading structure for randomness in wireless opportunistic routing. In SigComm: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (Vol. 37). ACM.

  34. Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.

    Article  Google Scholar 

  35. Spyropoulos, T., Psounis, K., Raghavendra, & C. S. (2005). Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking. ACM.

  36. Zhou, X.-W., et al. (2013). Dynamic DTN routing strategies based on knowledge. Wireless Personal Communications, 71(3), 1819–1836.

    Article  Google Scholar 

  37. Erramilli, V., & Crovella, M. (2008). Forwarding in opportunistic networks with resource constraints. In Proceedings of the third ACM workshop on challenged networks. ACM.

  38. JebaJothi, E. J., Kavitha, V., & Kavitha, T. (2010). Contention based routing in mobile ad hoc networks with multiple copies. arXiv preprint arXiv:1005.4009.

  39. Wang, G., Lu, H., & Xu, L. (2009). Nested spray and wait routing algorithm based on core nodes assisted. In International conference on Computational intelligence and software engineering, 2009. CiSE 2009, IEEE.

  40. Huang, W., Zhang, S., & Zhou, W. (2011). Spray and wait routing based on position prediction in opportunistic networks. In 2011 3rd International conference on computer research and development (ICCRD), IEEE.

  41. Cheng, L., et al. (2013). Wait, focus and spray: efficient data delivery in wireless sensor networks with ubiquitous mobile data collectors. Telecommunication Systems, 52(4), 2503–2517.

    Article  Google Scholar 

  42. Kim, E.-H., et al. (2014) Probability-based spray and wait protocol in delay tolerant networks. In 2014 international conference on information networking (ICOIN), IEEE.

  43. Mehto, A., & Chawla, M. (2014). Modified different neighbor history spray and wait using PROPHET in delay tolerant network. International Journal of Computer Applications, 86(18), 30–35.

    Article  Google Scholar 

  44. Zhang, L., et al. (2011). An energy-conscious socially-based spray and focus routing in delay tolerant mobile sensor network.

  45. Keränen, A., Ott, J., & Kärkkäinen, T (2009). The ONE simulator for DTN protocol evaluation. in Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

    Nahideh Derakhshanfard & Amir Masoud Rahmani

  2. Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran

    Masoud Sabaei

Authors
  1. Nahideh Derakhshanfard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masoud Sabaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amir Masoud Rahmani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nahideh Derakhshanfard.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Derakhshanfard, N., Sabaei, M. & Rahmani, A.M. Sharing spray and wait routing algorithm in opportunistic networks. Wireless Netw 22, 2403–2414 (2016). https://doi.org/10.1007/s11276-015-1105-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-1105-y

Keywords

Search

Navigation