A Geography‐Intimacy‐Based Algorithm for Data Forwarding in Mobile Social Networks. Issue 5 (1st September 2016)

• Record Type: Journal Article
• Authors: Zheng, Yi; Zhang, Dafang; Xie, Kun
• Is Part Of: Chinese journal of electronics. Volume 25:Issue 5(2016)
• Page Start: 936
• Page End: 942
• Publication Date: 2016-09-01
• Subjects: Data forwarding -- Mobile social networks (MSNs) -- Geography intimacy -- Intimacy; mobile computing -- network theory (graphs) -- social networking (online); geography‐intimacy‐based algorithm -- data forwarding -- mobile social networks -- uncertain network connectivity -- MSN -- GIDF -- intimacy based dynamic community detection algorithm -- IDCD -- node geographical information -- routing algorithm -- ONE simulator; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2016.06.042
• Languages: English
• ISSNs: 1022-4653

Abstract

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