摘要
针对无线传感器网络中数据传输必须在指定时延约束下完成的特殊场景提出了一种能量有效的数据融合树算法,该算法首次将分组敏感的概念引入到传感器网络实时数据融合应用中,并通过特殊机制使得该算法在降低能耗水平的同时可以为实时数据动态地选择满足时延要求的路径。另外,针对该数据融合树算法设计了一种特殊的数据融合定时机制,从而进一步改善了该算法的性能。最后,通过仿真试验将该算法与已存在算法进行了比较,证明了该算法的优越性。
We propose an energy efficient data aggregation tree algorithm for wireless sensor networks under a real-time scenario where the data aggregation must be performed within a specified latency constraint. The algorithm innovatively introduces the group-aware idea into the real-time data aggregation application, and it can choose path satisfying the latency constraint dynamically with lower energy consumption than other existing algorithm through a special mechanism. Moreover, this paper designs a synchronous mechanism for data aggregation timing control to supply special service for real-time data of proposed approach, performance of the proposed algorithm has been improved farther. Finally, extensive simulations show that the proposed algorithm is very efficient in energy-saving under the latency constraint and has better performance than other existing algorithms.
出处
《传感技术学报》
CAS
CSCD
北大核心
2008年第10期1760-1764,共5页
Chinese Journal of Sensors and Actuators
关键词
无线传感器网络
数据融合
分组敏感
时延约束
wireless sensor networks
data aggregation
group-aware
latency-constraint
