Page 315 - 《软件学报》2021年第8期

软件学报 ISSN 1000-9825, CODEN RUXUEW E-mail: jos@iscas.ac.cn
Journal of Software,2021,32(8):2597−2612 [doi: 10.13328/j.cnki.jos.005985] http://www.jos.org.cn
©中国科学院软件研究所版权所有. Tel: +86-10-62562563

∗
基于节点运动的机会网络路由算法

张棋飞, 桂 超, 宋 莺, 孙宝林, 戴志锋

(湖北经济学院 信息与通信工程学院,湖北 武汉 430205)
通讯作者: 孙宝林, E-mail: blsun@163.com

摘 要: 机会网络利用节点移动带来的接触机会传输数据,数据在节点运动过程中捎带转发,保证了节点独立性,
但会给数据传输带来影响.以节点的运动特性为切入点,设计了基于运动的机会网络路由算法.综合考虑数据传输、
数据内容以及应用需求等因素,设计了数据转发优先级评价模型,结合节点活动区间划分方案制定数据传输规则;设
计了差异化副本传输策略,在数据传输效率和系统开销之间取得折衷;考虑了节点活动范围、中心度及能量水平,构
建了运动自由度函数评估节点运动水平.在此基础上设计了效用函数,选择中继节点转发数据.仿真结果表明,该算
法能够在满足传输要求的同时限制网络开销,提高分组投递率,降低传输时延.
关键词: 机会路由;数据转发优先级;运动自由度;效用函数
中图法分类号: TP393

中文引用格式: 张棋飞,桂超,宋莺,孙宝林,戴志锋.基于节点运动的机会网络路由算法.软件学报,2021,32(8):2597−2612.
http://www.jos.org.cn/1000-9825/5985.htm
英文引用格式: Zhang QF, Gui C, Song Y, Sun BL, Dai ZF. Routing algorithm in opportunistic networks based on node mobility.
Ruan Jian Xue Bao/Journal of Software, 2021,32(8):2597−2612 (in Chinese). http://www.jos.org.cn/1000-9825/5985.htm
Routing Algorithm in Opportunistic Networks Based on Node Mobility

ZHANG Qi-Fei, GUI Chao, SONG Ying, SUN Bao-Lin, DAI Zhi-Feng
(School of Information and Communication Engineering, Hubei University of Economics, Wuhan 430205, China)

Abstract: Opportunistic networks utilize the contact opportunities created by node movement to forward data between node pairs. Data
is piggybacked during its carrier’s movement, which guarantees node independence while imposes an impact on data transmission
performance. This study designs a routing algorithm for opportunistic networks based on node movement characters. Considering the
factors of data transmission, data content and application demands, a data forwarding priority evaluation model is developed and adopted
to determine the data transmission rules combined with the division of node activity range. The transfer strategy of differential message
replicas is proposed to achieve a tradeoff between transmission efficiency and system overhead. A node free motion degree function is
constructed according to activity range distribution, centrality degree, and energy level to evaluate the node motion level. And then a
utility function is deduced for relaying node selection. The simulation results demonstrate that the proposed algorithm achieves higher
packet delivery ratio and less delivery latency while satisfying application demands and restraining network overhead.
Key words: opportunistic routing; data forwarding priority; free degree of motion; utility function

机会网络是一种在通信链路间歇式连通状况下,利用节点移动带来的接触机会实现数据传输的自组织网
[1]
[2]
络 .作为一种新兴的网络形态,机会网络面临着许多在传统网络环境中不曾遭遇的困难和挑战 ,其分组路由
问题更是引起了研究者的极大关注 [3−5] .机会网络路由机制基于节点间链路间歇式连通状况,利用节点移动带

∗ 基金项目: 国家自然科学基金(61572012); 湖北省自然科学基金(2017CFB677, 2018CFB661, 2018CFB721); 湖北省教育厅重
点项目(14D052)
Foundation item: National Natural Science Foundation of China (61572012); Natural Science Foundation of Hubei Province
(2017CFB677, 2018CFB661, 2018CFB721); Key Project of Education Bureau, Hubei Province (14D052)
收稿时间: 2018-05-07; 修改时间: 2019-04-02, 2019-08-11; 采用时间: 2019-12-04; jos 在线出版时间: 2020-04-21