Optimization of Target Q-Coverage Problem for QoS Requirement in Wireless Sensor Networks

Abstract

In the recent times, Quality of Service (QoS) terminology has been frequently used for Wireless Sensor Networks (WSNs) because of the fact that the targets which are covered by a different number of sensor nodes have different detection quality. QoS of the WSNs is determined depending upon the number of sensors that cover each target, sampling fraction etc. factors. Therefore, the optimization of the target Qcoverage problem is an important issue as an effective way that increases the lifetime of the network in continuous monitoring of the remote physical targets with different QoS restrictions. In this study, targets will be ensured to be covered by different detection quality by optimizing the Q-coverage problem which significantly plays a role in determining the coverage quality requirement of each target point in the related area. For this purpose, a new approach has been proposed based on Electromagnetism-Like (EM) algorithm, which is meta-heuristic. As a result of the comparison of the proposed algorithm with Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO) algorithms, it was determined by the simulations made that the approach proposed in providing the Q-coverage requirements which were defined for all targets was an effective solution in increasing the lifetime of the network by decreasing the energy consumptions of the sensor nodes.

An Efficient Algorithm to Enhance Nonoverlapping Coverage Area with Less Energy Consumption in WSN

“…Many authors presented their work for target coverage and aim to enhance the network lifetime of WSNs. In [8,12], the authors presented a heuristic function used for prolong network lifetime by generating the cover sets and reduced the consumption of energy which limited the coverage area of WSN. In [13], the authors used the directional sensor network for attaining maximum target coverage requirements and proved that the coverage problem was NP-complete problem.…”

Proficient QoS-Based Target Coverage Problem in Wireless Sensor Networks

“…Literature reveals various recent works pertaining to it. [38], [45], [47], [48]. Chaudhary and Pujari [38] addressed the problem by proposing an energy-based approach (named as HESL) where a sensor with higher remaining power will be given priority to be a part of the current Q-Cover.…”

“…Next, this work also ensures connectivity of the nodes of cover set to the central sink either directly, if they are one hop far from sink or through relay nodes. ÖZDAĞ [47] proposed EM-based algorithm to extend the functional network duration when achieving the solution for the target Q-Coverage variant. The EM is a meta-heuristic that simulates the puling and repulsive both types of movements of any charged particles placed in a predefined electromagnetic field [48].…”

“…Most of the addressed heuristics algorithms [38], [45], [47] to obtain network lifetime for target Q-Coverage problems have not given attention to the poorly covered target (called critical target). Since the coverage of poorly covered target is the deciding factor, as shown in the subsection IV.…”

A New Dynamic Deployment Approach Based on Whale Optimization Algorithm in the Optimization of Coverage Rates of Wireless Sensor Networks

“…However, when this technique, which is known as the random deployment method, is used, the actual landing positions of nodes cannot be controlled if there are obstacles or wind such as trees and buildings in the environment. As a result, the coverage requirement targeted in the node deployment practices performed with random deployment methods cannot be met [5]. The coverage rate of WSN can be optimized by meeting the coverage requirements required for the targets in the area with the deterministic deployment of nodes.…”