ZHENG Yi, ZHANG Dafang, XIE Kun. A Geography-Intimacy-Based Algorithm for Data Forwarding in Mobile Social Networks[J]. Chinese Journal of Electronics, 2016, 25(5): 936-942. doi: 10.1049/cje.2016.06.042
Citation: ZHENG Yi, ZHANG Dafang, XIE Kun. A Geography-Intimacy-Based Algorithm for Data Forwarding in Mobile Social Networks[J]. Chinese Journal of Electronics, 2016, 25(5): 936-942. doi: 10.1049/cje.2016.06.042

A Geography-Intimacy-Based Algorithm for Data Forwarding in Mobile Social Networks

doi: 10.1049/cje.2016.06.042
Funds:  This work is supported by the National Basic Research Program of China (No.2012CB315805), and the National Natural Science Foundation of China (No.61173167, No.61472130).
More Information
  • Corresponding author: ZHANG Dafang (corresponding author) is a professor with College of Computer Science and Electronic Engineering, Hunan University, China. His current research interests include dependable systems/networks, network security, network management and network measurement. (Email:dfzhang@hnu.edu.cn)
  • Received Date: 2015-01-09
  • Rev Recd Date: 2015-03-25
  • Publish Date: 2016-09-10
  • Due to uncertain network connectivity, efficiently data forwarding in Mobile social networks (MSNs) becomes challenging. To conquer the problem, an Efficient data forwarding scheme based on geography intimacy (GIDF) for MSNs to achieve higher delivery ratio is proposed. In GIDF, we firstly propose an Intimacy based dynamic community detection algorithm (IDCD), which divide the MSNs into several communities. We propose a novel metric geography intimacy which can quantify the node's geographical information and the friendships between nodes. Based on geography intimacy, we further propose a routing algorithm to forward data. Compared with the geography intimacy between nodes, the next hop is found, further find the route of data forwarding by doing the similar operations. Extensive simulations on real data with the ONE simulator show that GIDF is more efficient than the existing algorithms.
  • loading
  • Q.L. Huang, Z.F. Ma, Y.X. Yang, et al., "Secure data sharing and retrieval using attribute-based encryption in cloud-based OSNs", Chinese Journal of Electronics, Vol.23, No.3, pp.557-563, 2014.
    P. Costa, C. Mascolo, M. Musolesi and G.P. Picco, "Sociallyaware routing for publish-subscribe in delay-tolerant mobile ad hoc networks", IEEE Journal on Selected Areas in Communications, Vol.26, No.5, pp.748-760, 2008.
    E.M. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets", Proceedings of the 8th ACM International Symposium on Mobile ad hoc Networking and Computing, New York, USA, pp.32-40, 2007.
    P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap:Social-based forwarding in delay-tolerant networks", IEEE Transactions on Mobile Computing, Vol.10, No.11, pp.1576-1589, 2011.
    Z. Li, C. Wang, S.Q. Yang, C.J. Jiang, and X.Y. Li, "LASS:Local-activity and social-similarity based data forwarding in mobile social networks", IEEE Transactions on Parallel and Distributed Systems, Vol.26, No.1, pp.174-184, 2014.
    J. Fan, J. Chen, Y. Du, W. Gao, J. Wu, and Y. Sun, "Geocommunity-based broadcasting for data dissemination in mobile social networks", IEEE Transactions on Parallel and Distributed Systems, Vol.24, No.4, pp.734-743, 2013.
    J. Jiang, X. Wang, W.P. Sha, P. Huang, Y.F. Dai, and B.Y. Zhao, "Understanding latent interactions in online social networks", ACM Transactions on the Web, Vol.7, No.4, Article 18, 2013.
    D. Obradovic, S. Baumann, and A. Dengel, "A social network analysis and mining methodology for the monitoring of specific domains in the blogosphere", Social Network Analysis and Mining, Vol.3, No.2, pp.221-232, 2013.
    W. Dong, V. Dave, L. Qiu, and Y. Zhang, "Secure friend discovery in mobile social networks", Proceedings IEEE INFOCOM, pp.1647-1655, 2011.
    A. Madan, M. Cebrian, S. Moturu, K. Farrahi, and A. Pentland, "Sensing the ‘Health State’ of a Community", Pervasive Computing, Vol.11, No.4, pp.36-45, 2012.
    A. Lancichinetti, S. Fortunato, and J. Kert'esz, "Detecting the overlapping and hierarchical community structure in complex networks", New Journal of Physics, Vol.11, No.3, pp.1-20, 2009.
    A. Keränen and J. Ott, "Increasing reality for DTN protocol simulations", Technical Report, Helsinki University of Technology, Networking Laboratory, 2007.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (154) PDF downloads(1287) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return