无线传感器网络补偿性代价生成树路由算法

针对无线传感器网络中的"热点"问题,采用分簇的拓扑控制方法,并就簇头多跳方式提出了一种贪婪算法,以此在簇头间形成一种基于传输代价的生成树.算法前提是不同簇的传感数据相关性较小,不能进行数据融合.生成过程中每一步都以最小化当前最大节点代价为原则加入新的节点,从而达到均衡簇头节点能量消耗,延长网络生存时间的目的.并且在代价计算中引入相对剩余能量因子,以进一步均衡节点能量异构情况下的能量消耗.仿真结果表明,与现有典型算法相比较,在大规模无线传感器的应用环境下,网络生存时间得到有效的延长,节点剩余能量的分布也更加合理.

Compensatory cost spanning tree routing algorithm for wireless sensor networks

To solve the hot spots problem in wireless sensor networks,clustering topology control is adopted,and a greedy algorithm is presented for multi-hop routing to build a spanning tree based on the transfer cost on the assumption that data aggregation cannot be introduced due to the less relativity between the data from different clusters.In each step,a fresh node is added to the tree on the principle of min-max current cost,which can balance the energy consumption of cluster heads to prolong the lifetime of th...