Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks

REN Zhi; LI Xiu-feng; WANG Zhong-yong; CAO Hong-wei

doi:10.13756/j.gtxyj.2018.01.014

您当前的位置：

首页 >

文章列表页 >

Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks

- Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks
- Study on Optical communication Issue 1, Pages: 52-55(2018)
- 作者机构：
  
  重庆邮电大学重庆市移动通信技术重点实验室
- 作者简介：
- 基金信息：
- DOI：10.13756/j.gtxyj.2018.01.014
  CLC： TN92
- Published：2018，
扫描看全文
[1]任智,李秀峰,王中永,曹红伟.基于SV捎带信息的机会网络低开销路由算法[J].光通信研究,2018(01):52-55.

REN Zhi, LI Xiu-feng, WANG Zhong-yong, et al. Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks. [J]. (1):52-55(2018)
[1]任智,李秀峰,王中永,曹红伟.基于SV捎带信息的机会网络低开销路由算法[J].光通信研究,2018(01):52-55. DOI： 10.13756/j.gtxyj.2018.01.014.

REN Zhi, LI Xiu-feng, WANG Zhong-yong, et al. Low-overhead Routing based on Information Piggybacked by SV for Opportunistic Networks. [J]. (1):52-55(2018) DOI： 10.13756/j.gtxyj.2018.01.014.

摘要

针对当前机会网络中基于议价博弈的概率路由算法存在的汇总矢量（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.

关键词

机会网络议价博弈路由开销

Keywords

opportunistic networksBargaining Gameroutingoverhead

references

更多指标>

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A duplicate-free efficient opportunistic routing algorithm

An attack-aware routing algorithm for optical networks based on artificial fish swarm optimization

Study on a hybrid routing protocol for wireless sensor networks

A novel fiber grating wireless sensor network and the routing protocol design

Research on T-MPLS based routing and wavelength assignment

Related Author

No data

Related Institution

Key Laboratory of Mobile Communication Technology,Chongqing University of Posts and Telecommunications

Department of Information Engineering,Armed Police Engineering University

College of Communication and Information Engineering, Chongqing University of Posts and Telecommunications

Research Institute of Optical Communication and Optoelectronics,Beijing University of Posts and Telecommunications

Xi’an University of Post and Telecommunications

⁰