检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘志强[1] 关乾煜 王瑞利 何平基 张旭[1] LIU Zhi-qiang;GUAN Qian-yu;WANG Rui-li;HE Ping-ji;ZHANG Xu(College of Information Engineering,Inner Mongolia University of Technology,Hohhot 010080,China)
机构地区:[1]内蒙古工业大学信息工程学院,内蒙古呼和浩特010080
出 处:《传感器与微系统》2018年第11期107-110,共4页Transducer and Microsystem Technologies
基 金:内蒙古自治区科技创新引导奖励资金资助项目;内蒙古科技厅科技计划资助项目(201502015);内蒙古工业大学自然科学基金资助项目(ZD201001);呼和浩特市科技计划重大科技专项项目(2015-高-重-2);内蒙古自治区高等学校科学研究项目(NJZY16437)
摘 要:针对LEACH算法以及许多其改进算法在解决能耗问题上都是从能量均衡的角度出发,但在簇头的选取上仍然存在不足的问题,对LEACH算法进行了进一步改进,提出了一种以骨干节点作为簇首的(SNACH)拓扑路由算法。在网络中提取骨干节点作为簇头,对骨干节点进行扩展,得到一个骨干网络带作为簇头的备选集合,从而能够使节点均匀分布在网络中,降低了簇头节点"压力",使得网络中节点达到能量均衡的状态。令200个节点在200 m×200 m的区域内进行仿真实验,结果表明:在基站(BS)节点处于原点位置时,相比于LEACH算法,节点出现死亡的时间延缓了221%。To solve energy consumption problem of node in wireless sensor networks(WSNs) LEACH algorithm and many of its improved algorithms are from the point of view of energy balance,but there are still defects in selection of cluster heads,the LEACH algorithm is further improved,and a topology routing algorithm using skeleton nodes as cluster head(SNACH) is proposed. The skeleton nodes are extracted as cluster heads in the network,the skeleton nodes are expanded to get a backbone network band as alternative set of cluster heads. By this way,the nodes can be distributed uniformly in the network,reducing the pressure of the cluster head nodes,and making the node reach the state of energy balance in the network.200 nodes are distributed in the area of 200×200 m and simulation experiment is carried out,the results show that when the base station(BS) node is at the origin,compared with the LEACH algorithm,the time of node death is delayed by 221 %.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.163.164