应用于无线传感网络的新型层次型拓扑算法  

New Hiberarchy Topology Arithmetic for Wireless Sensor Network

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

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

出　　处：《计算机工程》2007年第23期114-116,128,共4页Computer Engineering

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

摘　　要：无线传感网络的节点能量有限,层次型的拓扑结构将整个网络分为多个簇,并选择簇头负责路由,节省了节点能量,延长了网络生存周期。文章在现有层次型拓扑算法的基础上,针对其不足,引入生日悖论理论,提出一种新的层次型拓扑算法。该算法通过在每个节点的时槽内,对不同工作状态进行合理分配,保证网络中所有节点在最少能量消耗下进行分簇和选择簇头工作,有效地延长了网络生存周期。The finite energy is one of the importent features of wireless sensor network. The hiberarchy topology devides the whole network into many clusters, and chooses the cluster-heads for the route, which saves the energy of the nodes and prolongs the lifetime of the whole network. This paper presents a new hiberarchy topology arithmetic with birthday paradox theory based on the existing hiberarchy topology arithmetic, aiming at their shortcoming. This arithmetic distributes reasonably the time slots of every node among the different status, ensuring all the nodes in the network do the clustering and choose cluster-heads with least energy consumption, and prolongs survival period of the network effectively.

关 键 词：生日悖论 层次型拓扑 分簇 LEACH HEED 

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