Search

To exploit richer spectrum resources for even better service quality, millimeter wave (mmWave) communication has been considered for high-speed railway (HSR) communication systems. In this paper, we focus on scheduling as many flows as possible while satisfying their QoS requirements. Due to interference, eavesdropping, or other problems, some flows may not be directly transmitted from the track-side BS. In this paper, we propose an UAV-assisted scheduling scheme which utilizes a UAV to serve as relay for such flows. The proposed scheme also utilize two mmWave bands, one for the BS links and the other for the UAV links. The proposed algorithm aims to maximize the number of flows with their QoS requirements satisfied. Simulations demonstrate that the proposed scheme achieves a superior performance on the number of completed flows and the system throughput over two baseline schemes. [ABSTRACT FROM AUTHOR]

Future communication networksrequire higher bandwidth, greater coverage, and better throughput. The Space-Air-Ground Integrated Network (SAGIN) has the advantage of wide-area coverage and can cover global communications. It can meet the needs of network resources for maritime activities and remote mountainous areas, which is of great significance to the realization of a new generation of communications networks. With the development of the network and the emergence of delay-sensitive applications such as the Internet of Things, improving the delay performance of the system has received extensive attention. SAGIN involves multiple networks and is more complex than other networks. If there is no reasonable management between different networks, it is easy to lead to difficult link deployment and high time delay. On the basis of research and customization of SFC technology, it can provide a wide range of services and other advantages. It has significant performance in application scenarios involving multi network integration. In order to solve the above problems, this paper studies the SAGIN architecture of SFC based on business types. A service function chain mapping method based on delays prediction is proposed. Calculate the delay of the deployment path and select the path with the lowest delay as the SFC mapping path. The service model is constructed according to the mapping path, and the network slices are divided based on the service type. The simulation results show that the SFC mapping algorithm based on time delay prediction is compared with the traditional SFC mapping scheme. The algorithm does not affect other indicators, the CPU resource utilization rate is 27.8 $\%$ higher, and the link resource utilization rate is 22.7 $\%$ higher. The service acceptance rate increased by 21.5 $\%$ , the latency performance increased by 38.2 $\%$ , and the total resource consumption is reduced by 25.2 $\%$. [ABSTRACT FROM AUTHOR]

As more and more people choose high-speed rail (HSR) as a means of transportation for short trips, there is ever growing demand of high quality of multimedia services. With its rich spectrum resources, millimeter wave (mm-wave) communications can satisfy the high network capacity requirements for HSR. Also, it is possible for receivers (RXs) to be equipped with antenna arrays in mm-wave communication systems due to its short wavelength. However, as HSRs run with high speed, the received signal power (RSP) varies rapidly over a cell and it is the lowest at the edge of the cell compared to other locations. Consequently, it is necessary to conduct research on RX beamforming for HSR in mm-wave band to improve the quality of the received signal. In this paper, we focus on RX beamforming for a mm-wave train-ground communication system. To improve the RSP, we propose an effective RX beamforming scheme based on deep reinforcement learning (DRL), and develop a deep Q-network (DQN) algorithm to train and determine the optimal RX beam direction with the purpose of maximizing average RSP. Through extensive simulations, we demonstrate that the proposed scheme has better performance than the four baseline schemes in terms of average RSP at most positions on the railway. [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]

An electromagnetic map (EM) can provide movable base stations with information to optimize the communication quality of temporary communication systems in disaster areas, such as areas suffering from earthquakes. In this paper, a low-cost and effective communication optimization system model that uses sensing nodes and EMs is proposed. Moreover, two EM reconstruction methods, which serve as the keys to the model, are proposed to reconstruct EMs to provide information for communication optimization according to different demands. One method is KGA-GAN-SBI, which combines the kriging algorithm, generative adversarial network and split bregman iterations, and the other is APCA-KGA-DPA, which combines the affinity propagation clustering algorithm, kriging algorithm and domain mapping algorithm. The former can satisfy the demand of high-accuracy EMs. The latter can reconstruct an EM faster than KGA-GAN-SBI. The simulation results show that both low-cost methods can reconstruct more accurate EMs than several existing algorithms; they can provide an effective way to optimize the communication quality of temporary communication and fill the gap in the study of EM applications. [ABSTRACT FROM AUTHOR]

With the explosive growth of mobile data, the demand of high-speed railway (HSR) passengers for broadband wireless access services urgently needs the support of ultra-high-speed scenario broadband wireless communication. Millimeter-wave (mmWave) can achieve high data transmission rates, but it is accompanied by high propagation loss and vulnerability to blockage. To address this issue, developments of directional antennas and unmanned aerial vehicles (UAVs) enhance the robustness of the mmWave train-ground communication system. In this paper, we propose a UAV and MRs relay assistance (UMRA) algorithm to effectively overcome link blockage, which can maximize the number of transmission flows on the premise of meeting QoS requirements and channel qualities. First, we formulate a mixed integer nonlinear programming (MINLP) problem for UAV trajectory design and transmission scheduling in the full-duplex (FD) mode. Then, in UMRA, the relay decision algorithm and transmission scheduling algorithm based on graph theory are proposed, which make a good tradeoff between computation complexity and system performance. Extensive simulation results show that a suitable UAV position will greatly improve the performance of the UMRA algorithm and make it close to the optimal solution. Compared with the other two existing benchmark schemes, with the high channel quality requirements and large-area blockage, UMRA can greatly improve the number of completed flows and system throughput. [ABSTRACT FROM AUTHOR]

Vehicular networks which are paralyzed by natural disasters is faced with communication dilemma. Through building a decentralized communication network, unmanned aerial vehicles (UAVs) with high mobility and flexibility are expected to be the solution to the post-disaster vehicular networks. The blockchain technology has been widely used in UAV networks to provision the prompt security of distributed communications. However, existing works ignore the dynamics of the network in that due to high mobility, distributed UAVs cannot timely connect to the backbone to synchronize blockchain transactions. The delay of synchronization can result in severe security issues. On addressing the issues, this paper proposes UAVs-aided blockchain offline transactions to ensure the security and effectiveness of delay-tolerant blockchain transactions when UAVs are offline. In specific, we consider vehicle-to-vehicle (V2V) charging transactions in post-disaster vehicular networks. By establishing offline channel between charging and discharging electric vehicles (EVs) by hashed time locked contract (HTLC), we design a UAVs aided penalty algorithm with accountable assertions to prevent deposit forging attacks and double-spending attacks. In addition, considering the selfishness of EVs, a Stackelberg game based incentive scheme is developed to encourage EVs to participate the offline transactions and to improve their trust values. By suing the mechanisms above, our proposal addresses the security of offline EV charging, as well as the selfishness of participant. Using extensive simulations, we demonstrate that the proposed scheme can realize secure transactions among EVs and can effectively improve the utilities of EVs through the comparison with conventional schemes. [ABSTRACT FROM AUTHOR]

