.png){kind=icon}
.png){kind=icon}
Return
A New Learning Automata-Based Algorithm to the Priority-Based Target Coverage Problem in Directional Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-319-16292-8_16.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Directional sensor networks
Target coverage problem
Cover set formation
Learning automata
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
M
IF:
0
Papers:
1
Citations:
0