Skip to main content
SpringerLink
Log in

CPTR: conditional probability tree based routing in opportunistic networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In opportunistic networks due to the inconsistency of the nodes link, routing is carried out dynamically and we cannot use proactive routes. In these networks, nodes use opportunities gained based on store-carry-forward patterns to forward messages. Every node that receives a message when it encounters another node makes decision regarding the forwarding or not forwarding the node encountered. In some previous methods, the recognition of whether encounter with current node is considered as an appropriate opportunity or not has been carried out based on the comparison of the probability of carrier node and the node encountered. In these methods, if the message is delivered to the encountered node, a better opportunity would be lost. To fight with this challenge we have posed CPTR method by using conditional probability tree method through which in addition to the probability of the delivery of carrier and encountered nodes’ message delivery, the opportunities for after encounter will be involved in messages’ forwarding. Results of simulation showed that the proposed method can improve the ratio of delivery and delay of message delivery compared to other similar methods in networks with limited buffer.

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

Similar content being viewed by others

References

  1. Attar, A., et al. (2012). A survey of security challenges in cognitive radio networks: Solutions and future research directions. Proceedings of the IEEE, 100(12), 3172–3186.

    Article  Google Scholar 

  2. Boldrini, C., Conti, M., & Passarella, A. (2008). Autonomic behaviour of opportunistic network routing. International Journal of Autonomous and Adaptive Communications Systems, 1(1), 122–147.

    Article  Google Scholar 

  3. Burgess, J., et al. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In INFOCOM.

  4. Busch, C., et al. (2012). Approximating congestion + dilation in networks via “quality of routing” games. IEEE Transactions on Computers, 61(9), 1270–1283.

    Article  MathSciNet  Google Scholar 

  5. 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 

  6. Demestichas, P., et al. (2004). Service configuration and traffic distribution in composite radio environments. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 34(1), 69–81.

    Article  Google Scholar 

  7. Derakhshanfard, N., Sabaei, M., & Rahmani, A. M. (2015). Sharing spray and wait routing algorithm in opportunistic networks. Wireless Networks,. doi:10.1007/s11276-015-1105-y.

    Google Scholar 

  8. Derakhshanfard, N. Sabaei, M., & Rahmani, A. M. (2015). Spray and wait routing based on TTL and buffer management in opportunistic networks. Technical report, Science and Research University Tehran branch.

  9. De Rango, F., Socievole, A., & Marano, S. (2015). Exploiting online and offline activity-based metrics for opportunistic forwarding. Wireless Networks, 21(4), 1163–1179.

    Article  Google Scholar 

  10. D’souza, R. J., & Jose, J. (2010). Routing approaches in delay tolerant networks: A survey. International Journal of Computer Applications, 1(17), 8–14.

    Google Scholar 

  11. Duarte, P. B. F., et al. (2012). On the partially overlapped channel assignment on wireless mesh network backbone: A game theoretic approach. IEEE Journal on Selected Areas in Communications, 30(1), 119–127.

    Article  Google Scholar 

  12. Dvir, A., et al. (2011). Backpressure-based routing protocol for DTNs ACM SIGCOMM. Computer Communication Review, 41(4), 405–406.

    Google Scholar 

  13. Fathima, G., & Wahidabanu, R. S. D. (2011). Buffer management for preferential delivery in opportunistic delay tolerant networks. International Journal of Wireless and Mobile Networks (IJWMN), 3, 15–28.

    Article  Google Scholar 

  14. Grossglauser, M., & Tse, D. N. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking, 10(4), 477–486.

    Article  Google Scholar 

  15. 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.

  16. Jiang, T., et al. (2012). QoE-driven channel allocation schemes for multimedia transmission of priority-based secondary users over cognitive radio networks. IEEE Journal on Selected Areas in Communications, 30(7), 1215–1224.

    Article  Google Scholar 

  17. 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).

  18. Khan, M. A., et al. (2012). game dynamics and cost of learning in heterogeneous 4G networks. IEEE Journal on Selected Areas in Communications, 30(1), 198–213.

    Article  Google Scholar 

  19. Kim, S. K., Choi, J. H., & Yang, S. B. (2015). Hotspot: Location-based forwarding scheme in an opportunistic network. Wireless Networks: Adhoc and Sensor. 26.

    Google Scholar 

  20. Kimura, T., Matsuura, T., Sasabe, M., Matsuda, T., & Takine, T. (2015). Location-aware utility-based routing for store-carry-forward message delivery. In 2015 International conference on information networking (ICOIN) (pp. 194–199). IEEE.

  21. Li, P. et al. (2012) CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM 2012 (pp. 100–108).

  22. 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 

  23. 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 

  24. 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 

  25. Meng, T., et al. (2015). Spatial reusability-aware routing in multi-hop wireless networks. IEEE TMC,. doi:10.1109/TC.2015.2417543.

    Google Scholar 

  26. 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 

  27. Nguyen, H. A., & Giordano, S. (2009). Routing in opportunistic networks. International Journal of Ambient Computing and Intelligence, 1(3), 19–38.

    Article  Google Scholar 

  28. Reza Rahimi, M., et al. (2014). Mobile cloud computing: A survey, state of art and future directions. MONET, 19(2), 133–143.

    Google Scholar 

  29. 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  MathSciNet  Google Scholar 

  30. 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.

  31. 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 

  32. Sun, X., et al. (2013). Performance of DTN protocols in space communications. Wireless Networks, 19(8), 2029–2047.

    Article  Google Scholar 

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

  34. Vasilakos, A., et al. (1998). Evolutionary-fuzzy prediction for strategic QoS routing in broadband networks. In The 1998 IEEE international conference on fuzzy systems proceedings (Vol. 2, pp. 1488–1493).

  35. 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.

  36. Vasilakos, A. V. (2013). Routing in opportunistic networks. In I. Woungang, S. K. Dhurandher, & A. Anpalagan (Eds.). New York: Springer.

  37. Xiang, L. et al. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In SECON (pp. 46–54).

  38. Xiong, N., et al. (2009). Comparative analysis of quality of service and memory usage for adaptive failure detectors in healthcare systems. IEEE Journal on Selected Areas in Communications, 27(4), 495–509.

    Article  Google Scholar 

  39. Yang, Z., et al. (2014). On storage dynamics of space delay/disruption tolerant network node. Wireless Networks, 20(8), 2529–2541.

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  41. Yao, Y., et al. (2013). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In MASS (pp. 182–190).

  42. Yao, Y., et al. (2015). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks. IEEE/ACM Transactions on Networking, 23(3), 810.

    Article  MathSciNet  Google Scholar 

  43. 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–12), 2238–2250.

    Article  Google Scholar 

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

    Article  Google Scholar 

  45. 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 

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

    Article  Google Scholar 

  47. Zhou, L., et al. (2010). Context-aware middleware for multimedia services in heterogeneous networks. IEEE Intelligent Systems, 25(2), 40–47.

    Article  Google Scholar 

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. CPTR: conditional probability tree based routing in opportunistic networks. Wireless Netw 23, 43–50 (2017). https://doi.org/10.1007/s11276-015-1136-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-1136-4

Keywords

Search

Navigation