Recently, research on the design of relay structure and optimal precoding matrix in massive multiple-input multiple-output (MIMO) relay systems has been proposed in many works assuming that partial or all of the channel state information (CSI) is known. However, in the practical communication systems, the CSI is unknown and needs to be estimated. In particular, channel estimation is more difficult when the relay adopts a hybrid precoding structure. In this paper, we propose an efficient channel estimation scheme based on Tucker-2 tensor model for a multi-way massive MIMO hybrid relay system. The proposed algorithm provides all the CSI involved in the communication links at each user end. Compared with traditional channel estimation algorithms, the proposed algorithm has better estimation performance and requires few iterations to achieve convergence. In addition, we derive the analytical expression of the Cramér-Rao lower bound (CRB) for reference. Simulation results verify the effectiveness of the proposed Tucker-2-based channel estimation approach. [ABSTRACT FROM AUTHOR]

Aerial base stations (ABSs) are expected to be important supplementary components for the 5G-and-beyond communication systems to achieve global Internet of Everything. To fully exploit the advantages of the ABSs seamless connection, in this paper, we propose a high altitude platform (HAP) and low altitude platforms (LAPs) cooperated network architecture. Specifically, the HAP can extend the network coverage and LAPs can act as relays to improve the transmission performance for hot spots. In the considered network, we investigate the sum rate maximization problem by optimizing the downlink and the uplink transmissions, respectively. In the downlink, we adopt the orthogonal frequency division multiple access technique and take the basic rate requirement into account. In addition, we optimize the height of LAPs and the spectrum allocation between the HAP and LAPs, and between the LAP and users. Then, we decouple the downlink sum rate maximation problem as three subproblems. An alternating optimization framework is designed to deal with these non-convex optimization problems, where the height and spectrum allocation are tackled in turn. In the uplink, we adopt the non-orthogonal multiple access technique, and consider the decoding threshold of the successive interference cancellation technique. Afterward, we optimize the power allocation of each user, and the spectrum allocation between users and the LAP, and between LAPs and the HAP. Finally, simulation results show the effects of spectrum allocation, height optimization and power allocation on network performance, which verify that the proposed scheme can achieve higher sum rate on both downlink and uplink in comparison with the current works. [ABSTRACT FROM AUTHOR]

Enhanced mobile broadband (eMBB) and ultra-reliable and low-latency communications (URLLC) are the two core services of the emerging fifth-generation (5G) systems. URLLC services require lower latency and high reliability, whereas eMBB services expect maximum data rates. Since 5G new radio (NR) aims to support heterogeneous services, the 3rd generation partnership project (3GPP) supports a highly flexible frame structure by introducing mixed numerology and mini-slot approaches. In these systems, the time slot is further divided into mini-slots. The coexistence of these two heterogeneous services leads to a challenging resource allocation problem. In this paper, we study the joint resource allocation problem of eMBB and URLLC schedulers to maximize the minimum expected achieved rate (MEAR) of eMBB users while satisfying URLLC users’ quality of service (QoS) constraints. The resource allocation of eMBB traffic occurs at time slot boundaries. In contrast, URLLC traffic is overlapped at the mini-slot timescale by adopting the non-orthogonal multiple access (NOMA) superposition technique. The suitable pairs of eMBB, URLLC users are evaluated using the one-one matching theory by inculcating fairness among eMBB users while satisfying the QoS parameters of URLCC users. The significance of the proposed approach over the baseline approaches is evaluated through numerical simulations in terms of the MEAR, mixed numerologies, and fairness scores among eMBB users. [ABSTRACT FROM AUTHOR]

Recently, reconfigurable intelligent surface (RIS) has drawn much attention due to its capability of improving coverage and communication performance. The development of RIS-assisted communication technology relies on deep understanding of RIS channel characteristics. However, most of the existing investigations focus on the impact of RIS, ignoring the existence of local scatterers in the real propagation environment. The ideal propagation condition limits the accuracy and application of the developed channel model. In this paper, we aim to analyze the channel characteristics of RIS-assisted near-filed communication by considering different conditions of local scatterers. Specifically, we propose a three-dimensional (3D) RIS-assisted multiple-input multiple-output (MIMO) channel model based on a three-dimensional cylinder model, which considers line-of-sight, single-bounced at RIS (SBR) and double-bounced (DB) modes where radio waves reflect from RIS and scatterers near receiver. Based on the proposed channel model, we investigate some key statistical properties for SBR and DB propagation, including the time-frequency-space correlation function and Doppler power spectrum. From the simulation results, it is found that RIS element number, RIS horizontal and vertical locations, distribution of surrounding scatterers, and movement of Rx have significant impacts on channel characteristics. Finally, channel capacities of SBR and DB modes are calculated, where the large size and appropriate locations of RIS significantly improve the channel capacity of RIS-assisted communication. These numerical results and observations can be used for design of RIS-assisted near-field communication systems. [ABSTRACT FROM AUTHOR]

This paper presents techniques that are expected to improve the bit error rate (BER) performance of Unmanned Aerial Vehicles (UAVs) communication systems. The decode-and-forward (DF)-based cooperative multi-hop Rician network using space shift keying (SSK) modulation is employed for this purpose. The SSK modulation and cooperative communication are merged and used together. This enhances the BER performance for multiple-input multiple-output (MIMO) channels, thus accentuating its significance as an important technique for consistently reliable communication methodology while, at the same time, eliminating wastage of energy. The new technique is named as high performance (HP) due to not only BER performance improvement but also increase of the diversity of the communication system. This new model is further used for multi-hop networks and the resulting BER characteristics are assessed for possible enhanced performance in Rician channels. The paper also showcases the generalized-n-hop BER equation for various multi-hop DF-based cooperative communication systems in diverse UAV models. The Monte Carlo simulations further confirm the theoretical results that already exist for transmit-receive antennas. This work also underlines the fact that the number of hops in a communication system has no bearing whatsoever on the BER performance diversity value. [ABSTRACT FROM AUTHOR]

