Search

This paper investigates physical layer security for a large-scale WSN with random multiple access, where each fusion center in the network randomly schedules a number of sensors to upload their sensed data subject to the overhearing of randomly distributed eavesdroppers. We propose an uncoordinated random jamming scheme in which those unscheduled sensors send jamming signals with a certain probability to defeat the eavesdroppers. With the aid of stochastic geometry theory and order statistics, we derive analytical expressions for the connection outage probability and secrecy outage probability to characterize transmission reliability and secrecy, respectively. Based on the obtained analytical results, we formulate an optimization problem for maximizing the sum secrecy throughput subject to both reliability and secrecy constraints, considering a joint design of the wiretap code rates for each scheduled sensor and the jamming probability for the unscheduled sensors. We provide both optimal and low-complexity sub-optimal algorithms to tackle the above problem, and further reveal various properties on the optimal parameters which are useful to guide practical designs. In particular, we demonstrate that the proposed random jamming scheme is beneficial for improving the sum secrecy throughput, and the optimal jamming probability is the result of trade-off between secrecy and throughput. We also show that the throughput performance of the sub-optimal scheme approaches that of the optimal one when facing a stringent reliability constraint or a loose secrecy constraint. [ABSTRACT FROM AUTHOR]

The incorporation of intelligent reflecting surface (IRS) into wireless communication systems can extend the coverage and enhance the data transmission rate. This paper studies the joint transceiver and IRS designs in IRS-assisted multi-input multi-output (MIMO) systems under both perfect channel state information (CSI) and imperfect CSI. Specifically, the transmit precoder, reflection coefficients at the IRS, and receive equalizer are jointly optimized to minimize the data detection mean square error (MSE), subject to the transmission power constraint and the modulus constraints for IRS reflection coefficients. The design problems, non-convex and challenging, are tackled under the framework of alternating optimization. For the design with perfect CSI, we successively optimize the IRS reflection coefficients given the precoder and present the closed-form optimal angle of one reflection coefficient given the others. For the robust design with imperfect CSI, we first average the detection MSE over channel uncertainties by using a generalized statistical CSI error model. Then, the averaged MSE is approximated by a more tractable upper bound. Subsequently, the robust design problem is elaborately transformed into a form similar to the problem with perfect CSI. Numerical results demonstrate the effectiveness of the proposed designs as compared to various benchmark schemes. [ABSTRACT FROM AUTHOR]

The one-dimensional (1-D) Golay complementary set (GCS) has many well-known properties and has been widely employed in communications engineering. The concept of 1-D GCS can be extended to the two-dimensional (2-D) Golay complementary array set (GCAS) where the 2-D aperiodic autocorrelations of constituent arrays sum to zero except for the 2-D zero shift. The 2-D GCAS includes the 2-D Golay complementary array pair (GCAP) as a special case when the set size is 2. In this paper, 2-D generalized Boolean functions are introduced and constructions of 2-D GCAPs, 2-D GCASs, and 2-D Golay complementary array mates based on generalized Boolean functions are proposed. Explicit expressions of 2-D Boolean functions for 2-D GCAPs and 2-D GCASs are given. Therefore, they are all direct constructions without the aid of other existing 1-D or 2-D sequences. Moreover, the peak-to-average power ratio (PAPR) properties of the column sequences and row sequences of the constructed 2-D GCAPs and 2-D GCASs are investigated and the PAPRs are proved to be upper bounded. [ABSTRACT FROM AUTHOR]

Matrix multiplication is a fundamental building block in various distributed computing algorithms. In order to multiply large matrices, it is common practice to distribute the computation into multiple tasks running on different nodes. In order to tolerate stragglers among such nodes, various coding schemes have been proposed by adding additional coded tasks. However, most existing coding schemes for matrix multiplication are constructed for only one matrix multiplication, while batch matrix multiplication is common in large-scale distributed computing workloads. In this paper, we propose Rook Coding (RC), a novel polynomial-based coding framework for computing the multiplication of $n$ pairs of matrices in batch. Designed to achieve lower encoding time in practice, we construct RC as polynomials of much simpler forms than existing coding schemes for batch matrix multiplication, achieving a recovery threshold of $O(n^{\log _{2} ~3})$. Compared to existing coding schemes, RC achieves a lower encoding complexity in practice, because of its simpler forms in the encoding polynomials. Through extensive experiments, we show that RC can save the time of the whole job thanks to its low overhead of encoding. [ABSTRACT FROM AUTHOR]

Most existing random access schemes for machine-type communications (MTC) simply adopt a uniform preamble selection distribution, irrespective of the underlying device activity distributions. Hence, they may yield unsatisfactory access efficiency. In this paper, we model device activities for MTC as multiple Bernoulli random variables following an arbitrary multivariate Bernoulli distribution which can reflect both dependent and independent device activities. Then, we optimize preamble selection and access barring for random access in MTC according to the underlying joint device activity distribution. Specifically, we investigate three cases of the joint device activity distribution, i.e., the cases of perfect, imperfect, and unknown joint device activity distributions, and formulate the average, worst-case average, and sample average throughput maximization problems, respectively. The problems in the three cases are challenging nonconvex problems. In the case of perfect joint device activity distribution, we develop an iterative algorithm and a low-complexity iterative algorithm to obtain stationary points of the original problem and an approximate problem, respectively. In the case of imperfect joint device activity distribution, we develop an iterative algorithm and a low-complexity iterative algorithm to obtain a Karush-Kuhn-Tucker (KKT) point of an equivalent problem and a stationary point of an approximate problem, respectively. Finally, in the case of unknown joint device activity distribution, we develop an iterative algorithm to obtain a stationary point. The proposed solutions are widely applicable and outperform existing solutions for dependent and independent device activities. [ABSTRACT FROM AUTHOR]

Caching popular contents at edge networks (such as small-cell base stations) has been proposed to deal with the ever-growing mobile traffic. At the meantime, recommendation system is able to shape user demands for further prompting caching gain. In this paper, we study a multi-antenna multi-cell edge network employing transmit beamforming with caching-aware recommendation and user association. We first establish a framework for the joint problem of beamforming, user association, content caching and recommendation to minimize the content transmission delay of mobile users, by specifying a set of necessary conditions for all four component functions of the network. The resulting optimization problem corresponds to a non-convex, multi-timescale, and mixed-integer programming problem, which is hard to handle. To deal with the difficulty in solving the joint optimization problem by the direct formulation, we equivalently decompose it into three sub-problems. Then, we develop a computationally-efficient iterative algorithm to obtain the sub-optimal solution, where the three subproblems are tackled iteratively. Simulation results are conducted to demonstrate that the proposed algorithm can obtain lower transmission delay than baseline schemes. [ABSTRACT FROM AUTHOR]

The performance of distributed computing is restricted by the slowest worker nodes, known as stragglers, in the system. Coded computation has emerged as an efficient technique to mitigate the straggler effects in distributed computing. Most existing works only considered the computation straggler for single-hop networks. However, in multi-hop networks, the straggler effects will occur not only on worker nodes but also on relay nodes. In this paper, we consider a heterogeneous multi-hop network. The nodes in the network are heterogeneous, i.e., their computation capacities and transmission capacities are different. We propose a hierarchical coding scheme for such a network. Firstly, we reorganize it into a hierarchical network containing multiple layers. Each layer in the network consists of several groups. Then, a new hierarchical coding scheme is proposed, where coding is applied to each group to mitigate the stragglers. By taking both the computation time and transmission time into consideration, the overall task completion time is derived. To improve the performance of the network, heterogeneous hierarchical coded computation (HHCC) algorithm is proposed to provide an asymptotically optimal task allocation strategy. Compared with existing uniform uncoded, load balanced uncoded, and heterogeneous coded matrix multiplication schemes, HHCC has significant improvement. [ABSTRACT FROM AUTHOR]

