Volume 13 Number 4 (Apr. 2018)
Home > Archive > 2018 > Volume 13 Number 4 (Apr. 2018) >
JCP 2018 Vol.13(4): 480-489 ISSN: 1796-203X
doi: 10.17706/jcp.13.4.480-489

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

Recep ÖZDAĞ
Department of Computer Engineering, Faculty of Engineering, YuzuncuYilUniversity, Van, Turkey.
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.

Index Terms—Network lifetime, Q-coverage, quality of service, target coverage problem.

[PDF]

Cite: Recep ÖZDAĞ, "Optimization of Target Q-Coverage Problem for QoS Requirement in Wireless Sensor Networks," Journal of Computers vol. 13, no. 4, pp. 480-489, 2018.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>