城市场景下车联网数据收集传输规划  

Data collection scheduling in urban vehicular Ad-hoc network

作　　者：贾宗璞[1] 杨焕焕 宋成[1] 谢果君 Jia Zongpu;Yang Huanhuan;Song Cheng;Xie Guojun(School of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454000,China)

机构地区：[1]河南理工大学计算机科学与技术学院,河南焦作454000

出　　处：《南京理工大学学报》2019年第1期22-28,共7页Journal of Nanjing University of Science and Technology

基　　金：国家自然科学基金(61300124);河南省科技攻关计划基金(132102210123)

摘　　要：为了提高车联网中车辆感知数据的收集率,形式化定义并求解了车联网的数据收集问题,利用车辆的实时交通信息,提出了受限通信场景和非受限通信场景下同时建树同时规划传输时刻的算法。在数据收集过程中动态地判定传输策略,基于贪婪算法的思想递归地寻找父节点,构建一棵动态聚集路由树。在模拟轨迹数据集上进行的大量对比试验表明,所提算法相对其他算法在数据收集率方面有了较大的提高。In order to improve the collection rate of vehicles sensory data in vehicular Ad-hoc network,the data collection problem is studied and defined in this paper. According to the real-time traffic information ,two different algorithms,which can simultaneously establish a collection rooting tree and scheming each node ’ s transmit time in the tree in limited communication scene and unlimited communication scene,are proposed. The basic idea of the algorithms is to dynamically determine the transmission strategy in the process of data collection and construct a dynamic aggregation routing tree based on the recursively parent node selection algorithm which uses a thinking of greedy algorithm. Finally,a large number of contrast experiments are carried out on the simulation trajectory data set. Results show that the proposed algorithms have a well improvement in data collection rate compared with other schemes.

关 键 词：时延约束 数据收集 数据聚集 聚集路由树 通信场景 车联网 

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