Vehicle-to-vehicle (V2V) communications under dense urban environments usually experience severe keyhole fading effect especially for multi-input multi-output (MIMO) channels, which degrades the capacity and outage performance due to the rank deficiency. To avoid these, the integration of MIMO and hybrid automatic repeat request (HARQ) is proposed to assist V2V communications in this paper. By using the methods of integral transforms, the outage probabilities are derived in closed-form for different HARQ-assisted schemes, including Type I-HARQ, HARQ with chase combining (HARQ-CC), and HARQ with incremental redundancy (HARQ-IR). With the results, meaningful insights are gained by conducting the asymptotic outage analysis. Specifically, it is revealed that full time diversity order can be achieved, while full spatial diversity order is unreachable as compared to MIMO-HARQ systems without keyhole effect. Moreover, we prove that the asymptotic outage probability is a monotonically increasing and convex function of the transmission rate. More importantly, although HARQ-IR performs better than HARQ-CC owing to its higher coding complexity, this advantage becomes negligible in the large-scale array regime. Finally, the numerical results are verified by Monte-Carlo simulations along with some in-depth discussions. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the modeling and design of intelligent reflecting surface (IRS)-assisted optical communication systems, which can circumvent the line-of-sight (LOS) requirement in multi-link free space optical (FSO) systems. The FSO laser beams incident on the optical IRSs have a Gaussian power intensity profile and a nonlinear phase profile, whereas the plane waves in radio frequency (RF) systems have a uniform power intensity profile and a linear phase profile. Given these substantial differences, the results available for IRS-assisted RF systems are not applicable to IRS-assisted FSO systems. Therefore, we develop a new analytical channel model for point-to-point IRS-assisted FSO systems based on the Huygens-Fresnel principle. Our analytical model captures the impact of the size, position, and orientation of the IRS as well as its phase shift profile on the end-to-end channel. To allow the sharing of the optical IRS by multiple FSO links, we propose three different protocols, namely the time division (TD), IRS-division (IRSD), and IRS homogenization (IRSH) protocols. The proposed protocols address the specific characteristics of FSO systems including the non-uniformity and possible misalignment of the laser beams. Furthermore, to compare the proposed IRS sharing protocols, we analyze the bit error rate (BER) and the outage probability of IRS-assisted multi-link FSO systems in the presence of inter-link interference. Our simulation results validate the accuracy of the proposed analytical channel model for IRS-assisted FSO systems and confirm that this model is applicable for both large and intermediate IRS-receiver lens distances. Furthermore, we show that for the proposed IRSD and IRSH protocols, inter-link interference becomes negligible if the laser beams are properly centered on the IRS and the transceivers are carefully positioned, respectively. Moreover, in the absence of misalignment errors, the IRSD protocol outperforms the other protocols, whereas in the presence of misalignment errors, the IRSH protocol performs significantly better than the IRSD protocol. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is a popular edge learning approach that utilizes local data and computing resources of network edge devices to train machine learning (ML) models while preserving users’ privacy. Nevertheless, performing efficient learning tasks on the devices and achieving longer battery life are primary challenges faced by federated learning. In this paper, we are the first to study the application of heterogeneous computing (HC) and wireless power transfer (WPT) to federated learning to address these challenges. Especially, we propose a heterogeneous computation and resource allocation framework based on a heterogeneous mobile architecture to achieve effective implementation of FL. To minimize the energy consumption of smart devices and maximize their harvesting energy simultaneously, we formulate an optimization problem featuring multidimensional control, which jointly considers time splitting for WPT, dataset size allocation, transmit power allocation and subcarrier assignment during communications, and processor frequency of processing units (central processing unit (CPU) and graphics processing unit (GPU)). However, the major obstacle is how to design a proper algorithm to solve this optimization problem efficiently. For this purpose, we decouple the optimization variables so as to achieve high efficiency in deriving its solution. Particularly, we first compute the optimal processor frequency and dataset size allocation via employing the Lagrangian dual method, followed by finding the closed-form solution to the optimal time splitting allocation, and finally attain the optimal subcarrier assignment as well as transmit power for transmissions through an iteration algorithm. To evaluate the performance of our proposed scheme, we set up four baseline schemes as comparison, and simulation results show that the proposed scheme converges quite fast and better enhance the energy efficiency of the wireless powered FL system compared with the baseline schemes. [ABSTRACT FROM AUTHOR]

In this paper, we consider a scheduling problem, in which several streams of status update packets with different priority levels are sent through a shared channel to their destinations. We introduce a notion of lexicographic age optimality, or simply lex-age-optimality, to evaluate the performance of multi-class status update policies. In particular, a lex-age-optimal scheduling policy first minimizes the Age of Information (AoI) metrics for high-priority streams, and then, within the set of optimal policies for high-priority streams, achieves the minimum AoI metrics for low-priority streams. We propose a new scheduling policy named Preemptive Priority, Maximum Age First, Last-Generated, First-Served (PP-MAF-LGFS), and prove that the PP-MAF-LGFS scheduling policy is lex-age-optimal. This result holds (i) for minimizing any time-dependent, symmetric, and non-decreasing age penalty function; (ii) for minimizing any non-decreasing functional of the stochastic process formed by the age penalty function; and (iii) for the cases where different priority classes have distinct arrival traffic patterns, age penalty functions, and age penalty functionals. For example, the PP-MAF-LGFS scheduling policy is lex-age-optimal for minimizing the probability of age violation of a high-priority stream and the time-average age of a low-priority stream. Numerical results are provided to illustrate our theoretical findings. [ABSTRACT FROM AUTHOR]

This paper considers an uplink reconfigurable intelligent surface (RIS)-aided massive multiple-input multiple-output (MIMO) system, where the phase shifts of the RIS are designed relying on statistical channel state information (CSI). Considering the complex environment, the general Rician channel model is adopted for both the users-RIS links and RIS-BS links. We first derive the closed-form approximate expressions for the achievable rate which holds for arbitrary numbers of base station (BS) antennas and RIS elements. Then, we utilize the derived expressions to provide some insights, including the asymptotic rate performance, the power scaling laws, and the impacts of various system parameters on the achievable rate. We also tackle the sum-rate maximization and the minimum user rate maximization problems by optimizing the phase shifts at the RIS based on genetic algorithm (GA). Finally, extensive simulations are provided to validate the benefits by integrating RIS into conventional massive MIMO systems. Our simulations also demonstrate the feasibility of deploying large-size but low-resolution RIS in massive MIMO systems. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) has emerged as an important transmission technology for numerous applications in Internet of Things (IoT) systems. Thus, in this paper, we investigate the application of RIS in energy harvesting (EH) based unmanned aerial vehicle (UAV) communication network with finite block length (BL) codes, where a rotary wing type flying UAV communicates with the multiple single antenna IoT users with the aid of multiple RISs mounted on several skyscraper buildings. To transmit the signal to a particular IoT user, the UAV selects an RIS on the basis of either UAV-RIS (i.e., partial) or UAV-RIS-IoT (i.e., full) channel state information (CSI) and then transmits the signal through the selected RIS along with the direct link transmission. In particular, we derive (i) the expression for probability of RIS selection, (ii) the statistical distribution of instantaneously received information signal-to-noise ratio (SNR) at the IoT user. Based on the derived statistics, we analyze the performance of the considered system under finite BL codes in terms of the average outage probability, average block error rate (ABLER) and goodput averaged over entire flying duration. Moreover, the BLER performance with finite BL codes is also compared with the infinite BL codes scenario. Additionally, we also investigate the impact of various channel and system parameters like imperfect CSI, number of RISs and the number of reflecting elements at each RIS, location of IoT users, variable altitude of the UAV, and the severity of channel fading of UAV-RIS link on the system performance. Furthermore, we have obtained the optimum UAV location in each time slot which minimizes the ABLER per time slot over all the users in the network. The analytical results are corroborated with Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

