车联网下基于网络编码的高吞吐量多径路由算法

doi:10.3969/j.issn.1000-436x.2013.z1.017

摘要/Abstract

摘要：

在车联网中，由于车辆节点间无线链路的频繁中断易导致数据重传，使整个车辆组网性能急剧下降。为此，面向车联网提出了一种增强吞吐量的多径路由算法，其核心是使车辆节点分簇算法支持网络编码，从而达到对乱序和丢失报文恢复的目的。该算法首先采用协同编码通信模型来实现分簇后同簇车辆节点互相协同的多路径传输，然后采用网络编码对源端车辆和中间车辆节点发送的数据进行线性编码操作，最后在目的端节点予以解码。在基于QualNet仿真平台上的实验结果表明，该算法能够有效地提升车联网中多径路由的吞吐量。

关键词: 车联网, 网络编码, 簇, 多径路由

Abstract:

In Internet of Vehicles (IoVs), the frequent interruptions of wireless links between the vehicles cause data retrans-mission, which makes the whole vehicle network performance fall sharply. Hence, a multipath routing algorithm was pro-posed for enhancing throughput. The core of the algorithm is to make the vehicle clustering algorithm support network cod-ing, which can achieve the purpose of recovery of disorder and lost packets. Firstly, a collaborative coding communication model was established to achieve mutual cooperative multi-path transmission between vehicle nodes in the same cluster. Secondly, network linear coding was adopted to encode the transmitted data of source vehicle nodes and intermediate vehicle nodes. Finally, destination nodes decode the received data. The performances of the scheme were evaluated by QualNet software. Simulation results show that the algorithm could effectively improve the throughput of multi-path routing in IoVs.

Key words: IoVs, network coding, cluster, multi-path routing

范存群,王尚广,谷文哲,孙其博,杨放春. 车联网下基于网络编码的高吞吐量多径路由算法[J]. 通信学报, 2013, 34(Z1): 133-141.

Cun-qun FAN,Shang-guang WANG,Wen-zhe GU,Qi-bo SUN,Fang-chun YANG. Enhanced-throughput multipath routing algorithm based on network coding in IoVs[J]. Journal on Communications, 2013, 34(Z1): 133-141.

图/表 11

图1

图2

图3

图4

图5

表1

表2

表3

图6

图7

图8

参考文献 20

