ABSTRACT
In the modern digital market flooded by nearly endless cyber-security hazards, sophisticated IDS (intrusion detection systems) can become invaluable in defending against intricate security threats. Sybil-Free Metric-based routing protocol for low power and lossy network (RPL) Trustworthiness Scheme (SF-MRTS) captures the nature of the biggest threat to the routing protocol for low-power and lossy networks under the RPL module, known as the Sybil attack. Sybil attacks build a significant security challenge for RPL networks where an attacker can distort at least two hop paths and disrupt network processes. Using such a new way of calculating node reliability, we introduce a cutting-edge approach, evaluating parameters beyond routing metrics like energy conservation and actuality. SF-MRTS works precisely towards achieving a trusted network by introducing such trust metrics on secure paths. Therefore, this may be considered more likely to withstand the attacks because of these security improvements. The simulation function of SF-MRTS clearly shows its concordance with the security risk management features, which are also necessary for the network's performance and stability maintenance. These mechanisms are based on the principles of game theory, and they allocate attractions to the nodes that cooperate while imposing penalties on the nodes that do not. This will be the way to avoid damage to the network, and it will lead to collaboration between the nodes. SF-MRTS is a security technology for emerging industrial Internet of Things (IoT) network attacks. It effectively guaranteed reliability and improved the networks' resilience in different scenarios.
ABSTRACT
This article presents an evaluation of BukaGini, a stability-aware Gini index feature selection algorithm designed to enhance model performance in machine learning applications. Specifically, the study focuses on assessing BukaGini's effectiveness within the domain of intrusion detection systems (IDS). Recognizing the need for improved feature interaction analysis methodologies in IDS, this research aims to investigate the performance of BukaGini in this context. BukaGini's performance is evaluated across four diverse datasets commonly used in IDS research: NSLKDD (22,544 samples), WUSTL EHMS (16,318 samples), WSN-DS (374,661 samples), and UNSWNB15 (175,341 samples), amounting to a total of 588,864 data samples. The evaluation encompasses key metrics such as stability score, accuracy, F1-score, recall, precision, and ROC AUC. Results indicate significant advancements in IDS performance, with BukaGini achieving remarkable accuracy rates of up to 99% and stability scores consistently surpassing 99% across all datasets. Additionally, BukaGini demonstrates an average reduction in dimensionality of 25%, selecting 10 features for each dataset using the Gini index. Through rigorous comparative analysis with existing methodologies, BukaGini emerges as a promising solution for feature interaction analysis within cybersecurity applications, particularly in the context of IDS. These findings highlight the potential of BukaGini to contribute to robust model performance and propel intrusion detection capabilities to new heights in real-world scenarios.
ABSTRACT
The increasing demand for network applications, such as teleconferencing, multimedia messaging and mobile TV, which have diverse requirements, has resulted in the introduction of Long Term Evolution (LTE) by the Third Generation Partnership Project (3GPP). LTE networks implement resource allocation algorithms to distribute radio resource to satisfy the bandwidth and delay requirements of users. However, the scheduling algorithm problem of distributing radio resources to users is not well defined in the LTE standard and thus considerably affects transmission order. Furthermore, the existing radio resource algorithm suffers from performance degradation under prioritised conditions because of the minimum data rate used to determine the transmission order. In this work, a novel downlink resource allocation algorithm that uses quality of service (QoS) requirements and channel conditions to address performance degradation is proposed. The new algorithm is formulated as an optimisation problem where network resources are allocated according to users' priority, whereas the scheduling algorithm decides on the basis of users' channel status to satisfy the demands of QoS. Simulation is used to evaluate the performance of the proposed algorithm, and results demonstrate that it performs better than do all other algorithms according to the measured metrics.