Search

Cybertwin is a promising networking paradigm that supports complex wireless interconnectivity and enhances reliable communications by using edge capability in different applications. However, the computation-heavy phased-array weight vector generation is the significant barrier for the implementation of physical layer security (PLS) for millimeter-wave (MMWV) communications in cybertwin-driven scenarios, like vehicle-to-everything (V2X) applications. In this paper, we propose a low-complexity phased-array PLS scheme in MMWV wireless communications for cybertwin-driven V2X applications. The computational complexity is much reduced in a cost-effective way, where the transmitting phased-array weight vectors are updated at the symbol rate by randomly swapping the pre-calculated initial weight vector elements instead of directly calculating a new weight vector. Performance evaluation shows the proposed scheme possesses a lower computational complexity than the compared PLS schemes. The simulation demonstrates that the constellations are scrambled at undesired directions, while the constellation at target direction remains clear and constant. Thus, the communication secrecy is preserved for the receiver at the target direction in cybertwin-driven vehicular communications. Finally, we demonstrate that the proposed scheme achieves good security performances in terms of symbol error rate (SER) and secrecy outage probability. [ABSTRACT FROM AUTHOR]

With the development of 6G wireless communication technologies, various resource-intensive and delay-sensitive vehicle application tasks are generated. These application tasks can be offloaded to Mobile Edge Computing (MEC) which deploys computing resources at the edge of networks. Besides, the recent proposed Cybertwin, as the digital representation of the complicated physical end-systems, can help the terminals obtain the required services from networks. Vehicles enabled by Cybertwin can offload their tasks to MEC and achieve better performance. In this paper, we focus on the study of a hybrid energy-powered multi-server MEC system with Cybertwin. Vehicles enabled by Cybertwin and edge servers send the current network status and unprocessed vehicle application tasks to the macro base station (MBS) to achieve the better allocation of resources. Energy harvesting (EH) devices are deployed on edge servers to form a “green energy-grid” hybrid energy supply model. We formulate a stochastic offloading optimization problem, and the goal is to minimize the system cost. The stochastic optimization problem is decomposed into three sub-problems. Then, we design an efficient multi-vehicle task offloading (EMT) algorithm to achieve the trade-off between system cost and task queue length. Theoretical analysis shows that EMT algorithm can optimize the total cost of the MEC system and guarantee the system performance. According to experimental evaluation, we verify the performance of the EMT algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a hybrid multicast/unicast scheme for a multiple-input single-output cache-aided non-orthogonal multiple access (NOMA) vehicular scenario in the face of rapidly fluctuating vehicular wireless channels. Considering a more practical situation, imperfect channel state information is taking into account. In this paper, we formulate an optimization problem to maximize the unicast sum rate under the constraints of the peak power, the peak backhaul, the minimum unicast rate, and the maximum multicast outage probability. To solve the formulated non-convex problem, a lower bound relaxation method is proposed, which enables a division of the original problem into two convex sub-problems. Computer simulations show that the proposed caching-aided NOMA is superior to the orthogonal multiple access counterpart. [ABSTRACT FROM AUTHOR]

The large spectral bandwidth at millimeter-wave (mmWave) frequencies provides a mean to achieve very high data rates in wireless communication systems. A unique characteristic of mmWave is that mmWave links are very sensitive to blockage and have large propagation path loss, which exhibits low line-of-sight (LoS) probability, unstable connectivity and unreliable communication. This paper studies the influence of the blockage in pedestrian scenario, explains in detail how blockage affects the mmWave propagation characteristics. In particular, we study the behavior of the blockage due to human mobility and how it affects the timescale for outage due to blockage using knife-edge diffraction model (KED). One of the existing solutions to overcome the influence of blockage, is to associate the user equipment (UE) with other available base stations (BSs) by handover (HO) if the serving BS is blocked. In this paper, for a pedestrian scenario, we propose two reinforcement learning (RL) based user association algorithms, which accounts for the past experience of the blockage on the position of the UE. One focuses on the reward to increase the sum LoS probability and is named as blockage-aware user association (BAUA). The other focuses on the reward to balance the trade-off between the throughput and the LoS probability and is named as modified BAUA. We compare the proposed algorithm with the conventional user algorithms such as the maximum throughput based algorithm and the maximum SINR based algorithm. Simulation results show that to increase the sum LoS probability BAUA would be suitable, and to increase the average throughput maximum throughput based method would be suitable. [ABSTRACT FROM AUTHOR]

In this paper, we investigate device-to-device (D2D) communication networks which are one of the key technologies for next-generation mobile communication networks and many other applications such as unmanned aerial vehicles (UAVs), vehicle-to-vehicle (V2V), and Internet of things (IoT). The overlay D2D communication networks that are considered in our study use dedicated radio resources separate from what cellular networks use and there exists co-channel interference in D2D networks without cross-channel interference between two networks. We propose a new transmission scheme for overlay D2D networks that uses a dueling deep reinforcement learning (DRL) architecture. The DRL is especially effective in environments where actions do not affect subsequent states as in wireless communication networks. The main contribution of this paper is that the proposed architecture is designed to utilize only information that each D2D devices can easily obtain by measuring channels. The proposed scheme thus enables D2D devices to train their own neural networks and to decide autonomously whether to transmit data without any intervention from infrastructures. The performance of the proposed scheme is analyzed in terms of average sum-rates and is compared to three baseline schemes. Simulation results show that the proposed scheme can achieve almost optimal sum-rates with low signal-to-noise (SNR) values without any intervention from infrastructure. [ABSTRACT FROM AUTHOR]

