nach oben

Cluster Computing

Erschienen in:

01.12.2014

DF++ : an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network

verfasst von: Qaisar Ayub, M. Soperi Mohd Zahid, Sulma Rashid, Abdul Hanan Abdullah

Erschienen in: Cluster Computing | Ausgabe 4/2014

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

The delegated forwarding (DF) curb transmissions by forwarding the message to a node that holds high quality value seen by the message. However, DF assumes infinite buffer space that is not possible in real time applications. In addition, quality value computation considers the encountering history and does not account for additional network parameters such as aging and transitive connectivity. In this paper, we have proposed a routing protocol called as DF++ that compute quality value based on probabilistic model used in PRoPHET protocol and forwards the message to current node by adaptive computation of available buffer space. We have compared performance of DF++ with DF, Epidemic and PRoPHET routing protocols. The proposed DF++ has higher delivery probability and fewer message drop and transmissions.

Vorheriger Artikel Towards a systematic approach to the dynamic adaptation of structured parallel computations using model predictive control

Nächster Artikel Scalable PGAS collective operations in NUMA clusters

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

Bansal, M., Rajput, R., Gupta, G.: Mobile ad hoc networking (MANET): routing protocol performance issues and evaluation considerations. Mobile Ad-hoc Network (MANET) Working Group, IETF (1998)

Fall, K., Farrell, S.: DTN: an architectural retrospective. IEEE J. Sel. Areas Commun. 26(5), 828–836 (2008) CrossRef

Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Single-copy routing in intermittently connected mobile networks. In: Proc. IEEE Conf. Sensor and Ad Hoc Communications and Networks (SECON). IEEE Press, New York (2004)

Shah, R.C., et al.: Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Netw. 1(2–3), 215–233 (2003) CrossRef

Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad Hoc Networks. Citeseer, Princeton (2000)

Spyropoulos, T., Psounis, K., Raghavendra, C.S.: 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, New York (2005)

Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. IEEE Press, New York (2007)

Wang, G., Wang, B., Gao, Y.: Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network. IEEE Press, New York (2010)

Soares, V.N., Rodrigues, J.J., Farahmand, F.: GeoSpray: a geographic routing protocol for vehicular delay-tolerant networks. Inf. Fusion (2011). doi:10.1016/j.inffus.2011.11.003

10.

Prodhan, A.T.D., Kabir, R., Shoja, H.G.C.: TTL based routing in opportunistic networks. J. Netw. Comput. Appl. 34(5), 1660–1670 (2011) CrossRef

11.

Zhang, J., Luo, G.: Adaptive spraying for routing in delay tolerant networks. Wirel. Pers. Commun. 66(1), 217–233 (2012) CrossRef

12.

Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576–1589 (2011) CrossRef

13.

Nelson, S.C., Bakht, M., Kravets, R.: Encounter-based routing in DTNs. In: INFOCOM. IEEE Press, New York (2009)

14.

Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. In: Service Assurance with Partial and Intermittent Resources, pp. 239–254. Springer, Berlin Heidelberg (2004) CrossRef

15.

Jathar, R., Gupta, A.: Probabilistic routing using contact sequencing in delay tolerant networks. In: Second International Conference on Communication Systems and Networks (COMSNETS). IEEE Press, New York (2010)

16.

de Oliveira, E.C.R., de Albuquerque, C.V.N.: NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History. ACM, New York (2009)

17.

Srinivasa, S., Krishnamurthy, S.: CREST: an opportunistic forwarding protocol based on conditional residual time. In: 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON’09. IEEE Press, New York (2009)

18.

Bulut, E., Geyik, S.C., Szymanski, B.K.: Conditional shortest path routing in delay tolerant networks. In: IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM). IEEE Press, New York (2010)

19.

Gao, W., Cao, G.: On exploiting transient contact patterns for data forwarding in delay tolerant networks. In: 18th IEEE International Conference on Network Protocols (ICNP). IEEE Press, New York (2010)

20.

Sandulescu, G., Nadjm-Tehrani, S.: Opportunistic DTN routing with window-aware adaptive replication. In: Proceedings of the 4th Asian Conference on Internet Engineering. ACM, New York (2008)

21.

Elwhishi, A., Ho, P.H., Naik, S., Shihada, B.: Contention aware routing for intermittently connected mobile networks. In: AFIN 2011, The Third International Conference on Advances in Future Internet, pp. 8–15 (2011)

22.

Abdelkader, T., et al.: A socially-based routing protocol for delay tolerant networks. In: Global Telecommunications Conference (GLOBECOM 2010). IEEE Press, New York (2010)

23.

Lee, K., et al.: Max-contribution: on optimal resource allocation in delay tolerant networks. In: Proceedings IEEE INFOCOM. IEEE Press, New York (2010)

24.

Yuan, Q., Cardei, I., Wu, J.: Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks. IEEE Press, New York (2009)

25.

Elwhishi, A., Ho, P.H., Naik, K., Shihada, B.: ARBR: adaptive reinforcement-based routing for DTN. In: IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp. 376–385. IEEE Press, New York (2010)

Titel: DF++ : an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network
verfasst von: Qaisar Ayub
M. Soperi Mohd Zahid
Sulma Rashid
Abdul Hanan Abdullah
Publikationsdatum: 01.12.2014
Verlag: Springer US
Erschienen in: Cluster Computing / Ausgabe 4/2014
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI: https://doi.org/10.1007/s10586-013-0331-2

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 4/2014

Privacy preserving sub-feature selection based on fuzzy probabilities

Efficient public verification proof of retrievability scheme in cloud

Towards effective science cloud provisioning for a large-scale high-throughput computing

Assessing the impact of the CPU power-saving modes on the task-parallel solution of sparse linear systems

Pre-execution power consumption prediction of computational multithreaded workloads

Empirical and analytical approaches for web server power modeling