Autonomous electric vehicles (AEVs) are gaining ground around the world. They are equipped with intelligent decision-making capabilities that allow them to optimize on their battery usage and engage in energy trading for profit maximization. This paper envisions a market model, where energy aggregators considers buying and selling electricity from AEVs. In this system, the aggregators reside on cloudlets at the edge of a cloud computing system for prompt communication and negotiation with AEVs. Whether they are parked or en-route, AEVs can be crowdsourced to provide energy to consumers at needed times. This study proposes double auction models to incentivize AEV agents to participate in the market based on their time preferences and energy pricing. The proposed system implements dynamic pricing structures, which are applicable to various scenarios of energy trading. To evaluate the proposed system, this paper provides extensive theoretical analysis and simulation experiments to demonstrate that the proposed auctioning models are computationally efficient, truthful, individually rational, and budget balanced. [ABSTRACT FROM AUTHOR]

Radio-frequency (RF) energy harvesting is one of the promising technologies in wireless networks. This paper considers wireless powered communication networks (WPCNs) where one hybrid access point (H-AP) coordinates RF energy/information transmissions to/from a set of nodes. For the important type of WPCNs where the nodes have throughput requirement, we aim to minimize H-AP's energy provision (EP) via jointly optimizing the time allocation of energy/information transmissions and H-AP's transmission power while satisfying node throughput requirement. More specifically, the half-duplex WPCN is considered first. We prove that H-AP's energy transmission power must be the maximum allowed value to achieve the minimal EP, then show that the problem is convex under this condition and finally design an algorithm applying golden section search and bisection search jointly to efficiently obtain the optimal time allocation. Second, the full-duplex WPCN is considered. Its EP minimization problem is proved convex. However, due to the hardness of solving it directly, we turn to solve the feasibility problem (FP) for a given EP per unit time. We construct a convex optimization problem based on this FP and design a dual subgradient algorithm for finding its optimal solution, which indicates whether this FP is feasible. The minimal EP per unit time and its corresponding optimal solution are found by using the bisection search method. Simulation results show that, the EP-minimized schemes are able to greatly reduce H-AP's EP as compared to the baseline schemes. [ABSTRACT FROM AUTHOR]

This paper considers a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use licensed spectrum. Based on the interaction of each D2D pair and each CU, we formulate the pairing problem between multiple CUs and multiple D2D pairs as a one-to-one matching game. Unlike most existing works, we consider a realistic scenario with incomplete channel information. Thus, each CU lacks enough information to establish its preference over D2D pairs. Therefore, traditional matching algorithms are not suitable for our scenario. To this end, we convert the matching game to an equivalent non-cooperative game, and then propose a novel learning algorithm, which converges to a stable matching. [ABSTRACT FROM AUTHOR]

In this paper, we investigate antenna selection (AS) methods for bidirectional (BD) full-duplex multiple-input–multiple-output (MIMO) systems in which antennas at each node can be selected to either transmit or receive. In this configuration, we first analyze the average sum rate of the optimal AS scheme that finds the best antenna set solution by examining all the possible candidates. The result provides insight into which transmit and receive antenna configuration improves the average sum-rate performance of the AS scheme. Then, we present a new AS algorithm that achieves near-optimal sum-rate performance with much reduced complexity compared with the optimal AS scheme. From simulation results, we verify that our sum-rate analysis for the optimal AS scheme matches the numerical results and confirm that, by employing the proposed AS algorithm, a performance gain of 15% is achieved. [ABSTRACT FROM PUBLISHER]

Security is a crucial feature of current (5G) and even more for future (6G) communication networks. While the innate nature of the wireless channel is an issue for guaranteeing security, its physical characteristics can be exploited for protecting confidential data. Physical-layer Security (PLS) mechanisms take advantage of unique features of the transmission media or of the user equipment to introduce an additional level of data protection. The physical-layer security (PLS) can be seen as the first level of defense. The noise-loop (NL) modulation is a PLS technique that intrinsically provides confidentiality. In this paper, we first provide the theoretical analysis to evaluate the reliability and security in multipath fading channels, and then the theoretical results are evaluated by experimentation. A Software Defined Radio (SDR) testbed that exploits the NL secure modulation was implemented and a measurement campaign has been carried out in an indoor environment, with passive and active malicious nodes. An evaluation of the complexity of the proposed system is also reported, showing that the NL has low hardware resource occupancy and low computational cost. These fundamental characteristics make the NL modulation a valid PLS technique for providing a security solution for beyond 5G and 6G networks. [ABSTRACT FROM AUTHOR]

The performance of train communication network (TCN) is one of the most important factors to ensure the safety of train operation, and there is a lack of research for the TCN performance currently. To master the state of TCN, a combined method to evaluate and predict the TCN performance is proposed in the paper. First, we select appropriate evaluation indexes and determine their comprehensive weights. Then, the evaluation model of TCN performance is established based on a multidimensional normal cloud model combined with weights. According to the evaluation results, the artificial neural network (ANN) is used to predict the TCN performance to realize the real-time evaluation. Finally, the effectiveness of the evaluation and prediction model of TCN performance is verified by the simulation result, which is obtained from the simulation platform of TCN. The results show that service quality for TCN has been effectively improved, which provides a theoretical reference for evaluation and prediction of TCN performance. [ABSTRACT FROM AUTHOR]

The performance evaluation of wireless systems is crucial for the development of future systems with more connected devices. It is essential to have an easy and relevant method for ensuring the wireless communication performance of the devices. We have recently developed a new random line-of-sight (random-LOS) measurement system for evaluating the communication performance of wireless devices, e.g., transceivers and antennas installed on a vehicle. In the measurement system, a plane wave is generated in the test zone emulating the far-field wave transmitted from a radio base station. In this paper we present both numerical simulations and actual experimental results of the random-LOS over-the-air (OTA) measurement setup operating in the 1.5–3 GHz band. The measurement accuracy is determined by the field variations within the test zone, where a smaller variation gives better measurement accuracy. In this paper the achieved accuracy expressed in terms of standard deviation (STD) was evaluated to be approximately 1 dB of the power within a cylindrical test zone of height 0.4 m and diameter 2 m. The active multiple-input multiple-output (MIMO) performance of antenna systems installed on an actual vehicle was measured and evaluated using the presented setup. A comparison to a theoretical zero forcing (ZF) receiver is also presented. [ABSTRACT FROM AUTHOR]

