Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
60works
0followers
19topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

60 published item(s)

preprint2026arXiv

Federated Reinforcement Learning for Efficient Mobile Crowdsensing under Incomplete Information

Mobile crowdsensing (MCS) is a distributed sensing architecture that utilizes existing sensors on mobile units (MUs) to perform sensing tasks. A mobile crowdsensing platform (MCSP) publishes the sensing tasks and the MUs decide whether to participate in exchange for money. The MCS system is dynamic: the task requirements, the MUs' availability, and their available resources change over time. The MUs aim to find an efficient task participation strategy to maximize their income while the MCSP focuses on maximizing the number of completed tasks. As optimal strategies require perfect non-causal information about the MCS system, which is unavailable in realistic scenarios, the main challenge is to find an efficient task participation strategy for the MUs under incomplete information. To this end, a novel fully decentralized federated deep reinforcement learning algorithm, FDRL-PPO, is proposed. FDRL-PPO enables every MU to learn its own task participation strategy based on its experiences, available resources, and preferences, without relying on perfect non-causal information about the MCS system. To replenish their batteries, the MUs rely on energy harvesting. As a result, their available energy varies over time, leading to varying availability and fragmented learning experiences. To mitigate these challenges, the proposed approach leverages federated learning, enabling MUs to collaboratively improve their models without sharing private raw data like their own experiences. By exchanging only learned models, MUs collectively compensate for individual limitations, and find more scalable, robust, and efficient task participation strategies. Comprehensive evaluations on both synthetic and real-world datasets show that FDRL-PPO consistently outperforms benchmark algorithms in terms of task completion ratio, fairness in task completion, energy consumption, and number of conflicting proposals.

preprint2026arXiv

World Model-Enabled Causal Digital Twins for Semantic Communications in Physical AI Systems

Semantic communication has emerged as a promising paradigm for enabling goal-oriented networking. However, most existing semantic communication solutions are tailored to one-shot tasks and optimize instantaneous performance. Hence, they cannot be used to support closed-loop dynamic systems with physical artificial intelligence (AI), in which the transmitted semantics affect not only the current inference outcome but also future control actions, state evolution, and ultimately long-horizon task performance. To address this gap, this paper investigates goal-oriented semantic communications for physical AI systems with closed-loop sensing-communication-inference-control. In particular, the problem of semantic communications is formulated as a long-term return-per-bit maximization under wireless bit-budget constraints while capturing both control efficiency and communication efficiency. To solve this problem, a novel causal information value (CIV) metric is introduced to evaluate the marginal contribution of each semantic token to the expected long-term return by transmission interventions. Then, a world-model-enabled causal digital twin (WM-CDT) framework is proposed to capture the dynamics of closed-loop physical AI systems and enable counterfactual reasoning for long-horizon imagined rollouts. Based on these imagined rollouts, an actor-critic policy is trained for long-horizon agent control with high data efficiency, while the semantic token selector is trained through CIV-per-bit evaluation. Extensive simulations on an AirSim-Sionna-based unmanned aerial vehicle (UAV) navigation simulator show that the proposed WM-CDT framework achieves significant improvement in return-per-kbit and navigation success rate compared to existing reinforcement learning solutions.

preprint2025arXiv

Dynamic Strategy Adaptation in Multi-Agent Environments with Large Language Models

Large language models (LLMs) demonstrate strong reasoning abilities across mathematical, strategic, and linguistic tasks, yet little is known about how well they reason in dynamic, real-time, multi-agent scenarios, such as collaborative environments in which agents continuously adapt to each other's behavior, as in cooperative gameplay settings. In this paper, we bridge this gap by combining LLM-driven agents with strategic reasoning and real-time adaptation in cooperative, multi-agent environments grounded in game-theoretic principles such as belief consistency and Nash equilibrium. The proposed framework applies broadly to dynamic scenarios in which agents coordinate, communicate, and make decisions in response to continuously changing conditions. We provide real-time strategy refinement and adaptive feedback mechanisms that enable agents to dynamically adjust policies based on immediate contextual interactions, in contrast to previous efforts that evaluate LLM capabilities in static or turn-based settings. Empirical results show that our method achieves up to a 26\% improvement in return over PPO baselines in high-noise environments, while maintaining real-time latency under 1.05 milliseconds. Our approach improves collaboration efficiency, task completion rates, and flexibility, illustrating that game-theoretic guidance integrated with real-time feedback enhances LLM performance, ultimately fostering more resilient and flexible strategic multi-agent systems.

preprint2023arXiv

Curriculum Learning for Goal-Oriented Semantic Communications with a Common Language

Goal-oriented semantic communication will be a pillar of next-generation wireless networks. Despite significant recent efforts in this area, most prior works are focused on specific data types (e.g., image or audio), and they ignore the goal and effectiveness aspects of semantic transmissions. In contrast, in this paper, a holistic goal-oriented semantic communication framework is proposed to enable a speaker and a listener to cooperatively execute a set of sequential tasks in a dynamic environment. A common language based on a hierarchical belief set is proposed to enable semantic communications between speaker and listener. The speaker, acting as an observer of the environment, utilizes the beliefs to transmit an initial description of its observation (called event) to the listener. The listener is then able to infer on the transmitted description and complete it by adding related beliefs to the transmitted beliefs of the speaker. As such, the listener reconstructs the observed event based on the completed description, and it then takes appropriate action in the environment based on the reconstructed event. An optimization problem is defined to determine the perfect and abstract description of the events while minimizing the transmission and inference costs with constraints on the task execution time and belief efficiency. Then, a novel bottom-up curriculum learning (CL) framework based on reinforcement learning is proposed to solve the optimization problem and enable the speaker and listener to gradually identify the structure of the belief set and the perfect and abstract description of the events. Simulation results show that the proposed CL method outperforms traditional RL in terms of convergence time, task execution cost and time, reliability, and belief efficiency.

preprint2022arXiv

3TO: THz-Enabled Throughput and Trajectory Optimization of UAVs in 6G Networks by Proximal Policy Optimization Deep Reinforcement Learning

Next-generation networks need to meet ubiquitous and high data-rate demand. Therefore, this paper considers the throughput and trajectory optimization of terahertz (THz)-enabled unmanned aerial vehicles (UAVs) in the sixth-generation (6G) communication networks. In the considered scenario, multiple UAVs must provide on-demand terabits per second (TB/s) services to an urban area along with existing terrestrial networks. However, THz-empowered UAVs pose some new constraints, e.g., dynamic THz-channel conditions for ground users (GUs) association and UAV trajectory optimization to fulfill GU's throughput demands. Thus, a framework is proposed to address these challenges, where a joint UAVs-GUs association, transmit power, and the trajectory optimization problem is studied. The formulated problem is mixed-integer non-linear programming (MINLP), which is NP-hard to solve. Consequently, an iterative algorithm is proposed to solve three sub-problems iteratively, i.e., UAVs-GUs association, transmit power, and trajectory optimization. Simulation results demonstrate that the proposed algorithm increased the throughput by up to 10%, 68.9%, and 69.1% respectively compared to baseline algorithms.

preprint2022arXiv

6G for Vehicle-to-Everything (V2X) Communications: Enabling Technologies, Challenges, and Opportunities

We are on the cusp of a new era of connected autonomous vehicles with unprecedented user experiences, tremendously improved road safety and air quality, highly diverse transportation environments and use cases, as well as a plethora of advanced applications. Realizing this grand vision requires a significantly enhanced vehicle-to-everything (V2X) communication network which should be extremely intelligent and capable of concurrently supporting hyper-fast, ultra-reliable, and low-latency massive information exchange. It is anticipated that the sixth-generation (6G) communication systems will fulfill these requirements of the next-generation V2X. In this article, we outline a series of key enabling technologies from a range of domains, such as new materials, algorithms, and system architectures. Aiming for truly intelligent transportation systems, we envision that machine learning will play an instrumental role for advanced vehicular communication and networking. To this end, we provide an overview on the recent advances of machine learning in 6G vehicular networks. To stimulate future research in this area, we discuss the strength, open challenges, maturity, and enhancing areas of these technologies.

preprint2022arXiv

A Joint Learning and Communications Framework for Federated Learning over Wireless Networks

In this paper, the problem of training federated learning (FL) algorithms over a realistic wireless network is studied. In particular, in the considered model, wireless users execute an FL algorithm while training their local FL models using their own data and transmitting the trained local FL models to a base station (BS) that will generate a global FL model and send it back to the users. Since all training parameters are transmitted over wireless links, the quality of the training will be affected by wireless factors such as packet errors and the availability of wireless resources. Meanwhile, due to the limited wireless bandwidth, the BS must select an appropriate subset of users to execute the FL algorithm so as to build a global FL model accurately. This joint learning, wireless resource allocation, and user selection problem is formulated as an optimization problem whose goal is to minimize an FL loss function that captures the performance of the FL algorithm. To address this problem, a closed-form expression for the expected convergence rate of the FL algorithm is first derived to quantify the impact of wireless factors on FL. Then, based on the expected convergence rate of the FL algorithm, the optimal transmit power for each user is derived, under a given user selection and uplink resource block (RB) allocation scheme. Finally, the user selection and uplink RB allocation is optimized so as to minimize the FL loss function. Simulation results show that the proposed joint federated learning and communication framework can reduce the FL loss function value by up to 10% and 16%, respectively, compared to: 1) An optimal user selection algorithm with random resource allocation and 2) a standard FL algorithm with random user selection and resource allocation.

