一种基于能量消耗分簇算法在WSN中的研究  

Clustering Algorithm Based on Energy Consumption in WSN

作　　者：苗玥[1] 白金牛[1] Miao Yue;Bai Jinniu(Department of Computer Science and Technology,Baotou Medical College,Baotou Inner Mongolia 014000,China)

机构地区：[1]内蒙古包头医学院计算机科学与技术系,内蒙古包头014000

出　　处：《科技通报》2016年第12期179-183,195,共6页Bulletin of Science and Technology

摘　　要：如何降低能量消耗是无线传感网络中的重要研究方向,本文首先对节点中的簇首节点消耗问题进行研究,然后针对分簇算法进行了改进:在簇首节点中采用遗传算法选出最优的节点;在簇覆盖范围中采用能量作为判断依据;在簇与簇的通信中采用改进的Dijkstra算法进行优化。仿真实验表明,本文的算法与LEACH,DBCP算法相比有了明显的改进,节点的能量消耗更加合理,生命周期进一步加强。How to reduce energy consumption has been an important direction in the research into wireless sensor network. This paper first studies the consumption of cluster head node and improves the clustering algorithm: to select the optimal node in the cluster head node by using the genetic algorithm;uses energy as the basis for judgment in the coverage of clustering; and optimize the improved Dijkstra algorithm in the communication between clusters. Simulation experiments show that compared with the LEACH and DBCP algorithm, algorithm in this paper has been significantly improved, energy consumption of nodes is more reasonable and life cycle is further strengthened.

关 键 词：能量消耗 分簇 DIJKSTRA算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]