无线传感网络中基于生日悖论的分簇算法  

Clustering Arithmetic Based on Birthday Paradox in Wireless Sensor Network

作　　者：韩屏[1] 李方敏[1] 

机构地区：[1]武汉理工大学信息工程学院,湖北武汉430070

出　　处：《小型微型计算机系统》2007年第11期2028-2032,共5页Journal of Chinese Computer Systems

基　　金：教育部博士点基金项目"无线传感网络在结构健康监测中的数据同步和融合技术研究"(20050497006)资

摘　　要：节点能量有限是无线传感网络的一个基本特性,本文为节省节点能量和延长网络生存周期,将生日悖论理论引入到分簇算法中.通过在每个节点的时槽内,对工作、侦听、休眠三种工作状态进行合理的分配,保证网络中所有节点在最少能量消耗下进行分簇和选择簇头工作,有效的延长了网络生存周期.并且给出了仿真结果.The finite energy is one of the basic features of wireless sensor network, this paper imports the theory of birthday paradox to the clustering arithmetic, which aims at saving energy of the nodes and prolonging the survival period, distributes reasonably the time slots of every node among the working, interception and dormancy status, ensures all the nodes in the network do the clustering and choose cluster-heads with least energy consumption, and prolongs effectively survival period of the network. Also, the paper provides the result of simulation.

关 键 词：生日悖论 分簇 LEACH HEED 

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