A Bipopulation-Based Evolutionary Algorithm for Solving Full Area Coverage Problems

Cited 19 time in webofscience Cited 0 time in scopus
  • Hit : 418
  • Download : 1
The full area coverage sensor deployment problem is a challenging issue in wireless sensor networks. We focus on sensor deployment strategies that aim to acquire a full-coverage state with a minimum number of sensors in a predetermined target region that includes non-penetrable obstacles. This paper presents an efficient bipopulation-based evolutionary full area coverage (BEFAC) algorithm that involves a bipopulation structure composed of a full-and partial-coverage populations. Fitness functions, stochastic unary recombination operators, and selection procedures between the two populations are well designed. Through applying the proposed BEFAC, a full-coverage state is acquired with a minimum number of deployed sensors in the target region, which has non-penetrable obstacles, and the algorithm avoids getting caught in local minima. The performance results reveal that BEFAC outperforms the conventional deployment methods in terms of the number of deployed sensors and the number of required fitness evaluations.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2013-12
Language
English
Article Type
Article
Keywords

WIRELESS SENSOR NETWORKS; DEPLOYMENT; LIFETIME; DESIGN

Citation

IEEE SENSORS JOURNAL, v.13, no.12, pp.4796 - 4807

ISSN
1530-437X
DOI
10.1109/JSEN.2013.2274693
URI
http://hdl.handle.net/10203/187392
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 19 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0