A Compact Bat Algorithm for Unequal Clustering in Wireless Sensor Networks

Everyday, a large number of complex scientific and industrial problems involve finding an optimal solution in a large solution space. A challenging task for several optimizations is not only the combinatorial operation but also the constraints of available devices. This paper proposes a novel optimi...

Full description

Saved in:
Bibliographic Details
Published inApplied sciences Vol. 9; no. 10; p. 1973
Main Authors Nguyen, Trong-The, Pan, Jeng-Shyang, Dao, Thi-Kien
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.05.2019
Subjects
Online AccessGet full text
ISSN2076-3417
2076-3417
DOI10.3390/app9101973

Cover

More Information
Summary:Everyday, a large number of complex scientific and industrial problems involve finding an optimal solution in a large solution space. A challenging task for several optimizations is not only the combinatorial operation but also the constraints of available devices. This paper proposes a novel optimization algorithm, namely the compact bat algorithm (cBA), to use for the class of optimization problems involving devices which have limited hardware resources. A real-valued prototype vector is used for the probabilistic operations to generate each candidate for the solution of the optimization of the cBA. The proposed cBA is extensively evaluated on several continuous multimodal functions as well as the unequal clustering of wireless sensor network (uWSN) problems. Experimental results demonstrate that the proposed algorithm achieves an effective way to use limited memory devices and provides competitive results.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app9101973