preprint2022arXiv

Blue Data Computation Maximization in 6G Space-Air-Sea Non-Terrestrial Networks

Non-terrestrial networks (NTN), encompassing space and air platforms, are a key component of the upcoming sixth-generation (6G) cellular network. Meanwhile, maritime network traffic has grown significantly in recent years due to sea transportation used for national defense, research, recreational activities, domestic and international trade. In this paper, the seamless and reliable demand for communication and computation in maritime wireless networks is investigated. Two types of marine user equipment (UEs), i.e., low-antenna gain and high-antenna gain UEs, are considered. A joint task computation and time allocation problem for weighted sum-rate maximization is formulated as mixed-integer linear programming (MILP). The goal is to design an algorithm that enables the network to efficiently provide backhaul resources to an unmanned aerial vehicle (UAV) and offload HUEs tasks to LEO satellite for blue data (i.e., marine user's data). To solve this MILP, a solution based on the Bender and primal decomposition is proposed. The Bender decomposes MILP into the master problem for binary task decision and subproblem for continuous-time resource allocation. Moreover, primal decomposition deals with a coupling constraint in the subproblem. Finally, numerical results demonstrate that the proposed algorithm provides the maritime UEs coverage demand in polynomial time computational complexity and achieves a near-optimal solution.

preprint2022arXiv

Common Language for Goal-Oriented Semantic Communications: A Curriculum Learning Framework

Semantic communications will play a critical role in enabling goal-oriented services over next-generation wireless systems. However, most prior art in this domain is restricted to specific applications (e.g., text or image), and it does not enable goal-oriented communications in which the effectiveness of the transmitted information must be considered along with the semantics so as to execute a certain task. In this paper, a comprehensive semantic communications framework is proposed for enabling goal-oriented task execution. To capture the semantics between a speaker and a listener, a common language is defined using the concept of beliefs to enable the speaker to describe the environment observations to the listener. Then, an optimization problem is posed to choose the minimum set of beliefs that perfectly describes the observation while minimizing the task execution time and transmission cost. A novel top-down framework that combines curriculum learning (CL) and reinforcement learning (RL) is proposed to solve this problem. Simulation results show that the proposed CL method outperforms traditional RL in terms of convergence time, task execution time, and transmission cost during training.

preprint2022arXiv

Digital Twin of Wireless Systems: Overview, Taxonomy, Challenges, and Opportunities

Future wireless services must be focused on improving the quality of life by enabling various applications, such as extended reality, brain-computer interaction, and healthcare. These applications have diverse performance requirements (e.g., user-defined quality of experience metrics, latency, and reliability) that are challenging to be fulfilled by existing wireless systems. To meet the diverse requirements of the emerging applications, the concept of a digital twin has been recently proposed. A digital twin uses a virtual representation along with security-related technologies (e.g., blockchain), communication technologies (e.g., 6G), computing technologies (e.g., edge computing), and machine learning, so as to enable the smart applications. In this tutorial, we present a comprehensive overview on digital twins for wireless systems. First, we present an overview of fundamental concepts (i.e., design aspects, high-level architecture, and frameworks) of digital twin of wireless systems. Second, a comprehensive taxonomy is devised for both different aspects. These aspects are twins for wireless and wireless for twins. For the twins for wireless aspect, we consider parameters, such as twin objects design, prototyping, deployment trends, physical devices design, interface design, incentive mechanism, twins isolation, and decoupling. On the other hand, for wireless for twins, parameters such as, twin objects access aspects, security and privacy, and air interface design are considered. Finally, open research challenges and opportunities are presented along with causes and possible solutions.

preprint2022arXiv

Downlink Interference Analysis of UAV-based mmWave Fronthaul for Small Cell Networks

In this paper, an unmanned aerial vehicles (UAV)-based heterogeneous network is studied to solve the problem of transferring massive traffic of distributed small cells to the core network. First, a detailed three-dimensional (3D) model of the downlink channel is characterized by taking into account the real antenna pattern, UAVs' vibrations, random distribution of small cell base stations (SBSs), and the position of UAVs in 3D space. Then, a rigorous analysis of interference is performed for two types pf interference: intra-cell interference and inter-cell interference. The interference analysis results are then used to derive an upper bound of outage probability on the considered system. Using numerical results show that the analytical and simulation results match one another. The results show that, in the presence of UAV's fluctuations, optimizing radiation pattern shape requires balancing an inherent tradeoff between increasing pattern gain to reduce the interference as well as to compensate large path loss at mmWave frequencies and decreasing it to alleviate the adverse effect of a UAV's vibrations. The analytical derivations enable the derivation of the optimal antenna pattern for any condition in a short time instead of using time-consuming extensive simulations.

preprint2022arXiv

Edge Continual Learning for Dynamic Digital Twins over Wireless Networks

Digital twins (DTs) constitute a critical link between the real-world and the metaverse. To guarantee a robust connection between these two worlds, DTs should maintain accurate representations of the physical applications, while preserving synchronization between real and digital entities. In this paper, a novel edge continual learning framework is proposed to accurately model the evolving affinity between a physical twin (PT) and its corresponding cyber twin (CT) while maintaining their utmost synchronization. In particular, a CT is simulated as a deep neural network (DNN) at the wireless network edge to model an autonomous vehicle traversing an episodically dynamic environment. As the vehicular PT updates its driving policy in each episode, the CT is required to concurrently adapt its DNN model to the PT, which gives rise to a de-synchronization gap. Considering the history-aware nature of DTs, the model update process is posed a dual objective optimization problem whose goal is to jointly minimize the loss function over all encountered episodes and the corresponding de-synchronization time. As the de-synchronization time continues to increase over sequential episodes, an elastic weight consolidation (EWC) technique that regularizes the DT history is proposed to limit de-synchronization time. Furthermore, to address the plasticity-stability tradeoff accompanying the progressive growth of the EWC regularization terms, a modified EWC method that considers fair execution between the historical episodes of the DTs is adopted. Ultimately, the proposed framework achieves a simultaneously accurate and synchronous CT model that is robust to catastrophic forgetting. Simulation results show that the proposed solution can achieve an accuracy of 90 % while guaranteeing a minimal desynchronization time.

preprint2022arXiv

Federated Learning on the Road: Autonomous Controller Design for Connected and Autonomous Vehicles

A new federated learning (FL) framework enabled by large-scale wireless connectivity is proposed for designing the autonomous controller of connected and autonomous vehicles (CAVs). In this framework, the learning models used by the controllers are collaboratively trained among a group of CAVs. To capture the varying CAV participation in the FL training process and the diverse local data quality among CAVs, a novel dynamic federated proximal (DFP) algorithm is proposed that accounts for the mobility of CAVs, the wireless fading channels, as well as the unbalanced and nonindependent and identically distributed data across CAVs. A rigorous convergence analysis is performed for the proposed algorithm to identify how fast the CAVs converge to using the optimal autonomous controller. In particular, the impacts of varying CAV participation in the FL process and diverse CAV data quality on the convergence of the proposed DFP algorithm are explicitly analyzed. Leveraging this analysis, an incentive mechanism based on contract theory is designed to improve the FL convergence speed. Simulation results using real vehicular data traces show that the proposed DFP-based controller can accurately track the target CAV speed over time and under different traffic scenarios. Moreover, the results show that the proposed DFP algorithm has a much faster convergence compared to popular FL algorithms such as federated averaging (FedAvg) and federated proximal (FedProx). The results also validate the feasibility of the contract-theoretic incentive mechanism and show that the proposed mechanism can improve the convergence speed of the DFP algorithm by 40% compared to the baselines.

preprint2022arXiv

Meta-Reinforcement Learning for Reliable Communication in THz/VLC Wireless VR Networks

In this paper, the problem of enhancing the quality of virtual reality (VR) services is studied for an indoor terahertz (THz)/visible light communication (VLC) wireless network. In the studied model, small base stations (SBSs) transmit high-quality VR images to VR users over THz bands and light-emitting diodes (LEDs) provide accurate indoor positioning services for them using VLC. Here, VR users move in real time and their movement patterns change over time according to their applications, where both THz and VLC links can be blocked by the bodies of VR users. To control the energy consumption of the studied THz/VLC wireless VR network, VLC access points (VAPs) must be selectively turned on so as to ensure accurate and extensive positioning for VR users. Based on the user positions, each SBS must generate corresponding VR images and establish THz links without body blockage to transmit the VR content. The problem is formulated as an optimization problem whose goal is to maximize the reliability of the VR network by selecting the appropriate VAPs to be turned on and controlling the user association with SBSs. To solve this problem, a policy gradient-based reinforcement learning (RL) algorithm that adopts a meta-learning approach is proposed. The proposed meta policy gradient (MPG) algorithm enables the trained policy to quickly adapt to new user movement patterns. In order to solve the problem of maximizing the average number of successfully served users for VR scenarios with a large number of users, a dual method based MPG algorithm (D-MPG) with a low complexity is proposed. Simulation results demonstrate that, compared to the trust region policy optimization algorithm (TRPO), the proposed MPG and D-MPG algorithms yield up to 26.8% and 21.9% improvement in the reliability as well as 81.2% and 87.5% gains in the convergence speed, respectively.

preprint2022arXiv

Neuro-Symbolic Artificial Intelligence (AI) for Intent based Semantic Communication

Intent-based networks that integrate sophisticated machine reasoning technologies will be a cornerstone of future wireless 6G systems. Intent-based communication requires the network to consider the semantics (meanings) and effectiveness (at end-user) of the data transmission. This is essential if 6G systems are to communicate reliably with fewer bits while simultaneously providing connectivity to heterogeneous users. In this paper, contrary to state of the art, which lacks explainability of data, the framework of neuro-symbolic artificial intelligence (NeSy AI) is proposed as a pillar for learning causal structure behind the observed data. In particular, the emerging concept of generative flow networks (GFlowNet) is leveraged for the first time in a wireless system to learn the probabilistic structure which generates the data. Further, a novel optimization problem for learning the optimal encoding and decoding functions is rigorously formulated with the intent of achieving higher semantic reliability. Novel analytical formulations are developed to define key metrics for semantic message transmission, including semantic distortion, semantic similarity, and semantic reliability. These semantic measure functions rely on the proposed definition of semantic content of the knowledge base and this information measure is reflective of the nodes' reasoning capabilities. Simulation results validate the ability to communicate efficiently (with less bits but same semantics) and significantly better compared to a conventional system which does not exploit the reasoning capabilities.

preprint2022arXiv

Performance Optimization for Semantic Communications: An Attention-based Reinforcement Learning Approach

In this paper, a semantic communication framework is proposed for textual data transmission. In the studied model, a base station (BS) extracts the semantic information from textual data, and transmits it to each user. The semantic information is modeled by a knowledge graph (KG) that consists of a set of semantic triples. After receiving the semantic information, each user recovers the original text using a graph-to-text generation model. To measure the performance of the considered semantic communication framework, a metric of semantic similarity (MSS) that jointly captures the semantic accuracy and completeness of the recovered text is proposed. Due to wireless resource limitations, the BS may not be able to transmit the entire semantic information to each user and satisfy the transmission delay constraint. Hence, the BS must select an appropriate resource block for each user as well as determine and transmit part of the semantic information to the users. As such, we formulate an optimization problem whose goal is to maximize the total MSS by jointly optimizing the resource allocation policy and determining the partial semantic information to be transmitted. To solve this problem, a proximal-policy-optimization-based reinforcement learning (RL) algorithm integrated with an attention network is proposed. The proposed algorithm can evaluate the importance of each triple in the semantic information using an attention network and then, build a relationship between the importance distribution of the triples in the semantic information and the total MSS. Compared to traditional RL algorithms, the proposed algorithm can dynamically adjust its learning rate thus ensuring convergence to a locally optimal solution.

preprint2022arXiv

Physics-Informed Quantum Communication Networks: A Vision Towards the Quantum Internet

Quantum communications is a promising technology that will play a fundamental role in the design of future networks. In fact, significant efforts are being dedicated by both the quantum physics and the classical communications communities on developing new architectures, solutions, and practical implementations of quantum communication networks (QCNs). Although these efforts led to various advances in today's technologies, there still exists a non-trivial gap between the research efforts of the two communities on designing and optimizing the performance of QCNs. For instance, most prior works by the classical communications community ignore important quantum physics-based constraints when designing QCNs. For example, many existing works on entanglement distribution do not account for the decoherence of qubits inside quantum memories and, thus, their designs become impractical since they assume an infinite lifetime of quantum states. In this paper, we bring forth a novel analysis of the performance of QCNs in a physics-informed manner, by relying on the quantum physics principles that underly the different components of QCNs. The need of the physics-informed approach is then assessed and its fundamental role in designing practical QCNs is analyzed across various open research areas. Moreover, we identify novel physics-informed performance metrics and controls that enable QCNs to leverage the state-of-the-art advancements in quantum technologies to enhance their performance. Finally, we analyze multiple pressing challenges and open research directions in QCNs that must be treated using a physics-informed approach to lead practically viable results. Ultimately, this work attempts to bridge the gap between the classical communications and the quantum physics communities in the area of QCNs to foster the development of the future communication networks towards the quantum Internet.

preprint2022arXiv

Positioning Using Visible Light Communications: A Perspective Arcs Approach

Visible light positioning (VLP) is an accurate indoor positioning technology that uses luminaires as transmitters. In particular, circular luminaires are a common source type for VLP, that are typically treated only as point sources for positioning, while ignoring their geometry characteristics. In this paper, the arc feature of the circular luminaire and the coordinate information obtained via visible light communication (VLC) are jointly used for VLC-enabled indoor positioning, and a novel perspective arcs approach is proposed. The proposed approach does not rely on any inertial measurement unit, and has no tilted angle limitations at the user. First, a VLC assisted perspective circle and arc algorithm (V-PCA) is proposed for a scenario in which a complete luminaire and an incomplete one can be captured by the user. Considering the cases in which parts of VLC links are blocked, an anti-occlusion VLC assisted perspective arcs algorithm (OA-V-PA) is proposed. Simulation results show that the proposed indoor positioning algorithm can achieve a 95th percentile positioning accuracy of around 10 cm. Moreover, an experimental prototype based on mobile phone is implemented, in which, a fused image processing method is proposed. Experimental results show that the average positioning accuracy is less than 5 cm.

preprint2022arXiv

Seamless and Energy Efficient Maritime Coverage in Coordinated 6G Space-Air-Sea Non-Terrestrial Networks

Non-terrestrial networks (NTNs), which integrate space and aerial networks with terrestrial systems, are a key area in the emerging sixth-generation (6G) wireless networks. As part of 6G, NTNs must provide pervasive connectivity to a wide range of devices, including smartphones, vehicles, sensors, robots, and maritime users. However, due to the high mobility and deployment of NTNs, managing the space-air-sea (SAS) NTN resources, i.e., energy, power, and channel allocation, is a major challenge. The design of a SAS-NTN for energy-efficient resource allocation is investigated in this study. The goal is to maximize system energy efficiency (EE) by collaboratively optimizing user equipment (UE) association, power control, and unmanned aerial vehicle (UAV) deployment. Given the limited payloads of UAVs, this work focuses on minimizing the total energy cost of UAVs (trajectory and transmission) while meeting EE requirements. A mixed-integer nonlinear programming problem is proposed, followed by the development of an algorithm to decompose, and solve each problem distributedly. The binary (UE association) and continuous (power, deployment) variables are separated using the Bender decomposition (BD), and then the Dinkelbach algorithm (DA) is used to convert fractional programming into an equivalent solvable form in the subproblem. A standard optimization solver is utilized to deal with the complexity of the master problem for binary variables. The alternating direction method of multipliers (ADMM) algorithm is used to solve the subproblem for the continuous variables. Our proposed algorithm provides a suboptimal solution, and simulation results demonstrate that the proposed algorithm achieves better EE than baselines.

preprint2022arXiv

Self-organizing Democratized Learning: Towards Large-scale Distributed Learning Systems

Emerging cross-device artificial intelligence (AI) applications require a transition from conventional centralized learning systems towards large-scale distributed AI systems that can collaboratively perform complex learning tasks. In this regard, democratized learning (Dem-AI) lays out a holistic philosophy with underlying principles for building large-scale distributed and democratized machine learning systems. The outlined principles are meant to study a generalization in distributed learning systems that goes beyond existing mechanisms such as federated learning. Moreover, such learning systems rely on hierarchical self-organization of well-connected distributed learning agents who have limited and highly personalized data and can evolve and regulate themselves based on the underlying duality of specialized and generalized processes. Inspired by Dem-AI philosophy, a novel distributed learning approach is proposed in this paper. The approach consists of a self-organizing hierarchical structuring mechanism based on agglomerative clustering, hierarchical generalization, and corresponding learning mechanism. Subsequently, hierarchical generalized learning problems in recursive forms are formulated and shown to be approximately solved using the solutions of distributed personalized learning problems and hierarchical update mechanisms. To that end, a distributed learning algorithm, namely DemLearn is proposed. Extensive experiments on benchmark MNIST, Fashion-MNIST, FE-MNIST, and CIFAR-10 datasets show that the proposed algorithms demonstrate better results in the generalization performance of learning models in agents compared to the conventional FL algorithms. The detailed analysis provides useful observations to further handle both the generalization and specialization performance of the learning models in Dem-AI systems.

preprint2022arXiv

Semantic-Aware Collaborative Deep Reinforcement Learning Over Wireless Cellular Networks

Collaborative deep reinforcement learning (CDRL) algorithms in which multiple agents can coordinate over a wireless network is a promising approach to enable future intelligent and autonomous systems that rely on real-time decision-making in complex dynamic environments. Nonetheless, in practical scenarios, CDRL faces many challenges due to the heterogeneity of agents and their learning tasks, different environments, time constraints of the learning, and resource limitations of wireless networks. To address these challenges, in this paper, a novel semantic-aware CDRL method is proposed to enable a group of heterogeneous untrained agents with semantically-linked DRL tasks to collaborate efficiently across a resource-constrained wireless cellular network. To this end, a new heterogeneous federated DRL (HFDRL) algorithm is proposed to select the best subset of semantically relevant DRL agents for collaboration. The proposed approach then jointly optimizes the training loss and wireless bandwidth allocation for the cooperating selected agents in order to train each agent within the time limit of its real-time task. Simulation results show the superior performance of the proposed algorithm compared to state-of-the-art baselines.

preprint2021arXiv

Centralized and Distributed Age of Information Minimization with non-linear Aging Functions in the Internet of Things

Resource management in Internet of Things (IoT) systems is a major challenge due to the massive scale and heterogeneity of the IoT system. For instance, most IoT applications require timely delivery of collected information, which is a key challenge for the IoT. In this paper, novel centralized and distributed resource allocation schemes are proposed to enable IoT devices to share limited communication resources and to transmit IoT messages in a timely manner. In the considered system, the timeliness of information is captured using non-linear age of information (AoI) metrics that can naturally quantify the freshness of information. To model the inherent heterogeneity of the IoT system, the non-linear aging functions are defined in terms of IoT device types and message content. To minimize AoI, the proposed resource management schemes allocate the limited communication resources considering AoI. In particular, the proposed centralized scheme enables the base station to learn the device types and to determine aging functions. Moreover, the proposed distributed scheme enables the devices to share the limited communication resources based on available information on other devices and their AoI. The convergence of the proposed distributed scheme is proved, and the effectiveness in reducing the AoI with partial information is analyzed. Simulation results show that the proposed centralized scheme achieves significantly lower average instantaneous AoI when compared to simple centralized allocation without learning, while the proposed distributed scheme achieves significantly lower average instantaneous AoI when compared to random allocation. The results also show that the proposed centralized scheme outperforms the proposed distributed scheme in almost all cases, but the distributed approach is more viable for a massive IoT.

preprint2021arXiv

Distributed Generative Adversarial Networks for mmWaveChannel Modeling in Wireless UAV Networks

In this paper, a novel framework is proposed to enable air-to-ground channel modeling over millimeter wave (mmWave) frequencies in an unmanned aerial vehicle (UAV) wireless network. First, an effective channel estimation approach is developed to collect mmWave channel information allowing each UAV to train a local channel model via a generative adversarial network (GAN). Next, in order to share the channel information between UAVs in a privacy-preserving manner, a cooperative framework, based on a distributed GAN architecture, is developed to enable each UAV to learn the mmWave channel distribution from the entire dataset in a fully distributed approach. The necessary and sufficient conditions for the optimal network structure that maximizes the learning rate for information sharing in the distributed network are derived. Simulation results show that the learning rate of the proposed GAN approach will increase by sharing more generated channel samples at each learning iteration, but decrease given more UAVs in the network. The results also show that the proposed GAN method yields a higher learning accuracy, compared with a standalone GAN, and improves the average rate for UAV downlink communications by over 10%, compared with a baseline real-time channel estimation scheme.

preprint2021arXiv

Multi-Agent Meta-Reinforcement Learning for Self-Powered and Sustainable Edge Computing Systems

The stringent requirements of mobile edge computing (MEC) applications and functions fathom the high capacity and dense deployment of MEC hosts to the upcoming wireless networks. However, operating such high capacity MEC hosts can significantly increase energy consumption. Thus, a base station (BS) unit can act as a self-powered BS. In this paper, an effective energy dispatch mechanism for self-powered wireless networks with edge computing capabilities is studied. First, a two-stage linear stochastic programming problem is formulated with the goal of minimizing the total energy consumption cost of the system while fulfilling the energy demand. Second, a semi-distributed data-driven solution is proposed by developing a novel multi-agent meta-reinforcement learning (MAMRL) framework to solve the formulated problem. In particular, each BS plays the role of a local agent that explores a Markovian behavior for both energy consumption and generation while each BS transfers time-varying features to a meta-agent. Sequentially, the meta-agent optimizes (i.e., exploits) the energy dispatch decision by accepting only the observations from each local agent with its own state information. Meanwhile, each BS agent estimates its own energy dispatch policy by applying the learned parameters from meta-agent. Finally, the proposed MAMRL framework is benchmarked by analyzing deterministic, asymmetric, and stochastic environments in terms of non-renewable energy usages, energy cost, and accuracy. Experimental results show that the proposed MAMRL model can reduce up to 11% non-renewable energy usage and by 22.4% the energy cost (with 95.8% prediction accuracy), compared to other baseline methods.

preprint2021arXiv

On the Optimality of Reconfigurable Intelligent Surfaces (RISs): Passive Beamforming, Modulation, and Resource Allocation

Reconfigurable intelligent surfaces (RISs) have recently emerged as a promising technology that can achieve high spectrum and energy efficiency for future wireless networks by integrating a massive number of low-cost and passive reflecting elements. An RIS can manipulate the properties of an incident wave, such as the frequency, amplitude, and phase, and, then, reflect this manipulated wave to a desired destination, without the need for complex signal processing. In this paper, the asymptotic optimality of achievable rate in a downlink RIS system is analyzed under a practical RIS environment with its associated limitations. In particular, a passive beamformer that can achieve the asymptotic optimal performance by controlling the incident wave properties is designed, under a limited RIS control link and practical reflection coefficients. In order to increase the achievable system sum-rate, a modulation scheme that can be used in an RIS without interfering with existing users is proposed and its average symbol error ratio is asymptotically derived. Moreover, a new resource allocation algorithm that jointly considers user scheduling and power control is designed, under consideration of the proposed passive beamforming and modulation schemes. Simulation results show that the proposed schemes are in close agreement with their upper bounds in presence of a large number of RIS reflecting elements thereby verifying that the achievable rate in practical RISs satisfies the asymptotic optimality.

preprint2021arXiv

Performance Analysis of Active Large Intelligent Surfaces (LISs): Uplink Spectral Efficiency and Pilot Training

Large intelligent surfaces (LISs) constitute a new and promising wireless communication paradigm that relies on the integration of a massive number of antenna elements over the entire surfaces of man-made structures. The LIS concept provides many advantages, such as the capability to provide reliable and space-intensive communications by effectively establishing line-of-sight (LOS) channels. In this paper, the system spectral efficiency (SSE) of an uplink LIS system is asymptotically analyzed under a practical LIS environment with a well-defined uplink frame structure. In order to verify the impact on the SSE of pilot contamination, the SSE of a multi-LIS system is asymptotically studied and a theoretical bound on its performance is derived. Given this performance bound, an optimal pilot training length for multi-LIS systems subjected to pilot contamination is characterized and, subsequently, the performance-maximizing number of devices that the LIS system must service is derived. Simulation results show that the derived analyses are in close agreement with the exact mutual information in presence of a large number of antennas, and the achievable SSE is limited by the effect of pilot contamination and intra/inter-LIS interference through the LOS path, even if the LIS is equipped with an infinite number of antennas. Additionally, the SSE obtained with the proposed pilot training length and number of scheduled devices is shown to reach the one obtained via a brute-force search for the optimal solution.

preprint2021arXiv

Wireless-Enabled Asynchronous Federated Fourier Neural Network for Turbulence Prediction in Urban Air Mobility (UAM)

To meet the growing mobility needs in intra-city transportation, the concept of urban air mobility (UAM) has been proposed in which vertical takeoff and landing (VTOL) aircraft are used to provide a ride-hailing service. In UAM, aircraft can operate in designated air spaces known as corridors, that link the aerodromes. A reliable communication network between GBSs and aircraft enables UAM to adequately utilize the airspace and create a fast, efficient, and safe transportation system. In this paper, to characterize the wireless connectivity performance for UAM, a spatial model is proposed. For this setup, the distribution of the distance between an arbitrarily selected GBS and its associated aircraft and the Laplace transform of the interference experienced by the GBS are derived. Using these results, the signal-to-interference ratio (SIR)-based connectivity probability is determined to capture the connectivity performance of the UAM aircraft-to-ground communication network. Then, leveraging these connectivity results, a wireless-enabled asynchronous federated learning (AFL) framework that uses a Fourier neural network is proposed to tackle the challenging problem of turbulence prediction during UAM operations. For this AFL scheme, a staleness-aware global aggregation scheme is introduced to expedite the convergence to the optimal turbulence prediction model used by UAM aircraft. Simulation results validate the theoretical derivations for the UAM wireless connectivity. The results also demonstrate that the proposed AFL framework converges to the optimal turbulence prediction model faster than the synchronous federated learning baselines and a staleness-free AFL approach. Furthermore, the results characterize the performance of wireless connectivity and convergence of the aircraft's turbulence model under different parameter settings, offering useful UAM design guidelines.

preprint2020arXiv

3D Channel Characterization and Performance Analysis of UAV-Assisted Millimeter Wave Links

Recently, the use of millimeter wave (mmW) frequencies has emerged as a promising solution for wirelessly connecting unmanned aerial vehicles (UAVs) to ground users. However, employing UAVassisted directional mmW links is challenging due to the random fluctuations of hovering UAVs. In this paper, the performance of UAV-based mmW links is investigated when UAVs are equipped with square array antennas. The 3GPP antenna propagation patterns are used to model the square array antenna. It is shown that the square array antenna is sensitive to both horizontal and vertical angular vibrations of UAVs. In order to explore the relationship between the vibrations of UAVs and their antenna pattern, the UAV-based mmW channels are characterized by considering the large scale path loss, small scale fading along with antenna patterns as well as the random effect of UAVs' angular vibrations. To enable effective performance analysis, tractable and closed-form statistical channel models are derived for aerial-to-aerial (A2A), ground-to-aerial (G2A), and aerial-to-ground (A2G) channels. The accuracy of analytical models is verified by employing Monte Carlo simulations. Analytical results are then used to study the effect of antenna pattern gain under different conditions for the UAVs' angular vibrations for establishing reliable UAV-assisted mmW links in terms of achieving minimum outage probability.

preprint2020arXiv

6G White Paper on Machine Learning in Wireless Communication Networks

The focus of this white paper is on machine learning (ML) in wireless communications. 6G wireless communication networks will be the backbone of the digital transformation of societies by providing ubiquitous, reliable, and near-instant wireless connectivity for humans and machines. Recent advances in ML research has led enable a wide range of novel technologies such as self-driving vehicles and voice assistants. Such innovation is possible as a result of the availability of advanced ML models, large datasets, and high computational power. On the other hand, the ever-increasing demand for connectivity will require a lot of innovation in 6G wireless networks, and ML tools will play a major role in solving problems in the wireless domain. In this paper, we provide an overview of the vision of how ML will impact the wireless communication systems. We first give an overview of the ML methods that have the highest potential to be used in wireless networks. Then, we discuss the problems that can be solved by using ML in various layers of the network such as the physical layer, medium access layer, and application layer. Zero-touch optimization of wireless networks using ML is another interesting aspect that is discussed in this paper. Finally, at the end of each section, important research questions that the section aims to answer are presented.

preprint2020arXiv

A Game of Drones: Cyber-Physical Security of Time-Critical UAV Applications with Cumulative Prospect Theory Perceptions and Valuations

In this paper, a novel mathematical framework is introduced for modeling and analyzing the cyber-physical security of time-critical UAV applications. A general UAV security network interdiction game is formulated to model interactions between a UAV operator and an interdictor, each of which can be benign or malicious. In this game, the interdictor chooses the optimal location(s) from which to target the drone system by interdicting the potential paths of the UAVs. Meanwhile, the UAV operator responds by finding an optimal path selection policy that enables its UAVs to evade attacks and minimize their mission completion time. New notions from cumulative prospect theory (PT) are incorporated into the game to capture the operator's and interdictor's subjective valuations of mission completion times and perceptions of the risk levels facing the UAVs. The equilibrium of the game, with and without PT, is then analytically characterized and studied. Novel algorithms are then proposed to reach the game's equilibria under both PT and classical game theory. Simulation results show the properties of the equilibrium for both the rational and PT cases. The results show that the operator's and interdictor's bounded rationality is more likely to be disadvantageous to the UAV operator.

preprint2020arXiv

Age of Information Analysis for Dynamic Spectrum Sharing

Timely information updates are critical to time-sensitive applications in networked monitoring and control systems. In this paper, the problem of real-time status update is considered for a cognitive radio network (CRN), in which the secondary user (SU) can relay the status packets from the primary user (PU) to the destination. In the considered CRN, the SU has opportunities to access the spectrum owned by the PU to send its own status packets to the destination. The freshness of information is measured by the age of information (AoI) metric. The problem of minimizing the average AoI and energy consumption by developing new optimal status update and packet relaying schemes for the SU is addressed under an average AoI constraint for the PU. This problem is formulated as a constrained Markov decision process (CMDP). The monotonic and decomposable properties of the value function are characterized and then used to show that the optimal update and relaying policy is threshold-based with respect to the AoI of the SU. These structures reveal a tradeoff between the AoI of the SU and the energy consumption as well as between the AoI of the SU and the AoI of the PU. An asymptotically optimal algorithm is proposed. Numerical results are then used to show the effectiveness of the proposed policy.

preprint2020arXiv

Cellular-Connected Wireless Virtual Reality: Requirements, Challenges, and Solutions

Cellular-connected wireless connectivity provides new opportunities for virtual reality(VR) to offer seamless user experience from anywhere at anytime. To realize this vision, the quality-of-service (QoS) for wireless VR needs to be carefully defined to reflect human perception requirements. In this paper, we first identify the primary drivers of VR systems, in terms of applications and use cases. We then map the human perception requirements to corresponding QoS requirements for four phases of VR technology development. To shed light on how to provide short/long-range mobility for VR services, we further list four main use cases for cellular-connected wireless VR and identify their unique research challenges along with their corresponding enabling technologies and solutions in 5G systems and beyond. Last but not least, we present a case study to demonstrate the effectiveness of our proposed solution and the unique QoS performance requirements of VR transmission compared with that of traditional video service in cellular networks.

preprint2020arXiv

Deep Learning for Content-based Personalized Viewport Prediction of 360-Degree VR Videos

In this paper, the problem of head movement prediction for virtual reality videos is studied. In the considered model, a deep learning network is introduced to leverage position data as well as video frame content to predict future head movement. For optimizing data input into this neural network, data sample rate, reduced data, and long-period prediction length are also explored for this model. Simulation results show that the proposed approach yields 16.1\% improvement in terms of prediction accuracy compared to a baseline approach that relies only on the position data.

preprint2020arXiv

Deep Learning for Optimal Deployment of UAVs with Visible Light Communications

In this paper, the problem of dynamical deployment of unmanned aerial vehicles (UAVs) equipped with visible light communication (VLC) capabilities for optimizing the energy efficiency of UAV-enabled networks is studied. In the studied model, the UAVs can simultaneously provide communications and illumination to service ground users. Since ambient illumination increases the interference over VLC links while reducing the illumination threshold of the UAVs, it is necessary to consider the illumination distribution of the target area for UAV deployment optimization. This problem is formulated as an optimization problem which jointly optimizes UAV deployment, user association, and power efficiency while meeting the illumination and communication requirements of users. To solve this problem, an algorithm that combines the machine learning framework of gated recurrent units (GRUs) with convolutional neural networks (CNNs) is proposed. Using GRUs and CNNs, the UAVs can model the long-term historical illumination distribution and predict the future illumination distribution. Given the prediction of illumination distribution, the original nonconvex optimization problem can be divided into two sub-problems and is then solved using a low-complexity, iterative algorithm. Then, the proposed algorithm enables UAVs to determine the their deployment and user association to minimize the total transmit power. Simulation results using real data from the Earth observations group (EOG) at NOAA/NCEI show that the proposed approach can achieve up to 68.9% reduction in total transmit power compared to a conventional optimal UAV deployment that does not consider the illumination distribution and user association.

preprint2020arXiv

Deep Reinforcement Learning for Fog Computing-based Vehicular System with Multi-operator Support

This paper studies the potential performance improvement that can be achieved by enabling multi-operator wireless connectivity for cloud/fog computing-connected vehicular systems. Mobile network operator (MNO) selection and switching problem is formulated by jointly considering switching cost, quality-of-service (QoS) variations between MNOs, and the different prices that can be charged by different MNOs as well as cloud and fog servers. A double deep Q network (DQN) based switching policy is proposed and proved to be able to minimize the long-term average cost of each vehicle with guaranteed latency and reliability performance. The performance of the proposed approach is evaluated using the dataset collected in a commercially available city-wide LTE network. Simulation results show that our proposed policy can significantly reduce the cost paid by each fog/cloud-connected vehicle with guaranteed latency services.

preprint2020arXiv

Delay Minimization for Federated Learning Over Wireless Communication Networks

In this paper, the problem of delay minimization for federated learning (FL) over wireless communication networks is investigated. In the considered model, each user exploits limited local computational resources to train a local FL model with its collected data and, then, sends the trained FL model parameters to a base station (BS) which aggregates the local FL models and broadcasts the aggregated FL model back to all the users. Since FL involves learning model exchanges between the users and the BS, both computation and communication latencies are determined by the required learning accuracy level, which affects the convergence rate of the FL algorithm. This joint learning and communication problem is formulated as a delay minimization problem, where it is proved that the objective function is a convex function of the learning accuracy. Then, a bisection search algorithm is proposed to obtain the optimal solution. Simulation results show that the proposed algorithm can reduce delay by up to 27.3% compared to conventional FL methods.

preprint2020arXiv

Energy-Efficient Wireless Communications with Distributed Reconfigurable Intelligent Surfaces

This paper investigates the problem of resource allocation for a wireless communication network with distributed reconfigurable intelligent surfaces (RISs). In this network, multiple RISs are spatially distributed to serve wireless users and the energy efficiency of the network is maximized by dynamically controlling the on-off status of each RIS as well as optimizing the reflection coefficients matrix of the RISs. This problem is posed as a joint optimization problem of transmit beamforming and RIS control, whose goal is to maximize the energy efficiency under minimum rate constraints of the users. To solve this problem, two iterative algorithms are proposed for the single-user case and multi-user case. For the single-user case, the phase optimization problem is solved by using a successive convex approximation method, which admits a closed-form solution at each step. Moreover, the optimal RIS on-off status is obtained by using the dual method. For the multi-user case, a low-complexity greedy searching method is proposed to solve the RIS on-off optimization problem. Simulation results show that the proposed scheme achieves up to 33\% and 68\% gains in terms of the energy efficiency in both single-user and multi-user cases compared to the conventional RIS scheme and amplify-and-forward relay scheme, respectively.

preprint2020arXiv

Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanism

Recent years have witnessed a rapid proliferation of smart Internet of Things (IoT) devices. IoT devices with intelligence require the use of effective machine learning paradigms. Federated learning can be a promising solution for enabling IoT-based smart applications. In this paper, we present the primary design aspects for enabling federated learning at network edge. We model the incentive-based interaction between a global server and participating devices for federated learning via a Stackelberg game to motivate the participation of the devices in the federated learning process. We present several open research challenges with their possible solutions. Finally, we provide an outlook on future research.

preprint2020arXiv

Federated Learning for Task and Resource Allocation in Wireless High Altitude Balloon Networks

In this paper, the problem of minimizing energy and time consumption for task computation and transmission is studied in a mobile edge computing (MEC)-enabled balloon network. In the considered network, each user needs to process a computational task in each time instant, where high-altitude balloons (HABs), acting as flying wireless base stations, can use their powerful computational abilities to process the tasks offloaded from their associated users. Since the data size of each user's computational task varies over time, the HABs must dynamically adjust the user association, service sequence, and task partition scheme to meet the users' needs. This problem is posed as an optimization problem whose goal is to minimize the energy and time consumption for task computing and transmission by adjusting the user association, service sequence, and task allocation scheme. To solve this problem, a support vector machine (SVM)-based federated learning (FL) algorithm is proposed to determine the user association proactively. The proposed SVM-based FL method enables each HAB to cooperatively build an SVM model that can determine all user associations without any transmissions of either user historical associations or computational tasks to other HABs. Given the prediction of the optimal user association, the service sequence and task allocation of each user can be optimized so as to minimize the weighted sum of the energy and time consumption. Simulations with real data of city cellular traffic from the OMNILab at Shanghai Jiao Tong University show that the proposed algorithm can reduce the weighted sum of the energy and time consumption of all users by up to 16.1% compared to a conventional centralized method.

preprint2020arXiv

Federated Learning in the Sky: Joint Power Allocation and Scheduling with UAV Swarms

Unmanned aerial vehicle (UAV) swarms must exploit machine learning (ML) in order to execute various tasks ranging from coordinated trajectory planning to cooperative target recognition. However, due to the lack of continuous connections between the UAV swarm and ground base stations (BSs), using centralized ML will be challenging, particularly when dealing with a large volume of data. In this paper, a novel framework is proposed to implement distributed federated learning (FL) algorithms within a UAV swarm that consists of a leading UAV and several following UAVs. Each following UAV trains a local FL model based on its collected data and then sends this trained local model to the leading UAV who will aggregate the received models, generate a global FL model, and transmit it to followers over the intra-swarm network. To identify how wireless factors, like fading, transmission delay, and UAV antenna angle deviations resulting from wind and mechanical vibrations, impact the performance of FL, a rigorous convergence analysis for FL is performed. Then, a joint power allocation and scheduling design is proposed to optimize the convergence rate of FL while taking into account the energy consumption during convergence and the delay requirement imposed by the swarm's control system. Simulation results validate the effectiveness of the FL convergence analysis and show that the joint design strategy can reduce the number of communication rounds needed for convergence by as much as 35% compared with the baseline design.

preprint2020arXiv

Graph-Theoretic Framework for Unified Analysis of Observability and Data Injection Attacks in the Smart Grid

In this paper, a novel graph-theoretic framework is proposed to generalize the analysis of a broad set of security attacks, including observability and data injection attacks, that target the state estimator of a smart grid. First, the notion of observability attacks is defined based on a proposed graph-theoretic construct. In this respect, a structured approach is proposed to characterize critical sets, whose removal renders the system unobservable. It is then shown that, for the system to be observable, these critical sets must be part of a maximum matching over a proposed bipartite graph. In addition, it is shown that stealthy data injection attacks (SDIAs) constitute a special case of these observability attacks. Then, various attack strategies and defense policies, for observability and data injection attacks, are shown to be amenable to analysis using the introduced graph-theoretic framework. The proposed framework is then shown to provide a unified basis for analysis of four key security problems (among others), pertaining to the characterization of: 1) The sparsest SDIA; 2) the sparsest SDIA including a certain measurement; 3) a set of measurements which must be defended to thwart all potential SDIAs; and 4) the set of measurements, which when protected, can thwart any SDIA whose cardinality is below a certain threshold. A case study using the IEEE 14-bus system with a set of 17 measurements is used to support the theoretical findings.

