无线移动感知网络上的数据聚集传输规划

发布时间：2018-04-16 11:26

本文选题：无线移动感知网络 + 车联网　；参考：《计算机学报》2015年03期

【摘要】：随着城市交通日益增多,智能交通系统研究受到工业界和学术界的极大关注.智能交通系统上的实时导航、交通监控等应用都需要大量实时车辆速度、位置等信息.由智能车组成的无线移动感知网络的链路变化频繁并且无线干扰严重,现有的车辆网络上的数据聚集算法没有考虑无线链路变化的具体情况,就进行数据聚集和传输的规划.文中分析并求解了移动感知网络上的无冲突数据聚集传输规划问题,将该问题形式化为移动通信拓扑图上的单传聚集传输规划问题,并证明了该问题是NP完全的;提出了移动聚集路由树,将无线冲突分为树内冲突和树间冲突,首先构建树间冲突图描述树间冲突,过滤节点的传输候选时刻集以消除树间冲突,然后利用动态规划思想进行聚集路由树上的数据聚集传输时刻规划来消除树内冲突.并且在真实出租车移动轨迹数据集上进行了实验,实验结果表明文中的算法比现有的算法在数据收集率上提高了1/4左右,并且收集上来的数据的平均延迟也更小.
[Abstract]:With the increasing of urban traffic, the research of Intelligent Transportation system (its) has attracted great attention from industry and academia.Real-time navigation, traffic monitoring and other applications in intelligent transportation system need a lot of real-time vehicle speed, position and other information.The wireless mobile sensing network composed of intelligent vehicles has frequent link changes and serious wireless interference. The existing data aggregation algorithms on the vehicle network do not consider the specific situation of the wireless link changes, so the data aggregation and transmission planning is carried out.In this paper, we analyze and solve the collision free data aggregation transmission planning problem in mobile perceptual networks, formalize this problem as a single transmission aggregation transmission planning problem on mobile communication topology, and prove that the problem is NP complete.A mobile aggregated routing tree is proposed, which divides wireless conflicts into intra-tree conflicts and inter-tree conflicts. Firstly, the inter-tree conflict graph is constructed to describe the inter-tree conflicts, and the transmission candidate time sets of nodes are filtered to eliminate the inter-tree conflicts.Then the data aggregation transmission time planning based on the aggregation routing tree is carried out by dynamic programming to eliminate the intra-tree conflict.The experimental results show that the data collection rate of the proposed algorithm is about a quarter higher than that of the existing algorithms, and the average delay of the collected data is also smaller.
【作者单位】：哈尔滨工业大学计算机科学与技术系;
【基金】：国家自然科学基金(61370214,61300210)资助~~
【分类号】：TP212.9;TN929.5

【参考文献】