移动群智感知中基于节点竞争的数据转发算法  

A Routing Algorithm in Mobile Crowd Sensing Based on Competitiveness of Node

作　　者：王巧莉 张振宇[1,2] 吴晓红 WANG Qiao-li;ZHANG Zhen-yu;WU Xiao-hong(School of Information Science and Engineering,Xinjiang University,Ummqi 830046;School of Software Engineering,Xinjiang University,Ummqi 830008)

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

出　　处：《现代计算机（中旬刊）》2018年第9期3-7,12,共6页Modern Computer

基　　金：国家自然科学基金项目(No.61262089)

摘　　要：针对移动群智感知网络中的数据转发问题,提出一种基于节点竞争的转发算法。该算法为参与数据转发的节点提供一定的奖励,调动节点参与竞争转发的积极性,达到促进数据转发的目的。其中,节点的竞争能力体现在节点的剩余能量、节点活跃度、节点关系强度、历史转发次数上,充分利用竞争能力较强的节点加快数据的转发过程。仿真结果表明,与Epidemic、Prophet及SW等算法相比,在保证较低网络开销的基础上,能够充分利用节点的转发能力,从而提高数据交付率和减少延迟。Proposes a forwarding algorithm based on node competition aiming at the problem of data forwarding in mobile crowd sensing networks.The algorithm provides certain incentives for the nodes involved in data forwarding, mobilizes the enthusiasm of the nodes to participate in the competition, and promotes the forwarding process of data. The node＇s competitiveness is reflected in the remaining energy ratio, the activeness, the strength of the relationship, and the number of historical transmissions. The nodes that have strong competitiveness are used to speed up the data forwarding process. Simulation results show that compared with Epidemic, Prophet and SW algorithms, on the basis of guaranteeing lower network overhead, the node＇s forwarding capability can be fully utilized, thus improving data delivery rate and reducing delay.

关 键 词：群智感知 剩余能量比 节点活跃度 关系强度 数据转发 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置]