检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:金鑫 易晓梅 吴鹏 JIN Xin;YI Xiaomei;WU Peng(School of Information Engineering, Zhejiang A&F University, Lin'an Zhejiang 311300, China)
机构地区:[1]浙江农林大学信息工程学院,浙江临安311300
出 处:《传感技术学报》2018年第2期271-275,共5页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金项目(61190114;61303236);浙江省自然科学基金项目(LY16F020036)
摘 要:大规模无线传感器网络路由转发中主要存在节点负载不均衡,容易导致"热区"中节点过早死亡,从而大大降低传感器网络生存时间的问题。针对这一问题,本文提出一种新的路由协议ECFP,首先利用节点与Sink节点的最短跳数建立簇首竞争半径,根据簇首竞争半径选择剩余能量较高、链路质量较好的节点出任簇首,然后基于虚拟力模型进行非均匀分簇,最后簇首之间多跳将信息传输至Sink节点。实验结果表明本文提出的协议在能耗均衡性和网络生存时间方面都具有较好的性能。The main problem of the large-scale wireless sensor network route forwarding is the burden of nodes is uneven,which easily leads to premature death of the"hot zone"nodes,thus greatly reducing the survival time of sensor network.In order to solve this problem,this paper proposes a new routing protocol called ECFP.Firstly,it use the minimum number of hops of nodes and Sink nodes to establish the competition radius of cluster head.The cluster head competition radius is used to select the nodes of higher remaining energy and link quality as the cluster head nodes,then the non-uniform clustering is carried out based on the virtual force model.Finally,the multi-hop information between the cluster head nodes is transmitted to the Sink node.The simulation results shows that the protocol proposed in this paper has a good performance in terms of energy consumption balance and network lifetime.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.46.149