Multi-access edge computing (MEC) has been one promising solution to reduce the computation delay of wireless devices. Due to the high spectrum efficiency of non-orthogonal multiple access (NOMA), this paper studies the single-user multi-edge-server MEC system based on downlink NOMA, aiming to minimize task computation delay by jointly optimizing the NOMA-based transmission duration (TD) and workload offloading allocation (WOA) among edge computing servers. This task computation delay minimization (CDM) problem is formulated as a nonconvex optimization problem. To solve the CDM problem efficiently, we decompose it into the sub-problem of determining the optimal WOA with a given TD and the top-problem of optimizing the TD. For the sub-problem, we first derive its some important properties and then design an efficient channel quality ranking based algorithm to obtain the optimal WOA. We solve the top-problem for the static-channel and dynamic-channel scenarios, respectively. For the static-channel scenario, we design an optimal algorithm which only apply once the golden section search method to obtain the optimal TD of first task and directly obtain the optimal offloading solution for any consequently arrived task with different workloads. For the dynamic-channel scenario where the channel qualities from the wireless device to the edge-computing servers are varying, it is critical to quickly determine the current task’s offloading solution under the current channel state and task workload, which is very challenging for the traditional optimization methods. In order to conquer this challenge, we propose the deep reinforcement learning (DRL) based algorithm, which can obtain the near-optimal offloading solution instantly after enough learning. Finally, we validate through simulations the advantages of NOMA over frequency division multiple access (FDMA). [ABSTRACT FROM AUTHOR]

Ultra-reliable low-latency communication (URLLC) is essential for future vehicle-to-vehicle (V2V) networks to improve traffic safety and enhance driving experience. Due to the fast-varying channel caused by high mobility, guaranteeing latency and reliability performance of the V2V links is a tremendous challenge. In this paper, we propose a novel resource allocation framework to support ultra-reliable low-latency V2V communications. The proposed framework includes both large-scale and small-scale resource optimizations. The large-scale resource allocation is performed at the central base station based on large-scale channel information periodically collected from vehicles. On the other hand, the small-scale resource allocation is performed at the vehicles according to instantaneous channel and queuing information. We develop optimal solutions for both resource allocation problems. With the proposed optimal solutions, the latency performance at the occurrence of extreme events is enhanced by enabling spectrum sharing among the vehicles. Simulation results demonstrate that the proposed algorithm can effectively improve the URLLC performance compared against the benchmark algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a new receiver design based on basis expansion model (BEM) orthogonal time frequency space (OTFS) is presented for high-mobility communications with Doppler-spread channel. By deriving an analytical BEM OTFS system model, a low-order generalized complex exponential BEM (GCE-BEM) aided rough channel estimation is proposed at the initial stage with low pilot overhead, followed by equalization. Then, the refinement of channel estimation and equalization is conducted iteratively, in which a high-resolution GCE-BEM model with a large BEM order is adopted and the detected data symbols are exploited as pseudo-pilots, leading to higher estimation accuracy. Simulation results show that the proposed BEM OTFS receiver significantly outperforms the existing OTFS receivers in terms of the mean square error (MSE) of channel estimation and bit error rate (BER), while featuring low pilot overhead. Results also show the near-optimal performance of the novel solution, i.e., achieved BER is very close to the case of perfect channel estimation. The theoretical lower bound on MSE of channel estimation is derived to verify the effectiveness of the proposed BEM OTFS receiver, which is shown to be close to simulation results. [ABSTRACT FROM AUTHOR]

This paper considers a resource allocation problem where several Internet-of-Things (IoT) devices send data to a base station (BS) with or without the help of the reconfigurable intelligent surface (RIS) assisted cellular network. The objective is to maximize the sum rate of all IoT devices by finding the optimal RIS and spreading factor (SF) for each device. Since these IoT devices lack prior information of the RISs or the channel state information (CSI), a distributed resource allocation framework with low complexity and learning features is required to achieve this goal. Therefore, we model this problem as a two-stage multi-player multi-armed bandit (MPMAB) framework to learn the optimal RIS and SF sequentially. Then, we put forth an exploration and exploitation boosting (E2Boost) algorithm to solve this two-stage MPMAB problem by combining the $\epsilon $ -greedy algorithm, Thompson sampling (TS) algorithm, and non-cooperation game method. We derive an upper regret bound for the proposed algorithm, i.e., $\mathcal {O}(\log ^{1+\delta }_{2} T)$ , increasing logarithmically with the time horizon $T$. Numerical results show that the E2Boost algorithm has the best performance among the existing methods and exhibits a fast convergence rate. More importantly, the proposed algorithm is not sensitive to the number of combinations of the RISs and SFs thanks to the two-stage allocation mechanism, which can benefit the high-density networks. [ABSTRACT FROM AUTHOR]

This paper investigates the first resource management problem for vehicular-to-infrastructure (V2I) networks under the in-band full-duplex (IBFD) backhauling scheme with guaranteed ultra-reliable and low-latency (URLLC) service. The considered networks suffers from interference caused by three node transmission in IBFD scheme and the mobility of vehicular user equipments (VUEs). The resource allocation problem is formulated to jointly optimize VUE association, resource block assignment (RA) and power allocation (PA), while satisfying the reliability and latency constraints at the same time. The formulated problem is a mixed integer non-linear problem with non-convex objective function and constraints. Finding globally optimal solution for this type of problem is still an open problem. To develop tractable solutions, the original problem is firstly simplified using derived equivalent expression for the objective function. The proposed method then decomposed it into RA and PA sub-problems. In each iteration, the PA sub-problem is solved for a set of given PA solution; while the solution for PA sub-problem is searched under determined RA results. The RA and PA sub-problems are solved iteratively until the converging condition is achieved. Theoretical analysis proves that the proposed method achieves Nash-stable equilibrium and local optimality for RA and PA sub-problems respectively. Simulation results verify the effectiveness of the derived performance analysis and demonstrate that the proposed algorithm outperforms the state-of-the-art algorithms in the literatures. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is an emerging cost-efficient technology to enhance communication performance by implementing a large number of passive reflecting elements with tunable phases in wireless systems. In this paper, we propose a general framework for the IRS-aided MIMO system designs under both single-user and multi-user setups, in which the diverse performance metrics including weighted mutual information and weighted MSE, and the realistic multiple weighted power constraint are taken into consideration. Leveraging the alternating optimization approach, the optimal IRS phase shifts are obtained in semi-closed forms. Specifically, based on the matrix-monotonic optimization theory, it is found that optimizing IRS phase shifts is essentially equivalent to tuning the eigenvalues and the corresponding eigenvectors of the MSE matrix. Then the proposed general framework is extended to a multi-user system by introducing a majorization-minimization (MM)-based method for IRS phase shift optimization. Simulation results show that our proposed optimal design brings significant enhancement on the chosen performance metric compared to the traditional MIMO systems without the IRS, and also significantly outperforms various benchmark designs in both single-user and multi-user systems. [ABSTRACT FROM AUTHOR]