In this paper, we consider a three-terminal state-dependent relay channel (RC) with the channel state noncausally available at only the relay. Such a model may be useful for designing cooperative wireless networks with some terminals equipped with cognition capabilities, i.e., the relay in our setup. In the discrete memoryless (DM) case, we establish lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, Gel'fand-Pinsker binning, and decode-and-forward (DF) relaying. The upper bound improves upon that obtained by assuming that the channel state is available at the source, the relay, and the destination. For the Gaussian case, we also derive lower and upper bounds on the capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, generalized dirty paper coding (DPC), and DF relaying; the upper bound is also better than that obtained by assuming that the channel state is available at the source, the relay, and the destination. In the case of degraded Gaussian channels, the lower bound meets with the upper bound for some special cases, and, so, the capacity is obtained for these cases. Furthermore, in the Gaussian case, we also extend the results to the case in which the relay operates in a half-duplex mode. [ABSTRACT FROM AUTHOR]

In this paper, we compute an achievable rate of a multiple-input-multiple-output (MIMO) Gaussian Z-interference channel (ZIC), as shown in Fig. 1, when transmit node C has imperfect cognitive knowledge of the signal sent by transmit node A. First, we compute the capacity of this channel, assuming noncausal but noisy knowledge at node C of node A's signal. We then compute the achievable rate for a causal cognitive strategy: This achievable rate is derived using a two-phase transmission scheme, in which node C uses a combination of a linear MMSE (LMMSE) estimator and a dirty-paper code, and node D employs a combination of an LMMSE estimator and a partial interference canceler. The achievable rate is studied in two different cases: 1) Node C operates in full-duplex mode, and 2) node C operates in half-duplex mode. To quantify the performance of the proposed strategy, we compute simple lower and upper bounds on the capacity of this channel. Similar to an interference channel, the achievable rate of the cognitive ZIC nonmonotonically varies with the interference. Specifically, the achievable rate first decreases with the channel gain between nodes A and D and then begins to increase beyond a certain threshold. The difference in the achievable rate between full- and half-duplex transmissions is also numerically evaluated. [ABSTRACT FROM AUTHOR]

In this paper, we consider the multiuser Gaussian broadcast channel with multiple transmit antennas at the base station and multiple receive antennas at each user. Assuming full knowledge of the channel state information at the transmitter and the different receivers, a new transmission scheme that employs partial interference cancellation at the transmitter with dirty-paper encoding and decoding is proposed. The maximal achievable throughput of this system is characterized, and it is shown that given any ordered set of users the proposed scheme is asymptotically optimal in the high signal-to-noise ratio (SNR) regime. In addition, with optimal user ordering, the proposed scheme is shown to be optimal in the low-SNR regime. We also consider a linear transmission scheme which employs only partial interuser interference cancellation at the base station without dirty-paper coding. Given a transmit power constraint at the base station, the sum-rate capacity of this scheme is characterized and a suboptimal precoding algorithm is proposed. In several cases, it is shown that, for all values of the SNR, the achievable throughput of this scheme is strictly larger than a system which employs full interference cancellation at the base station [21]. In addition, it is shown that, in some cases, the linear transmission scheme can support simultaneously an increased number of users while achieving a larger system throughput. [ABSTRACT FROM AUTHOR]

Cognitive radio promises a low-cost, highly flexible alternative to the classic single-frequency band, single-protocol wireless device. By sensing and adapting to its environment, such a device is able to fill voids in the wireless spectrum and can dramatically increase spectral efficiency. In this paper, the cognitive radio channel is defined as a two-sender, two-receiver interference channel in which sender 2 obtains the encoded message sender 1 plans to transmit. We consider two cases: in the genie-aided cognitive radio channel, sender 2 is noncausally presented the data to be transmitted by sender 1 while in the causal cognitive radio channel, the data is obtained causally. The cognitive radio at sender 2 may then choose to transmit simultaneously over the same channel, as opposed to waiting for an idle channel as is traditional for a cognitive radio. Our main result is the development of an achievable region which combines Gel'fand-Pinkser coding with an achievable region construction for the interference channel. In the additive Gaussian noise case, this resembles dirty-paper coding, a technique used in the computation of the capacity of the Gaussian multiple-input multiple-output (MIMO) broadcast channel. Numerical evaluation of the region in the Gaussian noise case is performed, and compared to an inner bound, the interference channel, and an outer bound, a modified Gaussian MIMO broadcast channel. Results are also extended to the case in which the message is causally obtained. [ABSTRACT FROM AUTHOR]

We present simple, practical codes designed for the binary and Gaussian dirty-paper channels. We show that the dirty-paper decoding problem can be transformed into an equivalent multiple-access decoding problem, for which we apply superposition coding. Our concept is a generalization of the nested lattices approach of Zamir, Shamai, and Erez. In a theoretical setting, our constructions are capable of achieving capacity using random component codes and maximum-likelihood decoding. We also present practical implementations of the constructions, and simulation results for both dirty-paper channels. Our results for the Gaussian dirty-paper channel are on par with the best known results for nested lattices. We discuss the binary dirty-tape channel, for which we present a simple, effective coding technique. Finally, we propose a framework for extending our approach to general Gel'fand-Pinsker channels. [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]