preprint2020arXiv

Indoor Millimeter-Wave Systems: Design and Performance Evaluation

Indoor areas, such as offices and shopping malls, are a natural environment for initial millimeter-wave (mmWave) deployments. While we already have the technology that enables us to realize indoor mmWave deployments, there are many remaining challenges associated with system-level design and planning for such. The objective of this article is to bring together multiple strands of research to provide a comprehensive and integrated framework for the design and performance evaluation of indoor mmWave systems. The paper introduces the framework with a status update on mmWave technology, including ongoing fifth generation (5G) wireless standardization efforts, and then moves on to experimentally-validated channel models that inform performance evaluation and deployment planning. Together these yield insights on indoor mmWave deployment strategies and system configurations, from feasible deployment densities to beam management strategies and necessary capacity extensions.

preprint2020arXiv

Interdependence-Aware Game-Theoretic Framework for Secure Intelligent Transportation Systems

The operation of future intelligent transportation systems (ITSs), communications infrastructure (CI), and power grids (PGs) will be highly interdependent. In particular, autonomous connected vehicles require CI resources to operate, and, thus, communication failures can result in non-optimality in the ITS flow in terms of traffic jams and fuel consumption. Similarly, CI components, e.g., base stations (BSs) can be impacted by failures in the electric grid that is powering them. Thus, malicious attacks on the PG can lead to failures in both the CI and the ITSs. To this end, in this paper, the security of an ITS against indirect attacks carried out through the PG is studied in an interdependent PG-CI-ITS scenario. To defend against such attacks, the administrator of the interdependent critical infrastructure can allocate backup power sources (BPSs) at every BS to compensate for the power loss caused by the attacker. However, due to budget limitations, the administrator must consider the importance of each BS in light of the PG risk of failure, while allocating the BPSs. In this regard, a rigorous analytical framework is proposed to model the interdependencies between the ITS, CI, and PG. Next, a one-to-one relationship between the PG components and ITS streets is derived in order to capture the effect of the PG components' failure on the optimality of the traffic flow in the streets. Moreover, the problem of BPS allocation is formulated using a Stackelberg game framework and the Stackelberg equilibrium (SE) of the game is characterized. Simulation results show that the derived SE outperforms any other BPS allocation strategy and can be scalable in linear time with respect to the size of the interdependent infrastructure.

