摘要
对无线传感器网络数据融合策略进行了研究,提出了求图中心点的分布式算法并以此为基础,提出了中心点融合算法。详细介绍了寻找中心点和建立融合树的过程,分析了网络密度和事件相对sink节点位置对节能效果的影响。通过与最短路路由算法比较,从数学推导和仿真结果两方面验证中心点融合的有效性。
This paper researches on aggregation strategy in wireless sensor networks, proposes a dlstributed method for finding the center of a graph and proposes a center aggregation algorithm that based on this distributed method. It introduces the process of finding center and building aggregation tree, analyzes the impact of network density and the relatively distance between the event and the sink on energy saving. From both mathematics consequence and emulator result, it is proved that the center aggregation has validity.
出处
《传感技术学报》
EI
CAS
CSCD
北大核心
2006年第3期872-877,共6页
Chinese Journal of Sensors and Actuators
关键词
数据融合
级别梯度场
寻找中心点
融合树
最短路路由
data aggregation
level gradient field
finding center point
aggregation tree
shortest path rou-ting