In this paper, we investigate the performance of an RIS-aided wireless communication system subject to outdated channel state information that may operate in both the near- and far-field regions. In particular, we take two RIS deployment strategies into consideration: (i) the centralized deployment, where all the reflecting elements are installed on a single RIS and (ii) the distributed deployment, where the same number of reflecting elements are placed on multiple RISs. For both deployment strategies, we derive accurate closed-form approximations for the ergodic capacity, and we introduce tight upper and lower bounds for the ergodic capacity to obtain useful design insights. From this analysis, we unveil that an increase of the transmit power, the Rician- $K$ factor, the accuracy of the channel state information and the number of reflecting elements help improve the system performance. Moreover, we prove that the centralized RIS-aided deployment may achieve a higher ergodic capacity as compared with the distributed RIS-aided deployment when the RIS is located near the base station or near the user. In different setups, on the other hand, we prove that the distributed deployment outperforms the centralized deployment. Finally, the analytical results are verified by using Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

Source localization plays a key role in many applications including radar, wireless and underwater communications. Among various localization methods, the most popular ones are Time-Of-Arrival (TOA), Time-Difference-Of-Arrival (TDOA), Angle-Of-Arrival (AOA) and Received Signal Strength (RSS) based. Since the Cramér-Rao lower bounds (CRLB) of these methods depend on the sensor geometry explicitly, sensor placement becomes a crucial issue in source localization applications. In this paper, we consider finding the optimal sensor placements for the TOA, TDOA, AOA and RSS based localization scenarios. We first unify the three localization models by a generalized problem formulation based on the CRLB-related metric. Then a unified optimization framework for optimal sensor placement (UTMOST) is developed through the combination of the alternating direction method of multipliers (ADMM) and majorization-minimization (MM) techniques. Unlike the majority of the state-of-the-art works, the proposed UTMOST neither approximates the design criterion nor considers only uncorrelated noise in the measurements. It can readily adapt to to different design criteria (i.e. A, D and E-optimality) with slight modifications within the framework and yield the optimal sensor placements correspondingly. Extensive numerical experiments are performed to exhibit the efficacy and flexibility of the proposed framework. [ABSTRACT FROM AUTHOR]

In this paper, we study an uplink non-orthogonal multiple access (NOMA) wireless system with short-packet communications (SPC) in the presence of channel estimation errors and residual transceiver hardware impairments. Two NOMA decoding schemes are considered, namely fixed-order decoding (i.e., mean-power based decoding) and dynamic-order decoding (i.e., instantaneous-power based decoding). We first derive the closed-form exact and asymptotic expressions of the cumulative distribution functions (CDF) of the signal-to-interference-plus-noise ratio (SINR) associated with the two decoding schemes. Based on this, we analyze the average block error-rate (BLER) achieved in the finite block-length regime. Next, we formulate maximum throughput optimization problems with respect to the length of the packet. This problem is shown to be quasi-concave, which facilitates the finding of the optimal block-length via a search algorithm. Analytical comparisons between the NOMA-SPC system and its OMA-SPC counterpart are also performed. Simulation results are provided to validate the analysis. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc network (VANET) underpins most intelligent transportation systems and given the open nature of the wireless communication environment, edge nodes in the VANET are subject to varying levels of attacks. While there are a large number of conditional privacy-preserving authentication protocols in the literature, most of these protocols (whose security is guaranteed by classical cryptographic primitives) are not designed to resist quantum attacks. In this paper, we propose a lattice-based conditional privacy-preserving authentication protocol for VANETs, designed to simultaneously achieve mutual authentication and privacy protection. We also show that our protocol is secure in the random oracle model, relying on the small integer solution problem. Additionally, we demonstrate the potential utility of our protocol by evaluating its performance. [ABSTRACT FROM AUTHOR]

Satellite and unmanned aerial vehicle (UAV) networks have been introduced as enhanced approaches to provide dynamic control, massive connections and global coverage for future wireless communication systems. This paper considers a coordinated satellite-UAV communication system, where the UAV performs the environmental reconnaissance task with the assistance of satellites in a hostile jamming environment. To fulfill this task, the UAV needs to realize autonomous trajectory control and upload the collected data to the satellite. With the aid of the uploading data, the satellite builds the environment situation map integrating the beam quality, jamming status, and traffic distribution. Accordingly, we propose a closed-loop anti-jamming dynamic trajectory optimization approach, which is divided into three stages. Firstly, a coarse trajectory planning is made according to the limited prior information and preset points. Secondly, the flight control between two adjacent preset points is formulated as a Markov decision process, and reinforcement learning (RL) based automatic flying control algorithms are proposed to explore the unknown hostile environment and realize autonomous and precise trajectory control. Thirdly, based on the collected data during the UAV’s flight, the satellite utilizes an environment situation estimating algorithm to build an environment situation map, which is used to reselect the preset points for the first stage and provide better initialization for the RL process in the second stage. Simulation results verify the validity and superiority of the proposed approach. [ABSTRACT FROM AUTHOR]

