Search

Collaborative inference in next-generation networks can enhance Artificial Intelligence (AI) applications, including autonomous driving, personal identification, and activity classification. This method involves a three-stage process: a) data acquisition through sensing, b) feature extraction, and c) feature encoding for transmission. Transmission of the extracted features entails the potential risk of exposing sensitive personal data. To address this issue, in this work a new privacy-protecting collaborative inference mechanism is developed. Under this mechanism, each edge device in the network protects the privacy of extracted features before transmitting them to a central server for inference. This mechanism aims to achieve two main objectives while ensuring effective inference performance: 1) reducing communication overhead, and 2) maintaining strict privacy guarantees during features transmission.

This paper introduces a new resource allocation framework for integrated sensing and communication (ISAC) systems, which are expected to be fundamental aspects of sixth-generation networks. In particular, we develop an augmented Lagrangian manifold optimization (ALMO) framework designed to maximize communication sum rate while satisfying sensing beampattern gain targets and base station (BS) transmit power limits. ALMO applies the principles of Riemannian manifold optimization (MO) to navigate the complex, non-convex landscape of the resource allocation problem. It efficiently leverages the augmented Lagrangian method to ensure adherence to constraints. We present comprehensive numerical results to validate our framework, which illustrates the ALMO method's superior capability to enhance the dual functionalities of communication and sensing in ISAC systems. For instance, with 12 antennas and 30 dBm BS transmit power, our proposed ALMO algorithm delivers a 10.1% sum rate gain over a benchmark optimization-based algorithm. This work demonstrates significant improvements in system performance and contributes a new algorithmic perspective to ISAC resource management., Comment: 13 pages, 11 figures, submitted to an IEEE Transactions Journal

An efficient resource management scheme is critical to enable network slicing in 5G networks and in envisioned 6G networks, and artificial intelligence (AI) techniques offer promising solutions. Considering the rapidly emerging new machine learning techniques, such as graph learning, federated learning, and transfer learning, a timely survey is needed to provide an overview of resource management and network slicing techniques of AI-enabled wireless networks. This article provides such a survey along with an application of knowledge transfer in radio access network (RAN) slicing. In particular, we firs provide some background on resource management and network slicing, and review relevant state-of-the-art AI and machine learning (ML) techniques and their applications. Then, we introduce our AI-enabled knowledge transfer and reuse-based resource management (AKRM) scheme, where we apply transfer learning to improve system performance. Compared with most existing works, which focus on the training of standalone agents from scratch, the main difference of AKRM lies in its knowledge transfer and reuse capability between different tasks. Our paper aims to be a roadmap for researchers to use knowledge transfer schemes in AI-enabled wireless networks, and we provide a case study over the resource allocation problem in RAN slicing., Comment: This work has been accepted by IEEE Wireless Communications Magazine. All rights belong to IEEE

In this paper, the situation in which a receiver has to execute a task from a quantized version of the information source of interest is considered. The task is modeled by the minimization problem of a general goal function $f(x;g)$ for which the decision $x$ has to be taken from a quantized version of the parameters $g$. This problem is relevant in many applications e.g., for radio resource allocation (RA), high spectral efficiency communications, controlled systems, or data clustering in the smart grid. By resorting to high resolution (HR) analysis, it is shown how to design a quantizer that minimizes the gap between the minimum of $f$ (which would be reached by knowing $g$ perfectly) and what is effectively reached with a quantized $g$. The conducted formal analysis both provides quantization strategies in the HR regime and insights for the general regime and allows a practical algorithm to be designed. The analysis also allows one to provide some elements to the new and fundamental problem of the relationship between the goal function regularity properties and the hardness to quantize its parameters. The derived results are discussed and supported by a rich numerical performance analysis in which known RA goal functions are studied and allows one to exhibit very significant improvements by tailoring the quantization operation to the final task.

Network slicing is a critical technique for 5G communications that covers radio access network (RAN), edge, transport and core slicing.The evolving network architecture requires the orchestration of multiple network resources such as radio and cache resources. In recent years, machine learning (ML) techniques have been widely applied for network management. However, most existing works do not take advantage of the knowledge transfer capability in ML. In this paper, we propose a deep transfer reinforcement learning (DTRL) scheme for joint radio and cache resource allocation to serve 5G RAN slicing. We first define a hierarchical architecture for joint resource allocation. Then we propose two DTRL algorithms: Q-value-based deep transfer reinforcement learning (QDTRL) and action selection-based deep transfer reinforcement learning (ADTRL). In the proposed schemes, learner agents utilize expert agents' knowledge to improve their performance on current tasks. The proposed algorithms are compared with both the model-free exploration bonus deep Q-learning (EB-DQN) and the model-based priority proportional fairness and time-to-live (PPF-TTL) algorithms. Compared with EB-DQN, our proposed DTRL-based method presents 21.4% lower delay for Ultra Reliable Low Latency Communications (URLLC) slice and 22.4% higher throughput for enhanced Mobile Broad Band (eMBB) slice, while achieving significantly faster convergence than EB-DQN. Moreover, 40.8% lower URLLC delay and 59.8% higher eMBB throughput are observed with respect to PPF-TTL., Comment: Accepted by IEEE Transactions on Cognitive Communications and Networking

