Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/52428
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Paskorn Champrasert | en_US |
dc.contributor.author | Teerawat Kumrai | en_US |
dc.date.accessioned | 2018-09-04T09:25:13Z | - |
dc.date.available | 2018-09-04T09:25:13Z | - |
dc.date.issued | 2013-10-28 | en_US |
dc.identifier.other | 2-s2.0-84885973382 | en_US |
dc.identifier.other | 10.1109/TIME-E.2013.6611969 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84885973382&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/52428 | - |
dc.description.abstract | This paper studies and evaluates a fitness-based crossover operator in an evolutionary multi-objective optimization algorithm, which heuristically optimizes the sensing coverage area and the installation cost in wireless sensor networks. The proposed evolutionary algorithm uses a population of individuals (or chromosomes), each of which represents a set of wireless sensor nodes' types and positions, and evolves them via the proposed fitness-based crossover operator (FBX) for seeking optimal sensing coverage and installation cost. Simulation results show that the fitness-based crossover evolutionary algorithm outperforms a well-known existing evolutionary algorithm for multi-objective optimization. © 2013 IEEE. | en_US |
dc.subject | Computer Science | en_US |
dc.title | Coverage and installation cost optimization in WSNs using a fitness-based crossover evolutionary algorithm | en_US |
dc.type | Conference Proceeding | en_US |
article.title.sourcetitle | Proceedings of 2013 International Conference on Technology, Informatics, Management, Engineering and Environment, TIME-E 2013 | en_US |
article.stream.affiliations | Chiang Mai University | en_US |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.