Optical wireless communication (OWC) over atmospheric turbulence and pointing errors is a well-studied topic. Still, there is limited research on signal fading due to random fog in an outdoor environment for terrestrial wireless communications. In this paper, we analyze the performance of a decode-and-forward (DF) relaying under the combined effect of random fog, pointing errors, and atmospheric turbulence with a negligible line-of-sight (LOS) direct link. We consider a generalized model for the end-to-end channel with independent and not identically distributed (i.ni.d.) pointing errors, random fog with Gamma distributed attenuation coefficient, double generalized gamma (DGG) atmospheric turbulence, and asymmetrical distance between the source and destination. We develop density and distribution functions of signal-to-noise ratio (SNR) under the combined effect of random fog, pointing errors, and atmospheric turbulence (FPT) channel and distribution function for the combined channel with random fog and pointing errors (FP). Using the derived statistical results, we present analytical expressions of the outage probability, average SNR, ergodic rate, and average bit error rate (BER) for both FP and FPT channels in terms of OWC system parameters. We also develop simplified and asymptotic performance analysis to provide insight on the system behavior analytically under various practically relevant scenarios. We demonstrate the mutual effects of channel impairments and pointing errors on the OWC performance, and show that the relaying system provides significant performance improvement compared with the direct transmissions, especially when pointing errors and fog becomes more pronounced. [ABSTRACT FROM AUTHOR]

Recent research on joint source channel coding (JSCC) for wireless communications has achieved great success owing to the employment of deep learning (DL). However, the existing work on DL based JSCC usually trains the designed network to operate under a specific signal-to-noise ratio (SNR) regime, without taking into account that the SNR level during the deployment stage may differ from that during the training stage. A number of networks are required to cover the scenario with a broad range of SNRs, which is computational inefficiency (in the training stage) and requires large storage. To overcome these drawbacks our paper proposes a novel method called Attention DL based JSCC (ADJSCC) that can successfully operate with different SNR levels during transmission. This design is inspired by the resource assignment strategy in traditional JSCC, which dynamically adjusts the compression ratio in source coding and the channel coding rate according to the channel SNR. This is achieved by resorting to attention mechanisms because these are able to allocate computing resources to more critical tasks. Instead of applying the resource allocation strategy in traditional JSCC, the ADJSCC uses the channel-wise soft attention to scaling features according to SNR conditions. We compare the ADJSCC method with the state-of-the-art DL based JSCC method through extensive experiments to demonstrate its adaptability, robustness and versatility. Compared with the existing methods, the proposed method takes less storage and is more robust in the presence of channel mismatch. [ABSTRACT FROM AUTHOR]

This paper investigates an intelligent reflecting surface (IRS) aided secure wireless powered communication network (WPCN), where a transmitter first harvests energy from a power station (PS), and then uses the collected energy to transmit information to multiple internet of things (IoT) devices in the form of multicast in the presence of multiple eavesdroppers. An IRS is deployed to enhance the efficiency of wireless energy transfer (WET) and secure wireless information transfer (WIT). Considering that the PS and transmitter belong to different service providers, we model this energy interaction through a Stackelberg game and propose an IRS-aided energy trading and secure communication (IRS-ETSC) scheme, in which the transmitter needs to pay an energy price as an incentive for the PS energy service. Specifically, the transmitter as the leader can control the energy price, WET time, two-stage phase shifts, and beamforming vector, while the PS as the follower can adjust the transmit power. To solve the non-convex leader game problem, we propose a two-step approach to decompose the original problem into two subproblems. The first subproblem can be solved independently by an efficient alternating optimization (AO) based algorithm, in which the closed-form optimal beamforming vector and energy phase shifts are alternately optimized. Then, the second subproblem is relaxed by semidefinite relaxation (SDR) and solved by an iterative algorithm based on block coordinate descent (BCD), where the optimal energy price, optimal WET time, and suboptimal information phase shifts can be obtained by golden section method and successive convex approximation (SCA) respectively. Both subproblems can converge to a stationary point. Numerical results show that compared with the traditional non-IRS scheme, the proposed IRS-ETSC scheme achieves utility improvement for both the PS and transmitter. [ABSTRACT FROM AUTHOR]

Fifth-generation (5G) wireless communications confront explosive growth in mobile data demand and massive intensive user equipment (UE) connections. The optimization of base station (BS) array orientations in large-scale networks can provide high potential performance gain to meet these requirements. However, traditional schemes are highly dependent on experience and difficult in implementation due to their demand on repeated drive tests and large amounts of data samples. In this paper, via exploiting UE locations and channel direction information, we propose an intelligent network optimization framework to maximize the long-term network rate performance. For the augmentation of limited drive test data, a deep Gaussian process regression (DGPR) model is designed to construct a scenario-specific channel modeling. In addition, via a domain-knowledge driven fusion of convolutional neural network (CNN) and multi-layer perceptron (MLP), we propose a multi-branch deep neural network (DNN) to accurately map BS array orientations and concise channel measurements to the network performance. Finally, based on the scenario-specific modeling, an efficient gradient search approach is proposed to optimize BS array orientations via neural network (NN) backpropagation. Both simulations and field tests in 5G experimental networks validate the effectiveness and efficiency of our proposed framework, especially with limited drive test data. [ABSTRACT FROM AUTHOR]

