.png){kind=icon}
返回
Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2014.10.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Wireless sensor networks are composed of a large number of disposable wireless sensors that collect information about their surrounding environment and transmit them to the end user. Because these sensors do not have rechargeable batteries, increasing their lifetime is important and various methods have been proposed to increase the lifetime of the sensor nodes in a network. Most of these methods are based on clustering or routing algorithms. The low energy adaptive clustering hierarchy (LEACH) algorithm is an efficient clustering algorithm where nodes within a cluster send their data to a local cluster head. Some researchers recommend a mobile sink (MS) as a way to reduce energy consumption and a rendezvous node (RN) to act as a store point for the MS. The present study proposes an algorithm that combines the use of the LEACH clustering algorithm, MS and rendezvous points (RP). Simulation results show that this method is more efficient than LEACH in terms of energy consumption, particularly in large regions. (C) 2014 Elsevier GmbH. All rights reserved.
Keyword:
Wireless sensor network (WSN)
Clustering
Mobile sink (MS)
Cluster head (CH)
Rendezvous node (RN)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
A
IF:
3.2
论文数:
5.8K
被引数:
8.3K
机构
引用论文
.png){kind=icon}
ESWC: Efficient Scheduling for the Mobile Sink in Wireless Sensor Networks with Delay Constraint
PREAI
分享收藏A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile Sinks
PREAI
分享收藏
没有更多内容
没有更多内容