返回
A New Learning Automata-Based Algorithm to the Priority-Based Target Coverage Problem in Directional Sensor Networks
DOI:10.1007/978-3-319-16292-8_16.png)
摘要
En 中文
One of the main operations in directional sensor networks (DSNs) is the surveillance of a set of events (targets) that occur in a given area and, at the same time, maximization of the network lifetime; this is due to limitation in sensing angle and battery power of the directional sensors. This problem gets more complicated by the possibility that targets may have different coverage requirements. In the present study, this problem is referred to as priority-based target coverage (PTC). As sensors are often densely deployed, organizing the sensors into several cover sets and then activating these cover sets successively is a promising solution to this problem. In this paper, we propose a learning automata-based algorithm to organize the directional sensors into several cover sets in such a way that each cover set could satisfy coverage requirements of all the targets. Several experiments are conducted to evaluate the performance of the proposed algorithm. The results demonstrated that the algorithms were able to contribute to solving the problem.
Keyword:
Directional sensor networks
Target coverage problem
Cover set formation
Learning automata
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
M
IF:
0
论文数:
1
被引数:
0
机构
引用论文
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

