返回
Learning Automata-Based Algorithms for Solving the Target Coverage Problem in Directional Sensor Networks
DOI:10.1007/s11277-013-1279-5.png)
摘要
En 中文
Recently, directional sensor networks have received a great deal of attention due to their wide range of applications in different fields. A unique characteristic of directional sensors is their limitation in both sensing angle and battery power, which highlights the significance of covering all the targets and, at the same time, extending the network lifetime. It is known as the target coverage problem that has been proved as an NP-complete problem. In this paper, we propose four learning automata-based algorithms to solve this problem. Additionally, several pruning rules are designed to improve the performance of these algorithms. To evaluate the performance of the proposed algorithms, several experiments were carried out. The theoretical maximum was used as a baseline to which the results of all the proposed algorithms are compared. The obtained results showed that the proposed algorithms could solve efficiently the target coverage problem.
Keyword:
Directional sensor networks
Cover set formation
Learning automata
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.2
论文数:
742
被引数:
1.2W
机构
引用论文
A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks定向传感器网络中基于遗传算法的目标覆盖调度方案
SENSORS
IF3.5
A learning automata-based algorithm for solving coverage problem in directional sensor networks
COMPUTING
IF2.8
Accumulation of cyclic ADP‐ribose measured by a specific radioimmunoassay in differentiated human leukemic HL‐60 cells with all‐trans‐retinoic acid
FEBS Letters
IF0