preprint2020arXiv

Meta-Reinforcement Learning for Trajectory Design in Wireless UAV Networks

In this paper, the design of an optimal trajectory for an energy-constrained drone operating in dynamic network environments is studied. In the considered model, a drone base station (DBS) is dispatched to provide uplink connectivity to ground users whose demand is dynamic and unpredictable. In this case, the DBS's trajectory must be adaptively adjusted to satisfy the dynamic user access requests. To this end, a meta-learning algorithm is proposed in order to adapt the DBS's trajectory when it encounters novel environments, by tuning a reinforcement learning (RL) solution. The meta-learning algorithm provides a solution that adapts the DBS in novel environments quickly based on limited former experiences. The meta-tuned RL is shown to yield a faster convergence to the optimal coverage in unseen environments with a considerably low computation complexity, compared to the baseline policy gradient algorithm. Simulation results show that, the proposed meta-learning solution yields a 25% improvement in the convergence speed, and about 10% improvement in the DBS' communication performance, compared to a baseline policy gradient algorithm. Meanwhile, the probability that the DBS serves over 50% of user requests increases about 27%, compared to the baseline policy gradient algorithm.

preprint2020arXiv

Minimum Age of Information in the Internet of Things with Non-uniform Status Packet Sizes

In this paper, a real-time Internet of Things (IoT) monitoring system is considered in which the IoT devices are scheduled to sample underlying physical processes and send the status updates to a common destination. In a real-world IoT, due to the possibly different dynamics of each physical process, the sizes of the status updates for different devices are often different and each status update typically requires multiple transmission slots. By taking into account such multi-time slot transmissions with non-uniform sizes of the status updates under noisy channels, the problem of joint device scheduling and status sampling is studied in order to minimize the average age of information (AoI) at the destination. This stochastic problem is formulated as an infinite horizon average cost Markov decision process (MDP). The monotonicity of the value function of the MDP is characterized and then used to show that the optimal scheduling and sampling policy is threshold-based with respect to the AoI at each device. To overcome the curse of dimensionality, a low-complexity suboptimal policy is proposed through a semi-randomized base policy and linear approximated value functions. The proposed suboptimal policy is shown to exhibit a similar structure to the optimal policy, which provides a structural base for its effective performance. A structure-aware algorithm is then developed to obtain the suboptimal policy. The analytical results are further extended to the IoT monitoring system with random status update arrivals, for which, the optimal scheduling and sampling policy is also shown to be threshold-based with the AoI at each device. Simulation results illustrate the structures of the optimal policy and show a near-optimal AoI performance resulting from the proposed suboptimal solution approach.

