.png){kind=icon}
返回
An Effective Algorithm to Find a Cost Minimizing Gateway Deployment for Node-Replaceable Wireless Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.3390/s21051732.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an efficient way to find a gateway deployment for a given sensor network topology. We assume that the expired sensors and gateways can be replaced and the locations of the gateways are chosen among the given sensor nodes. The objective is to find a gateway deployment that minimizes the cost per unit time, which consists of the maintenance and installation costs. The proposed algorithm creates a cost reference and uses it to find the optimal deployment via a divide and conquer algorithm. Comparing all cases is the most reliable way to find the optimal gateway deployment, but this is practically impossible to calculate, since its computation time increases exponentially as the number of nodes increases. The method we propose increases linearly, and so is suitable for large scale networks. Additionally, compared to stochastic algorithms such as the genetic algorithm, this methodology has advantages in computational speed and accuracy for a large number of nodes. We also verify our methodology through several numerical experiments.
Keyword:
wireless sensor networks (WSNs)
internet of things (IoT)
optimal gateway deployment
divide and conquer
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
.png){kind=icon}
分享收藏Thermal stability and degradation mechanisms of poly(acrylic acid) and its salts: Part 2—Sodium and potassium salts聚 (丙烯酸) 及其盐的热稳定性和降解机理: 第2部分-钠盐和钾盐
PREAI
分享收藏分享收藏分享收藏
查看更多内容