Open AccessA Geography‐Intimacy‐Based Algorithm for Data Forwarding in Mobile Social Networks
Author(s) -
Zheng Yi,
Zhang Dafang,
Xie Kun
Publication year - 2016
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.06.042
Subject(s) - computer science , algorithm , theoretical computer science
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.