检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学计算机科学与技术学院,重庆400065
出 处:《传感技术学报》2009年第11期1645-1649,共5页Chinese Journal of Sensors and Actuators
基 金:重庆市教委科学技术研究项目资助(KJ080526);重庆市科委项目资助(CSTC2009BB2081)
摘 要:为了延长网络的生存时间,需要设计能量有效的路由协议以适应传感器网络的特点。成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够提高网络的生存时间。本文提出一种基于时间延迟机制的分簇算法,称为CHTD。该算法建立了节点的时间延迟机制模型,使得能量较多的节点能够在每一轮中被优先选为簇首。同时,通过维持每个节点的簇首信息集合使得每轮产生的簇首数目稳定且位置均匀分布。模拟实验表明,CHTD有效地均衡了网络中节点的能量消耗,并显著地延长了网络的存活时间。In order to prolong the network lifetime,energy-efficient routing protocols should be designed to adapt the characteristic of wireless sensor networks. Clustering algorithm is a kind of key technique used to reduce energy consumption,which can make a longer life span of sensor network. A clustering hierarchy arithmetic based on time delay(CHTD) was presented, Taking use of the sensor nodes time delay module, it can guarantee the node with high remaining energy to be chosen as the cluster head nodes in priority in each round. Besides this,a set of nodes that have received cluster heads information is proposed so that the algorithm is able to ensure a constant number of cluster heads and the cluster heads are well scattered. Simulation results demonstrate that CHTD algorithm effectively balances the energy dispatch of the sensors and obvious improvement on the network lifetime.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38