机会网络中基于节点社会属性的转发算法  

Routing algorithm based on attribute of sociality of node in opportunistic networks

作　　者：刘慧[1] 张振宇[1,2] 杨文忠[2] 吴晓红[2] 

机构地区：[1]新疆大学软件学院,乌鲁木齐830008 [2]新疆大学信息科学与工程学院,乌鲁木齐830046

出　　处：《计算机工程与应用》2017年第22期92-96,115,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61262089;No.61262087)

摘　　要：针对机会网络中的数据转发问题,提出一种基于节点社会属性的转发算法。该算法计算节点的陌生性、介数中心性和相似性,均衡利用多个节点的资源防止某些节点因资源消耗过快而退出网络,降低网络的连通性。仿真结果表明,与Epidemic、PROPHET及SW等算法相比,在保证较低传输延迟和较高传输成功率的基础上,通过减少节点间的转发次数,有效地降低了网络传输开销,从而提高数据交付率和减少延迟。For message forwarding in opportunistic networks, a forwarding algorithm based on Attribute of Sociality of Node is proposed in this paper. This algorithm computes value of strangeness of nodes, betweenness, similarity and balanced use of the resources of multiple nodes to prevent some nodes fast out of the network and reduces network connectivity. Through the simulation experiment and compared with Epidemic, PROPHET, SW algorithm, this algorithm can reduce network overhead by reducing the number of forwarding between nodes based on ensuring lower delivery latency and higher delivery success rate, which improves data delivery ratio and decreases latency.

关 键 词：机会网络 陌生性 介数中心性 相似性 数据转发 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]