[1]	CHEN Y S , LIN Y W , PAN C Y . DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks[J]. Telecommunication Systems, 2011(46):299-316.
[2]	NAUMOV V , GROSS T . Connectivity-aware routing (CAR) in ve-hicular ad hoc networks[A]. Proceedings of IEEE International Confer-ence on Computer Communications, IEEE Infocom[C]. Anchorage, Alaska, USA, 2007.1919-1927.
[3]	YANG Q , LIM A , LI S , et al. ACAR: adaptive connectivity aware routing for vehicular ad hoc networks in city scenarios[J]. Mobile Networks and Applications, 2010(15):36-60.
[4]	HUANG X X , FANG Y G . Yuguang. Performance study of node-disjoint multipath routing in vehicular Ad Hoc networks[J]. IEEE Transactions on Vehicular Technology, 2009(58):1942-1950.
[5]	宋飞，苏伟，张宏科等．多路径并行传输中吞吐量的建模与分析[J]．电子学报， 2010,38(4):887-893. SONG F , SU W , ZHANG H K , et al. Modeling and analysis of throughput in CMT[J]. Acta Electronica Sinica, 2010,38(4):887-893.
[6]	SUN W , YAMAGUCHI H , YUKIMASA K , et al. GVGrid: a QoS routing protocol for vehicular ad hoc networks[A]. Proceedings of IEEE International Workshop on Quality of Service[C]. New Haven, CT, USA, 2006.130-139.
[7]	SKORDYLIS A , TRIGONI N . Delay-bounded routing in vehicular ad-hoc networks[A]. 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing 2008, MobiHoc'08[C]. Hong Kong SAR, China, 2008.341-350.
[8]	TALEB T , SAKHAEE E , JAMALIPOUR A , et al. A stable routing protocol to support ITS services in VANET networks[J]. IEEE Trans-actions on Vehicular Technology, 2007(56):3337-3347.
[9]	SAKHAEE E , JAMALIPOUR A . Stable clustering and communica-tions in pseudolinear highly mobile Ad Hoc networks[J]. IEEE Trans-actions on Vehicular Technology, 2008(57):3769-3777.
[10]	ZHAO J , CAO G . VADD: vehicle-assisted data delivery in vehicular Ad Hoc net-works[J]. IEEE Computer Communications, 2006,57(3):1-12.
[11]	YONG D , LI X . SADV: static-node-assisted adaptive data dissemina-tion in vehicular networks[J]. IEEE Transactions on Vehicular Tech-nology, 2010(59):2445-2455.
[12]	CUI S , GOLDSMITH A J , BAHAI A . Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks[J]. IEEE Jour-nal on Selected Areas in Communications, 2004,22(6):1089-1098.
[13]	PILLUTLA L S , KRISHNAMURTHY V . Joint rate and cluster opti-mization in cooperative MIMO sensor networks[A]. IEEE 6th Work-shop on Signal Processing Advances in Wireless Communications[C]. Philadelphia, PA, USA, 2005.265-269.
[14]	李钊，李建东，肖丽媛．认知MIMO系统基于授权通信模式信息的空频域机会接入[J]．通信学报， 2012,33(1):38-44. LI Z , LI J D , XIAO L Y . Spatio-frequency domain opportunistic access in CR-MIMO system based on primary transmission mode informa-tion[J]. Journal on Communications, 2012,33(1):38-44.
[15]	SENGUPTA S , RAYANCHU S , BANERJEE S . An analysis of wireless network coding for unicast sessions: the case for coding-aware routing[A]. Proc of IEEE Infocom[C]. Anchorage, AL, USA, 2007.1028-1036.
[16]	HO T , KARGER D R , MEDARD M , et al. The benefits of coding over routing in a randomized setting[A]. The 2003 IEEE International Symposium on Information Theory[C]. Yokohama, 2003.442-447.
[17]	BING D , JUN Z . Parity check network coding for wireless cooperative communications[J]. Acta Electronica Sinica, 2010,19(2):339-344.
[18]	SAKHAEE E , JAMALIPOUR A . Stable clustering and communica-tions in pseudolinear highly mobile Ad Hoc networks[J]. IEEE Trans-actions on Vehicular Technology, 2008,57(6):3769-3777.
[19]	肖百龙，郭伟，刘军等．移动自组织网络基于链路稳定性的伪流言路由算法[J]．通信学报， 2008,29(6):26-33. XIAO B L , GUO W , LIU J , et al. Pseudo Gossip routing algorithm Based link stability in mobile ad hoc networks[J]. Journal on Commu-nications, 2008,29(6):26-33.
[20]	SAHA A K , JOHNSON D B . Modeling mobility for vehicular ad hoc networks[A]. Proceedings of ACM International Workshop on Ve-hicular Ad Hoc Networks[C]. Philadelphia, USA, 2004.91-92.

关键参数	参数意义
n_i	第i个簇中的节点数
k	源节点与目标节点之间的簇个数
r _ij	第(i+1)个簇中与节点(i,j)相连的数目
pxy	节点x与y之间的分组丢失率

2^q	线性无关概率	2^q	线性无关概率
2¹	0.288 8	2⁵	0.967 8
2²	0.688 5	2⁶	0.984 1
2³	0.859 4	2⁷	0.992 1
2⁴	0.933 6	2⁸	0.999 6

仿真参数	值
GF(2^q)	2⁸
网络规模	10 km×10 km
信道带宽	1 Mbit/s
数据分组平均大小	512 Kbyte
天线覆盖半径	0.5 km
传输发射功率	21 dBm
接受机灵敏度	-24.67 dBm
仿真时间	1 000 s