您现在的位置: 首页> 研究主题> LEACH

LEACH

LEACH的相关文献在2000年到2022年内共计399篇,主要集中在自动化技术、计算机技术、无线电电子学、电信技术、肿瘤学 等领域,其中期刊论文350篇、会议论文7篇、专利文献42篇;相关期刊174种,包括电子科技、传感技术学报、传感器与微系统等; 相关会议6种,包括第三届国际信息技术与管理科学学术研讨会、2010全国开放式分布与并行计算学术年会、第十四届全国青年通信学术会议等;LEACH的相关文献由892位作者贡献,包括周林、王平、徐世武等。

LEACH—发文量

期刊论文>

论文:350 占比:87.72%

会议论文>

论文:7 占比:1.75%

专利文献>

论文:42 占比:10.53%

总计:399篇

LEACH—发文趋势图

LEACH

-研究学者

  • 周林
  • 王平
  • 徐世武
  • 李腊元
  • 胡黄水
  • 陈桂芬
  • 张鸿雁
  • 徐卫克
  • 李军伟
  • 李遵光
  • 期刊论文
  • 会议论文
  • 专利文献

搜索

排序:

年份

    • Kabukila Kilotwa Michel; Hairong Yan; Njiraini Immaculate; Biaye Yaye
    • 摘要: In recent years, the demand for Wireless Sensor Network (WSN) in smart farming has had a tremendous increase in demand for its efficiency. Wireless sensor networks have very many nodes, and it is of no use when the battery dies. This is why there are several routing protocols being take into consideration to cub this problem. In this paper, in order to increase the heterogeneity and energy levels of the network, the M-LEACH protocol is proposed. The key aim of the Leach protocol is to prolong the existence of wireless sensor network by lowering the energy consumption needed for Cluster Head creation and maintenance, the proposed algorithm instructs a node to use high power amplification as it acts as the Cluster heads, and low power amplification when it becomes a Cluster Member, in the next stage. Finally, for better effectiveness, M-LEACH employs hard and soft threshold systems. Since it eliminates collisions and reduces the packet drop ratio for other signals, the M-LEACH protocol proposed works better than the Leach protocol.
    • 李猛坤; 郭小民; 张月; 贾军营
    • 摘要: 针对无线传感器网络(WSN)中多跳路由转发带来的数据冗余传输、簇头网络能耗较大及网络生存周期较短的问题,提出一种全局动态优化的消冗降耗多跳路由发现算法.通过优化路径权重参数,改进多跳路由选择策略.在簇头分配接收数据时隙问题上引入双射频分工方式,减小接收簇头节点信息及向其他节点转发信息带来的数据冗余传输,在减小整个网络耗能的同时尽量避免数据冲突.通过仿真实验将本文算法与现有算法LEACH和EAMMH进行比较,结果表明本文算法的整体系统能耗和网络负载均衡优于另外2种算法.
    • 王越群; 高小虎; 曹春梅
    • 摘要: 针对LEACH算法蔟首选择机制中簇首选举的不确定性,本文从结点剩余电量、结点的邻居结点个数、结点相对位置三个方面对LEACH算法的簇首选举中的阈值计算进行优化,从而选出剩余电量较高、邻居结点数量多且位于区域中心附近的结点为蔟首结点,避免蔟首因电量耗尽失效而造成的信息传递中断。实验仿真结果表明:改进后的算法能有效减缓结点的死亡速度,保证数据的传输效率,对能耗的控制性能优于LEACH算法、LEAHC-C算法和LEACH-TTLEB算法。
    • Manar M.Aldaseen; Khaled M.Matrouk; Laiali H.Almazaydeh; Khaled M.Elleithy
    • 摘要: The Wireless Sensor Networks(WSNs)are characterized by their widespread deployment due to low cost,but the WSNs are vulnerable to various types of attacks.To defend against the attacks,an effective security solution is required.However,the limits of these networks’battery-based energy to the sensor are the most critical impediments to selecting cryptographic techniques.Consequently,finding a suitable algorithm that achieves the least energy consumption in data encryption and decryption and providing a highly protected system for data remains the fundamental problem.In this research,the main objective is to obtain data security during transmission by proposing a robust and low-power encryption algorithm,in addition,to examining security algorithms such as ECC and MD5 based on previous studies.In this research,the Energy Saving and Securing Data algorithm(ESSD)algorithm is introduced,which provides the Message Digest 5(MD5)computation simplicity by modifying the Elliptic Curve Cryptography(ECC)under the primary condition of power consumption.These three algorithms,ECC,MD5,and ESSD,are applied to Low Energy Adaptive Clustering Hierarchy(LEACH)and Threshold-sensitive Energy Efficient Sensor Network Protocol(TEEN)hierarchical routing algorithms which are considered the most widely used in WSNs.The results of security methods under the LEACH protocol show that all nodes are dead at 456,496,and 496,respectively,to ECC,MD5,and ESSD.The results of security methods under the TEEN protocol show that the test ends at 3743,4815,and 4889,respectively,to ECC,MD5,and ESSD.Based on these results,the ESSD outperforms better in terms of increased security and less power consumption.In addition,it is advantageous when applied to TEEN protocol.
    • 齐世霞; 薛小伟
    • 摘要: 本文针对传统的LEACH协议在簇头节点的选择及拓扑结构上的缺点,提出了一种改进的LEACH算法的优化设计思路,采用基于成本函数的方法进行簇头的选择和路由的建立,得到簇头节点到汇聚节点的最小成本路径,在感知范围和生命周期之间有一个较好的平衡。
    • Hajer Faris; Musaria Karim Mahmood; Osama Ahmad Alomari; Ashraf Elnagar
    • 摘要: Wireless sensor networks(WSNs)are characterized by their ability to monitor physical or chemical phenomena in a static or dynamic location by collecting data,and transmit it in a collaborative manner to one or more processing centers wirelessly using a routing protocol.Energy dissipation is one of the most challenging issues due to the limited power supply at the sensor node.All routing protocols are large consumers of energy,as they represent the main source of energy cost through data exchange operation.Clusterbased hierarchical routing algorithms are known for their good performance in energy conservation during active data exchange in WSNs.The most common of this type of protocol is the Low-Energy Adaptive Clustering Hierarchy(LEACH),which suffers from the problem of the pseudo-random selection of cluster head resulting in large power dissipation.This critical issue can be addressed by using an optimization algorithm to improve the LEACH cluster heads selection process,thus increasing the network lifespan.This paper proposes the LEACH-CHIO,a centralized cluster-based energyaware protocol based on the Coronavirus Herd Immunity Optimizer(CHIO)algorithm.CHIO is a newly emerging human-based optimization algorithm that is expected to achieve significant improvement in the LEACH cluster heads selection process.LEACH-CHIO is implemented and its performance is verified by simulating different wireless sensor network scenarios,which consist of a variable number of nodes ranging from 20 to 100.To evaluate the algorithm performances,three evaluation indicators have been examined,namely,power consumption,number of live nodes,and number of incoming packets.The simulation results demonstrated the superiority of the proposed protocol over basic LEACH protocol for the three indicators.
    • 胡光远; 李昊
    • 摘要: 本文针对WSN(Wireless Sensor Network,无线传感网)中传统LEACH协议分簇算法存在簇头随机选举、分簇不均匀的缺陷提出一种基于节点分布密度思想改进的DB-K-means算法用于LEACH协议的簇头选举与建簇过程.算法首先根据节点的分布密度确定最优分簇数目,再根据节点分布密度将节点分为核心节点、边缘节点、孤立节点.从核心节点中根据加权度量准则选择簇头,接着利用K-means算法完成其余节点的分簇.仿真结果表明,DB-K-means分簇算法能够有效克服K-means算法的缺陷,提升了分簇的准确性,有效延长了网络生存时间.
    • 刘涛; 庞博
    • 摘要: 针对低功耗自适应集簇分层型协议(low energy adaptive clustering hierarchy,LEACH)簇头选取不佳、网络寿命过短问题,提出一种基于分区的LEACH改进算法.该算法根据节点剩余能量、邻居节点数及距基站距离对簇头选举产生的影响,对簇头选举函数进行优化;对监测区域进行分区,不同分区采取不同的数据传输方式,减少基站附近簇头节点转发信息的负载量,有效避免基站附近"能量空洞"现象的发生.实验结果表明,相比于LEACHLEACH-EDP(LEACH energydistance-parti-tion)算法,本文改进算法第一死亡节点出现轮次分别推迟了23.32%、18.44%,网络寿命分别延长了32.27%、21.49%.
    • Mohammed Kaddi; Abdallah Banana; Mohammed Omari
    • 摘要: Wireless sensor network (WSN) has been widely used due to its vastrange of applications. The energy problem is one of the important problems influencingthe complete application. Sensor nodes use very small batteries as a powersource and replacing them is not an easy task. With this restriction, the sensornodes must conserve their energy and extend the network lifetime as long as possible.Also, these limits motivate much of the research to suggest solutions in alllayers of the protocol stack to save energy. So, energy management efficiencybecomes a key requirement in WSN design. The efficiency of these networks ishighly dependent on routing protocols directly affecting the network lifetime.Clustering is one of the most popular techniques preferred in routing operations.In this work we propose a novel energy-efficient protocol for WSN based on a batalgorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithmfor WSN) to prolong the network lifetime. We use an objective function thatgenerates an optimal number of sensor clusters with cluster heads (CH) to minimizeenergy consumption. The performance of the proposed approach is comparedwith Low-Energy Adaptive Clustering Hierarchy (LEACH) and EnergyEfficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interestingin terms of energy-saving and prolongation of the network lifetime.
    • SeaYoung Park; Jong-Yong Lee; Daesung Lee
    • 摘要: Replacing or recharging batteries in the sensor nodes of a wireless sensor network(WSN)is a significant challenge.Therefore,efficient power utilization by sensors is a critical requirement,and it is closely related to the life span of the network.Once a sensor node consumes all its energy,it will no longer function properly.Therefore,various protocols have been proposed to minimize the energy consumption of sensors and thus prolong the network operation.Recently,clustering algorithms combined with artificial intelligence have been proposed for this purpose.In particular,various protocols employ the K-means clustering algorithm,which is a machine learning method.The number of clustering configurations required by the K-means clustering algorithm is greater than that required by the hierarchical algorithm.Further,the selection of the cluster heads considers only the residual energy of the nodes without accounting for the transmission distance to the base station.In terms of energy consumption,the residual energy of each node,the transmission distance,the cluster head location,and the central relative position within the cluster should be considered simultaneously.In this paper,we propose the KOCED(K-means with Optimal clustering for WSN considering Centrality,Energy,and Distance)protocol,which considers the residual energy of nodes as well as the distances to the central point of the cluster and the base station.A performance comparison shows that the KOCED protocol outperforms the LEACH protocol by 259%(223 rounds)for first node dead(FND)and 164%(280 rounds)with 80%alive nodes.
  • 查看更多

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号