This paper studies an intelligent reflecting surface (IRS)-assisted wireless-powered communication network (WPCN), where a hybrid access point (HAP) broadcasts energy signals to multiple devices for their energy harvesting in the downlink (DL) and then the devices use the harvested energy to transmit information signals to the HAP in the uplink (UL) with the help of an IRS. In particular, we propose three types of IRS beamforming configurations, namely fully dynamic IRS beamforming (FDBF), partially dynamic IRS beamforming (PDBF), and static IRS beamforming (SBF), to strike a balance between the system performance and signaling overhead as well as implementation complexity. Moreover, we adopt a practical non-linear energy harvesting (EH) model, and leverage a power-splitting (PS) EH receiver architecture with multiple rectifiers to avoid the input radio frequency power to get stuck into the saturation regime. We aim to minimize the transmit energy consumption at the HAP by jointly optimizing the DL/UL time allocation, the HAP/devices transmit power, the PS factor, and IRS phase shifts, subject to a set of minimum throughput requirements for individual devices. To address the resulting non-convex optimization problems, a successive convex approximation (SCA) based alternating optimization algorithm is proposed. Moreover, we study the case with the ideal linear EH model and two algorithms, namely SCA-based algorithm and semidefinite relaxation (SDR) algorithm, are proposed. Simulation results demonstrate the effectiveness of our proposed designs over various benchmark schemes and also unveil the importance of the joint design of IRS beamforming and PS rectifiers for achieving energy efficient WPCNs in practice. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) assisted edge caching has been emerged as a promising solution to alleviate network congestion, which can provide users with their desired contents with reduced latency. For achieving effective UAV-assisted edge caching, how to jointly design the trajectory and caching strategy is critical, which, however, is not straightforward due to the heterogeneous and uncertain demand in the network. In this paper, aiming at maximizing the reduced delay brought by the UAV-assisted caching, we propose a proactive joint strategy on trajectory and caching for the UAV, where the demand uncertainty is particularly studied. Specifically, by regarding the demand on each content as a random variable, we formulate the strategy design as a risk-averse stochastic optimization problem to make the network performance guaranteed under certain confidence level. Different from most existing works assuming the perfect distributional information is available to deal with the uncertainty, we develop a data-driven approach based on the first and second order statistics to achieve a distributionally robust (DR) solution, which can make the strategy trustworthy with guaranteed network performance even though the specific distributional information is unknown. Simulation results have demonstrated the effectiveness of the proposed DR strategy. [ABSTRACT FROM AUTHOR]

In a cell-free wireless network, distributed access points (APs) jointly serve all user equipments (UEs) within their coverage area by using the same time/frequency resources. In this paper, we develop a novel downlink cell-free multiple-input multiple-output (MIMO) millimeter wave (mmWave) network architecture that enables all APs and UEs to dynamically self-partition into a set of independent cell-free subnetworks in a time-slot basis. For this, we propose several network partitioning algorithms based on deep reinforcement learning (DRL). Furthermore, to mitigate interference between different cell-free subnetworks, we develop a novel hybrid analog beamsteering-digital beamforming model that zero-forces interference among cell-free subnetworks and at the same time maximizes the instantaneous sum-rate of all UEs within each subnetwork. Specifically, the hybrid beamforming model is implemented by using a novel mixed DRL-convex optimization method in which analog beamsteering between APs and UEs is conducted based on DRL while digital beamforming is modeled and solved as a convex optimization problem. The DRL models for network clustering and hybrid beamsteering are combined into a single hierarchical DRL design that enables exchange of DRL agents’ experiences during both network training and operation. We also benchmark the performance of DRL models for clustering and beamsteering in terms of network performance, convergence rate, and computational complexity. Results show a significant rate enhancement due to the proposed hybrid beamforming scheme compared to its conventional all-digital counterpart. This performance enhancement becomes more significant as the number of network partitions increases. For DRL-based network clustering, the policy gradient (PG) algorithm offers the best possible performance in terms of stability and convergence rate while the state-action-reward-state-action (SARSA) algorithm suffers from significant variance, slower convergence, and slightly inferior performance than other algorithms. For DRL-based beamsteering, the soft actor-critic (SAC) algorithm with continuous action space shows the best performance. Also, online training of the agents with varying channel state information (CSI) is observed to increase the variance of the Q-values and decrease the convergence rate, with no significant effect on the average reward. The simulation codes are available at: https://github.com/yasser-aleryani/mmWaveCellFree.git [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) allows multiple users to share link resource for higher spectrum efficiency. It can be applied to unmanned aerial vehicle (UAV) and mobile edge computing (MEC) networks to provide convenient offloading computing service for ground users (GUs) with large-scale access. However, due to the line-of-sight (LoS) of UAV transmission, the information can be easily eavesdropped in NOMA-based UAV-MEC networks. In this paper, we propose a secure communication scheme for the NOMA-based UAV-MEC system towards a flying eavesdropper. In the proposed scheme, the average security computation capacity of the system is maximized while guaranteeing a minimum security computation requirement for each GU. Due to the uncertainty of the eavesdropper’s position, the coupling of multi-variables and the non-convexity of the problem, we first study the worst security situation through mathematical derivation. Then, the problem is solved by utilizing successive convex approximation (SCA) and block coordinate descent (BCD) methods with respect to channel coefficient, transmit power, central processing unit (CPU) computation frequency, local computation and UAV trajectory. Simulation results show that the proposed scheme is superior to the benchmarks in terms of the system security computation performance. [ABSTRACT FROM AUTHOR]

Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen significantly speeds up communication efficiency by transmitting multicast messages simultaneously useful to multiple users. Most prior works on coded caching are based on the assumption that each user may request all content in the library. However, in many applications the users are interested only in a limited set of content that depends on their location. For example, assisted self-driving vehicles may access super High-Definition maps of the area through which they are travelling. Motivated by these considerations, this paper formulates the coded caching problem for location-based content with edge cache nodes. The considered problem includes a content server with access to ${\mathsf N}$ location-based files (e.g., High-Definition maps), ${\mathsf K}$ edge cache nodes located at different regions, and ${\mathsf K}$ users (i.e., vehicles) each of which is in the serving region of one cache node and can retrieve the cached content of this cache node with negligible cost. Depending on the location, each user only requests a file from a location-dependent subset of the library. The objective is to minimize the worst-case load (i.e., the worst-case number of broadcasted bits from the content server among all possible demands). For this novel coded caching problem, we propose a highly non-trivial converse bound under uncoded cache placement (i.e., each cache node directly copies some library bits in its cache), which shows that a simple achievable scheme is optimal under uncoded cache placement. In addition, this achievable scheme is also proved to be generally order optimal within a factor of 3. Finally, we extend the coded caching problem for location-based content to the multiaccess coded caching topology originally proposed by Hachem et al., where each user is connected to ${\mathsf L}$ nearest cache nodes. When ${\mathsf L}\geq 2$ , we characterize the exact optimality on the worst-case load. [ABSTRACT FROM AUTHOR]

