Mobile users (or UEs, to use 3GPP terminology) served by small cells in dense urban settings may abruptly experience a significant deterioration in their channel to their serving base stations (BSs) in several scenarios, such as after turning a corner around a tall building, or a sudden knot of traffic blocking the direct path between the UE and its serving BS. In this work, we propose a scheme to temporarily increase the data rate to/from this UE with additional bandwidth from the nearest Coordinated Multi-Point (CoMP) cluster of BSs, while the slower process of handover of the UE to a new serving BS is ongoing. We emphasize that this additional bandwidth is additional to the data rates the UE is getting over its primary connection to the current serving BS and, after the handover, to the new serving BS. The key novelty of the present work is the proposal of a decentralized market-based resource allocation method to perform resource allocation to support Coordinated Beamforming (CB) CoMP. It is scalable to large numbers of UEs and BSs, and it is fast because resource allocations are made bilaterally, between BSs and UEs. Once the resource allocation to the UE has been made, the coordinated of transmissions occurs as per the usual CB methods. Thus the proposed method has the benefit of giving the UE access to its desired amount of resources fast, without waiting for handover to complete, or reporting channel state information before it knows the resources it will be allocated for receiving transmissions from the serving BS.
The widespread application of wireless services and dense devices access have triggered huge energy consumption. Because of the environmental and financial considerations, energy-efficient design in wireless networks becomes an inevitable trend. To the best of the authors' knowledge, energy-efficient orthogonal frequency division multiple access heterogeneous small cell optimization comprehensively considering energy efficiency maximization, power allocation, wireless backhaul bandwidth allocation, and user Quality of Service is a novel approach and research direction, and it has not been inve…
In wireless cloud storage systems, the recovery failure probability depends on not only wireless channel conditions but also storage size of each distributed storage node. For an efficient utilization of limited storage capacity and the performance characterization of allocation strategies, we asymptotically analyze the recovery failure probability of a wireless cloud storage system with a sum storage capacity constraint for both high SNR regime and low SNR regime. Then, we find the optimal storage allocation strategy across distributed storage nodes in terms of the asymptotic recovery failure…
The ever-increasing number of nodes in current and future wireless communication networks brings unprecedented challenges for the allocation of the available communication resources. This is caused by the combinatorial nature of the resource allocation problems, which limits the performance of state-of-the-art techniques when the network size increases. In this paper, we take a new direction and investigate how methods from statistical physics can be used to address resource allocation problems in large networks. To this aim, we propose a novel model of the wireless network based on a type of …
Wireless power charging enables portable devices to be permanently unplugged. Due to its low transmission power and low transmission efficiency, it requires much longer time slot to charge users compared with that for data transmission in wireless communication networks. Besides, each user's demand urgency needs to be taken into consideration for power allocation. Therefore, new algorithms are essential for wireless power allocation in multi-user wireless charging networks. In this paper, this problem is formulated as a static noncooperative game. It is shown that there exists a unique Nash eq…
Cooperative transmission can greatly improve communication system performance by taking advantage of the broadcast nature of wireless channels. Most previous work on resource allocation for cooperation transmission is based on centralized control. In this paper, we propose two share auction mechanisms, the SNR auction and the power auction, to distributively coordinate the resource allocation among users. We prove the existence, uniqueness and effectiveness of the auction results. In particular, the SNR auction leads to a fair resource allocation among users, and the power auction achieves a s…
This paper studies optimal resource allocation in the wireless-powered communication network (WPCN), where one hybrid access-point (H-AP) operating in full-duplex (FD) broadcasts wireless energy to a set of distributed users in the downlink (DL) and at the same time receives independent information from the users via time-division-multiple-access (TDMA) in the uplink (UL). We design an efficient protocol to support simultaneous wireless energy transfer (WET) in the DL and wireless information transmission (WIT) in the UL for the proposed FD-WPCN. We jointly optimize the time allocations to the…
This chapter presents joint interference suppression and power allocation algorithms for DS-CDMA and MIMO networks with multiple hops and amplify-and-forward and decode-and-forward (DF) protocols. A scheme for joint allocation of power levels across the relays and linear interference suppression is proposed. We also consider another strategy for joint interference suppression and relay selection that maximizes the diversity available in the system. Simulations show that the proposed cross-layer optimization algorithms obtain significant gains in capacity and performance over existing schemes.
This paper investigates an orthogonal frequency division multiplexing (OFDM)-based wireless powered communication system, where one user harvests energy from an energy access point (EAP) to power its information transmission to a data access point (DAP). The channels from the EAP to the user, i.e., the wireless energy transfer (WET) link, and from the user to the DAP, i.e., the wireless information transfer (WIT) link, vary over both time slots and sub-channels (SCs) in general. To avoid interference at DAP, WET and WIT are scheduled over orthogonal SCs at any slot. Our objective is to maximiz…
In this paper, we consider a multihop wireless sensor network with multiple relay nodes for each hop where the amplify-and-forward scheme is employed. We present algorithmic strategies to jointly design linear receivers and the power allocation parameters via an alternating optimization approach subject to different power constraints which include global, local and individual ones. Two design criteria are considered: the first one minimizes the mean-square error and the second one maximizes the sum-rate of the wireless sensor network. We derive constrained minimum mean-square error and constra…
The problem of noncooperative resource allocation in a multipoint-to-multipoint cellular network is considered in this paper. The considered scenario is general enough to represent several key instances of modern wireless networks such as a multicellular network, a peer-to-peer network (interference channel), and a wireless network equipped with femtocells. In particular, the problem of joint transmit waveforms adaptation, linear receiver design, and transmit power control is examined. Several utility functions to be maximized are considered, and, among them, we cite the received SINR, and the…
In this paper, a reduced complexity algorithm is proposed for grouped-subcarriers and power allocation in the downlink of OFDMA packet access wireless systems. The available subcarriers for data communication are grouped into partitions (groups) where each group is defined as a subchannel. The scheduler located at the base station allocates subchannels to users based on the variance of subchannel gains. The proposed algorithm for group allocation is a two-step algorithm that allocates groups to users based on the descending order of their variances to resolve the conflicting selection problem,…
This paper investigates quantization of channel state information (CSI) and bit allocation across wireless links in a multi-source, single-relay cooperative cellular network. Our goal is to minimize the loss in performance, measured as the achievable sum rate, due to limited-rate quantization of CSI. We develop both a channel quantization scheme and allocation of limited feedback bits to the various wireless links. We assume that the quantized CSI is reported to a central node responsible for optimal resource allocation. We first derive tight lower and upper bounds on the difference in rates b…
In this paper, we study the resource allocation algorithm design for multiuser orthogonal frequency division multiplexing (OFDM) downlink systems with simultaneous wireless information and power transfer. The algorithm design is formulated as a non-convex optimization problem for maximizing the energy efficiency of data transmission (bit/Joule delivered to the users). In particular, the problem formulation takes into account the minimum required system data rate, heterogeneous minimum required power transfers to the users, and the circuit power consumption. Subsequently, by exploiting the meth…
Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Joint bandwidth and power allocation strategies for wireless multi-user networks with and without relaying are proposed in this paper for (i) the maximization of the sum capacity of all users; (ii) the maximization of the worst user capacity; and (iii) the minimization of the total power consumption of all users. It is shown that the proposed allocation problems are convex and, therefore, can be solved efficiently. Moreover, the admission control based jo…
In this paper, we consider a multiple-input multiple-output wireless powered communication network (MIMO-WPCN), where multiple users harvest energy from a dedicated power station in order to be able to transmit their information signals to an information receiving station. Employing a practical non-linear energy harvesting (EH) model, we propose a joint time allocation and power control scheme, which takes into account the uncertainty regarding the channel state information (CSI) and provides robustness against imperfect CSI knowledge. In particular, we formulate two non-convex optimization pr…
In this paper, we consider wireless powered communication networks which could operate perpetually, as the base station (BS) broadcasts energy to the multiple energy harvesting (EH) information transmitters. These employ "harvest then transmit" mechanism, as they spend all of their energy harvested during the previous BS energy broadcast to transmit the information towards the BS. Assuming time division multiple access (TDMA), we propose a novel transmission scheme for jointly optimal allocation of the BS broadcasting power and time sharing among the wireless nodes, which maximizes the overall…
Mobile edge computing (MEC) is an emerging paradigm that mobile devices can offload the computation-intensive or latency-critical tasks to the nearby MEC servers, so as to save energy and extend battery life. Unlike the cloud server, MEC server is a small-scale data center deployed at a wireless access point, thus it is highly sensitive to both radio and computing resource. In this paper, we consider an Orthogonal Frequency-Division Multiplexing Access (OFDMA) based multi-user and multi-MEC-server system, where the task offloading strategies and wireless resources allocation are jointly invest…
Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy throughput per Joule under link security requirements. Three scenarios for the access of channel state information are considered: the perfect channel state information, partial channel state information with channels from the transmitters to the eavesdropper exponentially distributed, and not perfectly known channels between the transmitters and the users with ex…
In this letter, we consider a wireless-powered backscatter communication (WP-BackCom) network, where the transmitter first harvests energy from a dedicated energy RF source in the sleep state, and then backscatters information and harvests energy simultaneously through a reflection coefficient. Our goal is to maximize the achievable energy efficiency of the WP-BackCom network via jointly optimizing time allocation, reflection coefficient and transmit power of the dedicated energy RF source. The optimization problem is non-convex and challenging to solve. We develop an efficient Dinkelbach-base…
This paper considers wireless-powered cooperative jamming (CJ) to secure communication between a transmitter (Tx) and an information receiver (IR), in the presence of an energy receiver (ER) which is termed as a potential eavesdropper. The full-duplex jammer harvests energy from the Tx's information signal and transmits jamming signal at the same time, where the jamming signal not only confounds the ER (potential eavesdropper) but also charges the ER. Our goal is to maximize the secrecy information rate by jointly optimizing the power allocation at the Tx and jammer while maintaining the harve…
In this paper, efficient resource allocation for the uplink transmission of wireless powered IoT networks is investigated. We adopt LoRa technology as an example in the IoT network, but this work is still suitable for other communication technologies. Allocating limited resources, like spectrum and energy resources, among a massive number of users faces critical challenges. We consider grouping wireless powered IoT users into available channels first and then investigate power allocation for users grouped in the same channel to improve the network throughput. Specifically, the user grouping pr…
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and is hard to deal with for large number of sub channels and/or users. However, relying on some approximation methods, it is demonstrated that the proposed sub-optimal problem has roots in combinatorial opti…
This paper considers an orthogonal frequency division multiplexing (OFDM) downlink point-to-point system with simultaneous wireless information and power transfer. It is assumed that the receiver is able to harvest energy from noise, interference, and the desired signals. We study the design of power allocation algorithms maximizing the energy efficiency of data transmission (bit/Joule delivered to the receiver). In particular, the algorithm design is formulated as a high-dimensional non-convex optimization problem which takes into account the circuit power consumption, the minimum required da…
Simultaneous wireless information and power transfer (SWIPT) provides a promising solution for enabling perpetual wireless networks. As energy efficiency (EE) is an im- portant evaluation of system performance, this thesis studies energy-efficient resource allocation algorithm designs in SWIPT systems. We first investigate the trade-off between the EE for information transmission, the EE for power transfer, and the total transmit power in a basic SWIPT system with separated receivers. A multi-objective optimization problem is formulated under the constraint of maximum transmit power. We propos…
Most work on wireless network resource allocation use physical layer performance such as sum rate and outage probability as the figure of merit. These metrics may not reflect the true user QoS in future heterogenous networks (HetNets) with many small cells, due to large traffic variations in overlapping cells with complicated interference conditions. This paper studies the spectrum allocation problem in HetNets using the average packet sojourn time as the performance metric. To be specific, in a HetNet with $K$ base terminal stations (BTS's), we determine the optimal partition of the spectrum …
In this paper, we consider the sum $α$-fair utility maximization problem for joint downlink (DL) and uplink (UL) transmissions of a wireless powered communication network (WPCN) via time and power allocation. In the DL, the users with energy harvesting receiver architecture decode information and harvest energy based on simultaneous wireless information and power transfer. While in the UL, the users utilize the harvested energy for information transmission, and harvest energy when other users transmit UL information. We show that the general sum $α$-fair utility maximization problem can be tra…
We consider the distributed uplink resource allocation problem in a multi-carrier wireless network with multiple access points (APs). Each mobile user can optimize its own transmission rate by selecting a suitable AP and by controlling its transmit power. Our objective is to devise suitable algorithms by which mobile users can jointly perform these tasks in a distributed manner. Our approach relies on a game theoretic formulation of the joint power control and AP selection problem. In the proposed game, each user is a player with an associated strategy containing a discrete variable (the AP se…
Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem. This work studiesWSN joint time and frequency channel allocation for a given routing tree, such that: a) allocation is performed in a fully distributed way, i.e., information exchange is only performed among neighboring WSN terminals, within communication up to two hops, and b) detection of potential interfering terminals is simplified and can be practically r…
This paper considers the power allocation of a single-link wireless communication with joint energy harvesting and grid power supply. We formulate the problem as minimizing the grid power consumption with random energy and data arrival, and analyze the structure of the optimal power allocation policy in some special cases. For the case that all the packets are arrived before transmission, it is a dual problem of throughput maximization, and the optimal solution is found by the two-stage water filling (WF) policy, which allocates the harvested energy in the first stage, and then allocates the p…
The recent significant progress in realizing full-duplex~(FD) systems has opened up a promising avenue for improving quality of service (QoS) and quality of experience (QoE) in future wireless networks. There is an urgent need to address the diverse set of challenges regarding different aspects of FD network design, theory, and development. In addition to the self-interference cancelation signal processing algorithms, network protocols such as resource management are also essential in the practical design and implementation of FD wireless networks. This article aims to present the latest devel…
We consider the use of energy harvesters, in place of conventional batteries with fixed energy storage, for point-to-point wireless communications. In addition to the challenge of transmitting in a channel with time selective fading, energy harvesters provide a perpetual but unreliable energy source. In this paper, we consider the problem of energy allocation over a finite horizon, taking into account channel conditions and energy sources that are time varying, so as to maximize the throughput. Two types of side information (SI) on the channel conditions and harvested energy are assumed to be …
As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the capacity is established, and is further demonstrated via the Gaussian case, for which the synchronized and asynchronized capacities are obtained. The capacity achieving power allocation at the source and relay nodes among the subchannels is characterized. The fading relay channel is then studied, for which resource allocations that maximize the achievable rates a…
We consider the problem of decentralized detection where peripheral nodes make noisy observations of a phenomenon and send quantized information about the phenomenon towards a fusion center over a sum-rate constrained multiple access channel. The fusion center then makes a decision about the state of the phenomenon based on the aggregate received data. Using the Chernoff information as a performance metric, Chamberland and Veeravalli previously studied the structure of optimal rate allocation strategies for this scenario under the assumption of an unlimited number of sensors. Our key contribut…
This paper investigates a multi-input single-output (MISO) wireless powered communication network (WPCN) under the protocol of harvest-then-transmit. The power station (PS) with reliable power supply can replenish the passive user nodes by wireless power transfer (WPT) in the downlink (DL), then each user node transmits independent information to the sink by a time division multiple access (TDMA) scheme in the uplink (UL). We consider the joint time allocation and beamforming design to maximize the system sum-throughput. The semidefinite relaxation (SDR) technique is applied to solve the nonco…
The time-varying feature of wireless channels usually makes the hard delay bound for data transmissions unrealistic to guarantee. In contrast, the statistically-bounded delay with a small violation probability has been widely used for delay quality-of-service (QoS) characterization and evaluation. While existing research mainly focused on the statistical-delay control in single-hop links, in this paper we propose the QoS-driven power-allocation scheme over two-hop wireless relay links to statistically upper-bound the end-to-end delay under the decodeand- forward (DF) relay transmissions. Speci…
We study an one-hop device-to-device (D2D) assisted wireless caching network, where popular files are randomly and independently cached in the memory of end-users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through an one-hop D2D transmission, or from the base station (BS). We formulate a joint D2D link scheduling and power allocation problem to maximize the system throughput. However, the problem is non-convex and obtaining an optimal solution is computationally hard. Alternatively, we decompose the problem into a D2D link schedulin…
Intel Labs（英特尔实验室）；Georgia Institute of Technology（佐治亚理工学院）；Zhejiang University（浙江大学）
It has been a long-held belief that judicious resource allocation is critical to mitigating interference, improving network efficiency, and ultimately optimizing wireless communication performance. The traditional wisdom is to explicitly formulate resource allocation as an optimization problem and then exploit mathematical programming to solve the problem to a certain level of optimality. Nonetheless, as wireless networks become increasingly diverse and complex, e.g., in the high-mobility vehicular networks, the current design methodologies face significant challenges and thus call for rethink…
In this paper, we investigate the problem of jointly selecting a predefined number of energy-harvesting (EH) sensors and computing the optimal power allocation. The ultimate goal is to minimize the reconstruction distortion at the fusion center. This optimization problem is, unfortunately, non-convex. To circumvent that, we propose two suboptimal strategies: (i) a joint sensor selection and power allocation (JSS-EH) scheme that, we prove, is capable of iteratively finding a stationary solution of the original problem from a sequence of surrogate convex problems; and (ii) a separate sensor sele…
In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links…
We study outage regions for energy-constrained multi-hop and adaptive multi-route networks with an arbitrary number of relay nodes. Optimal power allocation strategies in the sense that outage probability is minimized are derived depending on the distances between the transmit nodes. We further investigate the rate gain of adaptive multi-route and multi-hop over direct transmission. It is shown that a combined strategy of direct transmission and adaptive multi-route outperforms multi-hop for all values of rate R. It can be stated that cooperation strategies are beneficial for low-rate systems …
The study investigated the allocation of transmission power and bits for a point-to-point orthogonal frequency-division multiplexing channel assuming perfect channel information at the receiver, but imperfect channel information at the transmitter. Channel information was quantized at the receiver and was sent back to the transmitter via a finite-rate feedback channel. Based on limited feedback from the receiver, the corresponding transmitter adapted the power level and/or modulation across subcarriers. To reduce the amount of feedback, subcarriers were partitioned into different clusters and …
In this paper, a novel approach for optimizing and managing resource allocation in wireless small cell networks (SCNs) with device-to-device (D2D) communication is proposed. The proposed approach allows to jointly exploit both the wireless and social context of wireless users for optimizing the overall allocation of resources and improving traffic offload in SCNs. This context-aware resource allocation problem is formulated as a matching game in which user equipments (UEs) and resource blocks (RBs) rank one another, based on utility functions that capture both wireless and social metrics. Due …
Over the last decade, simultaneous wireless information and power transfer (SWIPT) has become a practical and promising solution for connecting and recharging battery-limited devices, thanks to significant advances in low-power electronics technology and wireless communications techniques. To realize the promised potentials, advanced resource allocation design plays a decisive role in revealing, understanding, and exploiting the intrinsic rate-energy tradeoff capitalizing on the dual use of radio frequency (RF) signals for wireless charging and communication. In this paper, we provide a compre…
This paper addresses join wireless and computing resource allocation in mobile edge computing (MEC) systems with several access points and with the possibility that users connect to many access points, and utilize the computation capability of many servers at the same time. The problem of sum transmission energy minimization under response time constraints is considered. It is proved, that the optimization problem is non-convex. The complexity of optimization of a part of the system parameters is investigated, and based on these results an Iterative Resource Allocation procedure is proposed, t…
We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and …
To cope with the ever increasing demand for bandwidth, future wireless networks will be designed with reuse distance equal to one. This scenario requires the implementation of techniques able to manage the strong multiple access interference each cell generates towards its neighbor cells. In particular, low complexity and reduced feedback are important requirements for practical algorithms. In this paper we study an allocation problem for OFDMA networks formulated with the objective of minimizing the load of each cell in the system subject to the constraint that each user meets its target rate…
The rich mobile data and edge computing enabled wireless networks motivate to deploy artificial intelligence (AI) at network edge, known as \emph{edge AI}, which integrates wireless communication and machine learning. In communication, data bits are equally important, while in machine learning some data bits are more important. Therefore we can allocate more radio resources to the more important data and allocate less radio resources to the less important data, so as to efficiently utilize the limited radio resources. To this end, how to define "more or less important" of data is the key probl…
Immersive social interactions of mobile users are soon to be enabled within a virtual space, by means of virtual reality (VR) technologies and wireless cellular systems. In a VR mobile social network, the states of all interacting users should be updated synchronously and with low latency via two-way communications with edge computing servers. The resulting end-to-end latency depends on the relationship between the virtual and physical locations of the wireless VR users and of the edge servers. In this work, the problem of analyzing and optimizing the end-to-end latency is investigated for a s…
An overview of game-theoretic approaches to energy-efficient resource allocation in wireless networks is presented. Focusing on multiple-access networks, it is demonstrated that game theory can be used as an effective tool to study resource allocation in wireless networks with quality-of-service (QoS) constraints. A family of non-cooperative (distributed) games is presented in which each user seeks to choose a strategy that maximizes its own utility while satisfying its QoS requirements. The utility function considered here measures the number of reliable bits that are transmitted per joule of…
This paper investigates a new downlink nonorthogonal multiple access (NOMA) system, where a multiantenna unmanned aerial vehicle (UAV) is powered by wireless power transfer (WPT) and serves as the base station for multiple pairs of ground users (GUs) running NOMA in each pair. An energy efficiency (EE) maximization problem is formulated to jointly optimize the WPT time and the placement for the UAV, and the allocation of the UAV's transmit power between different NOMA user pairs and within each pair. To efficiently solve this nonconvex problem, we decompose the problem into three subproblems u…
The freshness or timeliness of data at server is a significant key performance indicator of sensor networks, especially in tolerance critical applications such as factory automation. As an effective and intuitive measurement to data timeliness, the metric of Age of Information (AoI) has attracted an intensive recent interest of research. This paper initiates a study on the AoI of wireless sensor networks working in the finite blocklength (FBL) regime as a resource allocation problem, and proposes to minimize the long-term discounted system AoI as a Markov decision process (MDP). The proposed m…
In this paper, an intelligent reflecting surface (IRS)-aided two-way decode-and-forward (DF) relay wireless network is considered, where two users exchange information via IRS and DF relay. To enhance the sum rate performance, three power allocation (PA) strategies are proposed. Firstly, a method of maximizing sum rate (Max-SR) is proposed to jointly optimize the PA factors of user U1, user U2 and relay station (RS). To further improve the sum rate performance, two high-performance schemes, namely maximizing minimum sum rate (Max-Min-SR) and maximizing sum rate with rate constraint (Max-SR-RC)…
In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for power-constrained Internet-of-Things (IoT) smart devices, where IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI). We formulate a hybrid access point (HAP) transmit energy minimization problem by jointly optimizing time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient under the imperfect CS…
Southern University of Science and Technology（南方科技大学）；Sifakis Research Institute of Trustworthy Autonomous Systems（思法基可信自主系统研究院）
Edge intelligence is an emerging network architecture that integrates sensing, communication, computing components, and supports various machine learning applications, where a fundamental communication question is: how to allocate the limited wireless resources (such as time, energy) to the simultaneous model training of heterogeneous learning tasks? Existing methods ignore two important facts: 1) different models have heterogeneous demands on training data; 2) there is a mismatch between the simulated environment and the real-world environment. As a result, they could lead to low learning per…
Reconfigurable Intelligent Surfaces (RISs) are recently attracting a wide interest due to their capability of tuning wireless propagation environments in order to increase the system performance of wireless networks. In this paper, a multiuser single-cell wireless network assisted by a RIS is studied. First of all, for the special case of a single-user system, three possible approaches are shown in order to optimize the Signal-to-Noise Ratio with respect to the beamformer used at the base station and to the RIS phase shifts. Then, for a multiuser system, assuming channel-matched beamforming, t…