In this paper, we consider a hybrid smart grid communication network consisting of power line communication (PLC) at the transmitter side and the device-to-device (D2D) cellular communication on the receiver side which provides last mile connectivity. The PLC channel is assumed to experience Rayleigh fading and is corrupted by impulsive noise, and the D2D communication being a short range communication system, is assumed to experience Nakagami- $m$ fading with additive Gaussian noise. We propose a maximal-ratio combining (MRC) receiver for the considered hybrid smart grid communication system employing binary phase shift keying (BPSK) modulation at the transmitter and derive a closed-form symbol error probability (SEP) expression for the proposed receiver. The interference between the D2D links is assumed to be negligible for the tractability of the error probability analysis. Numerical results demonstrate the optimality of operating the D2D links at lower signal-to-noise ratio (SNR) values to overcome the effect of the impulsive PLC channel by utilizing diversity branches. [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]

Explorations on the Lunar Far-side Surface (LFS) have recently developed rapidly with various landers, cruisers, and orbital space vehicles. Research on relay satellites with Earth-Moon Libration Point (EMLP) orbits has aroused widespread interest in supporting these probe missions, i.e., “Queqiao” spacecraft, due to their particular relative positions in the Earth-Lunar system. For example, a Halo orbital relay satellite at the Earth-Moon L2 point can provide more transmission opportunities for communication nodes on LFS to the destination nodes on the Earth. However, a single Halo orbital spacecraft could not provide all-time connections for the cislunar communication with its limited coverage on the LFS. In this paper, we proposed a dual-relay Halo orbit constellation for the cislunar communication network, providing high-proportion coverage on the LFS at any time using an analytical method of the grid point. Based on the proposed constellation, we designed an energy efficiency-optimal relay selection algorithm for the nodes on the LFS to return data back to the Earth by solving a MIP (Mixed-Integer-Programming) problem with collaborative considerations of source and relay node’s power allocation. The simulation results demonstrate that the proposed algorithm has the maximum energy efficiency (EE) while ensuring the user’s quality of service, compared with the algorithm of Spectrum Efficiency Maximization (SEM). [ABSTRACT FROM AUTHOR]

In this paper, we consider the orthogonal frequency division modulation (OFDM) based integrated radar-communication (Rad-Com) for automobile systems operating in millimeter wave band with imperfect time-frequency synchronization for communications. Since different pilot power allocation and placement strategies can result in different performance, we investigate the power allocation and placement design for the Rad-Com system. We analyze the effect of power allocation and pilot placement on the system performance. Based on the analysis, we provide, along with a channel estimation scheme, the pilot power allocation and placement designs that can optimize the radar and communication performance, respectively. Moreover, the tradeoff between radar and communication performance is discussed and a tradeoff design is presented. We conduct simulations to validate our analysis and evaluate the proposed designs. Results show that our analysis is valid and insightful and the proposed designs are effective. [ABSTRACT FROM AUTHOR]

In this paper, the maximum signal-to-interference-plus-noise ratio (MSINR) beamforming problem in antenna-array CDMA systems is considered. In this paper, a modified MSINR criterion presented in a previous paper is interpreted as an unconstrained scalar cost function. By applying recursive least squares (RLS) to minimize the cost function, a novel blind adaptive beamforming algorithm to estimate the beamforming vector, which optimally combines the desired signal contributions from different antenna elements while suppressing noise and interference, is derived. Neither the knowledge of the channel conditions (fading coefficients, signature sequences and timing of interferers, statistics of other noises, etc.) nor training sequence is required. Compared with previously published adaptive beamforming algorithms based on the stochastic-gradient method, it has faster convergence and better tracking capability in the time-varying environment. Simulation results in various signal environments are presented to show the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

A commonly used assumption in the existing unmanned aerial vehicle (UAV) channel models is that the UAV flies along linear trajectories. However, this assumption does not always hold in realistic UAV communication scenarios. In this paper, we relax the linear trajectory restriction and present a temporally non-stationary channel model for UAV-to-ground communication scenario. The temporal non-stationarity of the channel stemming from time-varying heading directions of the UAV is properly modeled. This is achieved by combining a geometry-based stochastic model (GBSM) and an aeronautic random mobility model (RMM), which is introduced to characterize the movement pattern of UAVs. Based on UAV and ground station (GS) trajectories, time-varying model parameters and statistics including space-time-frequency correlation function (STF-CF), Doppler power spectrum density (PSD), delay PSD, and stationary interval are derived. The influences of the RMM-related parameters on the statistics are presented and analyzed. Some of those statistics are verified by measurements, showing the practicability of the model. The work presented in this paper is helpful in designing UAV communication system considering realistic UAV trajectories. [ABSTRACT FROM AUTHOR]

Providing femto access points (FAPs) with computational capabilities will allow (either total or partial) offloading of highly demanding applications from smartphones to the so-called femto-cloud. Such offloading promises to be beneficial in terms of battery savings at the mobile terminal (MT) and/or in latency reduction in the execution of applications. However, for this promise to become a reality, the energy and/or the time required for the communication process must be compensated by the energy and/or the time savings that result from the remote computation at the FAPs. For this problem, we provide in this paper a framework for the joint optimization of the radio and computational resource usage exploiting the tradeoff between energy consumption and latency. Multiple antennas are assumed to be available at the MT and the serving FAP. As a result of the optimization, the optimal communication strategy (e.g., transmission power, rate, and precoder) is obtained, as well as the optimal distribution of the computational load between the handset and the serving FAP. This paper also establishes the conditions under which total or no offloading is optimal, determines which is the minimum affordable latency in the execution of the application, and analyzes, as a particular case, the minimization of the total consumed energy without latency constraints. [ABSTRACT FROM PUBLISHER]