We consider a wireless network consisting of two adjacent cells, where the joint transmission (JT) coordinated multipoint (CoMP) is established to assist the user equipments (UEs) located at the edge of each cell. In addition, full-duplex (FD) cooperative non-orthogonal-multiple-access (C-NOMA) is invoked within each cell to improve the data rates of the UEs and to assist those at the cell edge. The UEs are categorized into two groups, namely, cell-center UEs ($CUs$) and cell-edge UEs ($EUs$). The $CUs$ are the UEs located around the center of each cell. Meanwhile, the $EUs$ are the UEs located at the edge of each cell, where the JT-CoMP is applied since they have less distinctive received power from two cells. In this paper, a framework to jointly optimize the power control and the UEs clustering of CoMP-assisted FD C-NOMA system is formulated as an optimization problem to maximize the network sum-rate while guaranteeing the required quality-of-service of UEs. The formulated problem is a non-convex mixed-integer non-linear program that cannot be solved in a straightforward manner. To tackle this issue, the formulated problem is decomposed into an inner power allocation problem and an outer UEs clustering problem. For the inner problem, a computational-efficient solution is obtained. Meanwhile, the outer problem is reformulated as a one-to-one three-sided matching game. Then, a low-complexity near-optimal clustering algorithm is proposed. The simulation results demonstrate that 1) the optimality of the power control solution; 2) the CoMP-assisted FD C-NOMA has a superior performance compared to CoMP-assisted half-duplex (HD) C-NOMA and CoMP NOMA schemes for moderate values of self-interference. It has been also shown that the proposed solution achieves around 96.5% of the average achievable network sum-rate of the optimal solution. [ABSTRACT FROM AUTHOR]

In this paper an analytical model is introduced to describe the impulse response of the diffusive channel between a pointwise transmitter and a given fully-absorbing (FA) receiver in a molecular communication (MC) system. The presence of neighbouring FA nanomachines in the environment is taken into account by describing them as sources of negative molecules. The channel impulse responses of all the receivers are linked in a system of integral equations. The solution of the system with two receivers is obtained analytically. For a higher number of receivers the system of integral equations is solved numerically. It is also shown that the channel impulse response shape is distorted by the presence of the neighbouring FA interferers. For instance, there is a time shift of the peak in the number of absorbed molecules compared to the case without interference, as predicted by the proposed model. The analytical derivations are validated by means of particle based simulations. [ABSTRACT FROM AUTHOR]

In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$ -user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider both active and passive IRSs. While both types of IRS can attenuate the amplitude and change the phase of a reflected electromagnetic wave, active IRSs are also capable of amplifying the wave. We derive inner and outer bounds for the DoF region and lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of an active IRS and prove that the maximum value of $K$ for the sum DoF can be achieved if the number of IRS elements exceeds a certain finite value. The analysis framework developed for active IRSs forms the basis for our analysis of passive IRS-assisted systems. In particular, we present probabilistic inner and outer bounds for the DoF region and probabilistic lower and upper bounds for the sum DoF of the $K$ -user interference channel in the presence of a passive IRS and prove that the lower bound for the sum DoF asymptotically approaches $K$ as the number of IRS elements grows large. [ABSTRACT FROM AUTHOR]

A class of network codes have been proposed in the literature where the symbols transmitted on network edges are binary vectors and the coding operation performed in network nodes consists of the application of (possibly several) permutations on each incoming vector and XOR-ing the results to obtain the outgoing vector. These network codes, which we will refer to as permute-and-add network codes, involve simpler operations and are known to provide lower complexity solutions than scalar linear network codes. The complexity of these codes is determined by their degree which is the number of permutations applied on each incoming vector to compute an outgoing vector. Constructions of permute-and-add network codes for multicast networks are known. In this paper, we provide a new framework based on group algebras to design permute-and-add network codes for arbitrary (not necessarily multicast) networks. Our framework allows the use of any finite group of permutations (including circular shifts, proposed in prior works) and admits a trade-off between coding rate and the degree of the code. Further, our technique permits elegant recovery and generalizations of the key results on permute-and-add network codes known in the literature. [ABSTRACT FROM AUTHOR]

This paper considers the finite-order filter design problem for the source and multiple full-duplex (FD) relays in a cooperative communication system under frequency-selective fading channels. The goal is to optimize the source and relay filters such that the end-to-end signal-to-interference-plus-noise ratio (SINR) of minimum mean-squared error decision-feedback equalizer (MMSE-DFE) can be maximized. The resultant design problem is very difficult since we need to deal with self interference (SI), inter-relay interference (IRI), and inter-symbol interference (ISI) at the same time. Novel designs are then proposed to overcome the difficulty in this work. Transforming the signals into the frequency domain and using some optimization techniques, we first theoretically derive the power spectrum of the source filter and the spectrums of the relay filters. Then, the finite-order design is developed to approach the derived spectrums. Based on the weighted least-square (WLS) criterion, the Steiglitz-McBride method is exploited to obtain the filter coefficients in finite lengths. Numerical results demonstrated that complete removal of SI may not be a good strategy; preserving a certain amount of SI at each relay instead provides better SINR performance. [ABSTRACT FROM AUTHOR]

This paper proposes a novel general sixth-generation (6G) irregular-shaped geometry-based stochastic model (IS-GBSM) for millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) wireless communication systems. The proposed IS-GBSM can model spherical wavefront propagation, high delay resolution, and three-dimensional (3D) space-time-frequency non-stationarity of channels with time-space consistency, and thus can be applied to integrated communication and sensing systems. To capture the 3D non-stationarity with channel consistency, a new hybrid method combining geometric and parametric methods is developed. Based on the geometric method, i.e., visibility region (VR), the smooth and consistent appearance and disappearance of clusters during array-time evolution are modeled. With the help of the parametric method, a frequency-dependent path gain is introduced, and a visible factor based on uniform continuity theorem and bounded variation function is further proposed to capture the soft cluster power handover during cluster array-time evolution. Key channel statistics of the proposed IS-GBSM are derived and investigated. Simulation results demonstrate that the space-time-frequency non-stationarity is modeled and time-space consistency is captured. Finally, the utility of the proposed IS-GBSM is verified by the excellent agreement between simulation results and measurement. [ABSTRACT FROM AUTHOR]

Massive multiple-input-multiple-output (MIMO) and millimeter wave have been adopted as the enabling technologies for the 5G and beyond 5G (B5G) systems. A challenging problem introduced by the use of large antenna size and wide bandwidth is beam squint, i.e., spatial-wideband effect. Beam squint can significantly degrade the channel estimation performance for conventional channel estimators. Research effort on channel estimation under beam squint conditions has been very limited. For the few available work that attempts to address this problem, they require either all subcarriers or multiple symbols used as pilot for channel estimation, so large overhead becomes inevitable. Therefore, in this paper, we propose an efficient channel estimation method that only requires a small number of subcarriers. The channel estimation problem is formulated as a nonlinear least squares optimization problem. Initial parameter estimation is critical, which will affect the efficiency and convergence of the proposed algorithm. Using a densely-spaced antenna structure and consecutive subcarriers assignment approach, we can effectively avoid the aliasing effect and reduce the ambiguity during the initialization phase. A subcarrier assignment criterion is proposed to achieve the optimal performance. Closed-form expressions of the Cramér-Rao lower bound (CRLB) and the achievable rate are derived to evaluate the performance. Both simulation results and theoretical analysis show that even with a small number of subcarriers, the estimation error closely approaches the CRLB, and its effect is negligible compared with the noise when evaluating the signal-to-noise ratio with a simple linear detector. Furthermore, the number of pilot subcarriers has little impact on the achievable rate. [ABSTRACT FROM AUTHOR]

