一种无线传感器网中自适应的分簇路由算法  

Adaptive Cluster Routing Algorithm in Wireless Sensor Networks on Strategies to Grid Task Scheduling

作　　者：朱祥贤[1] 

机构地区：[1]淮安信息职业技术学院信息与通信工程系,江苏淮安223003

出　　处：《武汉理工大学学报》2010年第20期94-98,共5页Journal of Wuhan University of Technology

基　　金：国家自然科学基金(60472104)

摘　　要：为了在无线传感器网络中减少能耗,提出了一种自适应的分簇路由算法。该算法基于神经网络和博弈理论,根据事件变化自适应调整簇的覆盖和节点之间的通信,以有效利用传感节点资源,延长网络生命周期。仿真结果表明,该算法与传统算法相比,可以减少15.5%的能量消耗,延长13.4%的网络生命周期。An adaptive cluster routing algorithm is proposed in wireless sensor networks in order to save the energy.This algorithm is based on nervous system and game theory.And this algorithm could modify the scale of clusters and communication of nodes dynamically,which could efficiently utilize the resource of sensor nodes to improve the lifetime of network.The simulation results show that the proposed algorithm decreases the energy consumption by 15.5% and enlarges the life of network by 13.4% in comparison with the conventional algorithm.

关 键 词：无线传感器网络 分簇路由算法 神经网络 能耗 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]