Multiobjective Optimization Approach for Sensor Arrangement in A Complex Indoor Environment

Cited 18 time in webofscience Cited 0 time in scopus
  • Hit : 401
  • Download : 0
Various meta-heuristic search methods have been employed to resolve the sensor arrangement problem, which is a type of NP-hard, combinational problem. However, the difficulty of weight tuning, when formulating a single objective function, is the chief obstacle to the use of the single-objective optimization methods. Although multiobjective optimization methods have been applied recently to avoid the difficulty involved in weight design, the original multiobjective optimization method still requires a greater number of generations for the solutions to converge to the optimal Pareto front. Moreover, unlike in previous works, we deal with four unknowns to define the sensor arrangement problem more practically: 1) The number of sensors is unknown, 2) no candidate is given for installation, 3) the coverage radii of sensors are variable, and 4) sensors cover a wide area in which obstacles exist in complicated arrangements. To improve the search approach for a sensor arrangement with these requirements, we first propose a representation scheme to encode the sensor arrangement problem as a set of chromosomes. Genetic operators and a repair scheme are also properly employed in the proposed encoding method. In addition, two strategies, i.e., the hierarchical fitness assignment strategy and the hybrid optimization strategy, are proposed to improve convergence. We also perform experiments with two commercial sensors to verify the proposed multiobjective optimization approach for sensor arrangement (MOASA). The results show that the proposed MOASA gives better performance than conventional search methods. The effects of the proposed strategies are investigated with additional experiments in terms of the quality of Pareto solutions.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2012-03
Language
English
Article Type
Article
Keywords

BASE STATION LOCATION; EVOLUTIONARY ALGORITHM; NETWORKS; DEPLOYMENT; COVERAGE

Citation

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, v.42, no.2, pp.174 - 186

ISSN
1094-6977
DOI
10.1109/TSMCC.2010.2103310
URI
http://hdl.handle.net/10203/96394
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 18 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0