The Gray Wolf Optimizer (GWO) is a population-based meta-heuristic algorithm  that belongs to the family of swarm intelligence algorithms inspired by the social behavior of gray wolves, in particular the social hierarchy and hunting mechanism. Because of its simplicity, flexibility, and few parameters to be tuned, it has been applied to a wide range of optimization problems. And yet it has some disadvantages, such as poor exploration skills, stagnation at local optima, and slow convergence speed. Therefore, different variants of GWO have been proposed and developed to address these disadvantages. In this article, some literature, especially from the last five years, has been reviewed and summarized by well-known publishers. Fir

Cooperation spectrum sensing in cognitive radio networks has an analogy to a distributed decision in wireless sensor networks, where each sensor make local decision and those decision result are reported to a fusion center to give the final decision according to some fusion rules. In this paper the performance of cooperative spectrum sensing examines using new optimization strategy to find optimal weight and threshold curves that enables each secondary user senses the spectrum environment independently according to a floating threshold with respect to his local environment. Our proposed approach depends on proving the convexity of the famous optimization problem in cooperative spectrum sensing that stated maximizing the probability of detec

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

This paper presents a 3D watermarking model based on the nearest distance between two vertices in mesh, where the embedding path moves as deep as possible until the embedding data is completed. The proposed algorithm achieved good results according to invisibility and robustness. The visibility was measured in term
of Root Mean Square Error (RMSE) and Hausdroff Distance (HD), which obtained good results. As related to robustness, the proposed method showed resistance to geometrical attack (translation, scaling and rotation) as well as acceptable resistance to signal processing attacks like noise addition and simplification.

Vehicular ad hoc network (VANET) is a distinctive form of Mobile Ad hoc Network (MANET) that has attracted increasing research attention recently. The purpose of this study is to comprehensively investigate the elements constituting a VANET system and to address several challenges that have to be overcome to enable a reliable wireless communications within a vehicular environment. Furthermore, the study undertakes a survey of the taxonomy of existing VANET routing protocols, with particular emphasis on the strengths and limitations of these protocols in order to help solve VANET routing issues. Moreover, as mobile users demand constant network access regardless of their location, this study seeks to evaluate various mobility models for vehi

HS Saeed, SS Abdul-Jabbar, SG Mohammed, EA Abed, HS Ibrahem, Solid State Technology, 2020

Multi-agent systems are subfield of Artificial Intelligence that has experienced rapid growth because of its flexibility and intelligence in order to solve distributed problems. Multi-agent systems (MAS) have got interest from various researchers in different disciplines for solving sophisticated problems by dividing them into smaller tasks. These tasks can be assigned to agents as autonomous entities with their private database, which act on their environment, perceive, process, retain and recall by using multiple inputs. MAS can be defined as a network of individual agents that share knowledge and communicate with each other in order to solve a problem that is beyond the scope of a single agent. It is imperative to understand the chara

This paper discusses the limitation of both Sequence Covering Array (SCA) and Covering Array (CA) for testing reactive system when the order of parameter-values is sensitive. In doing so, this paper proposes a new model to take the sequence values into consideration. Accordingly, by superimposing the CA onto SCA yields another type of combinatorial test suite termed Multi-Valued Sequence Covering Array (MVSCA) in a more generalized form. This superimposing is a challenging process due to NP-Hardness for both SCA and CA. Motivated by such a challenge, this paper presents the MVSCA with a working illustrative example to show the similarities and differences among combinatorial testing methods. Consequently, the MVSCA is a