Edge federated learning (FL) is an emerging paradigm that trains a global parametric model from distributed datasets based on wireless communications. This paper proposes a unit-modulus over-the-air computation (UMAirComp) framework to facilitate efficient edge federated learning, which simultaneously uploads local model parameters and updates global model parameters via analog beamforming. The proposed framework avoids sophisticated baseband signal processing, leading to low communication delays and implementation costs. Training loss bounds of UMAirComp FL systems are derived and two low-complexity large-scale optimization algorithms, termed penalty alternating minimization (PAM) and accelerated gradient projection (AGP), are proposed to minimize the nonconvex nonsmooth loss bound. Simulation results show that the proposed UMAirComp framework with PAM algorithm achieves a smaller mean square error of model parameters’ estimation, training loss, and test error compared with other benchmark schemes. Moreover, the proposed UMAirComp framework with AGP algorithm achieves satisfactory performance while reduces the computational complexity by orders of magnitude compared with existing optimization algorithms. Finally, we demonstrate the implementation of UMAirComp in a vehicle-to-everything autonomous driving simulation platform. It is found that autonomous driving tasks are more sensitive to model parameter errors than other tasks since the neural networks for autonomous driving contain sparser model parameters. [ABSTRACT FROM AUTHOR]

In this paper, we consider a real-time deep learning-based symbol detection approach for MIMO-OFDM systems. To exploit the temporal correlation of the wireless channel and the time-frequency structure of OFDM signals, a recurrent neural network (RNN) with deep feedforward output layers is introduced, where the recurrent layers and feedforward output layers are designed to process time-domain and frequency-domain information respectively. Reservoir computing (RC), a special type of RNN, and extreme learning machine (ELM), a special type of feedforward neural network, are chosen as the corresponding building blocks to facilitate over-the-air training. An online training loss objective is introduced to recursively update the neural weights in real-time. We believe this is the first work in the literature to realize real-time machine learning for MIMO-OFDM symbol detection, i.e., conducting NN-based symbol detection on an OFDM symbol basis. We demonstrate that (1) the IEEE standardized WiFi training sequence can be directly applied as the real-time training sequence (2) the symbol detection performance can be further improved by using our theoretically derived pilot pattern. Evaluation results show that our RC-ELM-based symbol detection method outperforms traditional model-based techniques as well as state-of-the-art learning-based approaches in highly dynamic channel environments for real-time symbol detection. [ABSTRACT FROM AUTHOR]

The combination of energy harvesting (EH), cognitive radio (CR), and non-orthogonal multiple access (NOMA) is a promising solution to improve energy efficiency and spectral efficiency of the upcoming beyond fifth generation network (B5G), especially for support the wireless sensor communications in Internet of things (IoT) system. However, how to realize intelligent frequency, time, and energy resource allocation to support better performances is an important problem to be solved. In this paper, we study joint spectrum, energy, and time resource management for the EH-CR-NOMA IoT systems. Our goal is to minimize the number of data packets losses for all secondary sensing users (SSU), while satisfying the constraints on the maximum charging battery capacity, maximum transmitting power, maximum buffer capacity, and minimum data rate of primary users (PU) and SSUs. Due to the non-convexity of this optimization problem and the stochastic nature of the wireless environment, we propose a distributed multidimensional resource management algorithm based on deep reinforcement learning (DRL). Considering the continuity of the resources to be managed, the deep deterministic policy gradient (DDPG) algorithm is adopted, based on which each agent (SSU) can manage its own multidimensional resources without collaboration. In addition, a simplified but practical action adjuster (AA) is introduced for improving the training efficiency and battery performance protection. The provided results show that the convergence speed of the proposed algorithm is about 4 times faster than that of DDPG, and the average number of packet losses (ANPL) is about 8 times lower than that of the greedy algorithm. [ABSTRACT FROM AUTHOR]

Locally repairable codes (LRCs) are important for distributed storage systems due to their efficient repairing ability of the failed storage nodes. A $q$ -ary optimal $(n,k,r)$ -LRC is an $[n,k,d]$ linear code over $\mathbb {F}_{q}$ such that every code symbol has locality $r$ , and the minimum distance attains the well-known Singleton-like bound. In this paper, we study the maximal code length, code constructions and weight distributions of $q$ -ary optimal LRCs with locality 2 and distance 5, which are of both practical and theoretical interest. Firstly, it is proved that when the code dimension is even or odd, corresponding maximal code lengths of such $q$ -ary optimal LRCs are $3 \cdot \lfloor \frac {q+1}{3} \rfloor $ and $3 \cdot \left \lfloor{ \frac {q-1}{3} }\right \rfloor +5$ , respectively. Up to the equivalence of linear codes, we propose constructions of all the possible $q$ -ary optimal LRCs with locality 2, distance 5 and maximal code length. Then, by characterizing the weight type hierarchy of codewords, we show that the weight distribution of any $q$ -ary optimal LRC with locality 2, distance 5 and even code dimension can be uniquely determined and explicit expression of the weight distribution is given. Moreover, it is shown that all $q$ -ary optimal LRCs with locality 2, distance 5 and even code dimension are maximally recoverable. [ABSTRACT FROM AUTHOR]

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 CSI and non-linear energy harvesting model. On account of the high coupling of optimization variables, the formulated problem is a non-convex optimization problem that is difficult to solve directly. To address the above-mentioned challenging problem, alternating optimization (AO) technique is applied to decouple the optimization variables to solve the problem. Specifically, through AO, time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient are divided into three sub-problems to be solved alternately. The difference-of-convex (DC) programming is used to solve the non-convex rank-one constraint in solving IRS energy reflection coefficient and information reflection coefficient. Numerical simulations verify the superiority of the proposed optimization algorithm in decreasing HAP transmit energy compared with other benchmark schemes. [ABSTRACT FROM AUTHOR]

Despite the great promises that the resistive random access memory (ReRAM) has shown as the next generation of non-volatile memory technology, its crossbar array structure leads to a severe sneak path interference to the signal read back from the memory cell. In this paper, we first propose a novel belief propagation (BP) based detector for the sneak path interference in ReRAM. Based on the conditions for a sneak path to occur and the dependence of the states of the memory cells that are involved in the sneak path, a Tanner graph for the ReRAM channel is constructed, inside which specific messages are updated iteratively to get a better estimation of the sneak path affected cells. We further combine the graph of the designed BP detector with that of the BP decoder of the polar codes to form a joint detector and decoder. Tailored for the joint detector and decoder over the ReRAM channel, effective polar codes are constructed using the genetic algorithm. Simulation results show that the BP detector can effectively detect the cells affected by the sneak path, and the proposed polar codes and the joint detector and decoder can significantly improve the error rate performance of ReRAM. [ABSTRACT FROM AUTHOR]