In multiantenna downlink, linear precoders like channel inversion (CI), regularized CI (RCI), and phase alignment (PA) are more desirable than their nonlinear counterparts due to their reduced complexity. However, to exploit the full benefits of multiuser downlink, the availability of perfect channel state information (CSI) at the base station (BS) is mandatory. Since such an assumption is not realistic in practice, subject to CSI mismatch, the downlink precoders may undergo a severe degradation in performance. Therefore, an adaptive linear precoder is required to achieve better performance under the availability of imperfect CSI at the BS. In this paper, we propose such a linear precoder by judiciously picking up an optimized regularization parameter based on the knowledge of the channel estimation error variance in advance. To do so, we first introduce a generalized CSI mismatch model where the variance of the channel estimation error is a function of the signal-to-noise ratio (SNR) and is thus able to accommodate a variety of distinct scenarios such as reciprocal channels and CSI feedback. It is shown that the proposed precoding scheme, dubbed adaptively regularized PA (RPA), is capable of achieving lower bit error rates (BERs) compared to standard linear precoders under both perfect and imperfect CSI. [ABSTRACT FROM PUBLISHER]

This paper deals with the problem of efficient resource allocation in dynamic infrastructureless wireless networks. In a reactive interference-limited scenario, at each transmission trial, every transmitter selects a frequency channel from some common pool, together with a power level. As a result, for all transmitters, not only the fading gain, but the number and the power of interfering transmissions as well, vary over time. Due to the absence of a central controller and time varying network characteristics, it is highly inefficient for transmitters to acquire the global channel and network knowledge. Therefore, given no information, each transmitter selfishly intends to maximize its average reward, which is a function of the channel quality, as well as the joint selection profile of all transmitters. This scenario is modeled as an adversarial multiplayer multiarmed bandit game, where players attempt to minimize their so-called regret, while, at the network side, achieving equilibrium in some sense. Based on this model and to solve the resource allocation problem, in this paper, we develop two joint power level and channel selection strategies. We prove that the gap between the average rewards achieved by our approaches and that based on the best fixed strategy converges to zero asymptotically. Moreover, the empirical joint frequencies of the game converge to the set of correlated equilibria, which is characterized for two relaxed versions of the designed game. [ABSTRACT FROM PUBLISHER]

This paper examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless mobile applications is considered, where errors are caused by a discrete channel with correlated behavior over time. For carefully selected channel models and arrival processes, a tractable Markov structure composed of queue length and channel state is identified. This facilitates the analysis of the stationary behavior of the system, leading to evaluation criteria such as bounds on the probability of the queue exceeding a threshold. Specifically, this paper focuses on system models with scalable arrival profiles, which are based on Poisson processes, and finite-state channels with memory. These assumptions permit the rigorous comparison of system performance for codes with arbitrary block lengths and code rates. Based on the resulting characterizations, it is possible to select the best code parameters for delay-sensitive applications over various channels. Random codes and BCH codes are then employed as a means to study the relationship between code parameter selection and the queueing performance of point-to-point data links. The methodology introduced herein offers a new perspective on the joint queueing–coding analysis of finite-state channels with memory, and it is supported by numerical simulations. [ABSTRACT FROM PUBLISHER]

Proximate cloud computing enables computationally intensive applications on mobile devices, providing a rich user experience. However, remote resource bottlenecks limit the scalability of offloading, requiring optimization of the offloading decision and resource utilization. To this end, in this paper, we leverage the variability in capabilities of mobile devices and user preferences. Our system utility metric is a measure of quality of experience (QoE) based on task completion time and energy consumption of a mobile device. We propose a heuristic offloading decision algorithm (HODA), which is semidistributed and jointly optimizes the offloading decision, and communication and computation resources to maximize system utility. Our main contribution is to reduce the problem to a submodular maximization problem and prove its NP-hardness by decomposing it into two subproblems: 1) optimization of communication and computation resources solved by quasiconvex and convex optimization and 2) offloading decision solved by submodular set function optimization. HODA reduces the complexity of finding the local optimum to O(K^3), where $K$ is the number of mobile users. Simulation results show that HODA performs within 5% of the optimal on average. Compared with other solutions, HODA's performance is significantly superior as the number of users increases. [ABSTRACT FROM PUBLISHER]

Information-centric wireless network virtualization enables the sharing of not only the infrastructure but also the content among different service providers, enabling the gain of not only virtualization but in-network caching as well. In this paper, we propose a novel framework with information-centric wireless virtualization and device-to-device (D2D) communications, which enables content caching not only in the air but in the mobile device as well. Moreover, the content is virtualized and can be shared by users from different virtual service providers. In this framework, we formulate the virtual resource allocation and caching strategies as a joint optimization problem, considering the gain of not only virtualization but of caching in the proposed information-centric wireless network virtualization architecture with D2D communications as well. In addition, to reduce computational complexity and signaling overhead, we propose a distributed algorithm to solve the formulated problem based on recent advances in alternating direction method of multipliers (ADMM), in which different parties only need to solve their own problems without the exchange of channel state information (CSI) with fast convergence rate. Extensive simulations are conducted with different system parameters to show the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]

This paper designs and analyzes the bit-interleaved coded modulation with iterative demapping and decoding (BICM-ID) framework under color-shift-keying (CSK) modulation to achieve spectrally efficient transmissions in visible light communication (VLC) systems. Specifically, we investigate the protograph low-density parity-check (LDPC) codes, bit-to-symbol mapping schemes, and constellation labeling rules in higher-order CSK-aided VLC systems. To fully explore the BICM-ID benefit, we propose an irregular CSK mapping, in which an $M$ -ary standardized constellation (called “Standard constellation”) and a new $M$ -ary constellation (called “Target constellation”) are separately applied to modulate two different coded sub-blocks in a codeword to optimize the error performance of the CSK-aided VLC systems. Furthermore, using a modified protograph extrinsic information transfer (PEXIT) algorithm, we construct two types of protograph LDPC codes (i.e., unpunctured and punctured protograph LDPC codes) that outperform the conventional protograph LDPC codes. Both analytical and simulation results show that the proposed irregular-CSK-mapped BICM-ID employing the new protograph LDPC codes and Target constellation is capable of achieving outstanding performance, and is a promising transmission solution for high-speed VLC applications. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) swarm has emerged as a promising novel paradigm to achieve better coverage and higher capacity for future wireless network by exploiting the more favorable line-of-sight (LoS) propagation. To reap the potential gains of UAV swarm, the remote control signal sent by ground control unit (GCU) is essential, whereas the control signal quality are susceptible in practice due to the effect of the adjacent channel interference (ACI) and the external interference (EI) from radiation sources distributed across the region. To tackle these challenges, this paper considers priority-aware resource coordination in a multi-UAV communication system, where multiple UAVs are controlled by a GCU to perform certain tasks with a pre-defined trajectory. Specifically, we maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all the UAVs by jointly optimizing channel assignment and power allocation strategy under stringent resource availability constraints. According to the intensity of ACI, we consider the corresponding problem in two scenarios, i.e., Null-ACI and ACI systems. By virtue of the particular problem structure in Null-ACI case, we first recast the formulation into an equivalent yet more tractable form and obtain the global optimal solution via Hungarian algorithm. For general ACI systems, we develop an efficient iterative algorithm for its solution based on the alternating optimization methods. Extensive simulation results demonstrate that the proposed algorithms can significantly enhance the minimum SINR among all the UAVs and adapt the allocation of communication resources to diverse mission priority. [ABSTRACT FROM AUTHOR]

