共查询到19条相似文献，搜索用时 203 毫秒
1.
有限的能量资源是无线传感器网络（WSNs）广泛应用的主要限制之一。为了最大化整个网络的生存时间,需要优化无线传感器网络中节点的能量消耗。协议使用的无线传感器网络模型包含两种节点：普通节点和能量较高的高级节点。算法中综合考虑了节点当前剩余能量、网络中平均能量、簇头到基站的距离和节点类型等因素,设计了一种适合于异构无线传感器网络路由协议（HCEEC）。在该协议中,基站在对应的区域中选择能量更大、更加靠近基站的节点作为簇头来搜集本区域内的信息,簇头节点对本簇内的信息进行融合之后发送至基站节点。实验表明,该算法能够更好地综合网络中能量的负载、提高网络吞吐量和延长网络生存时间。 相似文献
2.
3.
为了延长传感器网络生存时间,多跳路由协议一直是无线传感器领域的研究热点。其中多跳分簇的路由协议（MHLEACH） 不仅能扩展通信范围,还可以均衡分配节点能耗,从而有效提高了能量利用率。但该方法存在的问题是若选中的簇首距离基站太远,则会耗费较多能量。同时,簇群链路分布的不均匀也可能使一些靠近基站的簇首更频繁地转发数据。为解决该问题,提出一种改进算法RSSI-Mean-Filter-MHLEACH（简称RMF-MHLEACH）,该算法能对接收路由消息时获得的邻居节点信号强度与邻居表内节点剩余能量信息进行比较分析,最后找出最优的上层转发节点,从而使各节点在保证通信质量的同时,也能合理分担簇首的能量消耗。 相似文献
4.
针对无线传感器网络路由协议LEACH(Low Energy Adaptive Clustering Hierarchy)存在能耗不均衡的问题,提出一种改进的路由协议LEACH EM(LEACH Energy and Multi hop routing)。该算法修改了选取簇首的阈值,使节点能根据自身剩余能量动态调整其轮转周期,同时在簇间引入多跳路由机制,使距离基站较远的簇首能耗得到均衡,由此平衡整个网络负载。仿真实验表明,LEACH EM算法在能耗均衡上得到了改善,在网络生命周期中,LEACH EM算法比LEACH延长了38.8%。 相似文献
5.
基于对LEACH算法和PEGASIS算法的研究,提出助理簇头改进ASCH算法.该算法能够在无线传感器网络中,根据簇头节点所处的地理位置、剩余能量及簇内成员节点数目,动态决定是否需要在簇内产生助理簇头,并在需要产生助理簇头的簇内选择合适的节点来减少簇头通信的能耗.在PEGASIS中加入助理簇头后,改进后的助理簇头改进算法的性能指标与已有算法相比均有提高,在均衡及节能、延长网络生命周期方面起到了积极的作用. 相似文献
6.
邓芳 《湖北第二师范学院学报》2010,(2):62-65
无线传感器网络拓扑控制算法对于延长网络的生存时间、减小通信干扰、提高路由协议和MAC协议的效率等具有重要的意义。根据无线传感器网络的分簇机制,有效地利用成簇算法均衡网络节点负载,降低能耗,从簇首的选择、簇组织和簇的路由三个方面系统地分析当前典型的成簇算法,对算法的特点和适用情况进行比较分析,并指出目前算法存在问题和改进措施。 相似文献
7.
无线传感器网络拓扑控制算法对于延长网络的生存时间、减小通信干扰、提高路由协议和MAC协议的效率等具有重要的意义。根据无线传感器网络的分簇机制,有效地利用成簇算法均衡网络节点负载,降低能耗,从簇首的选择、簇组织和簇的路由三个方面系统地分析当前典型的成簇算法,对算法的特点和适用情况进行比较分析,并指出目前算法存在问题和改进措施。 相似文献
8.
本文研究了一种基于节点位置信息的改进型LEACH无线传感器网络分簇算法,通过决策支持机制,利用传感器节点的位置信息进行分簇.该算法有效地减少了路由消耗,同时平衡节点间的能量使用,控制节点能耗,延长网络生存时间. 相似文献
9.
基于形式化建模的思想,分别建立簇首节点和簇中成员节点的有限状态机模型,描述LEACH协议的路由行为及算法思想,分析影响LEACH协议性能的可能性因素,利用NS2对LEACH协议进行仿真,仿真结果表明,改进后的LEACH协议在节省了整个网络的能量消耗并很好的均衡了网络内节点的能耗,延长了节点的生存时间,改善了网络的性能. 相似文献
10.
根据无线传感网络能量受限的特点,提出一种低能耗路由算法SOC-IACO,算法由自组织聚类算法SOC和改进蚁群算法WAC组成.先通过SOC将节点分簇,选取簇头构造簇头数据链,再通过WAC构造簇内节点数据链.簇内数据沿节点数据链汇聚至簇头、簇头数据沿簇头数据链汇聚至总簇头,由总簇头发送数据至基站.实验表明,由于聚类过程中考虑了节点分布和簇负载均衡并采用双层链路由,SOC-IACO算法能大幅降低节点能耗提高网络寿命. 相似文献
11.
根据LEACH协议的原理,研究了协议中簇形成过程簇头节点和非簇头节点间由于发送和接收控制信息带来的能量消耗,通过仿真表明,簇形成过程中的能量消耗是影响网络寿命和能量消耗不可忽略的因素,应当成为节能研究的重点之一. 相似文献
12.
数据汇聚是降低传感器网络传输能耗的重要手段.分簇传感网数据汇聚通常包括簇内汇聚及传递汇聚结果到基站两个阶段,现有方案大多关注第二阶段数据汇聚结果传递到基站的效率.现提出一种基于位置信息的分簇传感网数据汇聚方案,通过利用位置信息选择代理点,仅与代理点有不同测量值的节点进行数据发送,有效减少了第一阶段中的数据传输.理论分析与模拟试验表明,方案簇内消息发送数优于相关方案,减少了通信开销,延长了网络生命期. 相似文献
13.
周伟 《上海大学学报(英文版)》2011,15(2):150-153
In this paper, an energy efficient clustering algorithm based on neighbors (EECABN) for wireless sensor networks is proposed.
In the algorithm, an optimized weight of nodes is introduced to determine the priority of clustering procedure. As improvement,
the weight is a measurement of energy and degree as usual, and even associates with distance from neighbors, distance to the
sink node, and other factors. To prevent the low energy nodes being exhausted with energy, the strong nodes should have more
opportunities to act as cluster heads during the clustering procedure. The simulation results show that the algorithm can
effectively prolong whole the network lifetime. Especially at the early stage that some nodes in the network begin to die,
the process can be postponed by using the algorithm. 相似文献
14.
1Introduction Thispaperfocusesondevelopingalogicalhierarchi calcluster(LHC)foreachblockofmultimediaobjects asthedecentralizedarchitectureofthedistributed multimediaondemand(DMoD)server.Becausethe aggregatedbandwidthrequirementofthegeographical lydistributedusersisincreasingbeyondthecapacityof thenetworkbackbone,theDMoDschemeisproposed todistributetheloadoftheinteractiveMoDserviceto thenodeslocatedatthedifferentgeographical admini strativeregions.ThenetworktopologyG(V,E)and theresourceman… 相似文献
15.
提出了基于mesh结构的低功率消耗率组播路由(LPDMR)协议算法. 采用计分机制选择组播群首,而群首之间以最低功率消耗率来选择路经,并以按需方式组播,群内使用表驱动路由协议.结果表明提出的LPDMR路由算法可以大大提高包到达率和网络吞吐量,特别是提高了网络生命周期. 相似文献
16.
Network coding is a technique to increase the amount of information flow in a network by making the key observation that information
flow is fundamentally different from commodity flow. Whereas, under traditional methods of operation of data networks, intermediate
nodes are restricted to simply forwarding their incoming message symbols downstream, network coding achieves vast performance
gains by permitting intermediate nodes to carry out algebraic operations on the incoming data. In this article we present
a tutorial introduction to network coding as well as an application to the efficient operation of distributed data-storage
networks. 相似文献
17.
Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions including computation capability and battery capacity. Topology control is an important issue for achieving a balanced placement of sensor nodes. The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops. The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks. In this paper we propose an optimal algorithm with cluster balance taken into consideration, and compare it with three well known and widely used approaches, i.e., LEACH, MEER, and VAP-E, in performance evaluation. Experimental results show that the proposed approach increases the overall network lifetime, indicating that the amount of energy required for communication to the base station will be reduced for locating an optimal cluster. 相似文献
18.
Xin-yu Wang Xiao-hu Yang Jian-ling Sun Wei Li Wei Shi Shan-ping Li 《浙江大学学报(A卷英文版)》2008,9(10):1318-1325
This paper proposes a connected dominating set （CDS） based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks （MANETs）, which ensures the connectivity and efficiency of the CDS. Compared with Wu＇s algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity. 相似文献
19.
JIANG Jun-jie TANG Fei-long PAN Feng WANG Wei-nong 《浙江大学学报(A卷英文版)》2006,7(6):945-951
INTRODUCTION Peer-to-peer computing has become a populardistributed computing paradigm. Efficient resourcelookup is essential for such systems. As we know, most of the deployed peer-to-peersystems are unstructured. Napster is based on a cen-tral directory and was in popular use during early daysSoon after, Gnutella and KaZaA were deployedwidely. However, all these popular unstructuredpeer-to-peer systems suffer from unscalability. Fortunately, there are new kinds of peer-to-peernetwor… 相似文献