A new approach to solving target coverage problem in wireless sensor networks using an effective hybrid genetic algorithm and tabu search

被引:3
|
作者
Ajam, Leila [1 ]
Nodehi, Ali [1 ]
Mohamadi, Hosein [2 ]
机构
[1] Islamic Azad Univ, Dept Comp Engn, Gorgan Branch, Gorgan, Golestan, Iran
[2] Islamic Azad Univ, Dept Comp Engn, Azadshar Branch, Azadshar, Iran
关键词
Wireless sensor networks; cover set formation; scheduling algorithms; genetic algorithm; Tabu search; LEARNING AUTOMATA; HEURISTIC METHODS; LIFETIME;
D O I
10.3233/JIFS-202736
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Literature in recent years has introduced several studies conducted to solve the target coverage problem in wireless sensor networks (WSNs). Sensors are conventionally assumed as devices with only a single power level. However, real applications may involve sensors with multiple power levels (i.e., multiple sensing ranges each of which possesses a unique power consumption). Consequently, one of the key problems in WSNs is how to provide a full coverage on all targets distributed in a network containing sensors with multiple power levels and simultaneously prolong the network lifetime as much as possible. This problem is known as Maximum Network Lifetime With Adjustable Ranges (MNLAR) and its NP-completeness has been already proved. To solve this problem, we proposed an efficient hybrid algorithm containing Genetic Algorithm (GA) and Tabu Search (TS) aiming at constructing cover sets that consist of sensors with appropriate sensing ranges to provide a desirable coverage for all the targets in the network. In our hybrid model, GA as a robust global searching algorithm is used for exploration purposes, while TS with its already-proved local searching ability is utilized for exploitation purposes. As a result, the proposed algorithm is capable of creating a balance between intensification and diversification. To solve the MNLR problem in an efficient way, the proposed model was also enriched with an effective encoding method, genetic operators, and neighboring structure. In the present paper, different experiments were performed for the purpose of evaluating how the proposed algorithm performs the tasks defined. The results clearly confirmed the superiority of the proposed algorithm over the greedy-based algorithm and learning automata-based algorithm in terms of extending the network lifetime. Moreover, it was found that the use of multiple power levels altogether caused the extension of the network lifetime.
引用
收藏
页码:6245 / 6255
页数:11
相关论文
共 50 条
  • [1] An effective hybrid genetic algorithm and tabu search for maximizing network lifetime using coverage sets scheduling in wireless sensor networks
    Nemat allah Mottaki
    Homayun Motameni
    Hosein Mohamadi
    The Journal of Supercomputing, 2023, 79 : 3277 - 3297
  • [2] An effective hybrid genetic algorithm and tabu search for maximizing network lifetime using coverage sets scheduling in wireless sensor networks
    Mottaki, Nemat Allah
    Motameni, Homayun
    Mohamadi, Hosein
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (03): : 3277 - 3297
  • [3] A new hybrid genetic algorithm with tabu search for solving the temporal coverage problem using rotating directional sensors
    Eshaghi, Mahboobeh
    Nodehi, Ali
    Mohamadi, Hosein
    IET COMMUNICATIONS, 2024, 18 (16) : 938 - 949
  • [4] Genetic Algorithm-Based Heuristic for Solving Target Coverage Problem in Wireless Sensor Networks
    Manju
    Singh, Deepti
    Chand, Satish
    Kumar, Bijendra
    ADVANCED COMPUTING AND COMMUNICATION TECHNOLOGIES, 2018, 562 : 257 - 264
  • [5] A new hybrid algorithm integrating genetic algorithm with Tabu search to solve imbalanced k-coverage problem in directional sensor networks
    Mahmoudi, Babak
    Motameni, Homayun
    Mohamadi, Hosein
    IET COMMUNICATIONS, 2023, 17 (11) : 1243 - 1254
  • [6] An optimal algorithm for solving partial target coverage problem in wireless sensor networks
    Gu, Yu
    Ji, Yusheng
    Li, Jie
    Zhao, Baohua
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2013, 13 (13): : 1205 - 1219
  • [7] Hybrid Learning Algorithm for Effective Coverage in Wireless Sensor Networks
    Sun, Yanjing
    Li, Li
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 5, PROCEEDINGS, 2008, : 227 - 231
  • [8] A Hybrid Tabu Search and Genetic Algorithm for Solving an Aggregate Production Plan Problem
    Gabriel, Mohan Kumar
    Haq, Noorul A.
    PROCEEDINGS OF 2010 INTERNATIONAL CONFERENCE ON INNOVATION, MANAGEMENT AND SERVICE, 2010, : 250 - 255
  • [9] A sensor deployment approach for target coverage problem in wireless sensor networks
    Yarinezhad, Ramin
    Hashemi, Seyed Naser
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2020, 14 (5) : 5941 - 5956
  • [10] A sensor deployment approach for target coverage problem in wireless sensor networks
    Ramin Yarinezhad
    Seyed Naser Hashemi
    Journal of Ambient Intelligence and Humanized Computing, 2023, 14 : 5941 - 5956