无线传感器网络中基于区域再生树汇聚的路由算法

Routing Algorithm Based on Regional Regenerated Tree for Data Aggregation in Wireless Sensor Networks

传感器网络具有严格的能量限制,冗余的低速数据流和多对一的通信方式等不同于传统Ad Hoc网络的特点,针对这些特点,提出一种区域再生树汇聚的路由算法。算法中将传感区域内部的所有传感器节点采集的数据沿区域再生树的父子关系层层汇聚到传感区域内离Sink点最近的区域汇聚点,再将汇聚的数据通过全局路由树形成的最短路径传递给Sink节点。仿真结果显示区域再生树的数据汇聚能够减少数据传输量,并具有较小的传输时延。

Sensor networks differ from traditional adhoc networks in several ways： sensor networks have se- vere energy constraints, redundant low-rate data, and many-to-one flows. Based on these characteristics, a novel routing algorithm based on regenerated-tree for data aggregation was proposed. In this scheme, the node in sensing region which is nearest to the sink acts as the region aggregation point. All other nodes in sensing region send their data to this region aggregation node along the regenerated-tree, then, sends the aggregation information to the sink along the shortest path. Experimental results show that the data ag- gregation scheme can cause fewer transmissions and a bit shorter transmission delay.