基于最优簇首数划分单元格的改进GAF算法  

Improved GAF algorithm of dividing cells based on optimal number of cluster heads

作　　者：梁青[1] 李卓冉[1] 韩昊澎[1] 熊伟[2] 

机构地区：[1]西安邮电大学电子工程学院,西安710061 [2]空军工程大学信息与导航学院,西安710077

出　　处：《计算机应用研究》2013年第12期3622-3624,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(61202490);陕西省教育厅科学研究计划基金资助项目(12JK0559)

摘　　要：为构造良好的拓扑结构,降低节点能耗,延长网络生存期,对传统的GAF算法进行了改进。改进算法中考虑到连通度和最优簇首数的问题,提出了新的虚拟单元格划分方法。在簇首选择阶段,不仅考虑到节点剩余能量及节点距基站的距离,还考虑到节点吞吐率的问题,并通过定义簇首选择函数来进行簇首选择。仿真结果显示,改进的GAF算法有效地节省了节点能耗,延长了网络生存期。该算法的各项性能均优于传统的GAF算法。In order to construct a good topology, reduce nodes energy consumption and extend the lifetime of the network, this paper improved the traditional GAF algorithm. Considering the problem of connectivity and the optimal number of cluster heads, this paper proposed a new method of dividing the virtual cells. Not only considering the residual energy of nodes and the distances from base station, but also taking into account the node throughput in the cluster head selection stage. Besides, by defining the cluster-head selection function to find the cluster head. Simulation results show that, the improved GAF algorithm has effect on reducing the node＇s energy consumption and extending the network lifetime. The performance of the algorithm is better than the traditional GAF algorithm.

关 键 词：无线传感器网络 GAF算法 最优簇首数 节点吞吐率 簇首选择函数 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]