The so-called Internet of Vehicle (IoV) systems will interconnect numerous vehicles to communicate significant information through an Internet of Things (IoT) enabled network. It has emerged as a promising system wherein various data authentication techniques have been introduced using clumsy certificate management and Diffie-Hellman (DH) assumption. However, in the presence of quantum cryptanalysis, DH-type problems could be solved in polynomial-time. In this paper, a novel certificateless data authentication protocol is designed, enabling security features in open wireless communication in the IoV. The proposed protocol resists a quantum attack using lattice cryptography. Further, a reliable blockchain mechanism is shown to provide vehicles’ trustworthiness in batch data verification. Rigorous formal analysis shows the ability of the proposed algorithm to resist existential unforgeability against the chosen-message attack. Nonetheless, the developed protocol supports other essential security functionalities, including unlikability, conditional-traceability, anti-replay, and data authenticity. Performance analysis exhibits the simulation orchestration and shows the way the proposed protocol outperforms other related techniques in energy consumption, data computation, communication, and cryptographic key storage overheads. [ABSTRACT FROM AUTHOR]

To mitigate the impact of the dramatic growth of wireless video traffic and provide users with heterogeneous video services, a collaborative caching-transmission method in cache-enabled terahertz (THz) heterogeneous networks is studied in this paper. We propose a novel scalable video coding (SVC)-based two-tier cooperative caching strategy that can provide video services with different perceptual qualities. In addition, we propose a hierarchical hybrid transmission scheme where users obtain the requested layer files through the cooperative cellular multicast-D2D and THz transmissions. A base layer-based multicast group aggregation process is presented to improve resource utilization, while an efficient multicast transmission resource scheduling scheme can make better use of the spatial reusability. We derive the expressions for the average offloading capacity gain and average energy consumption, and formulate an efficiency function optimization problem. The problem is efficiently solved by the greedy strategy-gradient descent based caching solution and long tail distribution based heuristic caching solution. Simulation results validate the two solutions and demonstrate that the proposed caching-transmission method can achieve quasi-optimal performance compared with other contrasting schemes. [ABSTRACT FROM AUTHOR]

In this paper, an intelligent reflecting surface (IRS) is deployed to assist the terahertz (THz) communications. The sum-rate of user equipments (UEs) is maximized while guaranteeing the rate requirement of each UE. A block coordinate searching (BCS) algorithm is proposed to jointly optimize the IRS’s coordinates, phase shifts, THz sub-bands allocation and power control. Specifically, the relaxation with penalties based (RPB) algorithm is developed to obtain feasible coordinates of the IRS and guarantee the monotonicity of objective value. In addition, the IRS phase shifts are formulated as closed-form expressions with introduced pricing factors. Simulation results show that the proposed scheme can significantly enhance system performance. [ABSTRACT FROM AUTHOR]

In this paper, we consider a computation offloading problem in a three-tier network consisting of multiple mobile users (MUs), multiple edge clouds, and a central cloud. On this basis, we formulate a system Energy Time Cost ($ETC$) minimization problem by jointly optimizing the resource allocation, mobile-edge matching decision, and offloading decision. Due to the difficulty of directly solving the formulated problem, we decompose it and propose two offloading algorithms, namely Gale-Shapley based Minimum/Sequential Offloading Algorithm (GS-MOA/GS-SOA), to optimize offloading decisions by minimizing the system $ETC$ , in which the mobile-edge matching strategies based on the proposed Gale-Shapley based Mobile-Edge mAtching aLgorithm (GS-MEAL) and resource allocations are optimized iteratively. The simulations show the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

A hybrid satellite-terrestrial relay network (HSTRN) has been envisioned as a promising communication architecture for future wireless communications, which can prominently reduce the impact of shadow fading and expand service coverage. In this paper, we conduct theoretical performance analysis for a dual-hop communication system, consisting of multiple relays and multiple users in the HSTRN with the amplify-and-forward protocol. For the shadowing effect and the multipath effect, we introduce the shadowed-Rician distribution and Nakagami- $m$ fading to characterize the channel models for the satellite-relay and the relay-user links, respectively. Additionally, the opportunistic scheduling scheme is employed, where the optimal relay and the optimal user are selected from the alternative nodes with the maximum instantaneous signal-to-noise ratio. Thereafter, the analytical expressions including ergodic capacity and average symbol error rate (SER) are derived. More specifically, we also present the asymptotic behavior of the average SER at the high signal-to-noise ratio (SRN) regime. The theoretical analysis is validated by the numerical results. Moreover, the results also reveal that the performance of the system can be improved by increasing the number of relays and users under different channel parameters and various modulation schemes. [ABSTRACT FROM AUTHOR]

This paper investigates power allocation for minimizing the average bit error probability (BEP) in hybrid communication systems, more specifically hybrid power line/wireless systems (HPWSs). In this regard, a brief discussion of HPWSs is presented in order to point out the complementary characteristics of power line and wireless media. By considering orthogonal frequency-division multiplexing and maximal-ratio combining, optimization problems associated with the minimization of the average BEP in hybrid communication systems are formulated under two distinct transmission power constraints, called sum power and sum power-channel constraints. For both constraints, it is demonstrated that at most one medium should be used for data transmission over subchannels with the same index in order to minimize the average BEP in hybrid communication systems. Based on this finding, power allocation algorithms are derived for this purpose in HPWSs. Numerical analyses are then used to validate the proposed algorithms by comparing them with interior-point-based power allocation algorithms. In addition, performance comparisons show the advantage of the proposals over alternative algorithms from the literature, including previous algorithms proposed for maximizing the achievable data rate. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) consisting of a large number of programmable near-passive units has been a hot topic in wireless communications due to its capability in providing smart radio environments to enhance the communication performance. However, the existing research are mainly based on simplistic channel models, which will, in principle, lead to inaccurate analysis of the system performance. In this paper, we propose a general three-dimensional (3D) wideband non-stationary end-to-end channel model for RIS assisted multiple-input multiple-output (MIMO) communications, which takes into account the physical properties of RIS, such as unit numbers, unit sizes, array orientations and array configurations. By modeling the RIS by a virtual cluster, we describe the end-to-end channel by a superposition of virtual line-of-sight (V-LoS), single-bounced non-LoS (SB-NLoS), and double-bounced NLoS (DB-NLoS) components. We also derive an equivalent cascaded channel model and show the equivalence between end-to-end and cascaded modeling of RIS channels. Then, a sub-optimal solution with low complexity is used to derive the RIS reflection phases. The impact of physical properties of RIS, such as unit numbers, unit sizes, array orientations, array configurations and array relative locations, on channel statistical characteristics has been investigated and analyzed, the results demonstrate that the proposed model is helpful for characterizing the RIS-assisted communication channels. [ABSTRACT FROM AUTHOR]

