Papers by Mohammad Hayajneh

Sensors
Breathing monitoring is an efficient way of human health sensing and predicting numerous diseases... more Breathing monitoring is an efficient way of human health sensing and predicting numerous diseases. Various contact and non-contact-based methods are discussed in the literature for breathing monitoring. Radio frequency (RF)-based breathing monitoring has recently gained enormous popularity among non-contact methods. This method eliminates privacy concerns and the need for users to carry a device. In addition, such methods can reduce stress on healthcare facilities by providing intelligent digital health technologies. These intelligent digital technologies utilize a machine learning (ML)-based system for classifying breathing abnormalities. Despite advances in ML-based systems, the increasing dimensionality of data poses a significant challenge, as unrelated features can significantly impact the developed system’s performance. Optimal feature scoring may appear to be a viable solution to this problem, as it has the potential to improve system performance significantly. Initially, in ...
Towards a 3-tiered space-air-ground network with reinforcement learning
Journal of King Saud University - Computer and Information Sciences, 2022

Sensors, Jan 7, 2022
Edge Computing (EC) is a new architecture that extends Cloud Computing (CC) services closer to da... more Edge Computing (EC) is a new architecture that extends Cloud Computing (CC) services closer to data sources. EC combined with Deep Learning (DL) is a promising technology and is widely used in several applications. However, in conventional DL architectures with EC enabled, data producers must frequently send and share data with third parties, edge or cloud servers, to train their models. This architecture is often impractical due to the high bandwidth requirements, legalization, and privacy vulnerabilities. The Federated Learning (FL) concept has recently emerged as a promising solution for mitigating the problems of unwanted bandwidth loss, data privacy, and legalization. FL can co-train models across distributed clients, such as mobile phones, automobiles, hospitals, and more, through a centralized server, while maintaining data localization. FL can therefore be viewed as a stimulating factor in the EC paradigm as it enables collaborative learning and model optimization. Although the existing surveys have taken into account applications of FL in EC environments, there has not been any systematic survey discussing FL implementation and challenges in the EC paradigm. This paper aims to provide a systematic survey of the literature on the implementation of FL in EC environments with a taxonomy to identify advanced solutions and other open problems. In this survey, we review the fundamentals of EC and FL, then we review the existing related works in FL in EC. Furthermore, we describe the protocols, architecture, framework, and hardware requirements for FL implementation in the EC environment. Moreover, we discuss the applications, challenges, and related existing solutions in the edge FL. Finally, we detail two relevant case studies of applying FL in EC, and we identify open issues and potential directions for future research. We believe this survey will help researchers better understand the connection between FL and EC enabling technologies and concepts.

Cornell University - arXiv, Mar 31, 2013
Rate outage probability is an important performance metric to measure the level of quality of ser... more Rate outage probability is an important performance metric to measure the level of quality of service (QoS) in the Generation (4G) broadband access networks. Thus, in this paper, we calculate a closed form expression of the rate outage probability for a given user in a down-link multi-hop OFDMAbased system encountered as a result of links' channel variations. The channel random behavior on different subcarriers allocated to a given user is assumed to follow independent non-identical Nakagami-m distributions. Besides the rate outage probability formulas for single hop and multihop networks, we also derive a novel closed form formulas for the moment generating function, probability distribution function (pdf), and the cumulative distribution function (cdf) of a product of independent non-identical Gamma distributed random variables (RVs). These RVs are functions of the attainable signal-to-noise power ratio (SNR) on the allocated group of subcarriers. For single-hop scenario, inspired by the rate outage probability closed formula, we formulate an optimization problem in which we allocate subcarriers to users such that the total transmission rate is maximized while catering for fairness for all users. In the proposed formulation, fairness is considered by guaranteeing a minimum rate outage probability for each admitted user.

The paper addresses developing a team of aerial and ground robots to accomplish multi-robot syste... more The paper addresses developing a team of aerial and ground robots to accomplish multi-robot system navigation task in an accessible way. The motions of two different robotic structures, namely quadcopter, and differential drive mobile robots are simulated and controlled. Two-level controller has been adopted for the multi-robot system. A low-level controller is utilized for each robotic platform to insure its motion stability and robustness. Then, a formulation of high-level tracking controller is presented to allow each robot to avoid obstacles in a dynamic environment and to organize its motion with other flying/ground robots. The performance of the proposed system is demonstrated in a simulation environment. A modeling platform is adopted to construct the simulation environment, which allows the user to easily adjust the models and controller parameters as well as to implement different control algorithms. In addition, the simulation environment helps in analyzing the obtained re...

