Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Wireless Networks
Erschienen in: Wireless Networks 1/2017

26.11.2015

CPTR: conditional probability tree based routing in opportunistic networks

verfasst von: Nahideh Derakhshanfard, Masoud Sabaei, Amir Masoud Rahmani

Erschienen in: Wireless Networks | Ausgabe 1/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.
Vorheriger Artikel A review of industrial wireless networks in the context of Industry 4.0
Nächster Artikel Interference mitigation in Z-channel and relay-assisted Z-channel: a diversity gain region perspective

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
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.CrossRef
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.CrossRef
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.MathSciNetCrossRef
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.CrossRef
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.CrossRef
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.
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.CrossRef
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.CrossRef
12.
Dvir, A., et al. (2011). Backpressure-based routing protocol for DTNs ACM SIGCOMM. Computer Communication Review, 41(4), 405–406.
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.CrossRef
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.CrossRef
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.CrossRef
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.CrossRef
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 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.CrossRef
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.CrossRef
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
25.
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.CrossRef
27.
Nguyen, H. A., & Giordano, S. (2009). Routing in opportunistic networks. International Journal of Ambient Computing and Intelligence, 1(3), 19–38.CrossRef
28.
Reza Rahimi, M., et al. (2014). Mobile cloud computing: A survey, state of art and future directions. MONET, 19(2), 133–143.
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.MathSciNetCrossRef
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.CrossRef
32.
Sun, X., et al. (2013). Performance of DTN protocols in space communications. Wireless Networks, 19(8), 2029–2047.CrossRef
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.CrossRef
39.
Yang, Z., et al. (2014). On storage dynamics of space delay/disruption tolerant network node. Wireless Networks, 20(8), 2529–2541.CrossRef
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.MathSciNetCrossRef
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.MathSciNetCrossRef
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.CrossRef
44.
Youssef, M., et al. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92–109.CrossRef
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.CrossRef
46.
Zheng, Y., et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.CrossRef
47.
Zhou, L., et al. (2010). Context-aware middleware for multimedia services in heterogeneous networks. IEEE Intelligent Systems, 25(2), 40–47.CrossRef
Metadaten
Titel
CPTR: conditional probability tree based routing in opportunistic networks
verfasst von
Nahideh Derakhshanfard
Masoud Sabaei
Amir Masoud Rahmani
Publikationsdatum
26.11.2015
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 1/2017
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-015-1136-4

Weitere Artikel der Ausgabe 1/2017

Wireless Networks 1/2017 Zur Ausgabe

OriginalPaper

Heterogeneous network bandwidth management scheme based on the principal-agent game model

OriginalPaper

Utility optimization in heterogeneous networks via CSMA-based algorithms

OriginalPaper

Network pruning for extending satellite service life in LEO satellite constellations

OriginalPaper

A probability based stable routing for cognitive radio adhoc networks

OriginalPaper

Interference mitigation in Z-channel and relay-assisted Z-channel: a diversity gain region perspective

OriginalPaper

A review of industrial wireless networks in the context of Industry 4.0

Neuer Inhalt

    Bildnachweise