共查询到20条相似文献,搜索用时 218 毫秒
1.
基于LEACH的改进型无线传感器网络路由算法研究 总被引:1,自引:1,他引:0
杜风雷 《微电子学与计算机》2010,27(8)
针对经典分簇路由算法LEACH在选取簇头时没有充分考虑节点剩余能量的问题,在LEACH协议的基础上,改进了簇首选择、最优簇首数和簇形成过程,提出一个自适应分布式算法,即ADCP-LEACH算法,该算法可以应用干周期性的采集数据,根据每个节点竞选簇头时的阈值不同,让剩余能量大的节点当选簇头的概率更大.NS2仿真实验表明,改进的协议有效延长了网络的存活时间,性能优于LEACH协议. 相似文献
2.
3.
在无线传感器网络能量异构环境下对低功耗自适应的分簇算法(Low Energy Adaptive Clustering Hierarchy,LEACH)与稳定选举协议(Stable Election Protocol,SEP)算法进行了分析,针对其存在的不足提出了一种改进的方案。在簇头选举过程中提高了剩余能量高、距离基站较近节点当选为簇头的概率,同时对当选为簇头的节点设定能量阈值,避免能量过低的节点当选为簇头。仿真结果表明,改进后的算法较好地均衡了网络中节点的能量消耗,有效地提高了网络中能量的利用效率,并且极大地延长了网络正常工作的生命周期。 相似文献
4.
5.
6.
针对无人机群分簇网络中由于节点高移动性和能量受限导致簇结构不稳定和簇首频繁更新的问题,提出一种基于稳定性改进的加权簇首选举算法(Stability Improved Weighted Cluster Head Selection Algorithm,SI-WCSA)。首先,根据分配的任务确定簇的规模;其次,综合考量节点的移动性、能量、节点度和距离4种因素加权选举簇首,对移动性度量指标进行改进并提出3种能量消耗速率;最后,采用基于层次分析法和熵值法的组合赋权法计算贴合场景的指标权重。仿真结果表明,该算法能选取最优簇头,优化评估指标以减少节点移动性对网络生存时间的影响,降低簇首更换次数,均衡簇内节点能量,提升网络的鲁棒性,并且组合赋权法选取的权重系数将无人机网络的生存时间增加了6%。 相似文献
7.
无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期. 相似文献
8.
9.
通过分析无线传感器网络的电路模型和能量消耗情况,结合LEACH算法,提出一种基于最小能耗的无线传感器网络路由算法。网络运行时首先将其划分为若干个子区域,再进行簇首节点的选取,这样取代了传统LEACH算法对整片网络随机选取簇首节点的做法,使得簇首节点分布更加均匀。同时,在选取簇首节点之前对每个节点的剩余能量进行判断,低于阈值的采取休眠处理,这样保证了簇首节点选取的有效性。以上两点措施使区域内节点负载分配更加合理,有效地提升了整个网络的生存时间。 相似文献
10.
11.
Jian-hua Huang Zi-ming Zhao Yu-bo Yuan Ya-dong Hong 《Wireless Personal Communications》2017,95(3):2127-2142
One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols. 相似文献
12.
13.
Non‐uniform energy consumption during operation of a cluster‐based routing protocol for large‐scale wireless sensor networks (WSN) is major area of concern. Unbalanced energy consumption in the wireless network results in early node death and reduces the network lifetime. This is because nodes near the sink are overloaded in terms of data traffic compared with the far away nodes resulting in node deaths. In this work, a novel residual energy–based distributed clustering and routing (REDCR) protocol has been proposed, which allows multi‐hop communication based on cuckoo‐search (CS) algorithm and low‐energy adaptive‐clustering–hierarchy (LEACH) protocol. LEACH protocol allows choice of possible cluster heads by rotation at every round of data transmission by a newly developed objective function based on residual energy of the nodes. The information about the location and energy of the nodes is forwarded to the sink node where CS algorithm is implemented to choose optimal number of cluster heads and their positions in the network. This approach helps in uniform distribution of the cluster heads throughout the network and enhances the network stability. Several case studies have been performed by varying the position of the base stations and by changing the number of nodes in the area of application. The proposed REDCR protocol shows significant improvement by an average of 15% for network throughput, 25% for network scalability, 30% for network stability, 33% for residual energy conservation, and 60% for network lifetime proving this approach to be more acceptable one in near future. 相似文献
14.
将无线传感器网络划分成簇会有效利用系统资源,近来提出的基于异构分簇模型的无线传感器网络,是指网络中存在多种不同能力的节点,能力强的节点自动成为簇头,这种网络避免了复杂的簇头选举过程并有效降低了普通节点的硬件复杂性和成本。但是,固定簇头的方法会削弱系统的负载均衡以及健壮性。为了解决这个问题,提出了一种基于自适应退避策略的簇头调度方案,该方案通过适当增加冗余度实现传感节点的k覆盖,增强了网络的健壮性。同时,依赖于地理信息和剩余电池能量信息,簇头节点通过自主周期性睡眠来保证系统负载的均衡分配,延长网络生存期。 相似文献
15.
16.
为平衡无线传感器网络中的簇头负载并进一步降低多跳传输能耗,文中提出了一种改进的基于时间竞争成簇的路由算法。该算法通过限制近基站节点成簇入簇,以防止近基站节点成簇入簇的节能收益无法补偿成簇入簇能耗;利用基站广播公共信息和基于时间机制成簇,以减少节点基本信息交换能耗;通过候选簇头中继来平衡簇头负载。候选簇头的评价函数综合考虑了剩余能量和最优跳数的理想路径,以期在保持中继负载平衡的基础上尽量降低多跳能耗。仿真结果显示,该算法较LEACH和DEBUC算法延长了以30%节点死亡为网络失效的网络生存周期,表明该算法在降低节点能耗和平衡负载方面是有效的。 相似文献
17.
In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime. 相似文献
18.
簇路由是节省无线传感网络(WSNs)能量的有效策略。簇头的选择是簇路由的关键。然而,传统的簇路由是采用固定周期更新簇头,并没有考虑到簇头的剩余能量。为此,针对稳定簇头选择协议(SEP)进行改进,提出基于多级能量阈值的簇头更新策略,记为I-SEP。I-SEP路由考虑三类节点,这三类节点的初始能量不同。并针对三类节点的能量以及比例,计算它们成为簇头的概率和阈值。同时,每轮计算簇头的剩余能量,只有簇头剩余能量小于预定的阈值,才进行簇头更新,否则原来的簇头仍作为簇头,进而减少了更换簇头所带来的能耗。仿真结果表明,相比于SEP,提出的I-SEP路由有效地降低了能耗,延长了网络寿命。 相似文献
19.
基于移动Agent和WSN的突发事件场景数据收集算法研究 总被引:1,自引:0,他引:1
该文针对无线传感器网络应用于突发事件监测场景的能量消耗和网络延迟问题,提出了基于移动Agent的无线传感器网络簇式数据收集算法.动态成簇过程基于事件严重程度,并由其决定簇的生命周期和覆盖范围.Sink和簇头之间形成以Sink节点为簇头的虚拟簇.移动Agent迁移路径规划过程中下一跳节点的选取基于节点剩余能量、路径损耗及受刺激强度.移动Agent通过节点遍历的方式完成对所有簇内成员节点信息的收集.仿真结果表明,相对于C/S数据收集模型,基于移动Agent的模型具有更好的节能效果,并能一定程度地减少网络延迟,尤其适用于大规模无线传感器网络应用. 相似文献
20.
无线传感器网络中LEACH算法的改进研究 总被引:3,自引:2,他引:1
针对经典分簇路由算法LEACH在选取簇头时的不足,文中从节点区域能量平衡出发,尽量将剩余能量较高且所在位置覆盖密度较大的节点充当簇头,使整个区域"均匀"消耗能量,并基于此思想提出了一种对经典分簇路由算法LEACH的改进算法.实验仿真结果表明,改进算法能有效平衡区域能量消耗,延长网络的生命周期. 相似文献