This page has only limited features, please log in for full access.
The unpredictable situation from the Coronavirus (COVID-19) globally and the severity of the third wave has resulted in the entire world being quarantined from one another again. Self-quarantine is the only existing solution to stop the spread of the virus when vaccination is under trials. Due to COVID-19, individuals may have difficulties in breathing and may experience cognitive impairment, which results in physical and psychological health issues. Healthcare professionals are doing their best to treat the patients at risk to their health. It is important to develop innovative solutions to provide non-contact and remote assistance to reduce the spread of the virus and to provide better care to patients. In addition, such assistance is important for elderly and those that are already sick in order to provide timely medical assistance and to reduce false alarm/visits to the hospitals. This research aims to provide an innovative solution by remotely monitoring vital signs such as breathing and other connected health during the quarantine. We develop an innovative solution for connected health using software-defined radio (SDR) technology and artificial intelligence (AI). The channel frequency response (CFR) is used to extract the fine-grained wireless channel state information (WCSI) by using the multi-carrier orthogonal frequency division multiplexing (OFDM) technique. The design was validated by simulated channels by analyzing CFR for ideal, additive white gaussian noise (AWGN), fading, and dispersive channels. Finally, various breathing experiments are conducted and the results are illustrated as having classification accuracy of 99.3% for four different breathing patterns using machine learning algorithms. This platform allows medical professionals and caretakers to remotely monitor individuals in a non-contact manner. The developed platform is suitable for both COVID-19 and non-COVID-19 scenarios.
Muhammad Khan; Mubashir Rehman; Ali Mustafa; Raza Shah; Xiaodong Yang. Intelligent Non-Contact Sensing for Connected Health Using Software Defined Radio Technology. Electronics 2021, 10, 1558 .
AMA StyleMuhammad Khan, Mubashir Rehman, Ali Mustafa, Raza Shah, Xiaodong Yang. Intelligent Non-Contact Sensing for Connected Health Using Software Defined Radio Technology. Electronics. 2021; 10 (13):1558.
Chicago/Turabian StyleMuhammad Khan; Mubashir Rehman; Ali Mustafa; Raza Shah; Xiaodong Yang. 2021. "Intelligent Non-Contact Sensing for Connected Health Using Software Defined Radio Technology." Electronics 10, no. 13: 1558.
This research article presents an innovative approach based on analog network coding (ANC) in conjunction with space time block coding (STBC) which is termed as space time analog network coding (STANC). The STANC investigated as an affective network coding strategy to combat the effects of shadowing and path loss in wireless networks. The another objective of this research work is to evaluate the impact of relay location on system performance in increasing shadowing effect due to increasing tall structure like multistory building in metropolitan area. The performance of the proposed system is analyzed in terms of symbol error rate (SER), STANC gain and ergodic capacity using analytical expressions. Moment generating function approach is used to drive the SER for M-PSK modulated signals. The approximate closed-form expression of ergodic capacity is presented using the derived mean and second moment for STANC based cooperative system. Rician shadowed model is used which efficiently evaluate the effect of shadowing as compared to other fading models given in the literature which is the main advantage of this model. Numerical results signify that the approximated analytical expressions derived can be effectively used for performance improvement under path loss and shadowing effect as compared to simple ANC based system.
Shujaat Ali Khan Tanoli; Ali Mustafa; Faiza Nawaz; Imran Khan; Muhammad Usman; Zuhaib Ashfaq Khan. SER and throughput analysis of space–time analog network coded relaying system over shadowed Rician fading channels. Wireless Networks 2019, 25, 5045 -5056.
AMA StyleShujaat Ali Khan Tanoli, Ali Mustafa, Faiza Nawaz, Imran Khan, Muhammad Usman, Zuhaib Ashfaq Khan. SER and throughput analysis of space–time analog network coded relaying system over shadowed Rician fading channels. Wireless Networks. 2019; 25 (8):5045-5056.
Chicago/Turabian StyleShujaat Ali Khan Tanoli; Ali Mustafa; Faiza Nawaz; Imran Khan; Muhammad Usman; Zuhaib Ashfaq Khan. 2019. "SER and throughput analysis of space–time analog network coded relaying system over shadowed Rician fading channels." Wireless Networks 25, no. 8: 5045-5056.
Designing of distributed consensus algorithms featuring accuracy, robustness, reliability, and speed of convergence is in high demand for various multi-agent applications. In this research, it has been investigated to device a novel design of distributed estimation algorithm which can tackle the problem of unreliable communication among multi-agents to achieve consensus on the average value of their initial values and must be capable of computing the total number of agents in the system under dynamically changing interaction topologies. A dynamically changing network topology is considered in this research with unreliable communication links, and four different scenarios are established to be analyzed for the proposed consensus-based distributed estimation algorithm. This study established a consensus for a dynamically changing interaction topology among agents, for addition of agents in the network with dynamically switching topology at any instant in communication, for removal of agents from the network with dynamically switching topology at any instant in communication, and for a fixed topology with link failure and a reconnection with the same agent after each iteration. The proposed algorithm paces up the rate of convergence by reducing the number of iteration, along with sure convergence of the designed algorithm using the concepts of stochastic differential equation theory, control system theory, algebraic graph theory, and algebraic matrix theory. Finally, in the end, simulation results are provided which are clear evidence to validate the effectiveness of theoretical results of the proposed algorithm in comparison to previously known consensus algorithms in terms of different performance parameters.
Ali Mustafa; Muhammad Najam Ul Islam; Salman Ahmed; Muhammad Ahsan Tufail. Unreliable communication in high-performance distributed multi-agent systems: A ingenious scheme in high computing. International Journal of Distributed Sensor Networks 2018, 14, 1 .
AMA StyleAli Mustafa, Muhammad Najam Ul Islam, Salman Ahmed, Muhammad Ahsan Tufail. Unreliable communication in high-performance distributed multi-agent systems: A ingenious scheme in high computing. International Journal of Distributed Sensor Networks. 2018; 14 (2):1.
Chicago/Turabian StyleAli Mustafa; Muhammad Najam Ul Islam; Salman Ahmed; Muhammad Ahsan Tufail. 2018. "Unreliable communication in high-performance distributed multi-agent systems: A ingenious scheme in high computing." International Journal of Distributed Sensor Networks 14, no. 2: 1.
In this research an algorithm is proposed to find the total number of agents participating in a multi agent network. Also to achieve hasten distributed average consensus in order to consider a network with reliable and unreliable communication links. Class of algorithm is considered in which fixed initial state values are assigned to all agents in the network, with the iterations they updates their initial values by communicating with their neighboring agents within a multi agent network. Algorithm with weighted matrix satisfy the convergence condition of average consensus and accelerate the method to achieve the consensus. Usually this convergence process is relatively sluggish and take moreover numerous iterations to achieve a consensus. To overcome the above issues, a new approach is proposed in order to minimize the rate of convergence. A two step algorithm has been proposed, where in step one each agent employs a linear predictor to predict future agent values. In second step the computed values are used to proceed further by the other agents to achieve consensus in order to bypass the redundant states. In the end proposed algorithm is compared with other existing consensus frameworks to strengthen the claim regarding the proposed two step algorithm which leads to escalate the rate of convergence and reduces the number of iterations.
Ali Mustafa; Muhammad Najam Ul Islam; Salman Ahmed; Muhammad Ahsan Tufail. A Novel Approach for Fast Average Consensus Under Unreliable Communication in Distributed Multi Agent Networks. Wireless Personal Communications 2018, 99, 1423 -1441.
AMA StyleAli Mustafa, Muhammad Najam Ul Islam, Salman Ahmed, Muhammad Ahsan Tufail. A Novel Approach for Fast Average Consensus Under Unreliable Communication in Distributed Multi Agent Networks. Wireless Personal Communications. 2018; 99 (4):1423-1441.
Chicago/Turabian StyleAli Mustafa; Muhammad Najam Ul Islam; Salman Ahmed; Muhammad Ahsan Tufail. 2018. "A Novel Approach for Fast Average Consensus Under Unreliable Communication in Distributed Multi Agent Networks." Wireless Personal Communications 99, no. 4: 1423-1441.
Time varying networks are a new paradigm for understanding and building distributed systems composed of various agents. Agents are autonomous systems and have two important attributes; First, they have some degree of independence in execution of their decision and deciding their next goal in order to achieve a global goal secondly, they are capable of interacting with other agents using a communication network. In this paper, an algorithm for agent counting is proposed for computing the total number of agents in a network by using graph and matrix theory. Simulation results indicates some of the control problems in distributed time varying networks and demonstrate the effectiveness of the established results for a fixed and switching topologies.
Ali Mustafa; Salman Ahmed; Najam Ul Islam; Ahsan Tufail. An Efficient Agent Scheming in Distributed Time Varying Networks. Inventive Computation and Information Technologies 2017, 16, 308 -320.
AMA StyleAli Mustafa, Salman Ahmed, Najam Ul Islam, Ahsan Tufail. An Efficient Agent Scheming in Distributed Time Varying Networks. Inventive Computation and Information Technologies. 2017; 16 ():308-320.
Chicago/Turabian StyleAli Mustafa; Salman Ahmed; Najam Ul Islam; Ahsan Tufail. 2017. "An Efficient Agent Scheming in Distributed Time Varying Networks." Inventive Computation and Information Technologies 16, no. : 308-320.
Multiple-antenna (MIMO) technology is becoming mature for wireless communications and has been incorporated into wireless broadband standards like LTE and WiFi. Basically, the more the number of antennas the transmitter/receiver is equipped with, the more the possible independent signal paths and the better the performance in terms of data rate and link reliability. Massive MIMO (also known as large-scale antenna systems, very large MIMO, hyper MIMO and full-dimension MIMO) makes a clean break with current practice through the use of a very large number of service antennas (e.g., hundreds or thousands) that are operated fully coherently and adaptively. Extra antennas help by focusing the transmission and reception of signal energy into ever-smaller regions of space. This brings huge improvements in throughput and energy efficiency, in particularly when combined with simultaneous scheduling for a large number of user terminals (e.g., tens or hundreds). This Paper focuses on the efficiency of the throughput and fairness of large MIMO. In multi-user MIMO (MU-MIMO), fewer antennas were used, so the only concern was to mitigate the interference of the users. The interference was mitigated by using zero forcing (ZF) receivers while the fairness of the system was maintained by using Rayleigh Fading channel. MU-MIMO was sufficient for only smaller number of users as the number of antennas were fixed and all the users had to be entertained within the same bandwidth. But, in Massive MIMO, along with the interference of the users, the interference of the antennas themselves is also a big concern, as, the number of antennas were increased contrary to the fixed fewer number of antennas in MU-MIMO. Rayleigh Fading channel and ZF receivers were not sufficient for increased number of users and antennas respectively. The problem of interference amongst the antennas was addressed by using regularized channel inversion receivers that increase the throughput of the system while, the fairness of the system is increased by using Nakagami-m channel.
Hasnain Arshad; A. Habib; Ali Mustafa; Bilal Khan; Saad Zahid. Pairing and Scheduling for Large Array MIMO Using Regularized Channel Inversion Receivers Over Nakagami-m Fading. Wireless Personal Communications 2017, 96, 6397 -6424.
AMA StyleHasnain Arshad, A. Habib, Ali Mustafa, Bilal Khan, Saad Zahid. Pairing and Scheduling for Large Array MIMO Using Regularized Channel Inversion Receivers Over Nakagami-m Fading. Wireless Personal Communications. 2017; 96 (4):6397-6424.
Chicago/Turabian StyleHasnain Arshad; A. Habib; Ali Mustafa; Bilal Khan; Saad Zahid. 2017. "Pairing and Scheduling for Large Array MIMO Using Regularized Channel Inversion Receivers Over Nakagami-m Fading." Wireless Personal Communications 96, no. 4: 6397-6424.