Please use this identifier to cite or link to this item: https://lib.hpu.edu.vn/handle/123456789/34483
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNguyễn, Trọng Thểen_US
dc.contributor.authorĐào, Thị Kiênen_US
dc.contributor.authorNguyễn, Thị Thanh Tânen_US
dc.contributor.authorNgô, Trường Giangen_US
dc.contributor.authorPhạm, Đức Tìnhen_US
dc.date.accessioned2022-04-13T03:26:24Z
dc.date.available2022-04-13T03:26:24Z
dc.date.issued2021en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/34483
dc.description.abstractThis study suggests an optimal coverage model aimed at the optimal deployment of Wireless sensor networks (WSN) based on improving the artificial bee colony (ABC) algorithm. The distance between the sensor nodes is regulated reasonably by implementing quasi-gravitation and quasi-coulomb power. Also, with a low regional repetition rate, the ABC algorithm can achieve fast optimization. Besides, to minimize node energy consumption, the sensing radius of WSN nodes is dynamically modified. The simulation results show that the proposed algorithm performs better than the conventional particle swarm (PSO) and quantum-behaved particle swarm optimization (QPSO), ACO schemes in terms of network coverage rate, and convergence speed. Simultaneously, the algorithm has a particular benefit in reducing the energy consumption of nodes in the WSN.en_US
dc.format.extent10 tr.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectOptimal deploymenten_US
dc.subjectArtificial bee colonyen_US
dc.subjectQuasi-physical strategyen_US
dc.subjectWireless sensor networken_US
dc.titleAn Optimization Nodes Layout in Deployment WSN Based on Improved Artificial Bee Colonyen_US
dc.typeArticleen_US
Appears in Collections:Bài báo khoa học

Files in This Item:
File Description SizeFormat 
An-Optimization-Nodes-Layout-in-Deployment-WSN_Nguyen-Trong-The.pdf
  Restricted Access
1.16 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.