Skip to main content
SpringerLink
Log in

Effective social-context based message delivery using ChitChat in sparse delay tolerant networks

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Delay tolerant networks (DTNs) have garnered much interest with the wide-spread adoption of portable smart devices capable of wirelessly connecting with one another, thus enabling the formation of a network for opportunistic data dissemination. This type of network is useful in a variety of applications where other form of network communication strategies are unavailable, such as an on-the-ground tactical military network in an active battlefield or an emergency network formed immediately after a catastrophic disaster. DTNs also provide opportunities for various other interesting applications such as location-based social networking, interests-based data dissemination, and geolocal advertising. One persistent challenge for DTNs is achieving sufficient message delivery due to the dynamic, unpredictable, and opportunistic nature of inter-device connections; this challenge is exacerbated when such connections are sparsely available. In this paper, a novel social-context based message routing system, called ChitChat, is proposed with the focus on message delivery through sparsely-connected DTNs. ChitChat is a hybrid geographic/data-centric routing system designed to exploit each user’s social (or mission) interests to opportunistically learn of multi-hop paths through the network, and to derive the social semantics of geographic locations using user travel itineraries and multi-hop social relationships. In turn, this information is used to make distributed routing decisions based on the likelihood an encountered node will connect with others capable of successfully delivering a message. An analysis of network sparsity is conducted against five real-world datasets. Through simulations using the two highest-sparsity real-world datasets, ChitChat is capable of achieving more successful deliveries against three recent state-of-the-art DTN routing schemes while incurring lower costs against flooding.

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

Similar content being viewed by others

Notes

  1. It is worth noting that 1 km of communication range may not be possible in a real DTN, and is considered here to test the behavior and performance of all approaches under extreme network conditions.