Cloud-based cell-free massive multiple-input multiple-output (CFmMIMO) technology, which exploits a large number of distributed antennas to cooperatively serve multiple users, constitutes an appealing technique for B5G/6G wireless communications. However, the distributed nature of cloud-based CFmMIMO imposes great challenges in analyzing the error probability bounds, and very few efforts have so far been paid to optimize the detector design. In this paper, we try to add a stroke to this blank by analyzing the symbol error rate (SER) and design near-optimal detection algorithms. Specifically, considering non-identical large-scale coefficients and channel estimation errors, we first leverage the pairwise error probability to derive an asymptotic SER bound for uplink cloud-based CFmMIMO systems, which is verified by simulation results. Furthermore, motivated by the concepts of successive interference cancellation (SIC) and error correction mechanism (ECM), we design two distinct types of near-optimal detectors for cloud-based CFmMIMO systems and analyze their complexity and convergence performance. Finally, extensive simulation results show that our proposed SIC and ECM based detectors outperform conventional matched filtering (MF) and minimum mean squred error (MMSE) counterparts. In particular, the MMSE-SIC and MMSE-ECM detectors approach the derived asymptotic bound, and the MF-ECM detector strikes a balance between the SER and complexity in ultra CFmMIMO scenarios. [ABSTRACT FROM AUTHOR]

The use of massive multiple-input multiple-output (MIMO) technology has enabled increased efficiency and capacity of wireless communication systems. When the downlink channel to user terminals (UTs) is known at the base station (BS), the BS can precode transmission to simplify detection at the UTs. In frequency division duplexed (FDD) systems, obtaining CSI at the transmitter to fully exploit the advantages of massive MIMO is complicated, since the number of channel coefficients to be trained and fed back from the UT is very large. This is exacerbated in the case where the channel is time varying, where frequent retraining and feedback is required. However, if the channel coefficients are spatially correlated, the amount of feedback required can be reduced significantly. In this paper, we consider the case where the channel coefficients from the BS to the UTs are spatially correlated, and show that efficient allocation of training power based on eigenvalues of the channel correlation matrix significantly boosts achievable rates. Further, we show that using Kalman filters to track the evolving channel coefficients reduces the need to retrain channels, and the reduced training requirement translates to higher data rates. Simulations confirm that optimal training and tracking channel modes enhances rates significantly. [ABSTRACT FROM AUTHOR]

Many applications of wireless sensor networks (WSNs) require deploying sensors in hostile environments, where an adversary may eavesdrop communications. To secure communications in WSNs, the $q$ -composite key predistribution scheme has been proposed in the literature. In this paper, we investigate secure $k$ -connectivity in WSNs operating under the $q$ -composite scheme, in consideration of the unreliability of wireless links. Secure $k$ -connectivity ensures that any two sensors can find a path in between for secure communication, even when $k-1$ sensors fail. We present conditions on how to set the network parameters such that the network has secure $k$ -connectivity asymptotically almost surely. The result is given in the form of a sharp zero–one law. [ABSTRACT FROM AUTHOR]

Highmobility is an important scenario for the 5G wireless communications. However, the high mobility results in serious time-varying fading, bringing challenges to the reliabilities of wireless transmission. Diversity technique is an essential method to overcome the effect of fading. It is noted that an LDPC (low-density parity-check) code is a concatenation of single parity-check codes (SPC) and repetition codes (REP) by a random interleaver, and a REP can be viewed as a typical example for achieving time/frequency diversity. Thus, it is appealing to jointly consider LDPC codes and diversity techniques. This paper presents parity-check coding transmit diversity (PCTD) schemes based on half-rate invertible LDPC codes, which are capable of achieving both diversity and coding gains from the time-varying fading channels. Besides, we investigate two types of PCTD schemes, and take into consideration two transmission modes, which are single-carrier (SC) and orthogonal frequency division multiplexing (OFDM) transmission modes. A chase combining based message passing algorithm (CC-MPA) is proposed for the proposed schemes, which can take full advantages of signal processing and coding gains. Furthermore, the Shannon limits of time-varying fading channels with BPSK signaling are deduced. Simulation results show that the proposed PCTD with CC-MPA algorithm can provide better BER performances than the classical time-domain diversity scheme in time-varying fading channels, which is appealing for the high mobility communications. [ABSTRACT FROM AUTHOR]

