Show simple item record

dc.creatorAlberto Francisco Martínez Herrera
dc.creatorLeopoldo Eduardo Cárdenas Barrón
dc.creatorGerardo Antonio Castañón Avila
dc.creatorArmando Céspedes Mota
dc.date2016
dc.date.accessioned2018-10-18T20:12:58Z
dc.date.available2018-10-18T20:12:58Z
dc.identifier.issn1024123X
dc.identifier.doi10.1155/2016/7918581
dc.identifier.urihttp://hdl.handle.net/11285/630343
dc.descriptionLocation information for wireless sensor nodes is needed in most of the routing protocols for distributed sensor networks to determine the distance between two particular nodes in order to estimate the energy consumption. Differential evolution obtains a suboptimal solution based on three features included in the objective function: area, energy, and redundancy. The use of obstacles is considered to check how these barriers affect the behavior of the whole solution. The obstacles are considered like new restrictions aside of the typical restrictions of area boundaries and the overlap minimization. At each generation, the best element is tested to check whether the node distribution is able to create a minimum spanning tree and then to arrange the nodes using the smallest distance from the initial position to the suboptimal end position based on the Hungarian algorithm. This work presents results for different scenarios delimited by walls and testing whether it is possible to obtain a suboptimal solution with inner obstacles. Also, a case with an area delimited by a star shape is presented showing that the algorithm is able to fill the whole area, even if such area is delimited for the peaks of the star. © 2016 Armando Céspedes-Mota et al.
dc.languageeng
dc.publisherHindawi Publishing Corporation
dc.relationhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84962467341&doi=10.1155%2f2016%2f7918581&partnerID=40&md5=f8e283c916fdbcdb081508716969c612
dc.relationInvestigadores
dc.relationEstudiantes
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.sourceMathematical Problems in Engineering
dc.subjectEnergy utilization
dc.subjectEvolutionary algorithms
dc.subjectOptimization
dc.subjectPower management (telecommunication)
dc.subjectStars
dc.subjectTrees (mathematics)
dc.subjectWireless sensor networks
dc.subjectDifferential Evolution
dc.subjectDistributed sensor networks
dc.subjectHungarian algorithm
dc.subjectLocation information
dc.subjectMinimum spanning trees
dc.subjectObjective functions
dc.subjectSuboptimal solution
dc.subjectWireless sensor node
dc.subjectSensor nodes
dc.subject.classification7 INGENIERÍA Y TECNOLOGÍA
dc.titleOptimization of the distribution and localization of wireless sensor networks based on differential evolution approach
dc.typeArtículo
dc.identifier.volume2016
refterms.dateFOA2018-10-18T20:12:58Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess