فهرس المقالات target coverage

• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  1 - Improving Energy-Efficient Target Coverage in Visual Sensor Networks
  Behrooz Shahrokhzadeh Mehdi Dehghan MohammadReza Shahrokhzadeh
  Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) prob أکثر

  Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) algorithm that divides the sensors’ Field-of-View (FoV) to a number of cover sets and then applies a sleep-wake schedule for cover sets. We also identify the best possible FoV of sensors according to the targets’ location using rotating cameras, to reduce the solution space and approaching to a near-optimal solution. Our proposed energy and neighbor generating functions of the SA result in a balanced distribution of energy consumption as well as escaping from local optima. We conduct some simulation experiments to evaluate the performance of our proposed method by comparing with some well-known solutions in the literature. تفاصيل المقالة
• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  2 - A Genetic-based Algorithm to Solve Priority-based ‎Target Coverage Problem in Directional Sensor ‎Networks
  Leila Ajam Ali Nodehi Hosein Mohamadi
  The Directional Sensor Networks (DSNs) have recently drawn considerable attention with respect to their extensive applications in various situations. In this regard, covering a set of targets in a specific region while maximizing network lifetime is considered as a majo أکثر

  The Directional Sensor Networks (DSNs) have recently drawn considerable attention with respect to their extensive applications in various situations. In this regard, covering a set of targets in a specific region while maximizing network lifetime is considered as a major problem related to the DSN, which is resulted from limitation in sensing angle and battery power of directional sensors. The problem gets more challenging when the targets have different coverage quality requirements. In the present study, this problem is referred to as Priority-based Target Coverage (PTC) that has been proved to be an NP-complete problem. In this regard, a genetic-based algorithm along with a repair operator is developed, which is able to select a proper subset of directional sensors for providing the coverage quality requirements for all targets. In order to evaluate the performance of the proposed algorithm, several experiments were performed and the results were compared to those of another algorithms already introduced to literature. تفاصيل المقالة