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 条
  • [41] A Tabu Search Algorithm for Frequency Assignment Problem in Wireless Communication Networks
    Zhang Yu-Bin
    Zhao Yu-Cai
    Hui, Xiong
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 2848 - 2851
  • [42] A Weight-based Greedy Algorithm for Target Coverage Problem in Wireless Sensor networks
    Diop, Babacar
    Diongue, Dame
    Thiare, Ousmane
    2014 INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATIONS, AND CONTROL TECHNOLOGY (I4CT), 2014, : 120 - 125
  • [43] A new genetic-based approach for solving k-coverage problem in directional sensor networks
    Alibeiki, Abolghasem
    Motameni, Homayun
    Mohamadi, Hosein
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 154 : 16 - 26
  • [44] Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks
    Mini, S.
    Udgata, Siba K.
    Sabat, Samrat L.
    IEEE SENSORS JOURNAL, 2014, 14 (03) : 636 - 644
  • [45] A gravitational search algorithm for solving the relay node placement problem in wireless sensor networks
    Lanza-Gutierrez, Jose M.
    Gomez-Pulido, Juan A.
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (02)
  • [46] A Hybrid Genetic Algorithm with Local Search and Tabu Search Approaches for Solving the Post Enrolment Based Course Timetabling Problem: Outperforming Guided Search Genetic Algorithm
    Jaengchuea, Sawaphat
    Lohpetch, Dome
    2015 7TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND ELECTRICAL ENGINEERING (ICITEE), 2015, : 29 - 34
  • [47] A Hybrid Genetic Algorithm with Tabu Search for Optimization of the Traveling Thief Problem
    Alharbi, Saad T.
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2018, 9 (11) : 276 - 287
  • [48] Target K-coverage problem in wireless sensor networks
    Manju
    Bhambu, Pawan
    Kumar, Sandeep
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2020, 23 (02): : 651 - 659
  • [49] On the Maximum Directional Target Coverage Problem in Wireless Sensor Networks
    Lu, Zaixin
    Pitchford, Travis
    Li, Wei
    Wu, Weili
    2014 10TH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS (MSN), 2014, : 74 - 79
  • [50] Maximum Target Coverage Problem in Mobile Wireless Sensor Networks
    Liang, Dieyan
    Shen, Hong
    Chen, Lin
    SENSORS, 2021, 21 (01) : 1 - 13