References

  1. Abdelkader, T., Naik, K., Nayak, A., Goel, N., Srivastava, V.: A performance comparison of delay-tolerant network routing protocols. IEEE Netw. 30(2), 46–53 (2016)

    Article  Google Scholar 

  2. Barbosa, H., Barthelemy, M., Ghoshal, G., James, C.R., Lenormand, M., Louail, T., Menezes, R., Ramasco, J.J., Simini, F., Tomasini, M.: Human mobility: models and applications. Phys. Rep. 734, 1–74 (2018)

    Article  MathSciNet  Google Scholar 

  3. Bedogni, L., Fiore, M., Glacet, C.: Temporal reachability in vehicular networks. In: IEEE INFOCOM 2018—IEEE Conference on Computer Communications, pp. 81–89 (2018)

  4. Cabaniss, R., Vulli, S.S., Madria, S.: Social group detection based routing in delay tolerant networks. Wirel. Netw. 19(8), 1979–1993 (2013)

    Article  Google Scholar 

  5. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emerg. Distrib. Syst. 27(5), 387–408 (2012)

    Article  Google Scholar 

  6. Cho, J., Chen, I.: Provest: provenance-based trust model for delay tolerant networks. IEEE Trans. Dependable Secur. Comput. 15(1), 151–165 (2018)

    Article  Google Scholar 

  7. Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc ’07, pp. 32–40. New York, NY, USA (2007). ACM

  8. Datta, S., Madria, S., Milligan, J., Linderman, M.: Secure information forwarding through fragmentation in delay-tolerant networks. In: 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS), pp. 93–102 (2018)

  9. Eagle, N., Pentland, A.S., Lazer, D.: Inferring friendship network structure by using mobile phone data. Proc. Natl. Acad. Sci. USA 106(36), 15274–15278 (2009)

    Article  Google Scholar 

  10. Gao, W., Cao, G., La Porta, T., Han, J.: On exploiting transient social contact patterns for data forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 12(1), 151–165 (2013)

    Article  Google Scholar 

  11. Guo, H., Wang, X., Cheng, H., Huang, M.: A location aided controlled spraying routing algorithm for delay tolerant networks. Ad Hoc Netw. 66, 16–25 (2017)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  13. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM ’04, pp. 145–158. New York, NY, USA (2004). ACM

  14. Jethawa, H., Madria, S.: Reputation and credit based incentive mechanism for data-centric message delivery in DTNS. In: 2018 19th IEEE International Conference on Mobile Data Management (MDM), pp. 207–216 (2018)

  15. Jindal, A., Psounis, K.: Performance analysis of epidemic routing under contention. In: Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing, IWCMC ’06, pp. 539–544. New York, NY, USA (2006). ACM

  16. Keränen, A., Ott, J., Kärkkäinen, T.: The ONE Simulator for DTN Protocol Evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, SIMUTools ’09. New York, NY, USA (2009). ICST

  17. Kiukkonen, N., Blom, J., Dousse, O., Gatica-Perez, D., Laurila, J.: Towards rich mobile phone datasets: Lausanne data collection campaign. In: Proceedings of the 2010 ACM International Conference on Pervasive Services (2010)

  18. Laurila, J.K., Gatica-Perez, D., Aad, I., Bornet, O., Do, T.M.T., Dousse, O., Miettinen, M.: Big data for mobile computing research. In: Pervasive Computing, The mobile data challenge (2012)

  19. Li, Z., Shen, H.: Sedum: exploiting social networks in utility-based distributed routing for DTNS. IEEE Trans. Comput. 62(1), 83–97 (2013)

    Article  MathSciNet  Google Scholar 

  20. Li, F., Jiang, H., Li, H., Cheng, Y., Wang, Y.: Sebar: social-energy-based routing for mobile social delay-tolerant networks. IEEE Trans. Veh. Technol. 66(8), 7195–7206 (2017)

    Article  Google Scholar 

  21. Li, W., Galluccio, L., Bassi, F., Kieffer, M.: Distributed faulty node detection in delay tolerant networks: design and analysis. IEEE Trans. Mob. Comput. 17(4), 831–844 (2018)

    Article  Google Scholar 

  22. Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. In: Dini, P., Lorenz, P., de Souza, J. (eds.) Service Assurance with Partial and Intermittent Resources. Lecture Notes in Computer Science, vol. 3126, pp. 239–254. Springer, Berlin (2004)

    Chapter  Google Scholar 

  23. Machado, K., Boukerche, A., de Melo, P.O.V., Cerqueira, E., Loureiro, A.A.: Pervasive forwarding mechanism for mobile social networks. Comput. Netw. 111, 6–16 (2016)

    Article  Google Scholar 

  24. McGeehan, D., Lin, D., Madria, S.: Chitchat: An effective message delivery method in sparse pocket-switched networks. In: 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), pp. 457–466. Los Alamitos, CA, USA(2016). IEEE Computer Society

  25. Mei, A., Morabito, G., Santi, P., Stefa, J.: Social-aware stateless routing in pocket switched networks. IEEE Trans. Parallel Distrib. Syst. 26, 252–261 (2015)

    Article  Google Scholar 

  26. Nahrstedt, K., Vu, L.: CRAWDAD dataset uiuc/uim (v. 2012-01-24). http://crawdad.org/uiuc/uim/20120124 (2012)

  27. Pietilainen, A.-K., Diot, C.: CRAWDAD data set thlab/sigcomm2009 (v. 2012-07-15). http://crawdad.org/thlab/sigcomm2009/ (2012)

  28. Pietilänen, A.-K., Diot, C.: Dissemination in opportunistic social networks: The role of temporal communities. In: Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc ’12, pp. 165–174. New York, NY, USA (2012). ACM

  29. Rhee, I., Shin, M., Hong, S., Lee, K., Kim, S.J., Chong, S.: On the levy-walk nature of human mobility. IEEE/ACM Trans. Netw. 19(3), 630–643 (2011)

    Article  Google Scholar 

  30. Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: CRAWDAD dataset cambridge/haggle (v. 2009-05-29). http://crawdad.org/cambridge/haggle/20090529 (2009)

  31. 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, WDTN ’05, pp. 252–259. New York, NY, USA (2005). ACM

  32. Spyropoulos, T., Turletti, T., Obraczka, K.: Routing in delay-tolerant networks comprising heterogeneous node populations. IEEE Trans. Mob. Comput. 8(8), 1132–1147 (2009)

    Article  Google Scholar 

  33. Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Technical report, Duke University (2000)

  34. Zhang, B., Teng, J., Bai, X., Yang, Z., Xuan, D.: $\text{P}^3$-coupon: A probabilistic system for prompt and privacy-preserving electronic coupon distribution. In: 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom), pp. 93–101 (2011)

  35. Zhang, J., Huang, H., Yang, C., Liu, J., Fan, Y., Yang, G.: Destination-aware metric based social routing for mobile opportunistic networks. Wireless Networks (2019)

  36. Zheng, Y., Li, Q., Chen, Y., Xie, X., Ma, W.-Y.: Understanding mobility based on gps data. In: Proceedings of the 10th International Conference on Ubiquitous Computing, UbiComp ’08, pp. 312–321. New York, NY, USA, (2008). ACM

  37. Zheng, Y., Zhang, L., Xie, X., Ma, W.-Y.: Mining interesting locations and travel sequences from gps trajectories. In: Proceedings of the 18th International Conference on World Wide Web, WWW ’09, pp. 791–800. New York, NY, USA, (2009). ACM

  38. Zheng, Y., Xie, X., Ma, W.-Y.: Geolife: a collaborative social networking service among user, location and trajectory. IEEE Data Eng. Bull. 33(2), 32–39 (2010)

    Google Scholar 

  39. Zhu, Y., Xu, B., Shi, X., Wang, Y.: A survey of social-based routing in delay tolerant networks: positive and negative social effects. IEEE Commun. Surv. Tutor. 15(1), 387–401 (2013)

    Article  Google Scholar 

Download references

Acknowledgements

Portions of the research in this paper used the MDC Database made available by Idiap Research Institute, Switzerland and owned by Nokia.

Funding

Funding was provided by DOE.

Author information

Authors and Affiliations

  1. Missouri University of Science and Technology, Rolla, USA

    Douglas McGeehan, Sanjay Madria & Dan Lin

Authors
  1. Douglas McGeehan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay Madria
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dan Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjay Madria.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

McGeehan, D., Madria, S. & Lin, D. Effective social-context based message delivery using ChitChat in sparse delay tolerant networks. Distrib Parallel Databases 38, 401–438 (2020). https://doi.org/10.1007/s10619-019-07274-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-019-07274-x

Keywords

Search

Navigation