This paper evaluates the practically achievable best error performance obtained from a dimmable visible light communication (VLC) system that conveys information using binary modulations, such as on-off keying (OOK). As compared to previous studies that address the ideal performance of dimmable VLC systems only over reliable channels with arbitrarily small error probability, this paper presents the best achievable error probability of various configurations with the dimming targets, signal quality, and data rate. The numerical results establish the ultimate decoding error performance targeted for dimmable VLC systems and are expected to provide a practical guideline for the enhanced VLC system design. [ABSTRACT FROM AUTHOR]

Power control is becoming increasingly essential for the fifth-generation (5G) and beyond systems. An example use-case, among others, is the unmanned-aerial-vehicle (UAV) communications where the nearly line-of-sight (LoS) radio channels may result in very low signal-to-interference-plus-noise ratios (SINRs). The authors in (Chiang et al., 2007) proposed to efficiently and reliably solve this kind of non-convex problem via a series of geometrical programmings (GPs) using condensation approximation. However, it is only applicable for a small-scale network with several communication pairs and practically infeasible with more (e.g., tens of) nodes to be jointly optimized. We therefore in this paper aim to provide new insights into this problem. By properly introducing auxiliary variables, the problem is transformed to an equivalent form which is simpler and more intuitive for condensation. A novel condensation method with linear complexity is also proposed based on the form. The enhancements make the GP-based power control feasible for both small- and especially large-scale networks that are common in 5G and beyond. The algorithm is verified via simulations. A preliminary case study of uplink UAV communications also shows the potential of the algorithm. [ABSTRACT FROM AUTHOR]

This paper considers optimal joint time, frequency, and power allocation for energy-efficient device-to-device (D2D) communications in an overlay cellular network, where multiple D2D transmitters communicate with their corresponding D2D receivers while utilizing the energy harvested from a cellular base station (BS). Due to channel estimation error and feedback delays, the channel state information (CSI) available at the transmitters is usually imperfect, which can significantly deteriorate the energy efficiency (EE) of the considered system. To mitigate the impact of imperfect CSI, we formulate a non-convex robust optimization problem for the maximization of the EE (in bits/Joule) of the system while ensuring quality of service (QoS) requirements on the minimum data rata and the minimum amount of harvested energy for cellular and D2D users, respectively. We reveal that the optimal energy-efficient D2D transmission should exhaust all the harvested energy of each D2D transmitter. Exploiting this fact, we propose an efficient iterative algorithm for obtaining the optimal solution. To strike a balance between performance and computational complexity, we further propose a low-complexity suboptimal algorithm. Simulation results show that compared with several baseline schemes, both the proposed optimal and suboptimal algorithms can significantly improve the EE of wireless-powered D2D communications under imperfect CSI. Moreover, the proposed suboptimal algorithm is close-to-optimal when the number of cellular users are small or the channel estimation error is large. [ABSTRACT FROM AUTHOR]

This paper studies the application of network non-orthogonal multiple access (N-NOMA) to vehicular communication networks, modeled by a Poisson line Cox point process (PLC). Particularly, the road infrastructure is modeled by a Poisson line point process (PLP), whereas base stations (BSs) and users are located according to 1D homogeneous Poisson point processes (HPPPs) on each road. In the considered N-NOMA scheme, there are two types of users, i.e., coordinated multi-point (CoMP) users which are far from their BSs and NOMA users which are close to their BSs, where the CoMP users and the NOMA users are served simultaneously by applying the principle of NOMA. Specifically, the BSs collaborate with each other to provide reliable transmission for the CoMP user by applying Almouti coding, while each BS employs superposition coding to opportunistically serve an additional NOMA user. Compared to a conventional OMA based scheme, where only a CoMP user is served, the proposed N-NOMA scheme significantly improves the performance in terms of outage sum rates and user connectivity, since more users are served in the same resource block. A comprehensive analytical framework is developed to characterize the system level performance of the proposed N-NOMA scheme by applying PLC. Closed form expressions for the outage probabilities achieved by the CoMP and NOMA users are obtained. Computer simulation results are provided to show the superior performance of the proposed scheme and also validate the accuracy of the developed analytical results. [ABSTRACT FROM AUTHOR]

To meet the ever-increasing demand for mobile data traffic, mobile operators are seeking to utilize unlicensed spectrum as a supplement to the licensed spectrum. The harmonious and spectrum-efficient coexistence scheme between LTE and incumbent users on the unlicensed spectrum is thus mandatory. Currently, advanced intelligent technologies are being expected to play the crucial role in the future communication system. We thus introduce the Q-learning (QL) framework into LTE licensed assisted access (LAA) scheme in the paper, thereby forming a QL based LAA scheme. We first redefine the fairness in the sharing of unlicensed spectrum and then divide the state space into six states based on the predefined throughput and fairness thresholds, followed by the definition of the action set and reward function. In the proposed scheme, based on the convergent Q table, where each element is used to evaluate the pros and cons of taking an action, the agent can repeatedly interact with the environment until it reaches the terminal state, i.e. selects the optimal action (i.e. contention window size). Additionally, the chaotic motion with ergodicity, regularity and randomness is first introduced into the action-decision strategy to accelerate the training velocity with the balance consideration of exploration and exploitation. The simulation results prove that the proposed $\epsilon$ -chaotic greedy selection strategy has faster convergence velocity compared with other methods such as $\epsilon$ -greedy, pure greedy, Bolzmann and random selection strategy, and that the proposed chaotic QL LAA scheme outperforms the other LAA schemes such as the 3GPP, linear, fixed LAA and Listen Before Talk (LBT) adaptive schemes in terms of throughput, collision probability, fairness and delay. [ABSTRACT FROM AUTHOR]

