机会网络中基于陌生节点的竞争转发策略  

Competitive forwarding strategy based on stranger node in opportunity network

作　　者：刘慧 钱育蓉[2] 张振宇[1] 杨文忠[1] LIU Hui;QIAN Yu-rong;ZHANG Zhen-yu;YANG Wen-zhong(College of Information Science and Engineering,Xinjiang University,Urumqi 830046,China;College of Software,Xinjiang University,Urumqi 830046,China)

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

出　　处：《计算机工程与设计》2021年第10期2710-2717,共8页Computer Engineering and Design

基　　金：国家自然科学基金项目(61966035、61562086);新疆维吾尔自治区教育厅创新团队基金项目(XJEDU2016S035)。

摘　　要：针对机会网络中存在自私节点导致消息的传送成功率偏低、开销大、延迟高,考虑到节点在其社会属性存在的情况下,提出基于陌生节点的竞争转发算法—BSCP(based on stranger competition algorithm)。重点分析消息转发过程中利用节点的属性制定相应的转发策略,通过节点的陌生性,设置陌生节点在整个环境中的比例值,计算节点相遇的最大陌生值并排序,设计节点竞争策略使得数据转发成功率提高。仿真验证了BSCP算法的有效性,与STRON、Epidemic及BSIF等算法相比,该算法能有效保证消息传送成功率,减少由于节点自私性产生的消息丢失和碰撞现象,提高吞吐量,降低网络开销和延迟。A competitive forwarding strategy based on strange nodes in opportunistic networks was proposed for the message forwarding in the opportunistic network.The self-transmission of the message generated by the node is low,the overhead is high,the delay is high,and the node is lazy transmittable under the social attribute—BSCP(based on stranger competition algorithm).The use of the attributes of the nodes in the message forwarding process was analyzed to formulate the corresponding forwarding strategy.Based on the strangeness of the node,the proportion of the unknown node in the entire environment was set,and the maximum unknown value that the nodes met was calculated and sorted to design the node.The competition strategy improved the success rate of data forwarding.The simulation verifies the effectiveness of the BSCP algorithm compared with the algorithms such as STRON,Epidemic and BSIF.The algorithm can effectively guarantee the message transmission success rate,reduce the message loss and collision phenomenon caused by the node selfishness,improve the throughput,reduce the network overhead and delay.

关 键 词：机会网络 陌生节点 最大陌生值 竞争策略 竞争转发算法 

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