Currently, the Internet of Things (IoT) generates a huge amount of traffic data in communication and information technology. The diversification and integration of IoT applications and terminals make IoT vulnerable to intrusion attacks. Therefore, it is necessary to develop an efficient Intrusion Detection System (IDS) that guarantees the reliability, integrity, and security of IoT systems. The detection of intrusion is considered a challenging task because of inappropriate features existing in the input data and the slow training process. In order to address these issues, an effective meta heuristic based feature selection and deep learning techniques are developed for enhancing the IDS. The Osprey Optimization Algorithm (OOA) based feature selection is proposed for selecting the highly informative features from the input which leads to an effective differentiation among the normal and attack traffic of network. Moreover, the traditional sigmoid and tangent activation functions are replaced with the Exponential Linear Unit (ELU) activation function to propose the modified Bi-directional Long Short Term Memory (Bi-LSTM). The modified Bi-LSTM is used for classifying the types of intrusion attacks. The ELU activation function makes gradients extremely large during back-propagation and leads to faster learning. This research is analysed in three different datasets such as N-BaIoT, Canadian Institute for Cybersecurity Intrusion Detection Dataset 2017 (CICIDS-2017), and ToN-IoT datasets. The empirical investigation states that the proposed framework obtains impressive detection accuracy of 99.98 %, 99.97 % and 99.88 % on the N-BaIoT, CICIDS-2017, and ToN-IoT datasets, respectively. Compared to peer frameworks, this framework obtains high detection accuracy with better interpretability and reduced processing time.

• Keywords
• Bi-directional long short-term memory network, Exponential linear unit activation function, Internet of things, Intrusion detection system, Osprey optimization algorithm,
• Publication type
• Journal Article MeSH

This study proposes the One-to-One-Based Optimizer (OOBO), a new optimization technique for solving optimization problems in various scientific areas. The key idea in designing the suggested OOBO is to effectively use the knowledge of all members in the process of updating the algorithm population while preventing the algorithm from relying on specific members of the population. We use a one-to-one correspondence between the two sets of population members and the members selected as guides to increase the involvement of all population members in the update process. Each population member is chosen just once as a guide and is only utilized to update another member of the population in this one-to-one interaction. The proposed OOBO's performance in optimization is evaluated with fifty-two objective functions, encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, and the CEC 2017 test suite. The optimization results highlight the remarkable capacity of OOBO to strike a balance between exploration and exploitation within the problem-solving space during the search process. The quality of the optimization results achieved using the proposed OOBO is evaluated by comparing them to eight well-known algorithms. The simulation findings show that OOBO outperforms the other algorithms in addressing optimization problems and can give more acceptable quasi-optimal solutions. Also, the implementation of OOBO in six engineering problems shows the effectiveness of the proposed approach in solving real-world optimization applications.

• Keywords
• engineering, exploitation, exploration, metaheuristic algorithm, one-to-one correspondence, sensors,
• Publication type
• Journal Article MeSH

Metaheuristic optimization algorithms play an essential role in optimizing problems. In this article, a new metaheuristic approach called the drawer algorithm (DA) is developed to provide quasi-optimal solutions to optimization problems. The main inspiration for the DA is to simulate the selection of objects from different drawers to create an optimal combination. The optimization process involves a dresser with a given number of drawers, where similar items are placed in each drawer. The optimization is based on selecting suitable items, discarding unsuitable ones from different drawers, and assembling them into an appropriate combination. The DA is described, and its mathematical modeling is presented. The performance of the DA in optimization is tested by solving fifty-two objective functions of various unimodal and multimodal types and the CEC 2017 test suite. The results of the DA are compared to the performance of twelve well-known algorithms. The simulation results demonstrate that the DA, with a proper balance between exploration and exploitation, produces suitable solutions. Furthermore, comparing the performance of optimization algorithms shows that the DA is an effective approach for solving optimization problems and is much more competitive than the twelve algorithms against which it was compared to. Additionally, the implementation of the DA on twenty-two constrained problems from the CEC 2011 test suite demonstrates its high efficiency in handling optimization problems in real-world applications.

• Keywords
• drawer, exploitation, exploration, human-inspired methods, optimization,
• Publication type
• Journal Article MeSH