arXiv subjects

Abolfazl Razi

Publications and source records attributed to Abolfazl Razi.

80 records · Page 5Linked to original sources

arXiv2018

Distributed Cooperative Spectrum Sharing in UAV Networks Using Multi-Agent Reinforcement Learning

In this paper, we develop a distributed mechanism for spectrum sharing among a network of unmanned aerial vehicles (UAV) and licensed terrestrial networks. This method can provide a practical solution for situations where the UAV network may need external spectrum when dealing with congested spectrum or need to change its operating frequency due to security threats. Here we study a scenario where the UAV network performs a remote sensing mission. In this model, the UAVs are categorized into two clusters of relaying and sensing UAVs. The relay UAVs provide a relaying service for a licensed network to obtain spectrum access for the rest of UAVs that perform the sensing task. We develop a distributed mechanism in which the UAVs locally decide whether they need to participate in relaying or sensing considering the fact that communications among UAVs may not be feasible or reliable. The UAVs learn the optimal task allocation using a distributed reinforcement learning algorithm. Convergence of the algorithm is discussed and simulation results are presented for different scenarios to verify the convergence.

cs.MA↗

arXiv2018

Predictive Modeling of Biomedical Signals Using Controlled Spatial Transformation

An important paradigm in smart health is developing diagnosis tools and monitoring a patient's heart activity through processing Electrocardiogram (ECG) signals is a key example, sue to high mortality rate of heart-related disease. However, current heart monitoring devices suffer from two important drawbacks: i) failure in capturing inter-patient variability, and ii) incapability of identifying heart abnormalities ahead of time to take effective preventive and therapeutic interventions. This paper proposed a novel predictive signal processing method to solve these issues. We propose a two-step classification framework for ECG signals, where a global classifier recognizes severe abnormalities by comparing the signal against a universal reference model. The seemingly normal signals are then passed through a personalized classifier, to recognize mild but informative signal morphology distortions. The key idea is to develop a novel deviation analysis based on a controlled nonlinear transformation to capture significant deviations of the signal towards any of predefined abnormality classes. Here, we embrace the proven but overlooked fact that certain features of ECG signals reflect underlying cardiac abnormalities before the occurrences of cardiac disease. The proposed method achieves a classification accuracy of 96.6% and provides a unique feature of predictive analysis by providing warnings before critical heart conditions. In particular, the chance of observing a severe problem (a red alarm) is raised by about 5% to 10% after observing a yellow alarm of the same type. Although we used this methodology to provide early precaution messages to elderly and high-risk heart-patients, the proposed method is general and applicable to similar bio-medical signal processing applications.

eess.SP↗

arXiv2018

A Unified Framework for Joint Mobility Prediction and Object Profiling of Drones in UAV Networks

In recent years, using a network of autonomous and cooperative unmanned aerial vehicles (UAVs) without command and communication from the ground station has become more imperative, in particular in search-and-rescue operations, disaster management, and other applications where human intervention is limited. In such scenarios, UAVs can make more efficient decisions if they acquire more information about the mobility, sensing and actuation capabilities of their neighbor nodes. In this paper, we develop an unsupervised online learning algorithm for joint mobility prediction and object profiling of UAVs to facilitate control and communication protocols. The proposed method not only predicts the future locations of the surrounding flying objects, but also classifies them into different groups with similar levels of maneuverability (e.g. rotatory, and fixed-wing UAVs) without prior knowledge about these classes. This method is flexible in admitting new object types with unknown mobility profiles, thereby applicable to emerging flying Ad-hoc networks with heterogeneous nodes.

cs.NI↗

arXiv2018

On Greedy Routing in Dynamic UAV Networks

Unmanned aerial vehicles (UAVs), commonly known as drones, are becoming increasingly popular for various applications. Freely flying drones create highly dynamic environments, where conventional routing algorithms which rely on stationary network contact graphs fail to perform efficiently. Also, link establishment through exploring optimal paths using hello messages (as is used in AODV algorithm) deems extremely inefficient and costly for rapidly changing network topologies. In this paper, we present a distance-based greedy routing algorithm for UAV networks solely based on UAVs' local observations of their surrounding subnetwork. Thereby, neither a central decision maker nor a time-consuming route setup and maintenance mechanism are required. To evaluate the proposed method, we derive an analytical bound for the expected number of hops that a packet traverses. Also, we find the expected end-to-end distance traveled by each packet as well as the probability of successful delivery. The simulation results verify the accuracy of the developed analytical expressions and show considerable improvement compared to centralized shortest path routing algorithms.

