Skip to main content
Erschienen in: Telecommunication Systems 4/2018

20.12.2017

Distinguishing social contacts and pass-by contacts in DTN routing

verfasst von: Sun-Hyun Kim, Seung-Jae Han

Erschienen in: Telecommunication Systems | Ausgabe 4/2018

Einloggen

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

search-config
loading …

Abstract

The heterogeneity of the application data size needs to be considered in Delay Tolerant Networks (DTN) routing. Depending on the size of data, certain node contacts may not be long enough for complete data forwarding, i.e., data forwarding may be interrupted if the link is disconnected before the completion of data transfer. In this paper, we present a peer-to-peer DTN routing scheme that considers data size and contact duration. We classify node contacts into social contacts and pass-by contacts. The former corresponds to the case social interaction between users is involved, while the latter corresponds to the case contact occurs only due to physical proximity between nodes. Our scheme is novel in the following aspects. Firstly, we utilize both types of contacts unlike the existing social DTN routing which utilizes only social contacts. Large data is forwarded at social contacts which generally has long contact duration. Pass-by contacts are used for forwarding small data. Secondly, we characterize the strength of social ties by combining heterogeneous properties of contacts. We have evaluated the effectiveness of the proposed scheme by simulating the real world contact traces. It is shown that our scheme substantially higher delivery ratio and lower relaying overhead than the existing schemes when the size of data varies.

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!

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!

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!

Fußnoten
1
These papers consider the DTN delivery scenario when the mobile nodes are directly connected to AP.
 
2
Since the data size is 10 MB, the number of fragments does not change while the fragment size is 9–5 MB.
 