preprint2020arXiv

Mobility Management for Cellular-Connected UAVs: A Learning-Based Approach

The pervasiveness of the wireless cellular network can be a key enabler for the deployment of autonomous unmanned aerial vehicles (UAVs) in beyond visual line of sight scenarios without human control. However, traditional cellular networks are optimized for ground user equipment (GUE) such as smartphones which makes providing connectivity to flying UAVs very challenging. Moreover, ensuring better connectivity to a moving cellular-connected UAV is notoriously difficult due to the complex air-to-ground path loss model. In this paper, a novel mechanism is proposed to ensure robust wireless connectivity and mobility support for cellular-connected UAVs by tuning the downtilt (DT) angles of all the GBSs. By leveraging tools from reinforcement learning (RL), DT angles are dynamically adjusted by using a model-free RL algorithm. The goal is to provide efficient mobility support in the sky by maximizing the received signal quality at the UAV while also maintaining good throughput performance of the ground users. Simulation results show that the proposed RL-based mobility management (MM) technique can reduce the number of handovers while maintaining the performance goals, compared to the baseline MM scheme in which the network always keeps the DT angle fixed.

preprint2020arXiv

Neural Combinatorial Deep Reinforcement Learning for Age-optimal Joint Trajectory and Scheduling Design in UAV-assisted Networks