cs.NI↗

arXiv2017

A Coalition Formation Approach to Coordinated Task Allocation in Heterogeneous UAV Networks

The problem of adversary target detection and the subsequent task completion using a heterogeneous network of resource-constrained UAVs is considered. No prior knowledge about locations and required resources to identify these targets is available to the UAVs. In the proposed leader-follower coalition formation model, the UAV that first locates a target serves as the coalition leader and selects a group of follower UAVs to complete the task associated with the identified target. The goal of the coalition formation is to complete the designated tasks with minimal resource utilization. Another role of coalition members is to make the ground station aware of the detected adversary target by forwarding its signal to the station via a distributed cooperative relaying scheme. We also propose a reputation-based mechanism for coalition formation to monitor the cooperative behavior of the UAVs over the course of time and exclude potentially untrustworthy UAVs. Simulation results show the efficiency of the proposed method in forming optimal coalitions compared to alternative methods.

cs.MA↗

arXiv2017

Optimal Measurement Policy for Predicting UAV Network Topology

In recent years, there has been a growing interest in using networks of Unmanned Aerial Vehicles (UAV) that collectively perform complex tasks for diverse applications. An important challenge in realizing UAV networks is the need for a communication platform that accommodates rapid network topology changes. For instance, a timely prediction of network topology changes can reduce communication link loss rate by setting up links with prolonged connectivity. In this work, we develop an optimal tracking policy for each UAV to perceive its surrounding network configuration in order to facilitate more efficient communication protocols. More specifically, we develop an algorithm based on particle swarm optimization and Kalman filtering with intermittent observations to find a set of optimal tracking policies for each UAV under time-varying channel qualities and constrained tracking resources such that the overall network estimation error is minimized.

eess.SY↗

arXiv2015

A Shapley Value Solution to Game Theoretic-based Feature Reduction in False Alarm Detection

False alarm is one of the main concerns in intensive care units and can result in care disruption, sleep deprivation, and insensitivity of care-givers to alarms. Several methods have been proposed to suppress the false alarm rate through improving the quality of physiological signals by filtering, and developing more accurate sensors. However, significant intrinsic correlation among the extracted features limits the performance of most currently available data mining techniques, as they often discard the predictors with low individual impact that may potentially have strong discriminatory power when grouped with others. We propose a model based on coalition game theory that considers the inter-features dependencies in determining the salient predictors in respect to false alarm, which results in improved classification accuracy. The superior performance of this method compared to current methods is shown in simulation results using PhysionNet's MIMIC II database.

cs.CV↗

arXiv2015

Channel-Adaptive Packetization Policy for Minimal Latency and Maximal Energy Efficiency

This article considers the problem of delay optimal bundling of the input symbols into transmit packets in the entry point of a wireless sensor network such that the link delay is minimized under an arbitrary arrival rate and a given channel error rate. The proposed policy exploits the variable packet length feature of contemporary communications protocols in order to minimize the link delay via packet length regularization. This is performed through concrete characterization of the end-to-end link delay for zero error tolerance system with First Come First Serve (FCFS)queuing discipline and Automatic Repeat Request (ARQ) retransmission mechanism. The derivations are provided for an uncoded system as well as a coded system with a given bit error rate. The proposed packetization policy provides an optimal packetization interval that minimizes the end-to-end delay for a given channel with certain bit error probability. This algorithm can also be used for near-optimal bundling of input symbols for dynamic channel conditions provided that the channel condition varies slowly over time with respect to symbol arrival rate. This algorithm complements the current network-based delay-optimal routing and scheduling algorithms in order to further reduce the end-to-end delivery time. Moreover, the proposed method is employed to solve the problem of energy efficiency maximization under an average delay constraint by recasting it as a convex optimization problem.

cs.NI↗