A Time-Critical Low Complexity Distributed Self Organizing Hierarchical Particle Swarm Optimization Algorithm for Wireless Sensor Networks
This work explores the possibility of reducing computations in a distributed estimation setup, utilizing a self organizing hierarchical particle swarm optimization algorithm. Reducing computations is essential for any application using wireless sensors in a distributed network, as the sensors need t...
Saved in:
| Published in | Circuits, systems, and signal processing Vol. 44; no. 3; pp. 2180 - 2195 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.03.2025
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0278-081X 1531-5878 |
| DOI | 10.1007/s00034-024-02910-z |
Cover
| Summary: | This work explores the possibility of reducing computations in a distributed estimation setup, utilizing a self organizing hierarchical particle swarm optimization algorithm. Reducing computations is essential for any application using wireless sensors in a distributed network, as the sensors need to save processing power in order to last longer. An event triggering approach is used to remove redundant computations from the algorithm. This results in a slight degradation in performance but the trade-off is a significant reduction in computations. In practical applications, such as intruder detection in a cybersecurity setup, the proposed algorithm can prove to be an asset with its rapid estimation compared with the standard algorithms. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0278-081X 1531-5878 |
| DOI: | 10.1007/s00034-024-02910-z |