.png){kind=icon}
返回
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime
.png){kind=icon}
OA
AI
DOI：10.3390/s22051804.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Finding dominating sets in graphs is very important in the context of numerous real-world applications, especially in the area of wireless sensor networks. This is because network lifetime in wireless sensor networks can be prolonged by assigning sensors to disjoint dominating node sets. The nodes of these sets are then used by a sleep-wake cycling mechanism in a sequential way; that is, at any moment in time, only the nodes from exactly one of these sets are switched on while the others are switched off. This paper presents a population-based iterated greedy algorithm for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Our approach is compared to the ILP solver, CPLEX, which is an existing local search technique, and to our earlier greedy algorithm. This is performed through its application to 640 random graphs from the literature and to 300 newly generated random geometric graphs. The results show that our algorithm significantly outperforms the competitors.
Keyword:
population-based iterated greedy
disjoint dominating sets
lifetime maximization
wireless sensor networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks无线传感器网络中网络寿命最大化技术综述
PREAI
分享收藏Maximization of wireless sensor network lifetime using solar energy harvesting for smart agriculture monitoring.png)
AD HOC NETWORKS
AD HOC NETWORKSIF4.8
PREAI
分享收藏
查看更多内容