Large Scale Global Optimization Algorithms for IoT Networks: A Comparative Study
Sotirios K. Goudos, Achilles D. Boursianis, Ali Wagdy Mohamed, Shaohua, Wan, Panagiotis Sarigiannidis, George K. Karagiannidis, Ponnuthurai N., Suganthan

TL;DR
This paper compares four large-scale global optimization algorithms applied to the problem of power allocation in IoT wireless sensor networks, demonstrating their effectiveness in high-dimensional scenarios for energy efficiency.
Contribution
First application of LGSO algorithms to IoT power allocation, providing a comparative analysis of their performance in high-dimensional optimization problems.
Findings
Algorithms perform effectively in dimensions up to 800.
LGSO algorithms can optimize power allocation to reduce energy consumption.
Different algorithms show varying strengths depending on problem size.
Abstract
The advent of Internet of Things (IoT) has bring a new era in communication technology by expanding the current inter-networking services and enabling the machine-to-machine communication. IoT massive deployments will create the problem of optimal power allocation. The objective of the optimization problem is to obtain a feasible solution that minimizes the total power consumption of the WSN, when the error probability at the fusion center meets certain criteria. This work studies the optimization of a wireless sensor network (WNS) at higher dimensions by focusing to the power allocation of decentralized detection. More specifically, we apply and compare four algorithms designed to tackle Large scale global optimization (LGSO) problems. These are the memetic linear population size reduction and semi-parameter adaptation (MLSHADE-SPA), the contribution-based cooperative coevolution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