As a crucial part of the communication-based train control (CBTC) system, the wireless communication subsystem is responsible for transmitting safety-critical information, which directly affects the safe and efficient operation of the urban rail transit. The dependability analysis method for wireless communication in CBTC is critical and necessary to ensure the stable transmission of safety-critical information. However, most of the existing researches in CBTC lack a unified evaluation index to analyze the wireless communication dependability. In this paper, the dependability of wireless communication system in CBTC is established. To be specific, timeliness, integrity, security, and safety are used to describe the dependability of CBTC wireless communication system in our definition. The age of information (AoI) is used to quantitatively analyze the dependability in the CBTC wireless communication system. To verify the effectiveness of the proposed dependability analysis method, we quantitatively introduce the dependability of wireless communication system in CBTC with different scenarios, including packet-drop, re-transmission, handoff, and cyber-attack. Simulation results show that the designed dependability analysis method with quantized AoI can efficiently describe the dependability of CBTC wireless communication system in different scenarios. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) composed of unit cells with tunable reflection coefficients, amplitude, phase, and frequency has received great interest from wireless communication communities. In this paper, a non-stationary three-dimensional (3-D) wideband IRS-assisted channel model, including spatial and temporal non-stationarity, is proposed for high altitude platform (HAP) multiple-input multiple-output (MIMO) communication systems. The proposed channel model considers the propagation environment around the receiver (Rx) and that around both the IRS and Rx, which are modeled using multiple 3-D cylinders and confocal elliptic-cylinders, respectively. In the proposed model, the optimal reflection phases of the IRS reflection units are proposed, and the number and the size of the IRS reflection units are also considered, which are used to investigate received signal strength, multipath fading effect, and spatial non-stationarity of IRS-aided communication systems. The numerical results show that the IRS reflection units can improve the received signal strength by adjusting the reflection phases and multipath fading effect can be effectively reduced by increasing the number and the size of IRS reflection units. Also, it is found that the spatial correlation significantly decreases with the increase of the number and size of the IRS reflection units, and the proposed IRS-aided channel model presents spatial non-stationarity. These observations can provide guidelines and references for systems design and performance analysis of IRS-aided HAP-MIMO communication systems. [ABSTRACT FROM AUTHOR]

The heterogeneous fog radio access networks (Fog-RAN), the integration of fog computing, and traditional heterogeneous radio access networks can be implemented through the next-generation wireless communication networks. However, most of the solutions are limited to the spectrum efficiency optimization, and cross-tier interference existing in the fog access points (F-APs) could affect the network performance seriously. In this paper, the user association, resource allocation (including bandwidth and power), and caching deployment are investigated in the heterogeneous Fog-RAN to consider energy efficiency and cross-tier interference mitigation. Specifically, the user association, resource allocation, and caching strategy are formulated as a non-convex optimization problem and then transformed into a convex problem, which can be solved by a proposed algorithm based on the concept of the alternating direction method of multipliers (ADMM). Then an ADMM-based algorithm is proposed to enhance the energy efficiency of the Fog-RAN. Compared with the current solutions, simulation results illustrate the proposed algorithm’s convergence and effectiveness. [ABSTRACT FROM AUTHOR]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

A call for papers on the Institute of Electrical and Electronics Engineers (IEEE) Wireless Communications Letters (WCL), a joint publication of the IEEE Communications Society, the IEEE Signal Processing Society, and the IEEE Vehicular Technology Society, is presented.

In the past several years, unmanned aerial vehicle (UAV) have been employed to provide enhanced coverage or relay service to mobile users in a scenario with limited or even no infrastructure since they can be deployed to almost everywhere and can be manipulated at anytime. This paper studies UAV as aerial base station (BS) enabled wireless communication system, where a UAV is dispatched to provide wireless communication service to a set of ground users with difference quality-of-experience (QoE) requirements. In real world, user requirements are randomly and unevenly distributed. In addition, UAV communication coverage and on-board energy are limited and system resources are also limited (e.g., transmission power, spectrum). In order to meet the QoE of all users with limited system resources and limited UAV energy, we jointly optimize user communication scheduling, UAV trajectory, transmit power and bandwidth allocation to maximize energy-efficiency and satisfy user QoE requirement. The formulated problem is mixes integer non-convex and non-concave so it is difficult to solve. In this paper, we solvevv the problem with two steps as follows. Firstly, we transform the objective function into a tractable form. Secondly, we divide the optimal problem into four sub-optimal problems, and then use a powerful iterative algorithm with the Dinkelbach and block coordinate descent to solve the optimal problem. That is to say, the user scheduling, UAV trajectory, transmission power and bandwidth allocation are alternately optimized in each iteration. Extensive simulation results present that our proposed method can obtain higher energy efficiency than that of baselines. Specifically, the energy efficiency obtained by our proposed method is 12.5% higher than the approach that only maximizes throughput. [ABSTRACT FROM AUTHOR]