International Journal of Computers Communications & Control, 2017
We propose a game theoretic non-cooperative algorithm to optimize theinduced outage probability i... more We propose a game theoretic non-cooperative algorithm to optimize theinduced outage probability in an uplink cellular interference limited wireless Rayleighand Nakagami fading channels. We achieve this target by maximizing the certaintyequivalent margin (CEM). We derive a closed-form formula of the outage probabilityin Nakagami flat-fading channels, then we show that minimizing the induced outagefading probability for both Rayleigh and Nakagami channels is equivalent to maxi-mizing CEM. We present a non-cooperative power control algorithm using the gametheory framework. Through this non-cooperative game, we argue that the best de-cision in such an environment is for all users to transmit at the minimum power intheir corresponding strategy profiles. This finding considerably simplifies the imple-mentation of the proposed game.

IEEE Access, 2020
Device-to-device (D2D) communications is a cell-free enabler of 5G and rising wireless communicat... more Device-to-device (D2D) communications is a cell-free enabler of 5G and rising wireless communications demand between low-orbit satellite constellation, self-driving vehicles and unmanned aerial systems. Distributed computation (where channel state information is not available) schemes facilitate direct exchanges between mobile user equipment (UE) and if necessary a UE can serve as a relay. Thus, it is essential to develop robust D2D communications frameworks agnostic to the channel distribution which can deliver scalable data rates to self-driving vehicles while the spectral efficiency(SE) is non-asymptotic and energy consumption is increasing to yield an energy efficiency (EE) that is a unimodal function. In this paper, we evaluate the optimal EE by using the computation of the SE in distributed multiple input-multiple output (MIMO) wireless communications. A generalized water-filling framework over arbitrary channel distribution is used to evaluate the SE and then the EE to compare with single-input single-output optimized approximate schemes based on Taylor expansion. The computation yields the optimal power allocation at the transmitters which is derived to illustrate the performance gain of the generalized water-filling distributed MIMO over the approximate scheme. Our simulations results show novel achievable EE linear growth as a function of SE and robust trade-offs in performance gains determined by the total power consumption optimal profile when switching MIMO dimensions. Our trade-off prevents power consumption while EE is decreasing. Thus by switching the number of MIMO operating antenna elements at both the receiver and transmitter sides, EE is no more a unimodal function as illustrated in the literature. INDEX TERMS Autonomous systems, D2D communications, energy efficiency, MIMO systems, power control, spectral efficiency. I. INTRODUCTION Cell free concepts have been hailed to be the future of wireless communications, and technologies such as Massive multipleinput multiple-output (MIMO) and Small cell networks are being developed to back such claim. A cell-free massive MIMO system comprised of distributed access points is proposed in [1] which shows that cell-free massive MIMO can outperform small cells in terms of per user downlink throughput (Mbits/s). Command/Control and data Communications between self-driving cars constitute an embodiment of cell free and device-to-Device (D2D) communica-The associate editor coordinating the review of this manuscript and approving it for publication was Nafees Mansoor .
Journal of Infrared, Millimeter, and Terahertz Waves, 2019
The material cannot be used for any other purpose without further permission of the publisher and... more The material cannot be used for any other purpose without further permission of the publisher and is for private use only. There may be differences between this version and the published version. You are advised to consult the publisher's version if you wish to cite from it.

International Journal of Computers Communications & Control, 2015
In this paper we present a game-theoretic power control algorithms for wireless data in CDMA cell... more In this paper we present a game-theoretic power control algorithms for wireless data in CDMA cellular systems under two realistic channels: (a1) Fast flat fading channel and (a2) Slow flat fading channel. The fading coefficients under both (a1) and (a2) are studied for three appropriate small scale channel models that are used in the CDMA cellular systems: Rayleigh channel, Rician channel and Nakagami channel. This work is inspired by the results presented by [1] under nonfading channels. In other words, we study the impact of the realistic channel models on the findings in [1] through the followings: we evaluate the average utility function, the average number of bits received correctly at the receiver per one Joule expended, for each channel model. Then, using the average utility function we study the existence, uniqueness of Nash equilibrium (NE) if it exists, and the social desirability of NE in the Pareto sense. Results show that in a non-cooperative game (NPG) the best policy for all users in the cell is to target a fixed signal-to-interference and noise ratio (SINR) similar to what was shown in [1] for non-fading channel. The difference however is that the target SINR in fading channels is much higher than that in a non-fading channel. Also, for spreading gain less than or equal to 100, both NPG and non-cooperative power control game with pricing (NPGP) perform poorly, where all the terminals except the nearest one were not able to attain their corresponding minimum SINR even if sending at the maximum powers in their strategy spaces.

