光通信研究, 2018 (1): 52, 网络出版: 2018-04-09  

基于SV捎带信息的机会网络低开销路由算法

Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks
作者单位
重庆邮电大学 重庆市移动通信技术重点实验室,重庆 400065
摘要
针对当前机会网络中基于议价博弈的概率路由算法存在的汇总矢量(SV)交换机制含有冗余的控制分组,消息交易过程有冗余交互以及节点投递概率信息由专门的数据结构存储和传送,带来额外的通信开销等问题,提出一种基于SV捎带信息的机会网络低开销路由算法——LR-IPSV,该算法通过设计改进的SV交换机制,剔除现有消息交易过程中存在的冗余操作,并提出采用基于SV的投递概率捎带机制,从而达到降低开销和提升吞吐量的效果。仿真结果表明,LR-IPSV算法在开销、吞吐量等方面的性能均优于基于相遇和传输历史的概率路由(PROPHET)算法以及基于博弈刺激合作的概率路由(GSCP)算法。
Abstract
To solve the problems existing in the present probabilistic routing based on Bargaining Games, including redundant control packets exist in the exchange process of Summary Vector (SV), redundancy exists in the messages interaction process, and unnecessary overhead from using special data structure to transmit matrix of delivery probability, an routing algorithm based on information piggybacked by SV and Low-overhead Routing based on Information Piggybacked by SV for opportunistic networks (LR-IPSV) is proposed. The LR-IPSV algorithm designs an improved exchange mechanism of SV and eliminate the redundant steps in current interaction mechanism. We also propose mechanism of piggybacking matrix of delivery probability with SV to reduce the control overhead and improve the network throughput. The simulation results show that the proposed LR-IPSV algorithm shows better performances than previous Probabilistic Routing Protocol using History of Encounters and Transitivity (PROPHET) algorithm and Game-theoretic approach to Stimulate Cooperation for Probabilistic routing (GSCP) algorithm in terms of overhead and throughput.

任智, 李秀峰, 王中永, 曹红伟. 基于SV捎带信息的机会网络低开销路由算法[J]. 光通信研究, 2018, 44(1): 52. REN Zhi, LI Xiu-feng, WANG Zhong-yong, CAO Hong-wei. Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks[J]. Study On Optical Communications, 2018, 44(1): 52.

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!