In this paper, we conceive the design of dynamic wireless networks assisted by multiple intelligent reflecting surfaces (IRSs), where the connection states between users and IRSs are capable of being updated timely. Taking into account the time-varying states of the system, we further construct a long-term dynamic process. Our goal is to maximize the time average sum-rate of the dynamic system under the time average rate and power constraints of users, via jointly optimizing the power allocation at users and the reflecting coefficients at IRSs. With the aid of Lyapunov concept-based drift-plus-penalty (DPP) algorithm, the long-term optimization problem is formulated as an infinite-horizon time-average one. Subsequently, the fractional programming method based on Lagrangian dual transform is applied to optimize power allocation and reflecting coefficients in an iterative manner, and the closed-form solutions of power and reflecting coefficients can be obtained at each iteration. Finally, simulation results demonstrate the convergence and effectiveness of the proposed algorithm. Further performance comparisons indicate that the proposed algorithm can maintain a balance between supply and demand for resource allocation and improve the fairness of users. [ABSTRACT FROM AUTHOR]

The renewable energy source (RES)-powered small cell base station (SBS) is a promising technology for the next-generation networks because RESs provide sustainable energy without being depleted. In RES-assisted networks, joint optimization of user association (UA) and power control (PC) is required to enhance the sum-rate performance by reducing inter-cell interference between SBSs. This paper tackles the UA and PC optimization for the sum-rate maximization under quality-of-service (QoS) and backhaul constraints. We formulate the problem as mixed-integer non-linear programming, in which UA and PC variables of different time slots are tightly coupled due to the RES energy dynamics model. Hence, designing a dynamic policy-based UA and PC with consideration of the future environments such as the quantity of channel gain and energy harvesting remains a challenge. First, we propose a deep unsupervised learning (DUL)-based UA scheme for a fixed PC variable. To lower the computational complexity and accelerate the convergence of the proposed learning-based optimization, we relax the UA variable, which originally has an extremely high dimension, into a low-dimensional continuous variable inspired by the Lagrangian method. Next, we propose a deep reinforcement learning (DRL)-based PC scheme, in which the stringent QoS and backhaul constraints are considered penalty terms on the reward design. The proposed DRL-based PC scheme facilitates dynamic PC inferring the relationship between the future environment and current PC. Simulation results demonstrate that the proposed scheme enhances the sum-rate by 10%, accommodates 3.3 percent point (%p) more QoS-qualified users, and reduces the computation time by 20 times compared to the conventional optimization-based method. [ABSTRACT FROM AUTHOR]

This paper investigates the channel capacity of coherent reception with antenna diversity in Rayleigh fading using asymmetric constellations, such as nonbinary two-sided amplitude-shift keying (ASK) and quadrature amplitude modulation (QAM) with ≥ 8 levels. Due to the asymmetries, the capacity achieving input or a priori probability distributions deviate from uniformity. To perform the investigation, an analytical expression for the mutual information, in terms of an integral over a single variable, between the input (transmitted symbol) and the output (received signal vector comprising signals at receive antennas), is derived. For two-sided ASK, 8-QAM with cross constellation, and 16-QAM, analytical closed form expressions for the high and low signal-to-noise (SNR) approximations, respectively, of the capacity achieving input probability distribution, the capacity, and the relative gain in mutual information (between using the uniform and the capacity achieving input probability distributions) are obtained. Numerical results show that at low SNRs, the use of the capacity achieving nonuniform input probability distribution offers significant advantage over the use of the uniform input probability distribution, while at high SNRs, this advantage is significant only for configurations with one receive antenna. Furthermore, the high and low SNR approximations are shown to be reasonably accurate. [ABSTRACT FROM AUTHOR]

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce system complexity; they operate under the framework of coupled compressed sensing (CCS) which concatenates an outer tree code to an inner compressed sensing code for slot-wise message stitching. We suggest that by exploiting the MIMO channel information in the angular domain, redundancies required by the tree encoder/decoder in CCS can be removed to improve spectral efficiency, thereby an uncoupled transmission protocol is devised. To perform activity detection and channel estimation, we propose an expectation-maximization-aided generalized approximate message passing algorithm with a Markov random field support structure, which captures the inherent clustered sparsity structure of the angular domain channel. Then, message reconstruction in the form of a clustering decoder is performed by recognizing slot-distributed channels of each active user based on similarity. We put forward the slot-balanced $ K $ -means algorithm as the kernel of the clustering decoder, resolving constraints and collisions specific to the application scene. Extensive simulations reveal that the proposed scheme achieves a better error performance at high spectral efficiency compared to the CCS-based URA schemes. [ABSTRACT FROM AUTHOR]

Federated learning (FL) has been considered as a promising paradigm for enabling distributed training/learning in many machine-learning services without revealing users’ local data. Driven by the growing interests in exploiting FL in wireless networks, this paper studies the Non-orthogonal Multiple Access (NOMA) assisted FL in which a group of end-devices (EDs) form a NOMA cluster to send their locally trained models to the cellular base station (BS) for model aggregation. In particular, we consider that the BS adopts wireless power transfer (WPT) to power the EDs (for their data transmission and local training) in each round of FL iteration, and formulate a joint optimization of the BS’s WPT for different EDs, the EDs’ NOMA-transmission for sending the local models to the BS, the BS’s broadcasting of the aggregated model to all EDs, the processing-rates of the BS and EDs, as well as the training-accuracy of the FL, with the objective of minimizing the system-wise cost accounting for the total energy consumption as well as the FL convergence latency. In spite of the strict non-convexity of the joint optimization problem, we analytically characterize the BS’s and all EDs’ optimal processing-rates, based on which we propose a layered algorithm for finding the optimal solutions for the joint optimization problem via exploiting monotonic optimization. Numerical results validate that our algorithm can achieve the optimal solution as LINGO’s global-solver (i.e., a commercial optimization package) while significantly reducing the computation-time. Moreover, the results also demonstrate that our NOMA assisted FL can reduce the system cost compared to the benchmark FL scheme with the fixed local training-accuracy by more than 70% and the conventional frequency division multiple access (FDMA) based FL by 78%. [ABSTRACT FROM AUTHOR]

The integration of mobile edge computing (MEC) into an ultra-dense network (UDN) can provide ubiquitous task offloading services to computation-demanding users leveraging densely deployed micro base stations. The conventional multi-user task offloading strategies are performed centrally, where a central node makes global task offloading decisions on server selection and resource allocation. In practice, the deployment becomes prohibitively complex with the increasing number of users as it involves high communication overhead and complex global optimization operations. In this paper, we develop a novel decentralized task offloading strategy in UDN, enabling users to independently make local task offloading decisions. We formulate the associated optimization problem to minimize the long-term average task delay among all users. On this basis, we develop a novel calibrated contextual bandit learning (CCBL) algorithm, where users can learn the computational delay functions of micro base stations and predict the task offloading decisions of other users in a decentralized manner. The convergence of the proposed CCBL algorithm is verified via the approachability theory. Moreover, we transfer the target of calibrated learning from all micro base stations to a single user and propose a user-oriented CCBL algorithm to further decrease the computational complexity and increase the convergence rate. Simulation results illustrate that our proposed algorithm outperforms the existing decentralized algorithms and approaches the centralized one. [ABSTRACT FROM AUTHOR]

