摘要
由于移动社交网络中不存在稳定的端到端连接,因此移动社交网络中的数据转发是一个重要问题。从节点的友好性角度出发,利用节点间的友好性,构造了节点间的团结构并利用团与节点、社区之间的亲密度,提出了一种基于团结构亲密度的数据转发算法(DFAIG)。基本思想是,数据包携带节点只有在本社区AP或者相遇节点与以目的节点为中心的团结构的亲密度达到一定要求时,才转发数据包给相遇节点。仿真结果显示:与著名的Epidemic,Label和SGBR相比,提出的算法在降低网络开销上具有明显优势,且有效地提高数据包传递率。
As intermittent and uncertain network connectivity in mobile social networks, data forwarding becomes an important problem. Based on the friendship of nodes, first constructs groups of nodes and then utilizing the intimacy of groups with nodes and communications, propose a data forwarding algorithm based on intimacy of group （DFAIG）. The idea of DFAIG is that data packet carrier only forward data to encounter node its communication AP or the encounter node whose intimacy of group which takes destination node as center meets a certain requirement. Simulation results show that the algorithm has obvious superiority on reducing network overhead and also can significantly increase delivery ratio compared with Epidemic algorithm, Label and SGBR algorithm.
出处
《传感器与微系统》
CSCD
2017年第2期127-130,共4页
Transducer and Microsystem Technologies
基金
国家自然科学基金资助项目(61401144
61571179)
中央高校基本科研业务费专项基金资助项目(J2014HGXJ0074
2015HGZX0019)
关键词
移动社交网络
团结构亲密度
数据转发
拷贝数
mobile social networks
intimacy of groups
data forwarding
copy numbers