The C-RAN architecture has been prevailing in mobile networks for 5G and beyond. Along with the significant increase in the amount of mobile data, network operators must consider the spatio-temporal pattern of traffi c demand due to human mobility and lifestyles. It has been an important problem to efficiently deploy mobile networks avoiding the underutilization of cell capacities in off -peak times. To address this problem, in this paper we propose a concept of an adaptive C-RAN architecture toward the beyond 5G era. The proposed architecture enables flexible reconfi guration of the radio unit (RU) states and movable DU locations considering the changes in demand distribution. The DUs and RUs compose wireless relay fronthaul networks to forward fronthaul streams satisfying the strict latency requirements. This paper also proposes the joint scheduling algorithm to activate RUs, relocate DUs, and determine forwarding paths of fronthaul streams. It was confi rmed with computer simulations that mobile networks can be efficiently reconstructed with the proposed idea by activating/deactivating RUs and relocating/ migrating DUs. [ABSTRACT FROM AUTHOR]

Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower complexity because of its sparsity. In this paper, based on deterministic message passing algorithm (DMPA), algorithmic simplifications such as domain changing and probability approximation are applied for SCMA decoding. Early termination, adaptive decoding, and initial noise reduction are also employed for faster convergence and better performance. Numerical results show that the proposed optimizations benefit both decoding complexity and speed. Furthermore, efficient hardware architectures based on folding and retiming are proposed. VLSI implementation is also given in this paper. Comparison with the state-of-the-art have shown the proposed decoder's advantages in both latency and throughput (multi-Gbps). [ABSTRACT FROM AUTHOR]

In this paper, we study the resource allocation problem for downlink multicarrier non-orthogonal multiple access systems with short-packet communications (MC-NOMA-SPC). In contrast to long-packet communications in conventional wireless systems, SPC suffers from a transmission rate degradation and an unavoidable decoding error rate. Thus conventional resource allocation based on the Shannon capacity assuming infinite blocklength is no longer optimal. In this paper, we propose to use the effective-throughput as the performance metric to evaluate the tradeoff between the transmission rate and the decoding error rate. Building on that, we jointly optimize the subcarrier assignment, transmission power allocation, and transmission rate adaptation of each user to maximize the total weighted effective-throughput subject to transmission reliability and various practical constraints. Since the formulated problem belongs to a non-convex mixed integer nonlinear programming (MINLP) problem, we develop an efficient algorithm based on the dynamic programming (DP) recursion framework to obtain its optimal solutions. We further propose a low-complexity algorithm based on the principles of block coordinate descent (BCD) and concave-convex procedure (CCCP). Finally, the simulation results show that the proposed low-complexity algorithm can achieve similar performance as that of the optimal solution and outperform the other baseline schemes significantly. [ABSTRACT FROM AUTHOR]

With the increasing use of sensors and wireless communication systems, predictive maintenance is acquiring more and more importance to assess the condition of in-service equipment. Predictive maintenance presents promising cost savings, as it allows minimizing unscheduled power systems faults, which can have very costly and catastrophic consequences. Early stage detection of power system failure requires acquiring, monitoring, and periodically analyzing the condition of the elements involved, such as high-voltage power connectors, since they are critical devices which are often located in key points of power systems. This paper proposes a low-cost online system to determine the contact resistance of high-voltage direct current (dc) and alternating current (ac) power connectors, to determine their health condition in order to apply a predictive maintenance plan. The contact resistance is considered as a reliable indicator of the connector’s health condition. However, it cannot be directly measured, and the applied strategy differs between dc and ac power systems. The experimental results show a maximum uncertainty of 4.5%, thus proving the accuracy and feasibility of the approach presented in this paper, since the proposed limit of acceptable resistance increase is 20%. This approach can also be applied to many other power systems’ elements. [ABSTRACT FROM AUTHOR]

Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only $\text{38}{\%}$ of the total area of the memory-based base-line decoder when 5G code rates are supported. [ABSTRACT FROM AUTHOR]

Caching is a promising technique for 5G networks to reduce the backhual traffic and increase the overall network efficiency. In this paper, we study the caching placement policy with consideration of cooperative transmission for a two-hop relay-enabled device-to-device (D2D) network. In the caching placement phase, the probabilistic caching placement policy is considered, and in the content transmission phase, the hybrid automatic repeat request (HARQ) scheme with soft information combining [i.e., energy accumulation (EA) and mutual-information accumulation (MIA)] is utilized to improve the content retrieval experience. Cache-aided successful transmission probability (CSTP) is adopted as the main performance metric in this paper. By using tools from stochastic geometry, analytical expressions for the CSTP under different transmission schemes are derived. In moderate or high SIR regime, the optimal caching placement policy is identified based on the analytical expression and the CSTP performance is maximized accordingly. Evaluation results suggest that the MIA-based caching strategy performs better as opposed to existing strategies in most cases, but this outperformance vanishes when the transmission environment becomes severe or when users’ requests become concentrated. [ABSTRACT FROM AUTHOR]

Characterization and linearization of RF power amplifiers (PAs) are key issues of fifth-generation wireless communication systems, especially when high peak-to-average ratio waveforms are introduced. Recently, deep learning methods have achieved great success in numerous domains including wireless physical-layer. However, there has been limited work in using deep learning for PAs behavioral modeling and linearization. In this paper, we make a bridge between memory effects of the nonlinear PAs and memory of bidirectional long short-term memory (BiLSTM) neural networks. We then build a BiLSTM-based behavioral modeling architecture and its accompanying digital predistortion (DPD) model by reconciling a non causality concern. Next, an additional model is proposed in this paper to mitigate uncertainty of the tested PA when transforming phases. The experimental results demonstrate the effectiveness of the proposed scheme, in which the adequately trained networks are capable of characterizing the PA, and the artificial intelligence-based DPD shows promising linearization performance when considering the tested PAs inherent unpredictability. [ABSTRACT FROM AUTHOR]