In this paper, we develop a physics-based model that allows a scalable optimization of large intelligent reflecting surfaces (IRSs). The basic idea is to partition the IRS unit cells into several subsets, referred to as tiles, and model the impact of each tile on the wireless channel. Borrowing concepts from the radar literature, we model each tile as an anomalous reflector, and derive its impact on the wireless channel for given unit cell phase shifts by solving the corresponding integral equations for the electric and magnetic vector fields. Based on this model, one can design the phase shifts of the unit cells of a tile offline for the support of several transmission modes and then select the best mode online for a given channel realization. Therefore, the number of tiles and transmission modes in the proposed model are design parameters that can be adjusted to trade performance for complexity., Comment: The paper is 5 pages, contains 5 figures, and is submitted to Asilomar Conference on Signals, Systems, and Computers 2020. arXiv admin note: substantial text overlap with arXiv:2004.12957

Intelligent reflecting surfaces (IRSs) have the potential to transform wireless communication channels into smart reconfigurable propagation environments. To realize this new paradigm, the passive IRSs have to be large, especially for communication in far-field scenarios, so that they can compensate for the large end-to-end path-loss, which is caused by the multiplication of the individual path-losses of the transmitter-to-IRS and IRS-to-receiver channels. However, optimizing a large number of sub-wavelength IRS elements imposes a significant challenge for online transmission. To address this issue, in this paper, we develop a physics-based model and a scalable optimization framework for large IRSs. The basic idea is to partition the IRS unit cells into several subsets, referred to as tiles, model the impact of each tile on the wireless channel, and then optimize each tile in two stages, namely an offline design stage and an online optimization stage. For physics-based modeling, we borrow concepts from the radar literature, model each tile as an anomalous reflector, and derive its impact on the wireless channel for a given phase shift by solving the corresponding integral equations for the electric and magnetic vector fields. In the offline design stage, the IRS unit cells of each tile are jointly designed for the support of different transmission modes, where each transmission mode effectively corresponds to a given configuration of the phase shifts that the unit cells of the tile apply to an impinging electromagnetic wave. In the online optimization stage, the best transmission mode of each tile is selected such that a desired quality-of-service (QoS) criterion is maximized. We show that the proposed modeling and optimization framework can be used to efficiently optimize large IRSs comprising thousands of unit cells.

We address the problem of maximizing privacy of stochastic dynamical systems whose state information is released through quantized sensor data. In particular, we consider the setting where information about the system state is obtained using noisy sensor measurements. This data is quantized and transmitted to a remote station through a public/unsecured communication network. We aim at keeping the state of the system private; however, because the network is not secure, adversaries might have access to sensor data, which can be used to estimate the system state. To prevent such adversaries from obtaining an accurate state estimate, before transmission, we randomize quantized sensor data using additive random vectors, and send the corrupted data to the remote station instead. We design the joint probability distribution of these additive vectors (over a time window) to minimize the mutual information (our privacy metric) between some linear function of the system state (a desired private output) and the randomized sensor data for a desired level of distortion--how different quantized sensor measurements and distorted data are allowed to be. We pose the problem of synthesizing the joint probability distribution of the additive vectors as a convex program subject to linear constraints. Simulation experiments are presented to illustrate our privacy scheme.

In this paper, spectrum access in cognitive radio networks is modeled as a repeated auction game subject to monitoring and entry costs. For secondary users, sensing costs are incurred as the result of primary users' activity. Furthermore, each secondary user pays the cost of transmissions upon successful bidding for a channel. Knowledge regarding other secondary users' activity is limited due to the distributed nature of the network. The resulting formulation is thus a dynamic game with incomplete information. In this paper, an efficient bidding learning algorithm is proposed based on the outcome of past transactions. As demonstrated through extensive simulations, the proposed distributed scheme outperforms a myopic one-stage algorithm, and can achieve a good balance between efficiency and fairness., Comment: This paper is presented in Allerton Conference on Communication, Control, and Computing 2009

In wireless packet-forwarding networks with selfish nodes, application of a repeated game can induce the nodes to forward each others' packets, so that the network performance can be improved. However, the nodes on the boundary of such networks cannot benefit from this strategy, as the other nodes do not depend on them. This problem is sometimes known as {\em the curse of the boundary nodes}. To overcome this problem, an approach based on coalition games is proposed, in which the boundary nodes can use cooperative transmission to help the backbone nodes in the middle of the network. In return, the backbone nodes are willing to forward the boundary nodes' packets. Here, the concept of core is used to study the stability of the coalitions in such games. Then three types of fairness are investigated, namely, min-max fairness using nucleolus, average fairness using the Shapley function, and a newly proposed market fairness. Based on the specific problem addressed in this paper, market fairness is a new fairness concept involving fairness between multiple backbone nodes and multiple boundary nodes. Finally, a protocol is designed using both repeated games and coalition games. Simulation results show how boundary nodes and backbone nodes form coalitions according to different fairness criteria. The proposed protocol can improve the network connectivity by about 50%, compared with pure repeated game schemes., Comment: to appear in IEEE Transactions on Communications

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results achieved by other investigators., Comment: LaTeX2, 15 pages