In this paper, the legitimate surveillance of a suspicious mobile edge computing (MEC) network consisting of a suspicious edge server (SES) and multiple suspicious users (SUs), in the presence of a full-duplex monitor is studied. Each SU has a computation task to complete within a time deadline and can completely or partially offload the task to SES, while the monitor can either jam or assist the suspicious communications during task uploading and result downloading. With the heterogeneous offloading model adopted by the SUs, the problem of optimizing the monitor mode and transmit power to maximize the average ratio of successfully eavesdropped tasks, subject to the monitor transmit power constraint and the task completion time deadline constraint is investigated. The problem is solved via exploring the particular problem structure and adopting the sum-of-ratios optimization. Simulation results show that the proposed algorithm significantly outperforms the benchmark algorithms, especially for the SUs with partial offloading. It is also shown that the proposed algorithm is of low-complexity and achieves almost the same performance as the high-complexity optimal algorithm. Besides, compared to the SUs with binary offloading, the eavesdropping performance for the SUs with partial offloading is shown to be much better. [ABSTRACT FROM AUTHOR]

Secure model aggregation across many users is a key component of federated learning systems. The state-of-the-art protocols for secure model aggregation, which are based on additive masking, require all users to quantize their model updates to the same level of quantization. This severely degrades their performance due to lack of adaptation to available communication resources, e.g., bandwidth, at different users. As the main contribution of our paper, we propose HeteroSAg, a scheme that allows secure model aggregation while using heterogeneous quantization. HeteroSAg enables the edge users to adjust their quantization proportional to their available communication resources, which can provide a substantially better trade-off between the accuracy of training and the communication time. Our proposed scheme is based on a grouping strategy by partitioning the network into groups, and partitioning the local model updates of users into segments. Instead of applying aggregation protocol to the entire local model update vector, it is applied on segments with specific coordination between users. We further demonstrate how HeteroSAg can enable Byzantine robustness while achieving secure aggregation simultaneously. Finally, we prove the convergence guarantees of HeteroSAg under heterogeneous quantization in the non-Byzantine scenario. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are now beginning to be deployed for enhancing the network performance and coverage in wireless communication. However, due to the limitation of their on- board power and flight time, it is challenging to obtain an optimal resource allocation scheme for the UAV-assisted Internet of Things (IoT). In this paper, we design a new UAV-assisted IoT system relying on the shortest flight path of the UAVs while maximising the amount of data collected from IoT devices. Then, a deep reinforcement learning-based technique is conceived for finding the optimal trajectory and throughput in a specific coverage area. After training, the UAV has the ability to autonomously collect all the data from user nodes at a significant total sum-rate improvement while minimising the associated resources used. Numerical results are provided to highlight how our techniques strike a balance between the throughput attained, trajectory, and the time spent. More explicitly, we characterise the attainable performance in terms of the UAV trajectory, the expected reward and the total sum-rate. [ABSTRACT FROM AUTHOR]

Extremely large-scale multiple-input-multiple-output (XL-MIMO) is promising to meet the high rate requirements for future 6G. To realize efficient precoding, accurate channel state information is essential. Existing channel estimation algorithms with low pilot overhead heavily rely on the channel sparsity in the angular domain, which is achieved by the classical far-field planar-wavefront assumption. However, due to the non-negligible near-field spherical-wavefront property in XL-MIMO, this channel sparsity in the angular domain is not achievable. Therefore, existing far-field channel estimation schemes will suffer from severe performance loss. To address this problem, in this paper, we study the near-field channel estimation by exploiting the polar-domain sparsity. Specifically, unlike the classical angular-domain representation that only considers the angular information, we propose a polar-domain representation, which simultaneously accounts for both the angular and distance information. In this way, the near-field channel also exhibits sparsity in the polar domain, based on which, we propose on-grid and off-grid near-field XL-MIMO channel estimation schemes. Firstly, an on-grid polar-domain simultaneous orthogonal matching pursuit (P-SOMP) algorithm is proposed to efficiently estimate the near-field channel. Furthermore, an off-grid polar-domain simultaneous iterative gridless weighted (P-SIGW) algorithm is proposed to improve the estimation accuracy. Finally, simulations are provided to verify the effectiveness of our schemes. [ABSTRACT FROM AUTHOR]

In the present paper a closed-form framework is derived for the analysis and optimization of the coverage probability (Pcov) and of the area spectral efficiency (ASE) in long-range (LoRa) networks. The proposed framework exploits stochastic geometry tools to associate the Pcov and the ASE to the end device (ED) transmit power and to the ED density. The analysis reveals the trends of the Pcov and of the ASE curves, with respect to both of the two parameters, while the robustness of the framework holds even at the asymptotic cases. Building upon the derived framework, the analysis demonstrates that no joint global optimum exists that jointly maximizes the Pcov over both parameters, suggesting that the optimization of the Pcov must be performed separately, for the two key network parameters considered. As opposed to that, the analysis demonstrates that a set of global optima exists that jointly maximize the ASE over both parameters, and these global maxima are subsequently derived in closed form. Thus, the derived framework fully characterizes the performance of LoRa networks, while defining in closed form the optimal points of operation that can be proven of significant value, for the transceiver and network design, of practical LoRa networks. [ABSTRACT FROM AUTHOR]

Nonlinear self-interference (SI) cancellation is crucial for eliminating the impact of the transmitter-side nonlinearity on the comprehensive SI cancellation performance in full-duplex radios. However, in the propagation environment with rich reflection paths of signals, the number of the delayed taps required for time-domain nonlinear SI cancellation booms exponentially with the increase of the multi-path number, leading to unacceptable complexity. In this paper, a novel frequency-domain nonlinear SI canceller based on successive interference cancellation (SIC) technique is proposed for orthogonal frequency division multiplexing (OFDM) modulated full-duplex systems subjected to both transmitter nonlinearity and receiver nonlinearity. The proposed frequency-domain nonlinear SIC (FD-NSIC) cancels nonlinear components one by one via separately estimating the channel frequency response suffered by each order nonlinear component, which significantly relaxes the computational cost. Besides, to avoid the influence of the strong correlation between nonlinear components, orthogonalization is operated before SIC to white basis functions, which accelerates the convergence speed of the proposed FD-NSIC. Simulations are explicitly performed, showing that compared with the conventional frequency-domain nonlinear canceller based on recursive least squares (RLS) channel estimation, the proposed FD-NSIC is capable of canceling the SI to the noise floor with only 52% computational cost under 50 dB interference-to-noise ratio. [ABSTRACT FROM AUTHOR]

Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access technique to support massive connectivity for future wireless Internet of Things (IoT) networks. As the main feature of SCMA, modulation and spread spectrum is embedded into codebook mapping, offering significant codebook shaping gains to mitigate inter-cell interference. Maximizing the constellation-constrained average mutual information (AMI) is an effective way for SCMA codebook optimization. However, deriving a closed-form expression of the AMI is analytically intractable, while it is computationally costly to estimate the AMI by numerical methods. To address this challenge, this paper first derives a lower bound of the AMI with a closed-form expression. On this basis, we propose a novel codebook optimization method referred to as joint bare bones particle swarm optimization (JBBPSO) through maximizing the AMI lower bound. The proposed low-complexity method jointly optimizes the mother codebook including basic constellation and other non-zero-dimensional constellations, and the rotation angles of multiple users. Numerical results show that our proposed optimized codebooks outperform the state-of-the-art SCMA codebooks in terms of both the lower bound and the error performance. [ABSTRACT FROM AUTHOR]