In this paper, an unmanned aerial vehicle (UAV)-assisted wireless network is considered in which a battery-constrained UAV is assumed to move towards energy-constrained ground nodes to receive status updates about their observed processes. The UAV's flight trajectory and scheduling of status updates are jointly optimized with the objective of minimizing the normalized weighted sum of Age of Information (NWAoI) values for different physical processes at the UAV. The problem is first formulated as a mixed-integer program. Then, for a given scheduling policy, a convex optimization-based solution is proposed to derive the UAV's optimal flight trajectory and time instants on updates. However, finding the optimal scheduling policy is challenging due to the combinatorial nature of the formulated problem. Therefore, to complement the proposed convex optimization-based solution, a finite-horizon Markov decision process (MDP) is used to find the optimal scheduling policy. Since the state space of the MDP is extremely large, a novel neural combinatorial-based deep reinforcement learning (NCRL) algorithm using deep Q-network (DQN) is proposed to obtain the optimal policy. However, for large-scale scenarios with numerous nodes, the DQN architecture cannot efficiently learn the optimal scheduling policy anymore. Motivated by this, a long short-term memory (LSTM)-based autoencoder is proposed to map the state space to a fixed-size vector representation in such large-scale scenarios. A lower bound on the minimum NWAoI is analytically derived which provides system design guidelines on the appropriate choice of importance weights for different nodes. The numerical results also demonstrate that the proposed NCRL approach can significantly improve the achievable NWAoI per process compared to the baseline policies, such as weight-based and discretized state DQN policies.

