共查询到20条相似文献,搜索用时 140 毫秒
1.
2.
无线传感器网络(WSN)具有的能量有限,其能量利用效率的高低直接影响着网络的生命周期.为了提高无线传感器网络的能量利用效率,提出了一种能量感知非均匀成簇路由优化算法(Energy Awareness Unequal Clustering Routing Optimization Algorithm,EUCR).该算法通过节点在网络中所处的位置确定各节点的邻居节点,并以局部能量选举簇头,各簇头根据其邻居节点构建非均匀分簇网络.同时该算法在路由阶段考虑了簇头的剩余能量和转发代价.仿真结果表明,EUCR算法能有效提高网络的能量利用效率,并延长网络的生命周期. 相似文献
3.
具有能量供给的无线传感器网络路由算法研究 总被引:1,自引:0,他引:1
针对现有具有能量供给的无线传感器网络由算法出现的簇头分布不均匀、簇头无法连任的问题,本文提出了一种新的路由算法一CAEH(clustering algorithm for energy harvesting),该算法通过对簇头选举机制阈值进行改进,均衡了全网簇头节点的分布,同时簇头能够连续担任不再重复选举,从而充分保存与利用供给能量。理论和仿真实验表明:与另一种对比算法相比较,CAEH算法能够提高节点平均剩余能量以及存活节点的数量。 相似文献
4.
5.
传统LEACH协议在选举簇头节点时,采用动态簇头选举算法,每轮选举产生簇头节点个数为最佳簇头数的概率并不是最大,使得每轮选举的簇头数偏差较大,不能使节点能量达到最优化。针对这一问题,提出了改进的LEACH-P协议,该协议在簇头选举阶段通过簇头节点间的相互协作,以少量的能量消耗来获取全局信息,消除了LEACH协议簇头选举算法的盲目性,从而改善簇头选举算法。实验结果表明,LEACH—P协议相比传统LEACH协议有效地节省了节点能量,延长了网络生命周期。 相似文献
6.
7.
8.
针对LEACH算法在准备阶段出现的簇头分布不均匀、整个网络能耗不均衡,以及传输距离受限等不足,综合考虑空间信息和梯度、节点剩余能量、簇头能耗等因素,用于簇头的选举与数据的传输过程中,实现了LEACH算法的改进。仿真结果表明,改进后的算法与原LEACH算法相比,使网络中节点的能耗更加均衡,且推迟了网络中第一个消亡节点出现的时间,轮数增加了1倍,提高了整个网络中能量利用率以及网络性能,使网络寿命延长50%~69%。 相似文献
9.
基于灰色关联度的Leach算法的改进 总被引:1,自引:1,他引:0
Leach算法是无线传感器网络中应用最为广泛的分簇路由协议之一,但是该算法的簇头是随机产生的,有可能导致节点过早死亡,从而使整个网络崩溃。针对这一问题,提出一种基于优选簇头的改进Leach算法——gc Leach算法。改进算法引入灰色关联度思想对簇头进行分区选举,兼顾考虑了簇头的剩余能量以及位置分布,有效地避免了簇头分布不合理,以及簇头剩余能量过低导致的节点过早死亡的情况。仿真结果表明,改进后的gc Leach算法能够有效地降低网络能耗,延长网络生命周期。 相似文献
10.
11.
为了避免能量较少节点当选为群首而过早死亡,对Leach协议群首的选取进行改进。采用结合节点剩余能量重新设置阈值的方法,选取剩余能量较多的节点作为群首,解决了能量较少节点当选为群首和群首负担载过重的问题。仿真结果表明,采用改进后的算法可以有效减少网络能量的消耗,延长网络生存时间。 相似文献
12.
通过分析无线传感器网络的电路模型和能量消耗情况,结合LEACH算法,提出一种基于最小能耗的无线传感器网络路由算法。网络运行时首先将其划分为若干个子区域,再进行簇首节点的选取,这样取代了传统LEACH算法对整片网络随机选取簇首节点的做法,使得簇首节点分布更加均匀。同时,在选取簇首节点之前对每个节点的剩余能量进行判断,低于阈值的采取休眠处理,这样保证了簇首节点选取的有效性。以上两点措施使区域内节点负载分配更加合理,有效地提升了整个网络的生存时间。 相似文献
13.
Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle. 相似文献
14.
为了提高无线传感器网络的生存时间,针对当前LEACH算法存在的能量不均衡难题,提出一种能量均衡的无线传感器网络节点路由算法。首先将监测区域看成以基站为中心的扇形区域,并将扇形区域分割成不同大小的弧形方块,每个弧形方块中的节点组成一个簇,根据节点剩余能量产生簇头,然后采用单跳和多跳相结合的簇间通信机制,最后采用仿真实验测试算法的性能。结果表明,本文算法有效提高了网络的能量利用率,能够实现节点之间的能耗均衡,使无线传感器的网络生存时间得到延长,适用于对网络生命周期要求较高的应用。 相似文献
15.
Cluster-based intrusion detection systems, where cluster heads (CHs) detect misbehavior of their member nodes, have been proposed in mobile ad-hoc networks (MANETs) in order to protect the network and save the energy. However, long-term survival of all nodes is more important so as not to partition the network. The extension of the network lifetime in the cluster-based IDS depends on which nodes are selected as CHs, which consume much more energy than cluster members due to monitoring them and detecting intrusions. In this paper, we propose a Distributed Energy Efficient Cluster Formation (DEECF) scheme, which exploits the expected residual energy of mobile nodes to select CHs and starts the cluster formation from leaf nodes to reduce the number of clusters. The scheme consists of the cluster construction algorithm and the cluster maintenance algorithm, both of which can be performed at each node in a distributed way without any global knowledge. We prove the correctness of the algorithms, and show that the DEECF scheme is more energy efficient than other clustering schemes by extensive simulation. 相似文献
16.
Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA. 相似文献
17.
18.
无线传感网络(Wireless Sensor Network,WSN)作为一种资源受限的网络,网络中节点的能耗直接影响了网络的性能。因此,均衡网络中的能耗,延长网络的生命周期,成为设计WSN路由算法的重要目标。于是,在LEACH-C协议的基础上提出了一种移动汇聚路由算法。分簇阶段由Sink节点计算最优簇首个数,通过K-means聚类将网络中的节点划分至不同的集群,选择通信成本最低的节点作为各集群的簇首。稳定传输阶段通过移动Sink进行数据采集,针对不同的延迟分别规划Sink节点的移动轨迹。MATLAB仿真结果表明,与LEACH和LEAHC-C算法相比簇首的分布更合理,结合Sink节点的移动策略能有效均衡网络能耗,延长网络的寿命。 相似文献
19.
传感器网络的路由协议越来越引起人们的关注。针对节点高密度部署并且存在部分移动节点的网络环境,当前常用的各类路由算法都不能有效地降低能耗。论文提出了改进型GAF算法,将网络划分成若干个单元格,不同移动速度的节点以不同的权重竞选簇头,竞选失败者将进入休眠状态,以此来降低网络总能耗。通过分析和仿真,验证了该算法在节能方面的优势。 相似文献
20.
Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes. 相似文献