Literatur
1.
Zurück zum Zitat Vahdat, A., Becker, D., et al. (2000). Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University. Vahdat, A., Becker, D., et al. (2000). Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University.
2.
Zurück zum Zitat Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM WDTN, pp. 252–259. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM WDTN, pp. 252–259.
3.
Zurück zum Zitat Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceedings of IEEE PerCom Workshops, pp. 79–85. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceedings of IEEE PerCom Workshops, pp. 79–85.
4.
Zurück zum Zitat Nelson, S.C., Bakht, M., & Kravets, R. (2009). Encounter-based routing in DTNs. In Proceedings of IEEE INFOCOM, pp. 846–854. Nelson, S.C., Bakht, M., & Kravets, R. (2009). Encounter-based routing in DTNs. In Proceedings of IEEE INFOCOM, pp. 846–854.
5.
Zurück zum Zitat 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 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
6.
Zurück zum Zitat Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. In Proceedings of IEEE PerCom Workshops’07, pp. 65–70. Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. In Proceedings of IEEE PerCom Workshops’07, pp. 65–70.
7.
Zurück zum Zitat Hui, P., Crowcroft, J., & Yoneki, E. (2011). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.CrossRef Hui, P., Crowcroft, J., & Yoneki, E. (2011). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.CrossRef
8.
Zurück zum Zitat Boldrini, C., Conti, M., Jacopini, J., & Passarella, A. (2007). Hibop: A history based routing protocol for opportunistic networks. In Proceedings of IEEE WoWMoM, pp. 18–21. Boldrini, C., Conti, M., Jacopini, J., & Passarella, A. (2007). Hibop: A history based routing protocol for opportunistic networks. In Proceedings of IEEE WoWMoM, pp. 18–21.
9.
Zurück zum Zitat Zhuo, X., Li, Q., Gao, W., Cao, G., & Dai, Y. (2011). Contact duration aware data replication in delay tolerant networks. In Proceedings of IEEE ICNP, pp. 236–245. Zhuo, X., Li, Q., Gao, W., Cao, G., & Dai, Y. (2011). Contact duration aware data replication in delay tolerant networks. In Proceedings of IEEE ICNP, pp. 236–245.
10.
Zurück zum Zitat Zhuo, X., Li, Q., Cao, G., Dai, Y., Szymanski, B., & La Porta, T. (2011). Social-based cooperative caching in DTNs: A contact duration aware approach. In Proceedings of IEEE MASS, pp. 92–101. Zhuo, X., Li, Q., Cao, G., Dai, Y., Szymanski, B., & La Porta, T. (2011). Social-based cooperative caching in DTNs: A contact duration aware approach. In Proceedings of IEEE MASS, pp. 92–101.
11.
Zurück zum Zitat Sandulescu, G., & Nadjm-Tehrani, S. (2008). Opportunistic DTN routing with window-aware adaptive replication. In Proceedings of ACM AINTEC, pp. 103–112. Sandulescu, G., & Nadjm-Tehrani, S. (2008). Opportunistic DTN routing with window-aware adaptive replication. In Proceedings of ACM AINTEC, pp. 103–112.
12.
Zurück zum Zitat Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007). Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6), 606–620.CrossRef Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007). Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6), 606–620.CrossRef
13.
Zurück zum Zitat Musolesi, M., & Mascolo, C. (2007). Designing mobility models based on social network theory. ACM SIGMOBILE Mobile Computing and Communications Review, 11(3), 59–70.CrossRef Musolesi, M., & Mascolo, C. (2007). Designing mobility models based on social network theory. ACM SIGMOBILE Mobile Computing and Communications Review, 11(3), 59–70.CrossRef
14.
Zurück zum Zitat Conan, V., Leguay, J., & Friedman, T. (2007). Characterizing pairwise inter-contact patterns in delay tolerant networks. In Proceedings of ACM Autonomics, pp. 19–27. Conan, V., Leguay, J., & Friedman, T. (2007). Characterizing pairwise inter-contact patterns in delay tolerant networks. In Proceedings of ACM Autonomics, pp. 19–27.
15.
Zurück zum Zitat Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2006). Performance analysis of mobility-assisted routing. In Proceedings of ACM Mobihoc, pp. 49–60. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2006). Performance analysis of mobility-assisted routing. In Proceedings of ACM Mobihoc, pp. 49–60.
16.
Zurück zum Zitat Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The one simulator for DTN protocol evaluation. In Proceedings of ACM Simutools, pp. 55–61. Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The one simulator for DTN protocol evaluation. In Proceedings of ACM Simutools, pp. 55–61.
17.
Zurück zum Zitat Mitzenmacher, M., & Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press.CrossRef Mitzenmacher, M., & Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press.CrossRef
18.
Zurück zum Zitat Byers, J. W., Luby, M., & Mitzenmacher, M. (2002). A digital fountain approach to asynchronous reliable multicast. IEEE Journal Selected Areas in Communications, 20(8), 1528–1540.CrossRef Byers, J. W., Luby, M., & Mitzenmacher, M. (2002). A digital fountain approach to asynchronous reliable multicast. IEEE Journal Selected Areas in Communications, 20(8), 1528–1540.CrossRef
19.
Zurück zum Zitat Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49(2), 371–381.CrossRef Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49(2), 371–381.CrossRef
20.
Zurück zum Zitat Scott, J. et al. CRAWDAD trace cambridge/haggle/imote/infocom (v.2006-01-31). Scott, J. et al. CRAWDAD trace cambridge/haggle/imote/infocom (v.2006-01-31).
21.
Zurück zum Zitat Palla, G., Derényi, I., Farkas, I., & Vicsek, I. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435, 814–818.CrossRef Palla, G., Derényi, I., Farkas, I., & Vicsek, I. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435, 814–818.CrossRef
22.
Zurück zum Zitat Zhang, X., Kurose, J., Levine, B.N., Towsley, D., & Honggang, Z. (2007). Study of a bus-based disruption-tolerant network: Mobility modeling and impact on routing. In Proceedings of ACM Mobihoc, pp. 195–206. Zhang, X., Kurose, J., Levine, B.N., Towsley, D., & Honggang, Z. (2007). Study of a bus-based disruption-tolerant network: Mobility modeling and impact on routing. In Proceedings of ACM Mobihoc, pp. 195–206.
23.
Zurück zum Zitat Nahrstedt, K., & Vu, L. CRAWDAD data set uiuc/uim (v. 2012-01-24). Nahrstedt, K., & Vu, L. CRAWDAD data set uiuc/uim (v. 2012-01-24).
24.
Zurück zum Zitat Kim, S., Jeong, Y., & Han, S. (2014). Use of contact duration for message forwarding in intermittently connected mobile networks. Computer Networks, 64, 38–54.CrossRef Kim, S., Jeong, Y., & Han, S. (2014). Use of contact duration for message forwarding in intermittently connected mobile networks. Computer Networks, 64, 38–54.CrossRef
25.
Zurück zum Zitat Moreira, W., mendes, P., & Sargento, S. (2012). Opportunistic routing based on daily routines. In Proceedings of IEEE WoWMoM, pp. 1–6. Moreira, W., mendes, P., & Sargento, S. (2012). Opportunistic routing based on daily routines. In Proceedings of IEEE WoWMoM, pp. 1–6.
26.
Zurück zum Zitat Boldrini, C., Conti, M., & Passarella, A. (2008). ContentPlace: Social-aware data dissemination in opportunistic networks. In Proceedings of ACM MSWiM, pp. 203–210. Boldrini, C., Conti, M., & Passarella, A. (2008). ContentPlace: Social-aware data dissemination in opportunistic networks. In Proceedings of ACM MSWiM, pp. 203–210.
27.
Zurück zum Zitat Costa, P., Mascolo, C., Musolesiand, M., & Picco, G. P. (2008). Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 26(5), 748–760.CrossRef Costa, P., Mascolo, C., Musolesiand, M., & Picco, G. P. (2008). Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 26(5), 748–760.CrossRef
28.
Zurück zum Zitat Xiao, M., Wu, J., & Huang, L. (2014). Community-aware opportunistic routing in mobile social networks. IEEE Transactions on Computers, 63(7), 1682–1695.CrossRef Xiao, M., Wu, J., & Huang, L. (2014). Community-aware opportunistic routing in mobile social networks. IEEE Transactions on Computers, 63(7), 1682–1695.CrossRef
29.
Zurück zum Zitat Yu, C., Tu, Z., Yao, D., Lu, F., & Jin, H. (2016). Probabilistic routing algorithm based on contact duration and message redundancy in delay tolerant network. International Journal of Communication Systems, 29(16), 2416–2426.CrossRef Yu, C., Tu, Z., Yao, D., Lu, F., & Jin, H. (2016). Probabilistic routing algorithm based on contact duration and message redundancy in delay tolerant network. International Journal of Communication Systems, 29(16), 2416–2426.CrossRef
30.
Zurück zum Zitat Zhang, L., Wang, X., Lu, J., Ren, R., Duan, Z., & Cai, Z. (2017). A novel contact prediction-based routing scheme for DTNs. Transactions on Emerging Telecommunications Technologies, 28(1), e2889. Zhang, L., Wang, X., Lu, J., Ren, R., Duan, Z., & Cai, Z. (2017). A novel contact prediction-based routing scheme for DTNs. Transactions on Emerging Telecommunications Technologies, 28(1), e2889.
Metadaten
Titel
Distinguishing social contacts and pass-by contacts in DTN routing
verfasst von
Sun-Hyun Kim
Seung-Jae Han
Publikationsdatum
20.12.2017
Verlag
Springer US
Erschienen in
Telecommunication Systems / Ausgabe 4/2018
Print ISSN: 1018-4864
Elektronische ISSN: 1572-9451
DOI
https://doi.org/10.1007/s11235-017-0416-y

Weitere Artikel der Ausgabe 4/2018

Telecommunication Systems 4/2018 Zur Ausgabe

Neuer Inhalt