检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:ZHENG Yi ZHANG Dafang XIE Kun
机构地区:[1]College of Computer Science and Electronic Engineering, Hunan University
出 处:《Chinese Journal of Electronics》2016年第5期936-942,共7页电子学报(英文版)
基 金:supported by the National Basic Research Program of China(No.2012CB315805);the National Natural Science Foundation of China(No.61173167,No.61472130)
摘 要: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.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.
关 键 词:Data forwarding Mobile social networks(MSNs) Geography intimacy Intimacy
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.21.43.72