The proliferation of ransomware has become a significant threat to cybersecurity in recent years, causing significant financial, reputational, and operational damage to individuals and organizations. This paper aims to provide a comprehensive overview of the evolution of ransomware, its taxonomy, and its state-of-the-art research contributions. We begin by tracing the origins of ransomware and its evolution over time, highlighting the key milestones and major trends. Next, we propose a taxonomy of ransomware that categorizes different types of ransomware based on their characteristics and behavior. Subsequently, we review the existing research over several years in regard to detection, prevention, mitigation, and prediction techniques. Our extensive analysis, based on more than 150 references, has revealed that significant research, specifically 72.8%, has focused on detecting ransomware. However, a lack of emphasis has been placed on predicting ransomware. Additionally, of the studies focused on ransomware detection, a significant portion, 70%, have utilized Machine Learning methods. We further discuss the challenges found such as the ones related to obtaining ransomware datasets. In addition, our study uncovers a range of shortcomings in research pertaining to real-time protection and identifying zero-day ransomware. Adversarial machine learning exploitation has been identified as an under-researched area in the field. This survey is a constructive roadmap for researchers interested in ransomware research matters.
The Internet of Things (IoT) has the potential to revolutionize agriculture by providing real-time data on crop and livestock conditions. This study aims to evaluate the performance scalability of wireless sensor networks (WSNs) in agriculture, specifically in two scenarios: monitoring olive tree farms and stables for horse training. The study proposes a new classification approach of IoT in agriculture based on several factors and introduces performance assessment metrics for stationary and mobile scenarios in 6LowPAN networks. The study utilizes COOJA, a realistic WSN simulator, to model and simulate the performance of the 6LowPAN and Routing protocol for low-power and lossy networks (RPL) in the two farming scenarios. The simulation settings for both fixed and mobile nodes are shared, with the main difference being node mobility. The study characterizes different aspects of the performance requirements in the two farming scenarios by comparing the average power consumption, radio duty cycle, and sensor network graph connectivity degrees. A new approach is proposed to model and simulate moving animals within the COOJA simulator, adopting the random waypoint model (RWP) to represent horse movements. The results show the advantages of using the RPL protocol for routing in mobile and fixed sensor networks, which supports dynamic topologies and improves the overall network performance. The proposed framework is experimentally validated and tested through simulation, demonstrating the suitability of the proposed framework for both fixed and mobile scenarios, providing efficient communication performance and low latency. The results have several practical implications for precision agriculture by providing an efficient monitoring and management solution for agricultural and livestock farms. Overall, this study provides a comprehensive evaluation of the performance scalability of WSNs in the agriculture sector, offering a new classification approach and performance assessment metrics for stationary and mobile scenarios in 6LowPAN networks. The results demonstrate the suitability of the proposed framework for precision agriculture, providing efficient communication performance and low latency.
Finding an optimal node deployment strategy in wireless sensor networks (WSNs) that would reduce cost, be robust to node failures, reduce computation, and communication overhead, and guarantee a high level of coverage along with network connectivity is a difficult problem. In fact, sensing coverage and network connectivity are two of the most fundamental problems in WSNs as they can directly impact the network lifetime and operation. In this paper, we consider deriving optimal conditions for connectivity with coverage in WSNs. Most versions of this problem are (NP-complete), while approximation algorithms cannot be developed for some versions of polynomial time, unless P = NP. Hence, we also develop a heuristic for some versions of the problem and the efficacy of the heuristic will be evaluated through extensive simulations. We are also interested in determining the probability of finding a path between a given pair of nodes over a given topology of WSNs. This will serve as a measure of connectivity with coverage of the network. Hence, we derive necessary and sufficient conditions for connectivity with coverage over a clustered structure in WSNs. Then, employing queuing networks modeling techniques, we present a dynamic programming study of the connectivity with coverage of clustered structure and its effect on routing in generalized WSNs. The performance evaluation of the proposed schemes shows that availability of nodes, sensor node coverage, and the connectivity were sufficiently enhanced to maximize network lifetime.
The explosive increase in educational data and information systems has led to new teaching practices, challenges, and learning processes. To effectively manage and analyze this information, it is crucial to adopt innovative methodologies and techniques. Recommender systems (RSs) offer a solution for advising students and guiding their learning journeys by utilizing statistical methods such as machine learning (ML) and graph analysis to analyze program and student data. This paper introduces an RS for advisors and students that analyzes student records to develop personalized study plans over multiple semesters. The proposed system integrates ideas from graph theory, performance modeling, ML, explainable recommendations, and an intuitive user interface. The system implicitly implements many academic rules through network analysis. Accordingly, a systematic and comprehensive review of different students’ plans was possible using metrics developed in the mathematical graph theory. The proposed system systematically assesses and measures the relevance of a particular student’s study plan. Experiments on datasets collected at the University of Dubai show that the model presented in this study outperforms similar ML-based solutions in terms of different metrics. Typically, up to 86% accuracy and recall have been achieved. Additionally, the lowest mean square regression (MSR) rate of 0.14 has been attained compared to other state-of-the-art regressors.
1 December 2020 in Journal of King Saud University Computer and Information Sciences