preprint2020arXiv

Neurosciences and 6G: Lessons from and Needs of Communicative Brains

This paper presents the first comprehensive tutorial on a promising research field located at the frontier of two well-established domains: Neurosciences and wireless communications, motivated by the ongoing efforts to define how the sixth generation of mobile networks (6G) will be. In particular, this tutorial first provides a novel integrative approach that bridges the gap between these two, seemingly disparate fields. Then, we present the state-of-the-art and key challenges of these two topics. In particular, we propose a novel systematization that divides the contributions into two groups, one focused on what neurosciences will offer to 6G in terms of new applications and systems architecture (Neurosciences for Wireless), and the other focused on how wireless communication theory and 6G systems can provide new ways to study the brain (Wireless for Neurosciences). For the first group, we concretely explain how current scientific understanding of the brain would enable new application for 6G within the context of a new type of service that we dub braintype communications and that has more stringent requirements than human- and machine-type communication. In this regard, we expose the key requirements of brain-type communication services and we discuss how future wireless networks can be equipped to deal with such services. Meanwhile, for the second group, we thoroughly explore modern communication system paradigms, including Internet of Bio-nano Things and chaosbased communications, in addition to highlighting how complex systems tools can help bridging 6G and neuroscience applications. Brain-controlled vehicles are then presented as our case study. All in all, this tutorial is expected to provide a largely missing articulation between these two emerging fields while delineating concrete ways to move forward in such an interdisciplinary endeavor.

preprint2020arXiv

On Coordination of Smart Grid and Cooperative Cloud Providers

Cooperative cloud providers in the form of cloud federations can potentially reduce their energy costs by exploiting electricity price fluctuations across different locations. In this environment, on the one hand, the electricity price has a significant influence on the federations formed, and, thus, on the profit earned by the cloud providers, and on the other hand, the cloud cooperation has an inevitable impact on the performance of the smart grid. In this regard, the interaction between independent cloud providers and the smart grid is modeled as a two-stage Stackelberg game interleaved with a coalitional game in this paper. In this game, in the first stage the smart grid, as a leader chooses a proper electricity pricing mechanism to maximize its own profit. In the second stage, cloud providers cooperatively manage their workload to minimize their electricity costs. Given the dynamic of cloud providers in the federation formation process, an optimization model based on a constrained Markov decision process (CMDP) has been used by the smart grid to achieve the optimal policy. Numerical results show that the proposed solution yields around 28% and 29% profit improvement on average for the smart grid, and the cloud providers, respectively, compared to the noncooperative scheme

preprint2020arXiv

On the Age of Information in Internet of Things Systems with Correlated Devices

In this paper, a real-time Internet of Things (IoT) monitoring system is considered in which multiple IoT devices must transmit timely updates on the status information of a common underlying physical process to a common destination. In particular, a real-world IoT scenario is considered in which multiple (partially) observed status information by different IoT devices are required at the destination, so that the real-time status of the physical process can be properly re-constructed. By taking into account such correlated status information at the IoT devices, the problem of IoT device scheduling is studied in order to jointly minimize the average age of information (AoI) at the destination and the average energy cost at the IoT devices. Particularly, two types of IoT devices are considered: Type-I devices whose status updates randomly arrive and type-II devices whose status updates can be generated-at-will with an associated sampling cost. This stochastic problem is formulated as an infinite horizon average cost Markov decision process (MDP). The optimal scheduling policy is shown to be threshold-based with respect to the AoI at the destination, and the threshold is non-increasing with the channel condition of each device. For a special case in which all devices are type-II, the original MDP can be reduced to an MDP with much smaller state and action spaces. The optimal policy is further shown to have a similar threshold-based structure and the threshold is non-decreasing with an energy cost function of the devices. Simulation results illustrate the structure of the optimal policy and show the effectiveness of the optimal policy compared with a myopic baseline policy.

preprint2020arXiv

On the Ruin of Age of Information in Augmented Reality over Wireless Terahertz (THz) Networks

Guaranteeing fresh and reliable information for augmented reality (AR) services is a key challenge to enable a real-time experience and sustain a high quality of physical experience (QoPE) for the users. In this paper, a terahertz (THz) cellular network is used to exchange rate-hungry AR content. For this network, guaranteeing an instantaneous low peak age of information (PAoI) is necessary to overcome the uncertainty stemming from the THz channel. In particular, a novel economic concept, namely, the risk of ruin is proposed to examine the probability of occurrence of rare, but extremely high PAoI that can jeopardize the operation of the AR service. To assess the severity of these hazards, the cumulative distribution function (CDF) of the PAoI is derived for two different scheduling policies. This CDF is then used to find the probability of maximum severity of ruin PAoI. Furthermore, to provide long term insights about the AR content's age, the average PAoI of the overall system is also derived. Simulation results show that an increase in the number of users will positively impact the PAoI in both the expected and worst-case scenarios. Meanwhile, an increase in the bandwidth reduces the average PAoI but leads to a decline in the severity of ruin performance. The results also show that a system with preemptive last come first served (LCFS) queues of limited size buffers have a better ruin performance (12% increase in the probability of guaranteeing a less severe PAoI while increasing the number of users), whereas first come first served (FCFS) queues of limited buffers lead to a better average PAoI performance (45% lower PAoI as we increase the bandwidth).

preprint2020arXiv

Performance Analysis of Mobile Cellular-Connected Drones under Practical Antenna Configurations

Providing seamless connectivity to unmanned aerial vehicle user equipments (UAV-UEs) is very challenging due to the encountered line-of-sight interference and reduced gains of down-tilted base station (BS) antennas. For instance, as the altitude of UAV-UEs increases, their cell association and handover procedure become driven by the side-lobes of the BS antennas. In this paper, the performance of cellular-connected UAV-UEs is studied under 3D practical antenna configurations. Two scenarios are studied: scenarios with static, hovering UAV- UEs and scenarios with mobile UAV-UEs. For both scenarios, the UAV-UE coverage probability is characterized as a function of the system parameters. The effects of the number of antenna elements on the UAV-UE coverage probability and handover rate of mobile UAV-UEs are then investigated. Results reveal that the UAV-UE coverage probability under a practical antenna pattern is worse than that under a simple antenna model. Moreover, vertically-mobile UAV-UEs are susceptible to altitude handover due to consecutive crossings of the nulls and peaks of the antenna side-lobes.

preprint2020arXiv

Predictive Deployment of UAV Base Stations in Wireless Networks: Machine Learning Meets Contract Theory

In this paper, a novel framework is proposed to enable a predictive deployment of unmanned aerial vehicles (UAVs) as temporary base stations (BSs) to complement ground cellular systems in face of downlink traffic overload. First, a novel learning approach, based on the weighted expectation maximization (WEM) algorithm, is proposed to estimate the user distribution and the downlink traffic demand. Next, to guarantee a truthful information exchange between the BS and UAVs, using the framework of contract theory, an offload contract is developed, and the sufficient and necessary conditions for having a feasible contract are analytically derived. Subsequently, an optimization problem is formulated to deploy an optimal UAV onto the hotspot area in a way that the utility of the overloaded BS is maximized. Simulation results show that the proposed WEM approach yields a prediction error of around 10%. Compared with the expectation maximization and k-mean approaches, the WEM method shows a significant advantage on the prediction accuracy, as the traffic load in the cellular system becomes spatially uneven. Furthermore, compared with two event-driven deployment schemes based on the closest-distance and maximal-energy metrics, the proposed predictive approach enables UAV operators to provide efficient communication service for hotspot users in terms of the downlink capacity, energy consumption and service delay. Simulation results also show that the proposed method significantly improves the revenues of both the BS and UAV networks, compared with two baseline schemes.