Given the exponential proliferation of mobile devices and broadband services, there is a pressing need to amalgamate multiple technologies accommodating infrastructural changes for meeting the ever-increasing demands of user capacity. Therefore, in this paper, we propose the integration of proximity-based direct device-to-device (D2D) communication with the network densification concept. In this paper, we consider user-centric non-overlapping clusters associated with the closest access point for serving user equipment (UE) in the downlink under limited availability of orthogonal resource blocks (RBs), while the D2D links also reuse these downlink RBs. We analytically derive the coverage probability as well as the average transmission rate of D2D links under the proposed model, which results in a complex interference scenario. The performance results verify that our analytical results closely match with simulations for different parametric settings. The impact of the presence of D2D links on the coverage probability of the UEs is also quantified, revealing that the UEs’ performance is only modestly affected under the proposed system model. [ABSTRACT FROM AUTHOR]

Terahertz (THz)-band (0.1–10 THz) communication is envisioned as a key wireless technology of the next decade, able to support wireless Terabit-per-second links in 6G systems. THz communication exhibits an extremely large bandwidth (tens to hundreds of GHz) at the cost of a very high path loss ($>$ 100 dB for distances beyond a few meters). Therefore, highly directional antennas (DAs) are needed simultaneously in transmission and reception at all times to establish reliable communication links. The application of highly DAs introduces new challenges in the neighbor discovery process. In this paper, a time-efficient neighbor discovery protocol for THz-band communication networks is proposed. The protocol expedites the neighbor discovery process by leveraging the full antenna radiation pattern to detect a series of effective signals and map them to the universal signal patterns, which indicate the potential direction of the signal source. A mathematical framework is developed to compare the neighbor discovery protocols with and without the antenna side-lobes information in free space. The X60 testbed is utilized to validate the proposed neighbor discovery protocol. Furthermore, a feasibility analysis of the proposed protocol inside a bounded space (e.g., a square room) is conducted. Numerical results are presented to illustrate the performance improvements achieved by the proposed protocol when compared to the traditional neighbor discovery protocols with only main-lobe information. [ABSTRACT FROM AUTHOR]

Orthogonal frequency-division multiplexing (OFDM) is a promising technology for communication systems. This paper investigates the impacts of unknown noise variance on the popular spectrum sensing scheme, i.e., energy detection, for OFDM cognitive radios over multipath fading channels. To study the effects of unknown parameters on the energy detector, a new maximum-likelihood estimation of noise and signal powers employing the cyclic prefix of OFDM is presented in this paper. The mean values and Cram $\acute{\text{e}}$ r–Rao lower bounds of the estimation are obtained. Furthermore, the performances of the energy detector for both hypotheses, i.e., false-alarm rate and detection probability, under the influence of unknown noise variance are validated by both simulation and analytical results. The assessment on the required number of samples for the proposed energy detector is conducted, which indicates that an amount of 40–50% samples can be saved compared to the conventional energy detector. [ABSTRACT FROM AUTHOR]

This paper considers the bit loading problem for communication systems that utilize orthogonal frequency division multiplexing (OFDM) in conjunction with precoding (POFDM) or time-domain interleaving (IOFDM). In particular, we propose a new bit loading algorithm for P/I-OFDM that has substantially higher effective throughput and less computational complexity, when compared to bit loading in conventional OFDM systems. The obtained results show that the effective throughput of P/I-OFDM can be more than fourfold the conventional OFDM while the complexity is less than $1.5\%$. Moreover, the results show that the peak-to-average power ratio (PAPR) properties of the considered systems are preserved under the adaptation process. [ABSTRACT FROM AUTHOR]

High-speed rail public broadband wireless access requires communication terminals with high mobility to perform seamless cell switching in a harsh and fast time-varying environment. However, frequent switching caused by fast motion inevitably leads to unpredictable high volatility of the available spectrum, resulting in inefficient wireless communication. The application of highly mobile cognitive radio technology may address this challenge. This paper first analyzes the physical structure of the existing railway wireless communication network, and determines the characteristics of chainlike distribution and cascade operation of the base stations along the railway. Furthermore, using Bayesian reinforcement learning and multi-agent theory, a distributed cognitive base station model suitable for railway wireless environment is constructed. Based on the joint spectrum management of cascaded base station groups, this model proposes a multi-agent coordination algorithm with the goal of global optimal communication performance of the entire rail line. Finally, this paper evaluates the network performance of various test scenarios, and proves that the cognitive base station multi-agent cascade cooperative system can significantly increase the probability of successful data transmission and greatly reduce wireless spectrum handovers. This proposed scheme provides a brand-new solution for solving the problem of low wireless spectrum efficiency in the typical railway wireless network. [ABSTRACT FROM AUTHOR]

Multi-hop device-to-device (D2D) communications play an important role in expanding D2D coverage. In this paper, we study a relay-based and network-coding-assisted (in particular, XOR coding) multi-hop D2D communication system. In the system, toward jointly considering the impact of interference and network traffic conditions on the quality of D2D communications, various channel fading models and traffic models are investigated, and the packet loss probability of D2D links is meticulously computed using these models. With the packet loss probability of D2D links, the general closed-form expressions of end-to-end packet loss probability (E2EPLP) of the system with the presence (or absence) of XOR coding are subsequently derived. Our experiments reveal that both the number of relays and the mechanism of XOR coding can affect the system performance. Specifically, the increase in the number of relays will lower the overall system performance (e.g., an increase in the E2EPLP and end-to-end completion time, and a decrease of the end-to-end rate may follow as a result). On the other hand, although the presence of XOR coding unfortunately raises the system E2EPLP, it can effectively improve the end-to-end completion time and end-to-end rate. It is our belief that the analytical approach proposed in this paper and the results found in our work can be useful to peer studies in the context of applying network coding in multi-hop D2D networks. [ABSTRACT FROM AUTHOR]

