Skip to main content
SpringerLink
Log in

Distinguishing social contacts and pass-by contacts in DTN routing

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

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.

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Notes

  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.

References

  1. Vahdat, A., Becker, D., et al. (2000). Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University.

  2. 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. 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. Nelson, S.C., Bakht, M., & Kravets, R. (2009). Encounter-based routing in DTNs. In Proceedings of IEEE INFOCOM, pp. 846–854.

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

  6. Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. In Proceedings of IEEE PerCom Workshops’07, pp. 65–70.

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

    Article  Google Scholar 

  8. 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. 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. 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. Sandulescu, G., & Nadjm-Tehrani, S. (2008). Opportunistic DTN routing with window-aware adaptive replication. In Proceedings of ACM AINTEC, pp. 103–112.

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

    Article  Google Scholar 

  13. Musolesi, M., & Mascolo, C. (2007). Designing mobility models based on social network theory. ACM SIGMOBILE Mobile Computing and Communications Review, 11(3), 59–70.

    Article  Google Scholar 

  14. 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. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2006). Performance analysis of mobility-assisted routing. In Proceedings of ACM Mobihoc, pp. 49–60.

  16. 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. Mitzenmacher, M., & Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press.

    Book  Google Scholar 

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

    Article  Google Scholar 

  19. Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49(2), 371–381.

    Article  Google Scholar 

  20. Scott, J. et al. CRAWDAD trace cambridge/haggle/imote/infocom (v.2006-01-31).

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

    Article  Google Scholar 

  22. 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. Nahrstedt, K., & Vu, L. CRAWDAD data set uiuc/uim (v. 2012-01-24).

  24. Kim, S., Jeong, Y., & Han, S. (2014). Use of contact duration for message forwarding in intermittently connected mobile networks. Computer Networks, 64, 38–54.

    Article  Google Scholar 

  25. Moreira, W., mendes, P., & Sargento, S. (2012). Opportunistic routing based on daily routines. In Proceedings of IEEE WoWMoM, pp. 1–6.

  26. Boldrini, C., Conti, M., & Passarella, A. (2008). ContentPlace: Social-aware data dissemination in opportunistic networks. In Proceedings of ACM MSWiM, pp. 203–210.

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

    Article  Google Scholar 

  28. Xiao, M., Wu, J., & Huang, L. (2014). Community-aware opportunistic routing in mobile social networks. IEEE Transactions on Computers, 63(7), 1682–1695.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

Download references

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MSIT) (No. 2016R1A2B4014505).

Author information

Authors and Affiliations

  1. Yonsei University, Seoul, Korea

    Sun-Hyun Kim & Seung-Jae Han

Authors
  1. Sun-Hyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seung-Jae Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seung-Jae Han.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, SH., Han, SJ. Distinguishing social contacts and pass-by contacts in DTN routing. Telecommun Syst 68, 669–685 (2018). https://doi.org/10.1007/s11235-017-0416-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-017-0416-y

Keywords

Search

Navigation