preprint2020arXiv

Risk-Aware Optimization of Age of Information in the Internet of Things

Minimization of the expected value of age of information (AoI) is a risk-neutral approach, and it thus cannot capture rare, yet critical, events with potentially large AoI. In order to capture the effect of these events, in this paper, the notion of conditional value-at-risk (CVaR) is proposed as an effective coherent risk measure that is suitable for minimization of AoI for real-time IoT status updates. In the considered monitoring system, an IoT device monitors a physical process and sends the status updates to a remote receiver with an updating cost. The optimal status update process is designed to jointly minimize the AoI at the receiver, the CVaR of the AoI at the receiver, and the energy cost. This stochastic optimization problem is formulated as an infinite horizon discounted risk-aware Markov decision process (MDP), which is computationally intractable due to the time inconsistency of the CVaR. By exploiting the special properties of coherent risk measures, the risk-aware MDP is reduced to a standard MDP with an augmented state space, for which we derive the optimal stationary policy using dynamic programming. In particular, the optimal history-dependent policy of the risk-aware MDP is shown to depend on the history only through the augmented system states and can be readily constructed using the optimal stationary policy of the augmented MDP. The proposed solution is shown to be computationally tractable and able to minimize the AoI in real-time IoT monitoring systems in a risk-aware manner.

preprint2020arXiv

Risk-Based Optimization of Virtual Reality over Terahertz Reconfigurable Intelligent Surfaces

In this paper, the problem of associating reconfigurable intelligent surfaces (RISs) to virtual reality (VR) users is studied for a wireless VR network. In particular, this problem is considered within a cellular network that employs terahertz (THz) operated RISs acting as base stations. To provide a seamless VR experience, high data rates and reliable low latency need to be continuously guaranteed. To address these challenges, a novel risk-based framework based on the entropic value-at-risk is proposed for rate optimization and reliability performance. Furthermore, a Lyapunov optimization technique is used to reformulate the problem as a linear weighted function, while ensuring that higher order statistics of the queue length are maintained under a threshold. To address this problem, given the stochastic nature of the channel, a policy-based reinforcement learning (RL) algorithm is proposed. Since the state space is extremely large, the policy is learned through a deep-RL algorithm. In particular, a recurrent neural network (RNN) RL framework is proposed to capture the dynamic channel behavior and improve the speed of conventional RL policy-search algorithms. Simulation results demonstrate that the maximal queue length resulting from the proposed approach is only within 1% of the optimal solution. The results show a high accuracy and fast convergence for the RNN with a validation accuracy of 91.92%.

preprint2020arXiv

Ruin Theory for Energy-Efficient Resource Allocation in UAV-assisted Cellular Networks

Unmanned aerial vehicles (UAVs) can provide an effective solution for improving the coverage, capacity, and the overall performance of terrestrial wireless cellular networks. In particular, UAV-assisted cellular networks can meet the stringent performance requirements of the fifth generation new radio (5G NR) applications. In this paper, the problem of energy-efficient resource allocation in UAV-assisted cellular networks is studied under the reliability and latency constraints of 5G NR applications. The framework of ruin theory is employed to allow solar-powered UAVs to capture the dynamics of harvested and consumed energies. First, the surplus power of every UAV is modeled, and then it is used to compute the probability of ruin of the UAVs. The probability of ruin denotes the vulnerability of draining out the power of a UAV. Next, the probability of ruin is used for efficient user association with each UAV. Then, power allocation for 5G NR applications is performed to maximize the achievable network rate using the water-filling approach. Simulation results demonstrate that the proposed ruin-based scheme can enhance the flight duration up to 61% and the number of served users in a UAV flight by up to 58\%, compared to a baseline SINR-based scheme.

preprint2020arXiv

Smart Urban Mobility: When Mobility Systems Meet Smart Data

Cities around the world are expanding dramatically, with urban population growth reaching nearly 2.5 billion people in urban areas and road traffic growth exceeding 1.2 billion cars by 2050. The economic contribution of the transport sector represents 5% of the GDP in Europe and costs an average of US $482.05 billion in the United States. These figures indicate the rapid rise of industrial cities and the urgent need to move from traditional cities to smart cities. This article provides a survey of different approaches and technologies such as intelligent transportation systems (ITS) that leverage communication technologies to help maintain road users safe while driving, as well as support autonomous mobility through the optimization of control systems. The role of ITS is strengthened when combined with accurate artificial intelligence models that are built to optimize urban planning, analyze crowd behavior and predict traffic conditions. AI-driven ITS is becoming possible thanks to the existence of a large volume of mobility data generated by billions of users through their use of new technologies and online social media. The optimization of urban planning enhances vehicle routing capabilities and solves traffic congestion problems, as discussed in this paper. From an ecological perspective, we discuss the measures and incentives provided to foster the use of mobility systems. We also underline the role of the political will in promoting open data in the transport sector, considered as an essential ingredient for developing technological solutions necessary for cities to become healthier and more sustainable.

preprint2020arXiv

Wireless Communications for Collaborative Federated Learning

Internet of Things (IoT) services will use machine learning tools to efficiently analyze various types of data collected by IoT devices for inference, autonomy, and control purposes. However, due to resource constraints and privacy challenges, edge IoT devices may not be able to transmit their collected data to a central controller for training machine learning models. To overcome this challenge, federated learning (FL) has been proposed as a means for enabling edge devices to train a shared machine learning model without data exchanges thus reducing communication overhead and preserving data privacy. However, Google's seminal FL algorithm requires all devices to be directly connected with a central controller, which significantly limits its application scenarios. In this context, this paper introduces a novel FL framework, called collaborative FL (CFL), which enables edge devices to implement FL with less reliance on a central controller. The fundamentals of this framework are developed and then, a number of communication techniques are proposed so as to improve the performance of CFL. To this end, an overview of centralized learning, Google's seminal FL, and CFL is first presented. For each type of learning, the basic architecture as well as its advantages, drawbacks, and usage conditions are introduced. Then, three CFL performance metrics are presented and a suite of communication techniques ranging from network formation, device scheduling, mobility management, and coding is introduced to optimize the performance of CFL. For each technique, future research opportunities are also discussed. In a nutshell, this article will showcase how the proposed CFL framework can be effectively implemented at the edge of large-scale wireless systems such as the Internet of Things.

preprint2019arXiv

Drones in Distress: A Game-Theoretic Countermeasure for Protecting UAVs Against GPS Spoofing

One prominent security threat that targets unmanned aerial vehicles (UAVs) is the capture via GPS spoofing in which an attacker manipulates a UAV's global positioning system (GPS) signals in order to capture it. Given the anticipated widespread deployment of UAVs for various purposes, it is imperative to develop new security solutions against such attacks. In this paper, a mathematical framework is introduced for analyzing and mitigating the effects of GPS spoofing attacks on UAVs. In particular, system dynamics are used to model the optimal routes that the UAVs will adopt to reach their destinations. The GPS spoofer's effect on each UAV's route is also captured by the model. To this end, the spoofer's optimal imposed locations on the UAVs, are analytically derived; allowing the UAVs to predict their traveling routes under attack. Then, a countermeasure mechanism is developed to mitigate the effect of the GPS spoofing attack. The countermeasure is built on the premise of cooperative localization, in which a UAV can determine its location using nearby UAVs instead of the possibly compromised GPS locations. To better utilize the proposed defense mechanism, a dynamic Stackelberg game is formulated to model the interactions between a GPS spoofer and a drone operator. In particular, the drone operator acts as the leader that determines its optimal strategy in light of the spoofer's expected response strategy. The equilibrium strategies of the game are then analytically characterized and studied through a novel proposed algorithm. Simulation results show that, when combined with the Stackelberg strategies, the proposed defense mechanism will outperform baseline strategy selection techniques in terms of reducing the possibility of UAV capture

preprint2019arXiv

Smart Routing of Electric Vehicles for Load Balancing in Smart Grids

Electric vehicles (EVs) are expected to be a major component of the smart grid. The rapid proliferation of EVs will introduce an unprecedented load on the existing electric grid due to the charging/discharging behavior of the EVs, thus motivating the need for novel approaches for routing EVs across the grid. In this paper, a novel gametheoretic framework for smart routing of EVs within the smart grid is proposed. The goal of this framework is to balance the electricity load across the grid while taking into account the traffic congestion and the waiting time at charging stations. The EV routing problem is formulated as a noncooperative game. For this game, it is shown that selfish behavior of EVs will result in a pure-strategy Nash equilibrium with the price of anarchy upper bounded by the variance of the ground load induced by the residential, industrial, or commercial users. Moreover, the results are extended to capture the stochastic nature of induced ground load as well as the subjective behavior of the owners of EVs as captured by using notions from the behavioral framework of prospect theory. Simulation results provide new insights on more efficient energy pricing at charging stations and under more realistic grid conditions.