This page has only limited features, please log in for full access.
Software-defined networking (SDN) is widely perceived to simplify network management and monitoring. The introduction of the SDN model into wireless sensor networks (WSNs)—SDWSNs—helps the SDN controller perform intensive tasks. In contrast, sensor nodes will only perform forwarding tasks to address a WSN’s many problems and challenges, such as energy consumption, reliability, and consistency. This study conducts a review following a systematic process to identify the development concerning the architectural design of SDWSNs with a particular emphasis on the distributed control and programmability features of sensor nodes. A total of 84 papers from reputable databases were evaluated through thematic analysis. The findings revealed the relationship between an SDN and a WSN from conceptual perspectives, the taxonomy of research studies conducted for SDWSNs, and the various architectural development of SDWSNs proposed in the literature from programmable sensor nodes’ perspectives, software sensor nodes, and distributed control. Moreover, the open issues and challenges faced by SDWSNs’ solutions still include the inherent problems of optimal energy consumption, security, and distributed implementations for various applications.
Umar Ali Bukar; Mohamed Othman. Architectural Design, Improvement, and Challenges of Distributed Software-Defined Wireless Sensor Networks. Wireless Personal Communications 2021, 1 -45.
AMA StyleUmar Ali Bukar, Mohamed Othman. Architectural Design, Improvement, and Challenges of Distributed Software-Defined Wireless Sensor Networks. Wireless Personal Communications. 2021; ():1-45.
Chicago/Turabian StyleUmar Ali Bukar; Mohamed Othman. 2021. "Architectural Design, Improvement, and Challenges of Distributed Software-Defined Wireless Sensor Networks." Wireless Personal Communications , no. : 1-45.
Enabling machine-to-machine (M2M) communications on cellular networks will provide a promising future for smart cities and the Internet of Things. M2M systems involve a huge number of connected devices that may synchronously be activated to react to some event. This massive synchronous access causes intensive congestion and collisions in the random access channel (RACH), which is used as a first step to access network resources. In this article, we introduce a dynamic tree-splitting (DTS) algorithm to resolve RACH collisions for delay-sensitive devices during burst arrival scenarios. The DTS algorithm assigns a specific number of preambles to the collided devices for their next access attempt. The number of preambles is determined based on the mean number of collisions in each random access opportunity, with the aim of increasing the utilization of preambles. A mathematical analysis of the proposed algorithm is presented as well as the derivations of throughput and access delay. The analysis and simulation results show that DTS reduced access delay and increased RACH throughput by approximately 12%, compared to recent benchmarks, with a mean of three preamble transmissions and a success rate above 0.98, which indicates the efficiency and reliability of the proposed algorithm.
Huda Althumali; Mohamed Othman; Nor Kamariah Noordin; Zurina Mohd Hanapi. Dynamic Tree-Splitting Algorithm for Massive Random Access of M2M Communications in IoT Networks. IEEE Systems Journal 2021, PP, 1 -12.
AMA StyleHuda Althumali, Mohamed Othman, Nor Kamariah Noordin, Zurina Mohd Hanapi. Dynamic Tree-Splitting Algorithm for Massive Random Access of M2M Communications in IoT Networks. IEEE Systems Journal. 2021; PP (99):1-12.
Chicago/Turabian StyleHuda Althumali; Mohamed Othman; Nor Kamariah Noordin; Zurina Mohd Hanapi. 2021. "Dynamic Tree-Splitting Algorithm for Massive Random Access of M2M Communications in IoT Networks." IEEE Systems Journal PP, no. 99: 1-12.
Cloud computing provides solutions to a large number of organizations in terms of hosting systems and services. The services provided by cloud computing are broadly used for business and scientific applications. Business applications are task oriented applications and structured into business workflows. Whereas, scientific applications are data oriented and compute intensive applications and structured into scientific workflows. Scientific workflows are managed through scientific workflows management and scheduling systems. Recently, a significant amount of research is carried out on management and scheduling of scientific workflow applications. This study presents a comprehensive review on scientific workflows management and scheduling in cloud computing. It provides an overview of existing surveys on scientific workflows management systems. It presents a taxonomy of scientific workflow applications and characteristics. It shows the working of existing scientific workflows management and scheduling techniques including resource scheduling, fault-tolerant scheduling and energy efficient scheduling. It provides discussion on various performance evaluation parameters along with definition and equation. It also provides discussion on various performance evaluation platforms used for evaluation of scientific workflows management and scheduling strategies. It finds evaluation platforms used for the evaluation of scientific workflows techniques based on various performance evaluation parameters. It also finds various design goals for presenting new scientific workflow management techniques. Finally, it explores the open research issues that require attention and high importance.
Zulfiqar Ahmad; Ali Imran Jehangiri; Mohammed Alaa Ala'Anzy; Mohamed Othman; Rohaya Latip; Sardar Khaliq Uz Zaman; Arif Iqbal Umar. Scientific Workflows Management and Scheduling in Cloud Computing: Taxonomy, Prospects, and Challenges. IEEE Access 2021, 9, 53491 -53508.
AMA StyleZulfiqar Ahmad, Ali Imran Jehangiri, Mohammed Alaa Ala'Anzy, Mohamed Othman, Rohaya Latip, Sardar Khaliq Uz Zaman, Arif Iqbal Umar. Scientific Workflows Management and Scheduling in Cloud Computing: Taxonomy, Prospects, and Challenges. IEEE Access. 2021; 9 ():53491-53508.
Chicago/Turabian StyleZulfiqar Ahmad; Ali Imran Jehangiri; Mohammed Alaa Ala'Anzy; Mohamed Othman; Rohaya Latip; Sardar Khaliq Uz Zaman; Arif Iqbal Umar. 2021. "Scientific Workflows Management and Scheduling in Cloud Computing: Taxonomy, Prospects, and Challenges." IEEE Access 9, no. : 53491-53508.
Interconnection networks provide an effective means by which components of a system such as processors and memory modules communicate to provide reliable connectivity. This facilitates the realization of a highly efficient network design suitable for computational-intensive applications. Particularly, the use of multistage interconnection networks has unique advantages as the addition of extra stages helps to improve the network performance. However, this comes with challenges and trade-offs, which motivates researchers to explore various design options and architectural models to improve on its performance. A particular class of these networks is shuffle exchange network (SEN) which involves a symmetric N-input and N-output architecture built in stages of
Oluwatosin Amodu; Mohamed Othman; Nur Yunus; Zurina Hanapi. A Primer on Design Aspects and Recent Advances in Shuffle Exchange Multistage Interconnection Networks. Symmetry 2021, 13, 378 .
AMA StyleOluwatosin Amodu, Mohamed Othman, Nur Yunus, Zurina Hanapi. A Primer on Design Aspects and Recent Advances in Shuffle Exchange Multistage Interconnection Networks. Symmetry. 2021; 13 (3):378.
Chicago/Turabian StyleOluwatosin Amodu; Mohamed Othman; Nur Yunus; Zurina Hanapi. 2021. "A Primer on Design Aspects and Recent Advances in Shuffle Exchange Multistage Interconnection Networks." Symmetry 13, no. 3: 378.
Wireless sensor networks (WSN) are networks of thousands of nodes installed in a defined physical environment to sense and monitor its state condition. The viability of such a network is directly dependent and limited by the power of batteries supplying the nodes of these networks, which represents a disadvantage of such a network. To improve and extend the life of WSNs, scientists around the world regularly develop various routing protocols that minimize and optimize the energy consumption of sensor network nodes. This article, introduces a new heterogeneous-aware routing protocol well known as Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network or EZ-SEP, where the connection of nodes to a base station (BS) is done via a hybrid method, i.e., a certain amount of nodes communicate with the base station directly, while the remaining ones form a cluster to transfer data. Parameters of the field are unknown, and the field is partitioned into zones depending on the node energy. We reviewed the Z-SEP protocol concerning the election of the cluster head (CH) and its communication with BS and presented a novel extended mechanism for the selection of the CH based on remaining residual energy. In addition, EZ-SEP is weighted up using various estimation schemes such as base station repositioning, altering the field density, and variable nodes energy for comparison with the previous parent algorithm. EZ-SEP was executed and compared to routing protocols such as Z-SEP, SEP, and LEACH. The proposed algorithm performed using the MATLAB R2016b simulator. Simulation results show that our proposed extended version performs better than Z-SEP in the stability period due to an increase in the number of active nodes by 48%, in efficiency of network by the high packet delivery coefficient by 16% and optimizes the average power consumption compared to by 34.
Zhanserik Nurlan; Tamara Zhukabayeva; Mohamed Othman. EZ-SEP: Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network. Sensors 2021, 21, 1021 .
AMA StyleZhanserik Nurlan, Tamara Zhukabayeva, Mohamed Othman. EZ-SEP: Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network. Sensors. 2021; 21 (4):1021.
Chicago/Turabian StyleZhanserik Nurlan; Tamara Zhukabayeva; Mohamed Othman. 2021. "EZ-SEP: Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network." Sensors 21, no. 4: 1021.
The divisible load scheduling (DLS) can be considered as a special class of scheduling model in the area of distributed and parallel systems. According to the DLS, the computations and communications can be divided into some arbitrarily independent fragments in which each fragment can be computed independently by a processor. The basic assumptions of the traditional DLS models are \(w_j\le w_{j+1}\) and \(z_j\le z_{j+1}\) for all \(j\le m\)(\(z_j\) and \(w_j\) are the rates of communication and computation of the jth processor, respectively). These presumptions are not acceptable if the processors do not report their real rates of communication or computation. The problem that a processor may not report its real rates of communication or computation is called cheating problem. This paper has a multi-criteria approach to the time cheating problem in the area of the DLS. The multi-criteria DLS model is a new paradigm in the area of DLS and its applications. The main contribution of this paper is to reduce the effects of time cheating in a DLS scheduling model.
Shamsollah Ghanbari; Mohamed Othman. A multi-criteria approach to time cheating in the divisible load scheduling. Iran Journal of Computer Science 2021, 1 -12.
AMA StyleShamsollah Ghanbari, Mohamed Othman. A multi-criteria approach to time cheating in the divisible load scheduling. Iran Journal of Computer Science. 2021; ():1-12.
Chicago/Turabian StyleShamsollah Ghanbari; Mohamed Othman. 2021. "A multi-criteria approach to time cheating in the divisible load scheduling." Iran Journal of Computer Science , no. : 1-12.
D2D communication has been identified as one of the technologies for meeting the unique traffic demands of the fifth-generation wireless network communication. However, the effectiveness of D2D highly depends on the proximity of devices. In other words, whenever such devices are very far apart, communication may become ineffective. Thus, relay assisted D2D positions itself as an approach by which some of the limitations of traditional D2D communication can be addressed. This makes the applications of D2D communication more versatile. However, the introduction of relays also poses interference within the D2D communication network especially when the density of relay is high. Such scenarios call for techniques by which interference posed by relays can be averted while taking the benefits of relay-assisted communication. This motivates the consideration of interference cancellation (IC) in this paper where two IC models are adapted into the transmission capacity analysis of relay-assisted D2D communication. We show the performance gains attainable by interference cancellation and how the interplay between its parameters affect the network performance. Furthermore, two hybrid IC models are investigated and the impact of interference cancellation in these scenarios and the inherent trade-offs are revealed.
Oluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. Transmission capacity analysis of relay-assisted D2D cellular networks with interference cancellation. Ad Hoc Networks 2021, 117, 102400 .
AMA StyleOluwatosin Ahmed Amodu, Mohamed Othman, Nor Kamariah Noordin, Idawaty Ahmad. Transmission capacity analysis of relay-assisted D2D cellular networks with interference cancellation. Ad Hoc Networks. 2021; 117 ():102400.
Chicago/Turabian StyleOluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. 2021. "Transmission capacity analysis of relay-assisted D2D cellular networks with interference cancellation." Ad Hoc Networks 117, no. : 102400.
The deployment of machine-to-machine (M2M) communications on cellular networks provides ubiquitous services to Internet-of-Things (IoT) systems. Cellular networks have been chosen as the best infrastructure for M2M communications due to the wide coverage and spectral efficiency. However, with the increased number of devices connecting to the network, massive number of devices are expected to simultaneously access the network resources. This massive access results in excessive congestion and collisions in the random access channel (RACH) which causes major degradation in systems performance. This paper focuses on resolving the RACH collisions during the massive access scenarios for cellular M2M communications. We propose a collision resolution scheme using the backoff procedure which dynamically adjusts the backoff indicator (BI) based on the number of backlog devices and the available resources. The proposed scheme is integrated with three well-known random access schemes; standard random access (SRA), static access class barring (ACB) and dynamic access class barring (DAB). Furthermore, the paper presents an analysis for access success probability based on the dynamic backoff procedure. The optimal value of BI that achieves the highest access success probability is derived for the three different schemes. The analysis and simulation results indicate that the dynamic value of BI achieves approximately 99.9% access success rate with a slight increase in access delay of around 10%, which is considered a reasonable increment for delay-tolerant applications during the massive arrivals scenarios.
Huda Dakhilallah Althumali; Mohamed Othman; Nor Kamariah Noordin; Zurina Mohd Hanapi. Dynamic Backoff Collision Resolution for Massive M2M Random Access in Cellular IoT Networks. IEEE Access 2020, 8, 201345 -201359.
AMA StyleHuda Dakhilallah Althumali, Mohamed Othman, Nor Kamariah Noordin, Zurina Mohd Hanapi. Dynamic Backoff Collision Resolution for Massive M2M Random Access in Cellular IoT Networks. IEEE Access. 2020; 8 (99):201345-201359.
Chicago/Turabian StyleHuda Dakhilallah Althumali; Mohamed Othman; Nor Kamariah Noordin; Zurina Mohd Hanapi. 2020. "Dynamic Backoff Collision Resolution for Massive M2M Random Access in Cellular IoT Networks." IEEE Access 8, no. 99: 201345-201359.
The Internet of Things is a flexible, emerging technology and an innovative development of the environmental trend. It is a large and complex network of devices in which fog computing plays a growing role in order to handle the information flow of such large and complex networks. Influence of their activities on carbon emissions and energy costs in unlimited results. Dynamic and efficient load balancing technology can be used to improve overall performance and reduce energy consumption. Load can be transferred or shared between computer nodes through load balancing technology. Therefore, the design of energy-efficient load balancing solutions for edge and fog environments has become the main focus. In this research work, we have proposed Dynamic Energy Efficient Resource Allocation (DEER) strategy for balancing the load in fog computing environments. In the presented strategy, initially the user submits tasks for execution to the Tasks Manager. Resource Information Provider registers resources from Cloud Data Centres. The information about the tasks and resources are then submitted to the Resource Scheduler. The resource scheduler arranges the available resources in descending order as per their utilization. The resource engine after receiving the information of tasks and resources from the resource scheduler assigns tasks to the resources as per ordered list. During execution of tasks, the information about the status of the resources is also sent to the Resource Load Manager and Resource Power Manager. The Resource Power Manager manages the power consumption through the resource On/Off mechanism. After successful execution of tasks, the resource engine returns the result to the user. Simulation results reveal that the presented strategy is an efficient resource allocation scheme for balancing load in fog environments to minimize the energy consumption and computation cost by 8.67 % and 16.77 % as compared with existing DRAM scheme.
Anees Ur Rehman; Zulfiqar Ahmad; Ali Imran Jehangiri; Mohammed Ala'Anzy; Mohamed Othman; Arif Iqbal Umar; Jamil Ahmad. Dynamic Energy Efficient Resource Allocation Strategy for Load Balancing in Fog Environment. IEEE Access 2020, 8, 199829 -199839.
AMA StyleAnees Ur Rehman, Zulfiqar Ahmad, Ali Imran Jehangiri, Mohammed Ala'Anzy, Mohamed Othman, Arif Iqbal Umar, Jamil Ahmad. Dynamic Energy Efficient Resource Allocation Strategy for Load Balancing in Fog Environment. IEEE Access. 2020; 8 ():199829-199839.
Chicago/Turabian StyleAnees Ur Rehman; Zulfiqar Ahmad; Ali Imran Jehangiri; Mohammed Ala'Anzy; Mohamed Othman; Arif Iqbal Umar; Jamil Ahmad. 2020. "Dynamic Energy Efficient Resource Allocation Strategy for Load Balancing in Fog Environment." IEEE Access 8, no. : 199829-199839.
The involvement application and use of crisis and emergency management and communication are increasing rapidly. This study conducts a systematic literature review to identify the development of theoretical models in the area of social media crisis communication and management. The study aims to review and analyse the relationship of social media-based crisis communication in the context of crisis informatics and its taxonomy and the related crisis communication theoretical models to derive the challenges and limitations. A total of 207 articles were selected for the evaluation based on quality, relevancy, and contribution. The findings revealed that the situational crisis communication theory (SCCT) is the most dominant theory, followed by social-mediated crisis communication (SMCC) and integrated crisis mapping (ICM) models. The study identified theories such as the STREMII model, social media crisis management matrix/framework (SMSMF), and an interactive crisis communication model (ICCM) as emerging models. Moreover, the result of the finding shows that stakeholder interaction is an understudied field, while information reliability and processing for decision-making purposes, the wider application of social media sites, privacy issues, and how social media interaction can improve community resilience or build stakeholders relationships remain suitable topics for future research.
Umar Ali Bukar; Marzanah A. Jabar; Fatimah Sidi; Rozi Nor Haizan Binti Nor; Salfarina Abdullah; Mohamed Othman. Crisis Informatics in the Context of Social Media Crisis Communication: Theoretical Models, Taxonomy, and Open Issues. IEEE Access 2020, 8, 185842 -185869.
AMA StyleUmar Ali Bukar, Marzanah A. Jabar, Fatimah Sidi, Rozi Nor Haizan Binti Nor, Salfarina Abdullah, Mohamed Othman. Crisis Informatics in the Context of Social Media Crisis Communication: Theoretical Models, Taxonomy, and Open Issues. IEEE Access. 2020; 8 (99):185842-185869.
Chicago/Turabian StyleUmar Ali Bukar; Marzanah A. Jabar; Fatimah Sidi; Rozi Nor Haizan Binti Nor; Salfarina Abdullah; Mohamed Othman. 2020. "Crisis Informatics in the Context of Social Media Crisis Communication: Theoretical Models, Taxonomy, and Open Issues." IEEE Access 8, no. 99: 185842-185869.
This article exploits the recent advances in wireless energy harvesting to develop a framework for the outage probability of energy harvesting underlay cognitive radio networks. In this model, $N$ -hop primary users are equipped with constant energy source while secondary users (SUs) harvest energy from the transmissions of primary devices. The transmit power of secondary users is regulated to ensure that it does not violate the target end-to-end outage probability constraint of the $N$ -hop primary network. Potential relays that have harvested sufficient energy are eligible to relay data for other SUs within the network. Using this model, we reveal the impacts of the number of primary hops on the relay selection region and harvested energy. An expression for the total outage probability that encapsulates the impact of $N$ primary hops is also derived. Moreover, the effects of other relevant parameters on the outage probability are shown in detail.
Oluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. Outage Analysis of Energy-Harvesting-Based Relay-Assisted Random Underlay Cognitive Radio Networks With Multihop Primary Transmissions. IEEE Systems Journal 2020, 15, 3871 -3880.
AMA StyleOluwatosin Ahmed Amodu, Mohamed Othman, Nor Kamariah Noordin, Idawaty Ahmad. Outage Analysis of Energy-Harvesting-Based Relay-Assisted Random Underlay Cognitive Radio Networks With Multihop Primary Transmissions. IEEE Systems Journal. 2020; 15 (3):3871-3880.
Chicago/Turabian StyleOluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. 2020. "Outage Analysis of Energy-Harvesting-Based Relay-Assisted Random Underlay Cognitive Radio Networks With Multihop Primary Transmissions." IEEE Systems Journal 15, no. 3: 3871-3880.
IEEE 802.11n standard is deployed virtually everywhere: on residences, offices, university campuses, and even market places. However, throughput obtained by end users have not measured up to the speed range of between 100 and 600 Mbps stipulated in the standard due to the Physical (PHY) technology involved and timing headers at the Media access control (MAC). To overcome this, two frames aggregation schemes, namely, A-MSDU and A-MPDU were introduced as a means of utilizing channel efficiency at the MAC through amortization of the overheads over multiple frames. However, there are still issues with additional headers from aggregating frames. We know that A-MSDU performs well in clear channels and small aggregation sizes but poorly with increasing channel error and larger aggregation sizes, while the opposite is true for A-MPDU. Thus, several authors exploited their complimentary efficiencies to derive two-level aggregation schemes, resulting in higher throughput, headers reduction, and channel utilization. However, these gains are totally eroded at SNR of 19 dB and below. Using NS3 discrete event simulator, we therefore propose a two-level frame aggregation scheme that utilizes the enhanced A-MSDU and A-MPDU, using appropriate algorithm depending on the SNR value. Our work increased the SNR range for throughput performance by 37.5%; increased channel utilization by 40%, 36%, and 31% at SNR variants of 19 dB, 17 dB, and 16 dB respectively.
Aloysius Chris Akpanobong; Mohamed Othman; Godwin O. Ansa. Extending Throughput Performance for Low SNR Scenarios in WLANs Using Two-Level Frames Aggregation with Enhanced A-MSDU. Wireless Personal Communications 2020, 115, 1695 -1710.
AMA StyleAloysius Chris Akpanobong, Mohamed Othman, Godwin O. Ansa. Extending Throughput Performance for Low SNR Scenarios in WLANs Using Two-Level Frames Aggregation with Enhanced A-MSDU. Wireless Personal Communications. 2020; 115 (2):1695-1710.
Chicago/Turabian StyleAloysius Chris Akpanobong; Mohamed Othman; Godwin O. Ansa. 2020. "Extending Throughput Performance for Low SNR Scenarios in WLANs Using Two-Level Frames Aggregation with Enhanced A-MSDU." Wireless Personal Communications 115, no. 2: 1695-1710.
Mehrnaz Moudi; Mohamed Othman. On the relation between network throughput and delay curves. Automatika 2020, 61, 415 -424.
AMA StyleMehrnaz Moudi, Mohamed Othman. On the relation between network throughput and delay curves. Automatika. 2020; 61 (3):415-424.
Chicago/Turabian StyleMehrnaz Moudi; Mohamed Othman. 2020. "On the relation between network throughput and delay curves." Automatika 61, no. 3: 415-424.
Delivering optimum performance on a parallel computer is highly dependant on the efficiency of the scheduling and mapping procedure. If the composition of the parallel application is known a prior, the mapping can be accomplished statically on the compilation time. The mapping algorithm uses the model of the parallel application and maps its tasks to processors in a way to minimize the total execution time. In this paper, current modelling approaches have discussed. Later, a new modelling schema named Model of Exascale Message-Passing Programs on Heterogeneous Architectures (MEMPHA) has proposed. A comparative study has been performed between MEMPHA and existing models. To exhibit the efficiency of the MEMPHA, experiments have performed on a set of data-set hypergraphs. The results obtained from the experiments show that deploying the MEMPHA helps to optimize metrics, including the congestion, total communication volume and maximum volume of data being sent or received. These improvements vary from 76 % to 1 %, depending on the metric and benchmark model. Moreover, MEMPHA supports the modelling of applications with multiple producers for a single data transmission, where the rest of the approaches fail.
Sina Zangbari Koohi; Nor Asilah Wati Abdul Hamid; Mohamed Othman; Gafurjan Ibragimov; Ibragimov Gafurjan. MEMPHA: Model of Exascale Message-Passing Programs on Heterogeneous Architectures. IEEE Transactions on Parallel and Distributed Systems 2020, 31, 2570 -2581.
AMA StyleSina Zangbari Koohi, Nor Asilah Wati Abdul Hamid, Mohamed Othman, Gafurjan Ibragimov, Ibragimov Gafurjan. MEMPHA: Model of Exascale Message-Passing Programs on Heterogeneous Architectures. IEEE Transactions on Parallel and Distributed Systems. 2020; 31 (11):2570-2581.
Chicago/Turabian StyleSina Zangbari Koohi; Nor Asilah Wati Abdul Hamid; Mohamed Othman; Gafurjan Ibragimov; Ibragimov Gafurjan. 2020. "MEMPHA: Model of Exascale Message-Passing Programs on Heterogeneous Architectures." IEEE Transactions on Parallel and Distributed Systems 31, no. 11: 2570-2581.
Underwater wireless sensor network (UWSN) is the enabling technology for a new era of underwater monitoring and actuation applications. Although acoustic communication has been investigated for decades, however, that mainly focuses on the physical layer and its related issues like low bandwidth and considerable propagation delay. Apart from physical layer issues, the data aggregation and forwarding are also intensely constrained due to channel impairment and which needs due consideration. One way to improve data collection is the routing protocol. Opportunistic Routing (OR) is an advanced technique that can improve the data collection process of a wireless network, specifically the acoustic network. In this paper we propose a normalized advancement based opportunistic routing protocol, called NA-TORA. In NA-TORA the Expected Transmission Count (ETX) is used along with considering node energy consumption for data transmission to insure packet delivery. In UWSN data collection and forwarding process is also adversely affected by void nodes in a routing path. Avoiding void nodes in data forwarding route is a quite challenging task in UWSN due to node mobility and three-dimensional localization. In this paper, we have implemented a void node detection and avoiding mechanism on NA-TORA called NA-TORA with VA, which has been proposed to overcome the problem of void nodes in the data forwarding route. Comprehensive simulations were performed to compare the performance of NA-TORA and NA-TORA with VA with some well-known existing routing protocols. The outcome of the proposed scheme simulation is substantial in different performance evaluation parameters, such as energy consumption and data delivery ratio.
Ziaur Rahman; Fazirulhisyam Hashim; Mohd Fadlee A. Rasid; Mohamed Othman; Kamal Ali Alezabi. Normalized Advancement Based Totally Opportunistic Routing Algorithm With Void Detection and Avoiding Mechanism for Underwater Wireless Sensor Network. IEEE Access 2020, 8, 67484 -67500.
AMA StyleZiaur Rahman, Fazirulhisyam Hashim, Mohd Fadlee A. Rasid, Mohamed Othman, Kamal Ali Alezabi. Normalized Advancement Based Totally Opportunistic Routing Algorithm With Void Detection and Avoiding Mechanism for Underwater Wireless Sensor Network. IEEE Access. 2020; 8 (99):67484-67500.
Chicago/Turabian StyleZiaur Rahman; Fazirulhisyam Hashim; Mohd Fadlee A. Rasid; Mohamed Othman; Kamal Ali Alezabi. 2020. "Normalized Advancement Based Totally Opportunistic Routing Algorithm With Void Detection and Avoiding Mechanism for Underwater Wireless Sensor Network." IEEE Access 8, no. 99: 67484-67500.
The divisible load theory (DLT) is a paradigm in the area of distributed and parallel computing. As a matter of fact, the computations and communications can be divided into some independent part in which each part can be executed separately by a processor. The problem that the processors may cheat the algorithm has examined the divisible load theory. However, the computation rate cheating issue may appear if the processors accomplish their fraction of loads with various rates. According to the literature, if the processors do not report their true computation rates, they can not obtain optimal performance. This paper focuses on this problem. This paper proposes an AHP-based divisible load scheduling method aiming to decrease the impacts of cheating on the efficiency of divisible load scheduling. The experimental results indicate the proposed method considerably reduce the impacts of cheating on the startup time, speedup, and makespan specially when a huge number of processors cheat the algorithm.
Shamsollah Ghanbari; Mohamed Othman. Reducing the Effects of Time Cheating on the Performance of Divisible Load Scheduling Using Analytical Hierarchy Process. Advances in Intelligent Systems and Computing 2019, 403 -416.
AMA StyleShamsollah Ghanbari, Mohamed Othman. Reducing the Effects of Time Cheating on the Performance of Divisible Load Scheduling Using Analytical Hierarchy Process. Advances in Intelligent Systems and Computing. 2019; ():403-416.
Chicago/Turabian StyleShamsollah Ghanbari; Mohamed Othman. 2019. "Reducing the Effects of Time Cheating on the Performance of Divisible Load Scheduling Using Analytical Hierarchy Process." Advances in Intelligent Systems and Computing , no. : 403-416.
This research aims to experiment the Modified Accelerated Overrelaxation (MAOR) scheme on second order iterative method for solving two dimensional (2D) Helmholtz Equation. The equation is discretized using the standard second order (Full Sweep) finite difference method. Previous well known relaxation schemes includes the Gauss-Seidel (GS), Successive Overrelaxation (SOR), Modified SOR (MSOR) and Accelerated Overrelaxation (AOR) schemes. These schemes has at most two relaxation parameter while the MAOR scheme have more than two. Several numerical experiments were conducted on two different equations to test the feasibility and the superiority of the MAOR scheme compared to the previous schems on different mesh size.
N A Syafiq; M Othman; N Senu; F Ismail. An experimental study of the modified accelerated overrelaxation (MAOR) scheme on stationary helmholtz equation. Journal of Physics: Conference Series 2019, 1366, 012093 .
AMA StyleN A Syafiq, M Othman, N Senu, F Ismail. An experimental study of the modified accelerated overrelaxation (MAOR) scheme on stationary helmholtz equation. Journal of Physics: Conference Series. 2019; 1366 (1):012093.
Chicago/Turabian StyleN A Syafiq; M Othman; N Senu; F Ismail. 2019. "An experimental study of the modified accelerated overrelaxation (MAOR) scheme on stationary helmholtz equation." Journal of Physics: Conference Series 1366, no. 1: 012093.
Two trending technologies envisaged to provide huge prospects towards the realization of the fifth generation cellular systems are device-to-device (D2D) and machine-to-machine (M2M) communications. D2D facilitates direct connectivity between devices in proximity while M2M facilitates autonomous communication of smart devices. Since a massive number of M2M devices are set to be deployed in the future, this paper conceptualizes that M2M devices can relay data for D2D devices which are not in proximity. In this context, a probabilistic model is introduced for modelling the availability of M2M devices. Thorough investigations are made on transmission capacity (TC), TC gains and trade-offs involved with respect to both underlay and D2D-overlay modes. Using stochastic geometry, we derive the successful transmission probabilities for all associated links to determine the TCs in these scenarios and present computable expressions for the TC gains achieved. Furthermore, an exposition is provided on how the density and transmit power of MTDs in the network affect the D2D TC performance.
Oluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. Transmission capacity analysis of relay-assisted D2D cellular networks with M2M coexistence. Computer Networks 2019, 164, 106887 .
AMA StyleOluwatosin Ahmed Amodu, Mohamed Othman, Nor Kamariah Noordin, Idawaty Ahmad. Transmission capacity analysis of relay-assisted D2D cellular networks with M2M coexistence. Computer Networks. 2019; 164 ():106887.
Chicago/Turabian StyleOluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. 2019. "Transmission capacity analysis of relay-assisted D2D cellular networks with M2M coexistence." Computer Networks 164, no. : 106887.
Leader election is a classical problem in distributed system applications. There are many leader election algorithms, but we focus here on Bully Algorithm (BA). The main drawback of BA algorithm is the high number of messages passing. In BA algorithm, the message passing has order O (\(n^2\)) that increases heavy traffic on the network. In this paper, an Adaptive BA (ABA) is proposed to reduce the number of messages and make the leader election operation more flexible and safer. The proposed algorithm is based on the Highest Process Identification (HPI) and the Next HPI (NHPI) to facilitate the leader election operation. Moreover, the repetition of the leader election is stopped when the candidate coordinator fails. Our analytical equations show that the ABA algorithm is more efficient rather than BA algorithm, in both, the number of message passing and the latency, and the message passing complexity decreased to O(n).
Monir Abdullah; Ibrahim Al-Kohali; Mohamed Othman. An Adaptive Bully Algorithm for Leader Elections in Distributed Systems. Algorithms and Data Structures 2019, 373 -384.
AMA StyleMonir Abdullah, Ibrahim Al-Kohali, Mohamed Othman. An Adaptive Bully Algorithm for Leader Elections in Distributed Systems. Algorithms and Data Structures. 2019; ():373-384.
Chicago/Turabian StyleMonir Abdullah; Ibrahim Al-Kohali; Mohamed Othman. 2019. "An Adaptive Bully Algorithm for Leader Elections in Distributed Systems." Algorithms and Data Structures , no. : 373-384.
Device-to-Device (D2D) communication is one of the technologies on the spotlight for enhancing the cellular network performance towards the fifth generation wireless systems. It has diverse potentials to cater for both critical and non-critical applications. For example, timely information dissemination can be achieved during disasters using D2D communication. Also, content sharing and real-time applications can be effectively facilitated. Recently, new applications and technologies are beginning to embrace D2D to further improve their performance in terms of spectral efficiency, latency, and energy efficiency. However, this is not bereft of technical challenges due to the peculiar limitations of traditional D2D communication such as interference. In this paper, we focus on techniques for managing these challenges with regards to mode selection, power control, and resource allocation. As compared with other contemporary works on this subject, we discuss these issues in line with some of the most recent research trends. In addition, we compile pertinent design considerations of D2D discussed in literature while extracting new patterns to familiarize readers with applications, models, methods and metrics studied lately. Furthermore, we highlight and classify some of the key challenges of D2D communication with respect to current and future generation cellular technologies.
Oluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. A primer on design aspects, recent advances, and challenges in cellular device-to-device communication. Ad Hoc Networks 2019, 94, 101938 .
AMA StyleOluwatosin Ahmed Amodu, Mohamed Othman, Nor Kamariah Noordin, Idawaty Ahmad. A primer on design aspects, recent advances, and challenges in cellular device-to-device communication. Ad Hoc Networks. 2019; 94 ():101938.
Chicago/Turabian StyleOluwatosin Ahmed Amodu; Mohamed Othman; Nor Kamariah Noordin; Idawaty Ahmad. 2019. "A primer on design aspects, recent advances, and challenges in cellular device-to-device communication." Ad Hoc Networks 94, no. : 101938.