2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)
To quantify the diversity gain of Space-Time coding, obtained by increasing the number of transmi... more To quantify the diversity gain of Space-Time coding, obtained by increasing the number of transmit and receive antennas, in this paper we use the paradigm of random codes, modelling Space-Time codes as random matrices with zero mean, equal variance and independent entries having a common arbitrary distribution (discrete or continuous). This framework is especially convenient in this situation because: i) optimal codes are difficult to identify and, thus, are difficult to test; ii) the eigenvalues of this type of large matrices converge to a specific distribution, mostly known as the semicircle or circle law. This last observation allows us to derive closed form asymptotic expressions for the probability of error in Rayleigh and Rician fading that can be used to gain insight on how the fading and the number of antennas affect the system performance.
IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2006. (WiMob'2006)
In this paper we consider a scheme of packet scheduling for the forward link of a MIMO cellular s... more In this paper we consider a scheme of packet scheduling for the forward link of a MIMO cellular system, to increase system capacity by exploiting multiuser diversity based on spatial multiplexing (SM). The proposed scheme exhibits considerable increases in system capacity compared to commonly used schemes, while, at the same time, giving a fair chance of channel access to all users regardless of their channel fading status.

2008 IEEE International Conference on Communications, 2008
In order to support different types of user applications, the IEEE 802.16 standard defines differ... more In order to support different types of user applications, the IEEE 802.16 standard defines different service classes together with their associated Quality of Service (QoS) parameters. However, the standard lacks a MAC scheduling architecture that guarantees these defined QoS requirements. The importance of efficient scheduling is crucial to QoS provisioning for multimedia flows. In this paper we propose an opportunistic and optimized downlink scheduler that pledges fairness among admitted connections. Our approach involves separating the scheduling problem into two sub-problems. In the first problem, the proposed scheduler calculates the number of time-slots in each time frame corresponding to the service classes with the objective minimizing the blocking probability of each class. In the second problem, time-slots for each class connection are allocated using an integrated cross-layer priority functions that guarantee proportional fairness. The simulation results reveal that the proposed scheduler realizes our objectives, and provides efficient QoS scheduling without starving the connections of the best effort class.
2008 International Wireless Communications and Mobile Computing Conference, 2008
WiMAX is receiving growing attention as a reliable contender for broadband network applications. ... more WiMAX is receiving growing attention as a reliable contender for broadband network applications. Therefore, it is important to develop measures and benchmarks for the performance of this relatively new technology. These benchmarks are intended for service providers in order to be able to plan their networks properly to ensure robust and continuous service to their networks' end users. In this paper, we develop the bounds of the probability of throughput starvation occurring within the network. This is done based on the operating conditions within the network and the level of service that is required by different network customers. We validate the resulting models via simulation experiments. We compare the results obtained through the use of our models to those obtained through experiments.
Throughput Analysis of WiMAX Based Wireless Networks
2008 IEEE Wireless Communications and Networking Conference, 2008
In this study, we derive an analytical model that determines the conditions that lead to throughp... more In this study, we derive an analytical model that determines the conditions that lead to throughput-starvation in Wimax-based networks. We limit our discussion to downlink traffic in point-to-multipoint (PMP) based networks. The objective of our model is to define the probability of a subscriber station becoming throughput starved under different operating conditions. The model also defines the probability of a subscriber station being throughput overserved under the same operating conditions. We validate the resulting model using simulation experiments.

2009 IEEE Symposium on Computers and Communications, 2009
Secure verification of neighborhood membership (SVNM) is a relatively recently stated problem tha... more Secure verification of neighborhood membership (SVNM) is a relatively recently stated problem that has an increasing number of practical applications. The problem can be stated as the capability of a wireless network node (verifier) to verify the claim by another node (claimer) that it exists within a certain physical distance from the verifier. Several physical properties of the received signal are used for onehop location estimation-signal strength, time of flight, and angle of arrival, etc. However, many of these approaches are either not practically applicable or prohibitively expensive in many wireless network scenarios. In this work, we propose algorithms to detect and isolate nodes that lie about their location in the incremental addition phase of static sensor networks. Every node should announce its position and the power level it uses for transmission. Cooperative and base station verifications are used to detect nodes that lie about their locations. Our results show that we can achieve perfect detection (100%) of nodes that falsify their location information using either high power transmission or with the help of other nodes.

Security and Communication Networks, 2009
Local monitoring has been demonstrated as a powerful technique for mitigating security attacks in... more Local monitoring has been demonstrated as a powerful technique for mitigating security attacks in multi-hop ad-hoc networks. In local monitoring, nodes overhear partial neighborhood communication to detect misbehavior such as packet drop or delay. However, local monitoring as presented in the literature is vulnerable to a class of attacks that we introduce here called stealthy packet dropping. Stealthy packet dropping disrupts the packet from reaching the destination by malicious behavior at an intermediate node. However, the malicious node gives the impression to its neighbors that it performed the legitimate forwarding action. Moreover, a legitimate node comes under suspicion. We introduce four ways of achieving stealthy packet dropping, none of which is currently detectable. We provide a protocol called DISA, based on local monitoring, to remedy each attack. DISA incorporates two techniqueshaving the neighbors maintain additional information about the routing path, and adding some checking responsibility to each neighbor. We show through analysis and simulation that basic local monitoring (BLM) fails to efficiently mitigate any of the presented attacks while DISA successfully mitigates them.
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008
Congestion based pricing algorithms are considered efficient approaches to control congestion and... more Congestion based pricing algorithms are considered efficient approaches to control congestion and to distinguish services provided for users in computer networks. Game theory lends itself as a prevailing tool to design such algorithms. In this work, we propose a game theoretic congestion based bandwidth provisioning algorithm to address the scarcity for bandwidth provisioning scheme in IEEE 802.16 standard. To the best of our knowledge, the proposed algorithm is the first one to simultaneously control congestion and fairness while providing differentiated QoS guarantees. Simulation results reveal that the proposed scheme realizes our objective of controlling congestion, and provides differentiated QoS guarantees and proportional fairness among the different network classes.

Wireless Communications and Mobile Computing, 2010
In this study, we develop a fully distributed routing protocol for OFDMA-based multihop broadband... more In this study, we develop a fully distributed routing protocol for OFDMA-based multihop broadband wireless access (BWA) networks such as those of IEEE 802.16j. We refer to this protocol as the DCLRRA protocol. DCLRRA is based on autonomous resource allocation schemes that we also derive in this paper. The routing protocol's selection of the proper resource allocation scheme is based on whether the relay stations (RSs) are nomadic or stationary. While we develop the autonomous resource allocation schemes, we exploit the multiuser capabilities of the OFDMA physical layer. This allows simultaneous data transmission sessions within the same neighborhood while offering a total elimination of interference between transmitting nodes. The direct result of this strategy is increased throughput with high utilization of the communication channel. We examine our routing technique to show its performance merits through extensive simulations.

Sensors, 2013
The Internet of Things (IoT) is a networking paradigm where interconnected, smart objects continu... more The Internet of Things (IoT) is a networking paradigm where interconnected, smart objects continuously generate data and transmit it over the Internet. Much of the IoT initiatives are geared towards manufacturing low-cost and energy-efficient hardware for these objects, as well as the communication technologies that provide objects interconnectivity. However, the solutions to manage and utilize the massive volume of data produced by these objects are yet to mature. Traditional database management soluti ons fall short in satisfying the sophisticated application needs of an IoT network that has a truly global-scale. Current solutions for IoT data management address partial aspects of the IoT environment with special focus on sensor networks. In this paper, we survey the data management solutions that are proposed for IoT or subsystems of the IoT. We highlight the distinctive design primitives that we believe should be addressed in an IoT data management solution, and discuss how they are approached by the proposed solutions. We finally propose a data management framework for IoT that takes into consideration the discussed design elements and acts as a seed to a comprehensive IoT data management solution. The framework we propose adapts a federated, data-and sources-centric approach to link the diverse Things with their abundance of data to the potential applications and services that are envisioned for IoT.
International Journal of Teaching and Case Studies, 2009
This paper presents the findings of a formal experiment aiming to assess the effect of question t... more This paper presents the findings of a formal experiment aiming to assess the effect of question type on the performance of students. The experiment was complemented by a survey given to students to express their views on the subject matter. Analysis of quantitative results of the experiment revealed that students at entry-level performed better in MCQs, while junior and senior students performed better in ETQs. Analysis of the qualitative results gathered through the survey revealed that students at all levels prefer MCQs in exams but believe understanding and achievement of learning outcomes can only be done through ETQs.
Uploads
Papers by Mohammad Hayajneh