5 G based vehicular communication networks support various traffic safety and infotainment use cases and rely on the periodic exchange of information. However, these messages are susceptible to several attacks which can be detected using misbehavior detection systems (MDS). MDS utilizes trust score, feedback score and other evaluation schemes to identify abnormal behavior of the vehicles. However, the trust and feedback scores used in MDS may violate the location, trajectory, or identity privacy of the vehicle. In this paper, we propose a privacy-preserving misbehavior detection system that can detect or identify misbehavior without violating the privacy of the vehicle. In the proposed method, encrypted weighted feedbacks sent from vehicles are combined using additive homomorphic properties without violating the privacy of the information. The decryption of the aggregate feedback is done securely at the trusted authority which updates the reputation score of the vehicle according to the decrypted aggregate feedback score. We have also performed comprehensive security analysis and have shown the correctness and resilience of the proposed schemes against various attacks. In addition, we have done extensive performance analysis and have shown that the computation cost of the proposed scheme is better compared to the existing schemes. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) is considered as a promising technology, which can effectively control the phase of signals with low-cost reflective elements. In this paper, we investigate the RIS-assisted D2D communication system under Nakagami- $m$ fading. Overlay mode and underlay mode are discussed respectively. To characterize the performance of proposed communication system, we propose novel closed-form analytical expressions for outage probability under two modes, respectively. Based on the analytical results, we derive the diversity order of outage probability. We show that under overlay D2D mode, the diversity order depends on the number of elements and fading parameters. For the underlay D2D case, 0 diversity order is obtained due to the existence of interference. Furthermore, we study the ergodic achievable rate for each mode and the corresponding tight bounds are derived in closed form. High SNR slopes achieved by users under two modes are also discussed. We observe a high SNR slope of order 1 for overlay D2D mode and 0 for underlay D2D mode. In addition, we also investigate the energy efficiency (EE) of the considered system. Numerical results show that the optimal phase shift proposed in our paper enhance system performance effectively comparing to the traditional D2D communication and random phase shift scheme. Significant EE gains can be obtained for low to middle SNR region by passive reflectors with reconfigurable phase. Unlike relay system, the nearer RIS to the D2D transmitter/receiver, the better performance is obtained. [ABSTRACT FROM AUTHOR]

In this paper, we propose a physical layer secret key (PLSK) generation scheme for secure encrypted transmissions in orbital angular momentum (OAM) communication systems which improves the secret key capacity via taking advantage of OAM orthogonal modes. Based on the line-of-sight (LoS) quasi-static channel conditions in OAM systems, we propose a mode-based active defense phase in the PLSK scheme to invalidate keys generated by an eavesdropper when it is extremely close to the legitimate user. Our simulation results highlight that the key information generated by the eavesdropper is almost zero in the case of highly correlated legitimate and eavesdropping channels under LoS conditions. In addition, our proposed OAM PLSK scheme achieves a higher key generation rate (KGR) than existing works since mode-based active defense can disrupt the process of PLSK by the eavesdropper. [ABSTRACT FROM AUTHOR]

This paper presents the detailed design and the key system performance results of a comprehensive laboratory demonstrator (testbed) for a hybrid satellite/terrestrial S-band mobile digital broadcasting system. The physical layer is based on an enhanced version of the digital video broadcasting—satellite to handheld (DVB-SH) standard, exploiting dual-polarization multiple-input–multiple-output (MIMO) technology. This complete digital MIMO demonstrator, which is the first of its kind, allows for an in-depth verification and optimization of the MIMO techniques applied to satellite broadcasting networks. Moreover, this demonstrator allows for complementing and confirming the theoretical or simulation-based findings published thus far. It is shown that dual-polarization MIMO diversity is able to provide remarkable gains in terms of satellite/terrestrial transmit power reduction and/or capacity increase compared with more conventional non-MIMO solutions. It is also demonstrated that the adoption of a relatively simple spatial multiplexing MIMO technique represents the best way to grasp these gains. This paper provides an extensive set of laboratory measurement results for existing stochastic satellite and hybrid MIMO channels, as well as results based on an S-band satellite-measured dual-polarization time series recently collected during a campaign sponsored by the European Space Agency. Results obtained using MIMO techniques are also compared with a dual- and single-polarization single-input–single-output (SISO) DVB-SH benchmark system and with computer simulation results. [ABSTRACT FROM AUTHOR]

Recently, multiple concurrent transmission techniques have been proposed for smartly exploiting interference to improve network throughput. This paper considers zero-forcing (ZF) precoding that allows two interfering links to concurrently transmit under certain situations. This paper focuses on identifying appropriate schedule schemes that efficiently utilize the ZF precoding opportunities to improve network throughput. With this motivation, we define novel link models to formulate our concerned problem. We also develop a distributed scheduling algorithm by using belief propagation. Finally, we conduct extensive simulation experiments to evaluate the efficiency of ZF in improving network throughput in multihop wireless networks. Our simulations confirm that intelligently utilizing ZF in multihop networks is very effective in improving throughput. [ABSTRACT FROM PUBLISHER]

At present, non-orthogonal multiple access (NOMA) techniques have attracted broad attentions, since they could improve the throughput of cellular networks efficiently. However, the symbol error rate (SER) and bit error rate (BER) have not been studied comprehensively in the NOMA, even they play a key role in communication system control, e.g., power allocation. To address such an issue, this paper studies the SER and BER with consideration of the downlink/uplink transmission, the number of information streams, and the channel coding jointly. For analyzing the impact of channel coding, Gray coding is introduced for the downlink transmission. The derived SER and BER are given by closed-form expressions, by which the transmission performance could be evaluated efficiently. We also show an approximate SER/BER when the transmitter could employ Gray-coding. Additionally, associating with the derived closed-form expressions, we show that there exists no error propagation/error accumulation phenomenon when the successive interference cancellation (SIC) is adopted in signal demodulation, which is treated as a major drawback of SIC demodulation in the NOMA systems. Furthermore, by analyzing the encoding/decoding processes in the current NOMA works, a joint Gray-coding scheme is introduced to reduce the SER and BER in the downlink transmission effectively. Through simulations, we validate the correctness of the derived expressions of SER and BER from different aspects. [ABSTRACT FROM AUTHOR]