article

CPTR: conditional probability tree based routing in opportunistic networks

Authors:

Nahideh Derakhshanfard,

Amir Masoud RahmaniAuthors Info & Claims

Wireless Networks, Volume 23, Issue 1

Pages 43 - 50

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

Published: 01 January 2017 Publication History

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.

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.

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

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

[7]

Derakhshanfard, N., Sabaei, M., & Rahmani, A. M. (2015). Sharing spray and wait routing algorithm in opportunistic networks. Wireless Networks,.

Digital Library

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

Digital Library

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

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

[12]

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

Digital Library

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

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

Digital Library

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

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

Digital Library

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

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

[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 INFOCOM2012 (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.

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

Digital Library

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

[25]

Meng, T., et al. (2015). Spatial reusability-aware routing in multi-hop wireless networks. IEEE TMC,.

Digital Library

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

Digital Library

[27]

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

[28]

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

Digital Library

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

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

Digital Library

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

Digital Library

[32]

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

Digital Library

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

Digital Library

[39]

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

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

[44]

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

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

Digital Library

[46]

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

Digital Library

[47]

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

Digital Library

Cited By

Derakhshanfard N(2020)Erlang Based Buffer Management and Routing in Opportunistic NetworksWireless Personal Communications: An International Journal10.1007/s11277-019-06835-8110:4(2165-2177)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s11277-019-06835-8
Abdolhosseinzadeh SDerakhshanfard N(2020)CTR: Carry Time-Based Routing for Increasing Delivery Ratio in Mobile Social NetworksWireless Personal Communications: An International Journal10.1007/s11277-019-06785-1110:3(1271-1282)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s11277-019-06785-1
Sharma DRodrigues JVashishth VKhanna AChhabra A(2020)RLProph: a dynamic programming based reinforcement learning approach for optimal routing in opportunistic IoT networksWireless Networks10.1007/s11276-020-02331-126:6(4319-4338)Online publication date: 1-Aug-2020
https://dl.acm.org/doi/10.1007/s11276-020-02331-1
Show More Cited By

CPTR: conditional probability tree based routing in opportunistic networks
1. Networks
  1. Network protocols
    1. Network layer protocols

Recommendations

TTL based routing in opportunistic networks

One of the major problem in routing messages in an Opportunistic Network (OpNet) is the absence of a complete end-to-end path from the source to the destination. To deal with such adversity many routing protocols employ epidemic techniques to flood the ...
Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks

Two schools of thought exist in terms of handling mobility in mobile ad hoc networks (MANETs). One is the traditional connection-based model, which views node mobility as undesirable and tries to either remove (through recovery schemes) or mask (through ...
GeoDTN+Nav: Geographic DTN Routing with Navigator Prediction for Urban Vehicular Environments

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Wireless Networks

Wireless Networks Volume 23, Issue 1

January 2017

298 pages

ISSN:1022-0038

Issue’s Table of Contents

Copyright © Copyright © 2017 Springer Science+Business Media New York.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 2017

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Derakhshanfard N(2020)Erlang Based Buffer Management and Routing in Opportunistic NetworksWireless Personal Communications: An International Journal10.1007/s11277-019-06835-8110:4(2165-2177)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s11277-019-06835-8
Abdolhosseinzadeh SDerakhshanfard N(2020)CTR: Carry Time-Based Routing for Increasing Delivery Ratio in Mobile Social NetworksWireless Personal Communications: An International Journal10.1007/s11277-019-06785-1110:3(1271-1282)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s11277-019-06785-1
Sharma DRodrigues JVashishth VKhanna AChhabra A(2020)RLProph: a dynamic programming based reinforcement learning approach for optimal routing in opportunistic IoT networksWireless Networks10.1007/s11276-020-02331-126:6(4319-4338)Online publication date: 1-Aug-2020
https://dl.acm.org/doi/10.1007/s11276-020-02331-1
Tahouri Asl SDerakhshanfard N(2019)SFQWireless Personal Communications: An International Journal10.1007/s11277-018-6070-1104:3(1109-1120)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s11277-018-6070-1

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents