Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Distribution of Inter-Contact Time: An Analysis-Based on Social Relationships

  • Received : 2012.09.23
  • Accepted : 2013.05.16
  • Published : 2013.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.

Keywords

References

  1. K. R. Fall, "A delay-tolerant network architecture for challenged internets," in Proc. ACM SIGCOMM, 2003, pp. 27-34.
  2. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of human mobility on opportunistic forwarding algorithms," IEEE Trans. Mobile Comput., vol. 6, pp. 606-620, Jun. 2007. https://doi.org/10.1109/TMC.2007.1060
  3. K. Wei, D. Zeng, S. Guo, and K. Xu, "Social-aware relay node selection in delay tolerant networks," in Proc. IEEE ICCCN, 2013, pp. 1-7.
  4. P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, "Pocket switched networks and human mobility in conference environments," in Proc. ACM SIGCOMM WDTN, 2005, pp. 244-251.
  5. J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft, "Opportunistic content distribution in an urban setting," in Proc. SIGCOMM CHANTS, June 2007, pp. 205-212.
  6. H. Cai and D. Y. Eun, "Crossing over the bounded domain: From exponential to power-law intermeeting time in mobile ad hoc networks," IEEE Trans. Trans. Netw., vol. 17, pp. 1578-1591, Oct. 2009. https://doi.org/10.1109/TNET.2008.2011734
  7. T. Karagiannis, J.-Y. Le Boudec, and M. Vojnovic, "Power law and exponential decay of intercontact times between mobile devices," IEEE Trans. Mobile Comput., vol. 9, no. 10, pp. 1377-1390, Oct. 2010. https://doi.org/10.1109/TMC.2010.99
  8. V. Conan, J. Leguay, and T. Friedman, "Characterizing pairwise inter-contact patterns in delay tolerant networks," in Proc. ICST AUTONOMICS, 2007, pp. 19:1-19:9.
  9. A. Passarella, M. Conti, C. Boldrini, and R. I. Dunbar, "Modelling inter-contact times in social pervasive networks," in Proc. ACM MSWiM, 2011, pp. 333-340.
  10. K. Wei, X. Liang, and K. Xu "A survey of social-aware routing protocols in delay tolerant networks: Applications, taxonomy and design-related issues," in Proc. IEEE Commu. Surveys and Tutorials, 2013, no. 99.
  11. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, "CRAWDAD data set cambridge/haggle/imote/infocom2006," [Online]. Available: http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom2006, Feb. 2009.
  12. N. Eagle and A. Pentland, "Reality mining: Sensing complex social systems," Personal and Ubiquitous Comput., pp. 255-268, 2006.
  13. G. Bigwood, D. Rehunathan, M. Bateman, T. Henderson, and S. Bhatti, "Data set st andrews/sassy," [Online]. Available: http://crawdad.cs.dartmouth.edu/standrews/sassy, June 2011.
  14. D. Kotz, T. Henderson, I. Abyzov and J. Yeo, "CRAWDAD data set dartmouth/campus v.2009-09-09," [Online]. Available: http://crawdad.cs.dartmouth.edu/dartmouth/campus, Sept. 2009.
  15. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: Social-based forwarding in delay tolerant networks," in Proc. ACM MobiHoc, 2008, pp. 241-250.
  16. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," NATURE, vol. 435, no. 7043, pp. 814-818, 2005. https://doi.org/10.1038/nature03607
  17. T. Hossmann, T. Spyropoulos, and F. Legendre, "Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing," in Proc. INFOCOM, 2010, pp. 1-9.