共查询到20条相似文献,搜索用时 62 毫秒
1.
在能量有效加权分簇(EWC)算法的基础上,提出一种簇首选择算法EWC-N(new EWC)。该算法根据节点的邻节点数量与剩余能量计算出权值,选出权值大的节点为簇首,在选择簇首的过程中,动态调整簇首之间的距离。该算法减少了分簇过程中能量的消耗,簇首的分布更加合理。仿真实验结果表明,该算法相对于EWC提高了能量有效利用率近9%,延长了约12%的网络生存时间。 相似文献
2.
3.
针对无线传感器网络中每轮能耗和簇内节点负载不均衡问题,本文提出了一种能量有效的多层分簇算法(EEMLC)。基站在首轮按照各层的最优簇头数对整个网络逐层进行虚拟分区,在接着的轮次中,各个分区根据本轮节点的剩余能量来选取下一轮簇头,前者使得网络每轮总能耗最小并有效保证各轮的能耗均衡,后者确保分区内节点的负载平衡,从而最大限度地延长网络的生命周期。实验仿真结果表明,与LEACH算法相比,EEMLC算法的每轮能耗均衡性有了显著提高,网络的生命周期延长了11.3%。 相似文献
4.
5.
6.
7.
8.
江华丽 《单片机与嵌入式系统应用》2018,(2):25-30
无线传感网是由许多具有计算能力的智慧无线节点组成的网络,这些无线传感节点负责收集周边环境的各类数据进行汇总处理,使得人们可以实时获得大量可靠的信息.在无线传感网络中,网络协议设计的主要目的是降低网内节点在通信上的能耗,从而延长网络的工作寿命.本文以分簇路由协议为研究对象,对国内外典型的分簇路由协议进行分析和比较,分析分簇路由协议存在的问题,并预测未来发展的趋势. 相似文献
9.
10.
现有的一些拓扑生成算法需要进行节点定位,既增加了算法复杂度和节点能量消耗,也不能很好地使能量和节点度均衡。提出一种新的“雨点”式分簇算法,模拟下雨时雨点打落在地面后会飞溅水花并溅出水波的效果。利用构建的“雨点”模型实现的无线传感器网络无需定位支持的分簇操作,可以使节点的剩余能量与节点度达到均衡。 相似文献
11.
一种能量高效的无线传感器网络分簇路由算法 总被引:2,自引:0,他引:2
无线传感器网络中节点的能量有限,提高能量的有效性便成为无线传感器网络路由协议设计的首要目标。设计了一种能量高效的分簇路由算法,它提出让候选节点在一定的覆盖范围内以剩余能量为标准来竞选簇头,以使簇头分布均匀;处于簇类交界的节点则根据能量和距离来选择归属的簇头,以平衡网络负载;新算法还采用多跳的簇间通信方式来降低大部分簇头节点的通信负载。仿真结果表明:新算法能够有效降低网络能耗,延长网络生存时间。 相似文献
12.
Dawei GongAuthor Vitae Yuanyuan YangZhexi PanAuthor Vitae 《Journal of Parallel and Distributed Computing》2013
Recent experimental studies have revealed that a large percentage of wireless links are lossy and unreliable for data delivery in wireless sensor networks (WSNs). Such findings raise new challenges for the design of clustering algorithms in WSNs in terms of data reliability and energy efficiency. In this paper, we propose distributed clustering algorithms for lossy WSNs with a mobile collector, where the mobile collector moves close to each cluster head to receive data directly and then uploads collected data to the base station. We first consider constructing one-hop clusters in lossy WSNs where all cluster members are within the direct communication range of their cluster heads. We formulate the problem into an integer program, aiming at maximizing the network lifetime, which is defined as the number of rounds of data collection until the first node dies. We then prove that the problem is NP-hard. After that, we propose a metric-based distributed clustering algorithm to solve the problem. We adopt a metric called selection weight for each sensor node that indicates both link qualities around the node and its capability of being a cluster head. We further extend the algorithm to multi-hop clustering to achieve better scalability. We have found out that the performance of the one-hop clustering algorithm in small WSNs is very close to the optimal results obtained by mathematical tools. We have conducted extensive simulations for large WSNs and the results demonstrate that the proposed clustering algorithms can significantly improve the data reception ratio, reduce the total energy consumption in the network and prolong network lifetime compared to a typical distributed clustering algorithm, HEED, that does not consider lossy links. 相似文献
13.
The deployment of wireless sensor networks in many application areas requires self-organization of the network nodes into clusters. Clustering is a network management technique, since it creates a hierarchical structure over a flat network. Quite a lot of node clustering techniques have appeared in the literature, and roughly fall into two families: those based on the construction of a dominating set and those which are based solely on energy considerations. The former family suffers from the fact that only a small subset of the network nodes are responsible for relaying the messages, and thus cause rapid consumption of the energy of these nodes. The latter family uses the residual energy of each node in order to decide about whether it will elect itself as a leader of a cluster or not. This family’s methods ignore topological features of the nodes and are used in combination with the methods of the former family. We propose an energy-efficient distributed clustering protocol for wireless sensor networks, based on a metric for characterizing the significance of a node, w.r.t. its contribution in relaying messages. The protocol achieves small communication complexity and linear computation complexity. Experimental results attest that the protocol improves network longevity. 相似文献
14.
无线传感器网络存在着严重的能量约束,传统同构的传感网络路由协议和算法不适合异构网络,因此,设计异构传感网络下的节能路由算法具有现实意义。研究两种不同类型传感器节点构成的,具有不同的初始能量和不同感知数据能力的异构网络中基于簇头预测的节能分簇路由算法ECAH。根据簇内节点的剩余能量、能量消耗速率和跟上一轮簇头的距离预测出下一轮簇头,有效地减少了控制报文数量,降低了系统开销,节约了能量。仿真结果显示,在异构的网络中采用ECAH路由算法比LEACH算法网络生存时间大约提高了23%。 相似文献
15.
根据无线传感器网络节点能量消耗和网络生存周期的特点,通过建立动态规划能量优化模型,在路由总能耗满足能量阈值约束条件下,均衡消耗网络中各节点能量,在此基础上提出一种适合无线传感器网络的动态规划路由算法。仿真结果表明,提出的路由算法能充分地利用有限的能量资源,较大地延长网络生存周期并降低节点的平均能耗。 相似文献
16.
针对无线传感网节点能耗不均造成的生命周期短的问题,提出一种能量高效的无线传感网分簇路由算法(NUC&GDF)。该算法从三个方面对无线传感网的路由进行优化;a)改进簇首选举机制,选择合适的簇首;b)改进簇首节点成簇半径规则,形成合理的簇规模大小;c)在簇首与基站的稳定数据传输过程中,引入改进的梯度下降法强化学习来计算权值最小的自适应无线簇间路由。实验结果分析表明,提出的算法性能比LEACH算法、LEACH-C算法以及DEBUC算法更优;在网络规模为100 m×100 m时,网络生命周期分别提高约50.3%、21.5%、16.4%,能更有效地延长网络生命周期。 相似文献
17.
针对无线传感网中存在的节点能量受限,网络循环利用周期短,吞吐量少等问题,提出了一种能量高效的无线传感器网络分簇算法--KAF(K-means and FAH).算法初始阶段基于改进的K均值(K-means)聚类获得网络分簇;利用模糊层次综合评价(FAHP)方法,根据节点能量、距基站的距离、节点能量效率等因素优化簇首选择;在数据传输阶段,根据传输距离、能量、跳数等因素构建节点多跳路由方式,有效减少了节点在数据传输时的能量消耗.仿真实验表明:相比于LEACH-K,KPSO等其他分簇路由协议,KAF对减少节点能耗,延长网络生命周期,增加网络吞吐量等方面均有明显改进. 相似文献
18.
19.
The Journal of Supercomputing - Wireless sensor networks are most used to monitor remote environments. Multitudinous sensor nodes gather data in a self-governing manner, operating on an exhaustive... 相似文献
20.
通过分析不同类型节点的失效对于网络覆盖效率的影响,提出一种具有能量和覆盖意识的无线传感器网络分簇算法.该算法不依赖节点的物理位置信息,优先选取部署密度较高区域的节点担任簇首,当簇首的剩余能量低于设定阈值时实施簇首迁移,以均衡网络能耗,降低节点的死亡率.进一步分析了算法复杂度和节点最优广播半径的选取.仿真结果表明,所提出的算法可有效改善网络运行中的覆盖性能,延长网络寿命. 相似文献