Optimal Coverage and Connectivity in Industrial Wireless Mesh Networks Based on Harris’ Hawk Optimization Algorithm
نویسندگان
چکیده
The placement of wireless mesh routers is a significant matter in enhancing the performance network. Therefore, it essential that are optimally placed to guarantee strong connectivity and coverage for ensuring best network accessibility. importance this issue has motivated researchers pursue more investigation on optimizing networks’ performance. Various optimization algorithms have been developed literature identify trade-offs between client coverage. This work aimed at implementing novel application Harris Hawk’s Optimization (HHO) algorithm place so as improve HHO seeks optimal leads maximizing connection increasing number covered clients. In study, three configurations used with sizes 40, 60, 100 routers. simulation results statistically analyzed compared other population-based such Sine Cosine Algorithm (SCA), Gray Wolf’s (GWO), Particle Swarm (PSO). Moreover, state-of-the-art validate effectiveness proposed approach. findings statistical analysis confirm outperforms terms connectivity. outcomes demonstrate can be considered an efficacious means enhance networks (WMNs).
منابع مشابه
Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm
Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...
متن کاملWireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm
How to best solve the coverage problem has always been a critical issue in wireless sensor networks; this paper focuses on redundant network nodes, short life cycle and other defects and firstly sets nodes utilization and network effective coverage as optimization goals, so as to establish relevant mathematical model, and then introduce the inverse Gaussian mutation algorithms on AFSA, making t...
متن کاملOptimal Coverage Algorithm of Wireless Sensor Networks Based on Particle Swarm Optimization with Coherent Velocity
Optimal coverage of wireless sensor networks is one of the most fundamental problems for constructing efficient perception layer of the Internet of Things. On the basis of research on spatial neighborhood, the node coverage and area coverage models are analyzed, then an optimal coverage algorithm of wireless sensor networks is proposed based on particle swarm optimization with coherent velocity...
متن کاملPower Optimal Connectivity and Coverage in Wireless Sensor Networks
This work addresses the problem of minimizing power consumption in each sensor node locally while ensuring two global (i.e., network wide) properties: (i) communication connectivity, and (ii) sensing coverage. A sensor node saves energy by suspending its sensing and communication activities according to a Markovian stochastic process. It is shown that a power level to induce a coverage radius w...
متن کاملDistributed Algorithm for Coverage and Connectivity in Wireless Sensor Networks
Even if several algorithms were proposed in the literature to solve the coverage problem in Wireless Sensor Networks (WSNs), they still suffer from some weaknesses. This is the reason why we suggest in this paper, a distributed protocol, called Single Phase Multiple Initiator (SPMI). Its aim is to find Connect Cover Set (CCS) for assuring the coverage and connectivity in WSN. Our idea is based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3173316