一种可变尺度的VANETs无结构数据聚合算法

An adjustable structure-free data aggregation approach on VANETs

摘要:

在VANETs的应用中,为了满足应用目的节点对距其远近不同的节点对数据精度的不同要求,聚合算法需要具有能够变尺度调节的能力,形式化地定义了VANETs单节点上的可变尺度数据聚合问题并证明了该问题是NP-难的,同时提出了基于贪心思想的单节点变尺度数据聚合近似算法ESAS.模拟实验表明,在保证可变尺度数据质量前提下,ESAS与现有的考虑数据精度的聚合算法(FBAS)相比能显著减少传输数据量.

Abstract:

In-network data aggregation is a useful technique for applications that require periodic dissemination of information to a large region.For applications on VANETs,destination node requires different degrees of data accuracy according to the distance from it to source node that generates data.Therefore,data aggregation scheme should adjust the aggregation factor to satisfy the different requirements of data accuracy from different applications.Based on this,we formalize adjustable data aggregation on one node on VANETs problem,and prove that it is NP-Hard,and we also propose an adjustable data aggregation approximate algorithm ESAS based on greedy.Simulation experiments make it clear that ESAS has a sharp decrease on the amount of communication data compared with that based on fuzzy logic aggregation scheme(FBAS).