Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mohamed Alrshah has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Two-level frame aggregation with enhanced A-MPDU for signal-to-noise ratio efficiency in IEEE 802.11n WLANs

    by Fatoumata Sorra, Mohamed Othman, Umar Ali Bukar, Fahrul Hakim, Mohamed A. Alrashah, Anvar Saif, Mehrnaz Moudi

    One of the most important frame aggregation features for enhancing the speed of IEEE 802.11n wireless local area networks (WLANs) through sharing headers and timing overheads is an aggregate MAC protocol data unit (A-MPDU). However, because aggregation overhead affects A-MPDU frame size, the A-MPDU performance falls short of user expectations. The variable signal-to-noise ratio (SNR) is significantly decreased as a result of the influence of lost sub-frame on the volume of sub-frames that may be aggregated (the level of aggregation). In order to solve this issue, this study suggests an improved A-MPDU with reduced header overheads as well as a efficient two-level aggregation technique based on enhanced A-MPDU. To test the suggested plan, a simulation experiment was run on NS-3. The results show that the suggested two-level aggregation approach works better than the existing methods by achieving higher throughput, SNR, and a efficient medium access control (MAC) layer.

  • Open Access

    Workload Allocation Toward Energy Consumption-Delay Trade-Off in Cloud-Fog Computing Using Multi-Objective NPSO Algorithm

    by Faten A. Saif, Rohaya Latip, Zurina Mohd Hanapi, Mohamed A. Alrshah, Shafinah Kamarudin

    The Internet of Things (IoT) generates massive data from smart devices that demand responses from cloud servers. However, sending tasks to the cloud reduces the power consumed by the users’ devices, but increases the transmission delay of the tasks. In contrast, sending tasks to the fog server reduces the transmission delay due to the shorter distance between the user and the server. However, this occurs at the user end’s expense of higher energy consumption. Thus, this study proposes a mathematical framework for workload allocation to model the power consumption and delay functions for both fog and clouds. After that, a Modified Least Laxity First (MLLF) algorithm was proposed to reduce the maximum delay threshold. Furthermore, a new multi-objective approach, namely the Non-dominated Particle Swarm Optimization (NPSO), is proposed to reduce energy consumption and delay compared to the state-of-the-art algorithms. The simulation results show that NPSO outperforms the state-of-the-art algorithm in reducing energy consumption, while NGSA-II proves its effectiveness in reducing transmission delay compared to the other algorithms in the experimental simulation. In addition, the MLLF algorithm reduces the maximum delay threshold by approximately 11% compared with other related algorithms. Moreover, the results prove that metaheuristics are more appropriate for distributed computing.


  • Open Access

    Crucial File Selection Strategy (CFSS) for Enhanced Download Response Time in Cloud Replication Environments

    by M.A. Fazlina, Rohaya Latip, Azizol Abdullah, Hamidah Ibrahim, Mohamed A. Alrshah

    Cloud Computing is a mass platform to serve high volume data from multi-devices and numerous technologies. Cloud tenants have a high demand to access their data faster without any disruptions. Therefore, cloud providers are struggling to ensure every individual data is secured and always accessible. Hence, an appropriate replication strategy capable of selecting essential data is required in cloud replication environments as the solution. This paper proposed a Crucial File Selection Strategy (CFSS) to address poor response time in a cloud replication environment. A cloud simulator called CloudSim is used to conduct the necessary experiments, and results are presented to evidence the enhancement on replication performance. The obtained analytical graphs are discussed thoroughly, and apparently, the proposed CFSS algorithm outperformed another existing algorithm with a 10.47% improvement in average response time for multiple jobs per round.


  • Open Access

    Locust Inspired Algorithm for Cloudlet Scheduling in Cloud Computing Environments

    by Mohammed Alaa Ala’anzy, Mohamed Othman, Zurina Mohd Hanapi, Mohamed A. Alrshah

    Cloud computing is an emerging paradigm that offers flexible and seamless services for users based on their needs, including user budget savings. However, the involvement of a vast number of cloud users has made the scheduling of users’ tasks (i.e., cloudlets) a challenging issue in selecting suitable data centres, servers (hosts), and virtual machines (VMs). Cloudlet scheduling is an NP-complete problem that can be solved using various meta-heuristic algorithms, which are quite popular due to their effectiveness. Massive user tasks and rapid growth in cloud resources have become increasingly complex challenges; therefore, an efficient algorithm is necessary for allocating cloudlets efficiently to attain better execution times, resource utilisation, and waiting times. This paper proposes a cloudlet scheduling, locust inspired algorithm to reduce the average makespan and waiting time and to boost VM and server utilisation. The CloudSim toolkit was used to evaluate our algorithm’s efficiency, and the obtained results revealed that our algorithm outperforms other state-of-the-art nature-inspired algorithms, improving the average makespan, waiting time, and resource utilisation.


  • Open Access

    Vigorous Replication Strategy With Balanced Quorum for Minimizing the Storage Consumption and Response Time in Cloud Environments

    by Fazlina Mohd Ali, Rohaya Latip, Mohamed A. Alrshah, Azizol Abdullah, Hamidah Ibrahim

    Digital data is establishing enormously across the globe, which is considered highly valuable due to its significant contributions to facilitate different individuals’ lives. Even though technology evolving rapidly, data availability remains a major challenge due to the heterogeneity of the data with different types, platforms, and technologies. Additionally, the acquired data must be always available and accessible for users regardless of time and location, which appears to be another crucial issue due to many inefficient system implementations. The most essential option to solve this issue is by providing the best replication strategies that are able to afford business continuity without interruption. Essentially, cloud replication must be able to secure huge data by enabling comprehensive replication strategies, optimal data availability, fast data retrieval, and cost-effective data management and maintenance. Therefore, this paper mainly introduces the Vigorous Replication Strategy with Balanced Quorum (VRS-BQ) replica placement technique for minimizing storage consumption, response time and replication process time in cloud environments. Comprehensive experiments have been conducted using the well-known CloudSim simulation tool, in which the results reveal that the proposed VRS-BQ algorithm attains 25% lower average response time, 22% lower replication time, and 20% lower storage consumption compared to the existing DPRS algorithm while maintaining a high level of data availability.


  • Open Access

    Energy and Spectral Efficiency Balancing Algorithm for Energy Saving in LTE Downlinks

    by Mamman Maharazu, Zurina Mohd Hanapi, Mohamed A. Alrashah

    In wireless network communication environments, Spectral Efficiency (SE) and Energy Efficiency (EE) are among the major indicators used for evaluating network performance. However, given the high demand for data rate services and the exponential growth of energy consumption, SE and EE continue to elicit increasing attention in academia and industries. Consequently, a study of the trade-off between these metrics is imperative. In contrast with existing works, this study proposes an efficient SE and EE trade-off algorithm for saving energy in downlink Long Term Evolution (LTE) networks to concurrently optimize SE and EE while considering battery life at the Base Station (BS). The scheme is formulated as a Multi-objective Optimization Problem (MOP) and its Pareto optimal solution is examined. In contrast with other algorithms that prolong battery life by considering the idle state of a BS, thereby increasing average delay and energy consumption, the proposed algorithm prolongs battery life by adjusting the initial and final states of a BS to minimize the average delay and the energy consumption. Similarly, the use of an omni-directional antenna to spread radio signals to the user equipment in all directions causes high interference and low spatial reuse. We propose using a directional antenna instead of an omni-directional antenna by transmitting signals in one direction which results in no or low interference and high spatial reuse. The proposed scheme has been extensively evaluated through simulation, where simulation results prove that the proposed scheme is efficiently able to decrease the average response delay, improve SE, and minimize energy consumption.


  • Open Access

    HEVC Watermarking Techniques for Authentication and Copyright Applications: Challenges and Opportunities

    by Ali A. Elrowayati, Mohamed A. Alrshah, Mohammad Faiz Liew Abdullah, Rohaya Latip

    Recently, High-Efficiency Video Coding (HEVC/H.265) has been chosen to replace previous video coding standards, such as H.263 and H.264. Despite the efficiency of HEVC, it still lacks reliable and practical functionalities to support authentication and copyright applications. In order to provide this support, several watermarking techniques have been proposed by many researchers during the last few years. However, those techniques are still suffering from many issues that need to be considered for future designs. In this paper, a Systematic Literature Review (SLR) is introduced to identify HEVC challenges and potential research directions for interested researchers and developers. The time scope of this SLR covers all research articles published during the last six years starting from January 2014 up to the end of April 2020. Forty-two articles have met the criteria of selection out of 343 articles published in this area during the mentioned time scope. A new classification has been drawn followed by an identification of the challenges of implementing HEVC watermarking techniques based on the analysis and discussion of those chosen articles. Eventually, recommendations for HEVC watermarking techniques have been listed to help researchers to improve the existing techniques or to design new efficient ones.


  • Two-Level Frame Aggregation Scheme Under Unreliable Channel Conditions for IEEE 802.11n WLANs: A Survey

    by Fatoumata Sorra, Mohamed Othman, Fakrul Hakim, Mohamed Alrshah, Monir Abdullah, Anwar Saif

    Frame Aggregation schemes defined by IEEE 802.11n is the combination of the Aggregate MAC Service Data Unit (A-MSDU) and MAC Protocol Data Unit (A- MPDU). The units are aimed at maximizing Wireless Local Area Networks (WLANs) efficiency at Media Access Control (MAC) level, via the sharing of headers and timing overheads. Moreover, the combination of A-MSDU and A-MPDU is known as Two-level frame aggregation. In spite of their abilities in improving the throughput of MAC Layer, the scheme is still limited by other overheads as a result of aggregation which affects the system performance. Block Acknowledgement (Block ACK) and Frame aggregation were introduced in order to minimize MAC Layer overheads. Still, there are some parameters that affect the aggregation performance, such as aggregate length, sub frame size and channel condition overheads. A-MPDU in other hand minimizes the effect of error condition through sub frame transmission. Therefore, A- MPDU aggregation performances, its limitations, and its promising performances motivated this survey to focus on enhancing Aggregation Mac Protocol Data Unit (eA-MPDU) performance by minimizing the headers overheads of the Two-Level Frame Aggregation Scheme, for the reduction of the channel noise, which by its role will increase the Signal Noise Ratio (SNR) and improve the throughput.


  • Open Access

    Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support

    by Basheer Raddwan, Khalil Al-Wagih, Ibrahim A. Al-Baltah, Mohamed A. Alrshah, Mohammed A. Al-Maqri

    Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.


  • Open Access

    CMIP: Clone Mobile-Agent Itinerary Planning Approach for Enhancing Event-to-Sink Throughput in Wireless Sensor Networks

    by Huthiafa Q. Qadori, Zuriati Ahmad Zukarnain, Mohamed A. Alrshah, Zurina Mohd Hanapi, Shamala Subramaniam

    In order to mitigate the problem of data congestion, increased latency, and high-energy consumption in wireless sensor networks, mobile agent (MA) has been proven to be a viable alternative to the traditional client-server data gathering model. MA has the ability to migrate among network nodes based on an assigned itinerary, which can be formed via single itinerary planning (SIP) or multiple itinerary planning (MIP). MIP-based data gathering approach solves problems associated with SIP in terms of task duration, energy consumption, and reliability. However, the majority of the existing MIP approaches focus only on reducing energy consumption and task duration, while the event-to-sink throughput has not been considered. In this paper, a clone mobile-agent itinerary planning approach (CMIP) is proposed to reduce task duration while improving the event-to-sink throughput in real-time applications, especially when the MA is assigned to visit a large number of source nodes. Simulation results show that the CMIP approach outperforms both central location-based MIP (CL-MIP) and greatest information in greatest memory-based MIP (GIGM-MIP) in terms of reducing task duration by about 56% and 16%, respectively. Furthermore, CMIP improves the event-to-sink throughput by about 93% and 22% as compared to both CL-MIP and GIGM-MIP approaches, respectively.