Search

Hardware non-idealities are among the main performance restrictions for upcoming wireless communication systems. Asymmetric hardware distortions (HWD) happen when the impairments of the I/Q branches are correlated or imbalanced, which in turn generate improper additive interference at the receiver side. When the interference is improper, as well as in other interference-limited scenarios, improper Gaussian signaling (IGS) has been shown to provide rate and/or power efficiency benefits. In this paper, we investigate the rate benefits of IGS in a two-user interference channel (IC) with additive asymmetric HWD when interference is treated as noise. We propose two iterative algorithms to optimize the parameters of the improper transmit signals. We first rewrite the rate region as an pseudo-signal-to-interference-plus-noise-ratio (PSINR) region and employ majorization minimization and fractional programming to find a suboptimal solution for the achievable user rates. Then, we propose a simplified algorithm based on a separate optimization of the powers and complementary variances of the users, which exhibits lower computational complexity. We show that IGS can improve the performance of the two-user IC with additive HWD. Our proposed algorithms outperform proper Gaussian signaling and competing IGS algorithms in the literature that do not consider asymmetric HWD. [ABSTRACT FROM AUTHOR]

To efficiently trade off system sum rate and link fairness, power allocation in wireless spectrum-sharing networks often concentrates upon proportional fairness. The corresponding problem has been proved to be convex for a single tone but NP-hard for more than two tones. However, in the two-tone case, the complexity of the problem for achieving proportional fairness has not been addressed yet. In this paper, we prove that the issue of proportional-fairness optimization for the two-tone situation is NP-hard by reducing the problem of finding the maximum independent set in an undirected graph to it. Moreover, a computationally efficient algorithm is proposed to provide an efficient suboptimal solution. Simulation results are presented to illustrate the effectiveness of our proposal. [ABSTRACT FROM PUBLISHER]

This paper considers the problem of scheduling real-time traffic in wireless networks. We consider ad hoc wireless networks with general conflict graph-based interference model and single-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline. The number of packet arrivals in each time-slot and the maximum delay before the deadline are independent and identically distributed across time. We require a minimum fraction of packets to be delivered. At each link, we assume the link keeps track of the difference between the minimum number of packets that need to be delivered so far and the number of packets that are actually delivered, which we call the deficit. The largest-deficit-first (LDF) policy schedules links in descending order according to their deficit values, which is a variation of the longest-queue-first (LQF) policy for non-real-time traffic. We prove that the efficiency ratio of LDF, which is the fraction of the throughput region that LDF can achieve for given traffic distributions, can be lower-bounded by a quantity that we call the real-time local-pooling factor (R-LPF). We further prove that a lower bound on the R-LPF can be related to the weighted sum of the service rates, with a special case of 1/(\beta+1) by considering the uniform weight, where \beta is the interference degree of the conflict graph. We also propose a heuristic consensus algorithm that can be used to obtain a good weight vector for such lower bounds for given network topology. [ABSTRACT FROM AUTHOR]

The 802.11ac is a significant landmark in wireless communications, as it pushes towards new rate limits by utilizing downlink multiuser multiple-input multiple-output (MIMO) beamforming to transmit data to various locations simultaneously. However, successful beamforming relies on intelligent user selection which requires, in turn, extensive overhead of channel calibration between the AP and each of the candidate users. The large overhead involved in the user selection procedure overwhelms the multiuser gain and hinders the utilization of multiuser MIMO. The phenomenon is even more acute when APs handle large groups of mobile users, which frequently associate and disconnect, making the process of acquiring channel state from all users and selecting the appropriate group even harder. Thus, the subtle relation between the achievable rate of a scheduling algorithm and the overhead it requires is significant for the 802.11ac performance analysis. In this paper, we provide a rigorous analysis of distributed algorithms that schedule a group of users for the downlink. In particular, we accommodate common scheduling methods for the 802.11ac protocol and analyze both their achievable rate and their calibration process overhead. Both analysis and extensive simulations depict the superiority of simple threshold-based methods in terms of the throughput. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of distributed channel selection for interference mitigation in a canonical communication network. The channel is assumed time-varying, and the active user set is considered dynamically variable due to the specific service requirement. This problem is formulated as an exact potential game, and the optimality property of the solution to this problem is first analyzed. Then, we design a low-complexity fully distributed no-regret learning algorithm for channel adaptation in a dynamic environment, where each active player can independently and automatically update its action with no information exchange. The proposed algorithm is proven to converge to a set of correlated equilibria with a probability of 1. Finally, we conduct simulations to demonstrate that the proposed algorithm achieves near-optimal performance for interference mitigation in dynamic environments. [ABSTRACT FROM AUTHOR]

This paper considers a method for improving physical layer security of wireless networks with full-duplex radio. In particular, fast algorithms are developed to compute power allocations in subcarriers, subject to power and rate constraints, to maximize the secrecy capacity of a three-node network consisting of a source, a full-duplex destination, and an eavesdropper. A residual level of radio self-interference channel is considered. The optimal power allocation at the destination is found to be significant especially when its power budget is high. Also studied in this paper are a network with multiple full-duplex destinations and another network with multiple sources. Using the algorithms developed in this paper, we are able to show that a multiuser strategy that optimizes the power distributions among the users (in terms of either the sources or the destinations) can yield a substantial gain of secrecy capacity over a single-user strategy. [ABSTRACT FROM PUBLISHER]

This paper uses a spatial Aloha model to describe a distributed autonomous wireless network in which a group of transmit–receive pairs (users) shares a common collision channel via slotted-Aloha-like random access. The objective of this study is to develop an intelligent algorithm to be embedded into the transceivers so that all users know how to self-tune their medium access probability (MAP) to achieve overall Pareto optimality in terms of network throughput under spatial reuse while maintaining network stability. While the optimal solution requires each user to have complete information about the network, our proposed algorithm only requires users to have local information. The fundamental of our algorithm is that the users will first self-organize into a number of nonoverlapping neighborhoods, and the user with the maximum node degree in each neighborhood is elected as the local leader (LL). Each LL then adjusts its MAP according to a parameter R, which indicates the radio intensity level in its neighboring region, whereas the remaining users in the neighborhood simply follow the same MAP value. We show that by ensuring R \le \text{2} at the LLs, the stability of the entire network can be assured, even when each user only has partial network information. For practical implementation, we propose each LL to use R=\text{2}$ as the constant reference signal to its built-in proportional and integral controller. The settings of the control parameters are discussed, and we validate through simulations that the proposed method is able to achieve close-to-Pareto-front throughput. [ABSTRACT FROM PUBLISHER]

Over-provisioned femtocell networks can be used to serve indoor locations that see high peak loads, such as airports or train stations. However, networks designed for high peak loads are mostly under-utilized, which is wasteful from an energy-use perspective. This paper introduces a femtocell selective activation problem. We motivate the use of selective activation in femtocell networks using real femtocell power measurements. We formally define the selective activation problem, and introduce GreenFemto, a distributed femtocell selective activation algorithm. We prove that GreenFemto converges to a locally Pareto optimal solution. Detailed simulations of an LTE wireless system are used to demonstrate the performance of GreenFemto. We find that GreenFemto uses up to 55% fewer femtocells to serve a given load, relative to an existing femtocell power-saving technique. Furthermore, we show that GreenFemto comes within 15% of a globally optimal solution. We conclude that selective activation can be successfully applied to femtocell networks to both reduce power consumption, and reduce outage probabilities. [ABSTRACT FROM PUBLISHER]

Sparse code multiple access (SCMA) is one type of non-orthogonal multiple access techniques for the fifth-generation wireless communication networks. Existing multiuser detection algorithms for SCMA uplink systems are based on the assumption that signals are in synchronization. However, asynchrony cannot be neglected due to the propagation delays in practical environments. In this paper, we present three detection algorithms for uplink asynchronous SCMA systems, namely belief propagation message passing algorithm, belief propagation with equal gain combining message passing algorithm, and partial phase-coherent algorithms. Simulation results show that our proposed asynchronous detection algorithms are able to offer descent bit error rate performances, with only a small performances loss compared to the synchronous case. Moreover, our proposed algorithms converge well in the uplink asynchronous SCMA systems. [ABSTRACT FROM AUTHOR]

By blending the concepts of non-orthogonal multiple access (NOMA) and orthogonal frequency division multiplexing, in this paper, a novel hybrid scheme is conceived for supporting diverse services in future wireless systems. Motivating to maximize energy efficiency (EE), the joint resource management of user clustering (UC) and power allocation is investigated for the downlink hybrid NOMA systems. Under two different power consumption cases, the optimal resource allocation (Opt-RA) algorithm is developed with the help of converting the original mixed integer non-linear programming (MINLP) problem to the tractable decoupled problems. For practical implementation, the heuristic resource allocation (Heur-RA) algorithm is also proposed, and it includes a low-complexity UC algorithm based on the candidate search-and-allocation approach. Our simulation results show that, both the Opt-RA and Heur-RA algorithms achieve significantly higher EE performance than other existing algorithms. Further, the results also prove that, the hybrid NOMA conceived is able to exploit the advantages of NOMA scheme, and is superior to conventional orthogonal multiple access (OMA) in terms of EE, as well as achieving higher flexibility for system configuration than NOMA. [ABSTRACT FROM AUTHOR]

Recent advances in loop interference cancelation techniques enable full-duplex relaying (FDR) systems, which transmit and receive simultaneously in the same band with high spectrum efficiency. Meanwhile, wireless virtualization has attracted a lot of attention from both academia and industry because it can provide more flexibility, diversity, and other benefits in the process of wireless network design, construction, operation, and management. In this paper, we introduce the idea of wireless virtualization into FDR cellular networks. Then, the problem of energy-aware virtual resource management is formulated as a three-stage Stackelberg game. The subgame perfect equilibrium for each stage is analyzed. In addition, the interplays of the three-stage game are discussed, and an iterative algorithm is proposed to obtain the Stackelberg equilibrium solution. Simulation results are presented to show the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]

Deep neural networks (DNNs) have been widely applied for classification tasks in wireless communications such as link scheduling, user association and base station (BS) muting. When training a DNN using datasets with highly-skewed class distribution where most data belong to a few majority classes, learning performance for minority classes will degrade since the imbalanced data forces the training process to be biased towards the majority classes. In many wireless problems, multiple decisions for classification are made jointly, say deciding which BSs in a network should be muted to avoid interference. In this paper, we employ DNN to learn an optimal predictive interference coordination policy, and strive to avoid biased learning in such a multi-label multi-class classification problem. The major contribution is proposing a training method to encourage fairness among classes by minimizing the maximal cost of decisions among classes, which is converted into a problem to optimize the weighting factors on the training cost of each class. We provide a gradient descent algorithm to optimize the weighting factors and the model parameters of the DNN by alternative updates. Simulation results show that the training method can improve the learning performance for the minority class and can achieve higher network utility than existing training methods. [ABSTRACT FROM AUTHOR]

We consider the uplink transmission in multiuser wireless systems with multiple single-antenna transmitting users and a multiantenna receiver. We address two problems in this paper. The first problem is user admission, i.e., given a large number of users, how to admit the maximum number of users that can simultaneously satisfy quality of service (QoS) and power constraints. The second problem is how to distribute the data among the users when they are allowed to share data before transmission. The aim is to minimize the total data exchange cost. Such a problem is called user clustering. We formulate those problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose a common framework to tackle those problems by first applying the \ell1 -norm relaxation and then solving them with convex optimization methods. Simulations show that the proposed algorithms achieve excellent performance. For user admission, the numbers of admitted users by the proposed algorithms are close to the optimum numbers of admitted users obtained by exhaustive search (ES) . For user clustering, the total data exchange cost is reduced by more than 10% after only a few iterations. When the QoS requirement is low, the user data exchange can be avoided using the proposed method, which achieves the optimum result obtained by ES. [ABSTRACT FROM PUBLISHER]

As an important complement and enhancement technique for cellular communication systems, the device-to-device (D2D) technique has exhibited a number of benefits in terms of, for instance, offering an improved spectral efficiency, enabling a reduced transmit power and providing an enhanced channel capacity, etc. However, a severe interference may be imposed on the conventional cellular users by the activated D2D links, thus, substantially eroding the performance of the former. In this paper, we propose an interference limited area (ILA) based D2D-management scheme along with an appropriately designed power control algorithm for mitigating the above-mentioned interference. We first derive the closed-form expressions of the average coverage probability for both the cellular and D2D links under the proposed ILA scheme, followed by proposing a resource-allocation algorithm subject to a power control mechanism. Numerical results show that the proposed ILA scheme is capable of outperforming the conventional scheme in terms of both the coverage probability (i.e., for both cellular and D2D links) and the sum data rate, particularly in the scenarios with a high D2D density and a high signal-to-interference-plus-noise ratio. [ABSTRACT FROM AUTHOR]

To achieve spectral-efficient massive access in future wireless networks, this paper proposes a comprehensive fully non-orthogonal communication framework. First, we design a fully non-orthogonal communication scheme which consists of non-orthogonal channel estimation and non-orthogonal multiple access. Then, we analyze the performance of the proposed fully non-orthogonal communication, and derive a tight lower bound on the spectral efficiency in terms of key system parameters and channel conditions. Meanwhile, several novel insights are provided on spectral efficiency via asymptotic analysis in three important cases, i.e., a large number of base station (BS) antennas, a high BS transmit power, and perfect channel state information (CSI) at the BS. Finally, we optimize the performance of the proposed fully non-orthogonal communication and present two simple but efficient optimization algorithms for maximizing the weighted sum of spectral efficiency. Extensive simulation results validate the effectiveness of the proposed schemes. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the multiple input multiple output (MIMO)-non-orthogonal multiple access (NOMA) transmission with the aid of location information. We first consider two users separated in both the distance and angle domains. With different access distances, NOMA could be used to serve the near-user and the far-user simultaneously, whereas spatial division multiple access (SDMA) would be applied if the two users have largely-separated angles of departure (AOD) that guarantees spatial orthogonality. Comparing the ergodic sum rates of these two multiple access (MA) schemes, we first characterize the preferable MA regions in the angle-distance plane. Analytical expression of the region boundary between NOMA and SDMA is derived. Moreover, NOMA-preferable regions are expressed in terms of the maximum distance difference and the minimum angle difference between the two users, respectively. On basis of these results, we further propose a location-based low-complexity user pairing algorithm for the general multiuser scenario. Numerical results confirm the accuracy of the derived region boundaries, and the simulations show that the proposed user pairing algorithm can effectively improve the resource utilization rate, compared to the conventional MA and user pairing schemes. [ABSTRACT FROM AUTHOR]

We present in this paper a novel proactive interference avoidance scheme for mobile-to-mobile (M2M) communication as an underlay in Long-Term Evolution (LTE) downlink networks. The proposed scheme introduces an intelligent user-selective resource allocation algorithm that aims to proactively avoid interference between M2M pairs and LTE regular users while achieving a satisfactory link budget for both M2M and LTE regular links. The proposed resource allocation algorithm is based on a novel low-complexity interference estimation approach that requires only channel quality indicator (CQI) information (CSI). Since the CQI reporting mechanism has been already implemented in current LTE systems, the proposed algorithm is indeed practical and standard compatible, compared with the existing works that require perfect knowledge of the channel state information (CSI). In this research, achievable data throughput with LTE-compliant adaptive modulation and coding has been adopted as the optimization measurement, rather than the information-theoretic capacity. Therefore, the performance of the proposed scheme is practically realizable in LTE communication systems. Since the performance of the proposed scheme highly relies on the accuracy of CQI feedback, we also carry out performance analysis to evaluate the impact of CQI estimation error and delay. The simulation results show that the total achievable data throughput for LTE networks is dramatically enhanced by M2M communication with this proposed interference avoidance resource allocation scheme. [ABSTRACT FROM PUBLISHER]

In heterogeneous networks (HetNets), the load between macrocell base stations (MBSs) and small-cell base stations (SBSs) is imbalanced due to their different transmission powers and locations. This load imbalance significantly impacts system performance and affects the experience of mobile users (MUs) with different priorities. In this paper, we aim to distributively optimize the user association in HetNets with various user priorities to solve the load balancing problem. Since the user association is a binary matching problem, which is NP-hard, we propose a distributed belief propagation (BP) algorithm to approach the optimal solution. We first develop a factor graph model, using the network topology, to represent this user association problem. With this factor graph, we propose a novel distributed BP algorithm by adopting the proportional fairness as the objective. Next, we theoretically prove the existence of the fixed point in our BP algorithm. To be more practical, we develop an approximation method to significantly reduce the computational and communication complexity of the BP algorithm. Furthermore, we analyze some properties of the factor graph relevant to the performance of the BP algorithm using the stochastic geometry. Simulation results show that 1) the proposed BP algorithm well approaches the optimal system performance and achieves a much better performance compared with other association schemes and that 2) the analytical results on the average degree distribution and sparsity of the factor graph match with those obtained from the Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

The increasing densification of telecommunications mobile networks raises the compelling problem of exposure to electromagnetic fields (EMF). In this paper, we address the particular concept of heterogeneous networks, where small cells (SCs) are deployed to build up a second layer to the existing macrocell network. SC deployment is shown to be particularly effective in reducing EMF exposure, in addition to capacity enhancement. Previous studies on EMF have focused on the uplink (UL) and downlink (DL) components separately, although they are strongly correlated. Relying on the definition of the exposure index (EI) from the European FP7 Lexnet project, we evaluate the impact on EMF exposure due to SC deployment. Guidelines for EMF-efficient deployment of SCs are first presented and evaluated. Then, a new enhanced intercell interference coordination (eICIC) algorithm using UL and DL metrics to optimize capacity and exposure to EMF is proposed. Static and self-optimizing dynamic implementations of the solution are considered, using a utility function related to the sojourn time of the users. Time-domain and frequency-domain self-optimized eICIC are compared in terms of EMF exposure reduction and capacity enhancement. The eICIC algorithms are combined with a self-optimized coverage range expansion function leading to further reduction of the EI. The proposed solution for optimizing both capacity and exposure to EMF is compared with a capacity-driven solution based on the DL metrics only. Simulation results illustrate the performance gains obtained for the different SC deployment scenarios. [ABSTRACT FROM PUBLISHER]

In this paper, we study the energy-efficient resource allocation problem for device-to-device (D2D) communication underlaying cellular networks, which aims to maximize the minimum weighted energy efficiency of D2D links while guaranteeing minimum data rates for cellular links. We first characterize the optimal power allocation of the cellular links to transform the original resource allocation problem into the joint subchannel and power allocation problem for D2D links. We then propose three resource allocation algorithms with different complexity levels, namely, dual-based, branch-and-bound (BnB), and relaxation-based rounding (RBR) algorithms. While the dual-based algorithm solves the problem by using the dual decomposition method, the BnB and RBR algorithms tackle the problem by employing the relaxation approach. We establish the strong performance guarantees for the proposed algorithms through theoretical analysis. Extensive numerical studies demonstrate that the proposed algorithms achieve superior performance and significantly outperform a conventional algorithm. [ABSTRACT FROM PUBLISHER]

In wireless network resource allocation, the radio power control problems are often solved by fixed point algorithms. Although these algorithms give feasible problem solutions, such solutions often lack notion of problem optimality. This paper reconsiders well-known fixed-point algorithms, such as those with standard and type-II standard interference functions, and investigates the conditions under which they give optimal solutions. The optimality is established by the recently proposed fast-Lipschitz optimization framework. To apply such a framework, the analysis is performed by a logarithmic transformation of variables that gives tractable fast-Lipschitz problems. It is shown how the logarithmic problem constraints are contractive by the standard or type-II standard assumptions on the power control problem, and how sets of cost functions fulfill the fast-Lipschitz qualifying conditions. The analysis on nonmonotonic interference function allows establishing a new qualifying condition for fast-Lipschitz optimization. The results are illustrated by considering power control problems with standard interference function, problems with type-II standard interference functions, and a case of subhomogeneous power control problems. Given the generality of fast-Lipschitz optimization compared to traditional methods for resource allocation, it is concluded that such an optimization may help to determine the optimality of many resource allocation problems in wireless networks. [ABSTRACT FROM AUTHOR]

A novel probabilistic radio resource allocation algorithm is proposed for code-division multiple-access cognitive radio networks. Our method incorporates a sensing-based hybrid access- and interference-limited spectrum sharing strategy to maximize the achievable spectral efficiency of cognitive users (CUs) while guaranteeing the quality-of-service (QoS) requirements of licensed services. Specifically, the enhanced performance for CUs is achieved through optimal joint power and rate adaptation to the time-varying multiuser interference and frequency-selective fading channel conditions. We show that this scheme can improve the average spectral efficiency of CUs, while satisfying the peak and average received-interference constraints at the primary receiver. [ABSTRACT FROM PUBLISHER]

In an interference limited network, joint power and admission control (JPAC) aims at supporting a maximum number of links at their specified signal-to-interference-plus-noise ratio (SINR) targets while using minimum total transmission power. Various convex approximation deflation approaches have been developed for the JPAC problem. In this paper, we propose an effective polynomial time non-convex approximation deflation approach for solving the problem. The approach is based on the non-convex \ell q~(0< q< 1) approximation of an equivalent sparse \ell 0 reformulation of the JPAC problem. We show that, for any instance of the JPAC problem, there exists a \bar q\in (0,1) such that it can be exactly solved by solving its \ell q approximation problem with any q\in (0, \bar q]. We also show that finding the global solution of the \ell q approximation problem is NP-hard. Then, we propose a potential reduction interior-point algorithm, which can return an \epsilon -KKT solution of the NP-hard \ell q approximation problem in polynomial time. The returned solution can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure, resulting in the polynomial time non-convex approximation deflation approach for the JPAC problem. Numerical simulations show that the proposed approach outperforms the existing convex approximation approaches in terms of the number of supported links and the total transmission power, particularly exhibiting a quite good performance in selecting which subset of links to support. [ABSTRACT FROM PUBLISHER]

In this paper, we consider the problem of power control for sum-rate maximization on multiple interfering links [transmitter–receiver pairs (Tx–RX)] under a sum power constraint. We consider a single-frequency network, where all pairs are operating in the same frequency band, thereby creating interference with each other. We study the power-allocation problem for sum-rate maximization with and without quality-of-service (QoS) requirements on individual links. When the objective is only sum-rate maximization without QoS guarantees, we develop an analytic solution to decide optimal power allocation for a two-TX–RX-pair problem. We also develop a low-complexity iterative algorithm for a three-TX–RX-pair problem. For a generic N>\3 TX–RX pair problem, we develop two low-complexity suboptimal power-allocation algorithms. The first algorithm is based on the idea of making clusters of two or three TX–RX pairs and then leveraging the power-allocation results obtained for the two- and three-TX–RX-pair problems. The second algorithm is developed by using a high signal-to-interference-plus-noise ratio (SINR) approximation, and this algorithm can be also implemented in a distributed manner by individual TXs. We then consider the same problem but with additional QoS guarantees for individual links. We again develop an analytic solution for the two-TX–RX-pair problem and a distributed algorithm for N>\2 TX–RX pairs. [ABSTRACT FROM PUBLISHER]

Ultradense heterogeneous networks (HetNets) are emerging as an inevitable approach to tackle the capacity crunch in cellular networks. However, imbalanced load among small and macrocells and poor resource utilization as a consequence in HetNets remains a long-standing problem. This paper addresses this problem by presenting a solution for maximization of coverage and capacity while minimizing load imbalance among macro and small cells. Most recent studies on the topic focus on either optimization of coverage, capacity or load, or a combination of two of these three intertwined objectives. We formulate the optimization problem as a function of two hard parameters namely antenna tilt and transmit power, and a soft parameter, cell individual offset, that affect the coverage, capacity, and load directly. The resulting solution is a combination of the otherwise conflicting coverage and capacity optimization (CCO) and load balancing (LB) self-organizing network (SON) functions. In the presented joint CCO-LB solution, a conflict free operation of CCO and LB is ensured by designing a novel load aware user association methodology and resolving the effects of shadowing on coverage probability using stochastic approximation. The problem is proven to be nonconvex and is solved using genetic algorithm, sequential quadratic programming, and pattern search algorithms. The proposed CCO-LB solution is compared against two recently proposed CCO and CCO-LB solutions in the literature. Results show that the proposed solution can yield significant gain in terms of throughput, spectral efficiency, and load distribution. [ABSTRACT FROM AUTHOR]

This paper considers a heavy loaded full-duplex (FD) small cell consisting of one FD base station and multiple half-duplex users where the number of subchannels is less than the number of uplink and downlink users. With the objective of maximizing the total sum-rate, a joint power allocation, and user pairing problem is formulated. To solve this problem, a novel decomposition method is proposed, which decouples the power allocation and user pairing problem into two subproblems. It is proven that the optimal solution of subproblems is the optimal solution of the original problem. Then, optimal algorithms are developed for the two subproblems. Numerical results show that the proposed algorithm achieves better performance compared with the baselines of the greedy algorithm and random pairing algorithm. [ABSTRACT FROM AUTHOR]

Traffic offloading via device-to-device communications is expected to play a major role to meet the exponential data traffic growth in wireless networks. In this paper, we focus on the problem of user capacity maximization in ultra-dense heterogeneous networks with device-to-device cooperation, where a large number of users in a given geographical area request common data content, such as video on demand streaming, with strict quality of service guarantees. We aim at finding the best strategy for delivering the content either over long range connectivity from the access points or short range connectivity from peer mobile terminals while meeting a target rate per served user. We formulate the multiuser resource management problem as an optimization problem including traffic offloading and channel allocation considering a very high user density reaching up to 1.75 users per square meter. We extend the system model to include mobile terminals acting as content owners by having the content cached locally, in order to further enhance the network capacity and coverage. We then propose an iterative resource management solution, which first solves the optimization subproblem of traffic offloading with orthogonal channels, and then optimally allocates channels to the transmitters with minimized interference due to channel reuse. We also propose efficient suboptimal hierarchical tree-based algorithms that operate in real time with dynamic and fast solutions for ultra-dense networks. For performance evaluation, we consider a realistic scenario consisting of a stadium topology with thousands of mobile terminals active simultaneously. We generate results as a function of a wide range of system parameters, and demonstrate that the proposed algorithms achieve near-optimal performance with notably low time complexity. [ABSTRACT FROM AUTHOR]

Cognitive small-cell networks have great potential in improving spectrum efficiency and mitigating inter-cell interference. Comprehensively classifying the channel states in cognitive small-cell networks is important for efficiently reusing the spectrum bands that are licensed to a macrocell. In this paper, we investigate channel state classification in cognitive small-cell networks with multilevels of transmission powers, including occupation detection of spectrum bands and transmission power classification of a macrocell base station (MBS). Specifically, two scenarios including a priori known signaling features and unknown signaling features are both studied. For the former scenario, we propose an optimal spectrum sensing and power classification algorithm, based on coherent classification, to achieve accurate sensing performance by fully exploiting the inherent information of the signaling features. Optimal sensing threshold and decision regions are derived for detecting and classifying the transmission power of the MBS. For the scenario without signaling features, a generic spectrum sensing and power classification algorithm is proposed based on noncoherent classification with low implementation complexity. A new performance metric, i.e., classification probability, is introduced to comprehensively evaluate the classification capability of the proposed algorithms. Finally, extensive simulations are provided to verify the proposed algorithms. [ABSTRACT FROM AUTHOR]

Multiple linear constraint water filling problem (MLWFP) is solved innovatively in this paper, in which powers allotted to the $T$ resources of the transmitting user maximize the capacity of the transmitting user while controlling the interference to all the surrounded users of the wireless network. MLWFP is solved previously using iterative algorithms that take more number of iterations, thus, increasing the computational complexity. Unlike prior algorithms, the uniqueness of the proposed algorithm is in detecting the tight bounds for the number of nonzero powers $S$. Subsequently, $S$ is calculated from its bounds. This makes it possible for the proposed algorithm to compute $S$ nonzero powers alone (using the closed-form solution), whereas all the prior algorithms find powers iteratively for all $T$ ( $>$ $S$ ) resources. Thus, the worst case computational complexity of the proposed algorithm is reduced manyfold and is considerably lower than that of the prior algorithms by a factor of $O(T^2)$. Simulation results justify the analysis of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Spanner construction is one of the most important techniques for topology control in wireless networks. A spanner can help not only to decrease the number of links and to maintain connectivity but also to ensure that the distance between any pair of communication nodes is within some constant factor from the shortest possible distance. Due to the non-locality, constructing a spanner is especially challenging under the physical interference model signal-to-interference-and-noise-ratio (SINR). In this paper, we develop two localized randomized algorithms SINR-directed-YG and SINR-undirected-YG to construct a directed Yao graph (YG) and an undirected YG in O(\log n) ( n is the number of wireless nodes) time slots with a high probability, in which each node is capable of performing successful local broadcasts to gather neighborhood information within a certain region and the SINR constraint is satisfied at all the steps of the algorithms. The resultant graph of SINR-undirected-YG, which is based on SINR-directed-YG, possesses a constant stretch factor \frac 11-2\sin (\pi/c) , where c>6 is a constant. To the best of our knowledge, SINR-undirected-YG is the first spanner construction algorithm under SINR. We also obtain Yao-Yao graph under SINR. Extensive theoretical performance analysis and simulation study are carried out to verify the effectiveness and the efficiency of our proposed algorithms. [ABSTRACT FROM AUTHOR]

The 5G wireless communication system supports varied applications, making the uplink/downlink traffic asymmetry more and more serious. Dynamic time division duplex (TDD) technique has become a key technology of 5G networks due to its flexibility to support asymmetric services. In this paper, we study dynamic TDD sub-frame reconfiguration algorithm based on shifting. Firstly, we define cell shifting priority considering both traffic and interference. Then, we perform cell shifting-based TDD sub-frame reconfiguration following cell shifting priority. Simulation results show that the proposed dynamic TDD algorithm can guarantee high data rate and low interference, thus effectively increases the network throughput. [ABSTRACT FROM AUTHOR]

A number of inherently unipolar orthogonal frequency division multiplexing (OFDM) modulation schemes have been introduced recently in an attempt to improve the energy efficiency of OFDM-based intensity modulation and direct detection (IM/DD) systems. All such algorithms, including asymmetrically clipped optical OFDM (ACO-OFDM), pulse-amplitude-modulated discrete multitone modulation (PAM-DMT) and unipolar orthogonal frequency division multiplexing (U-OFDM), experience an inherent loss in spectral efficiency caused by the restrictions imposed on the OFDM frame structure required for the generation of a unipolar signal. The current paper presents a modified modulation approach, termed enhanced U-OFDM (eU-OFDM), which compensates the spectral efficiency loss in U-OFDM. At the same time, it still allows for the generation of an inherently unipolar modulation signal that achieves better performance in terms of both electrical power and optical power dissipation compared to the conventional state-of-the-art technique direct current (DC)-biased optical OFDM (DCO-OFDM). To the best of the authors' knowledge, the current work also presents the first experimental proof-of-concept demonstration of both U-OFDM and eU-OFDM, and clearly demonstrates the significant energy advantages that these two schemes can introduce in an optical wireless communications (OWC) system. [ABSTRACT FROM PUBLISHER]

Radar signal design in a spectrally crowded environment is currently a challenge due to the increasing requests for spectrum from both military sensing applications and civilian wireless services. The goal of this paper is to improve a previously devised algorithm for the synthesis of optimized radar waveforms fulfilling spectral compatibility with overlaid licensed radiators. The new technique achieves an enhanced spectral coexistence with the surrounding electromagnetic environment through a suitable modulation of the transmitted waveform energy, which was kept fixed at the maximum level in the previously devised algorithm. At the analysis stage, the waveform performance is studied in terms of trade-off among the achievable Signal to Interference Plus Noise Ratio (SINR), spectral shape, and the resulting Autocorrelation Function (ACF), also in situations where the previous technique cannot be applied. [ABSTRACT FROM AUTHOR]

This work investigates the design of linear precoders in cooperative multi-cell MIMO downlink coverage for finite-alphabet source signals. Traditional design of multi-cell MIMO downlink precoder relies on Gaussian input assumption, which may lead to performance loss when true data inputs consist of discrete non-Gaussian symbols. This work presents optimized precoders for finite-alphabet input by maximizing the sum rate under per-base station power constraints. Specifically, we propose two distributed algorithms: a finite-alphabet signal Gaussian interference gradient projection algorithm and a block diagonalization alternating optimization algorithm while supporting interference cancellation. Our numerical results demonstrate considerable performance gain in terms of approximate transmission data rate as well as decoded bit error rate over precoding schemes designed by using the non-realistic Gaussian input assumption. [ABSTRACT FROM PUBLISHER]

Cognitive radio (CR) is currently one of the most promising solutions for designing spectrum-efficient wireless communication systems. In this paper, we present a greedy cognitive access policy that handles spectrum sensing with the tools of image processing. By means of the Wigner–Ville transform (WVT), we are able to analyze the time and frequency features of the received interference, and represent them on a time–frequency grid as an image in which brightness reveals the spectrum occupancy. According to sensed interference, each secondary user autonomously tries to access the grid following a multiple-division principle, i.e., by properly shaping the signal in the code, time, and frequency domains. In detail, this is realized by processing the WVT to derive the shaping mask (and the matching algorithm) that allows the filling up of the “time spectrum holes.” Numerical simulations and a test-bed implementation show how the proposed scheme outperforms selected state-of-the-art approaches while still presenting an affordable computational cost. [ABSTRACT FROM AUTHOR]

We propose a marginal-power-efficiency-based adaptation (MPEA) scheme for distributed power control in wireless communication systems. Nodes autonomously adapt their transmit power by keeping a differential measure of power efficiency, which is defined as the additional capacity obtained per unit of transmit power, at a desirable threshold. We combine the MPEA with the Foschini–Miljanic (FM) algorithm into a power control algorithm for a multihop cellular network where nodes can dynamically adapt to both local and global conditions. We derive a fixed point to which the power allocations converge under the scheme and illustrate a significant improvement in the system throughput. [ABSTRACT FROM AUTHOR]

In emergency communications, guaranteeing ultrareliable and low-latency communication is challenging yet crucial to save human lives and to coordinate the operations of first responders. To address this problem, we introduce a general approach for channel selection in mission-critical communications, i.e., choose channels with the best quality timely and accurately via channel probing. Since the channel conditions are dynamic and initially unknown to wireless users, choosing channels with the best conditions is nontrivial. Thus, we adopt online learning methods to let users probe channels and predict the channel conditions by a restricted time interval of observation. We formulate this problem as an emerging branch of the classic multiarmed bandit (MAB) problem, namely thepure-exploration banditproblem, to achieve a tradeoff between sampling time/resource budget and the channel selection accuracy (i.e., the probability of selecting optimal channels). The goal of the learning process is to choose the “optimal subset” of channels after a limited time period of channel probing. We propose and evaluate one learning policy for the single-user case and three learning policies for the distributed multiuser cases. We take communication costs and interference costs into account, and analyze the tradeoff between these costs and the accuracy of channel selection. Extensive simulations are conducted and the results show that the proposed algorithms can achieve considerably higher channel selection accuracy than previous exploration bandit approaches and classic MAB methods. [ABSTRACT FROM AUTHOR]

Bluetooth Low Energy (BLE) is a popular wireless communication protocol heavily used in Internet of Things applications. Nowadays, robustness is considered a key requirement in wireless communication. However, radio interference from various sources may affect the performance of BLE devices, leading to channel congestion. Therefore, there is a broadly recognized need of methodologies capable of sensing and avoiding interference. In this paper, two improvements at the data link layer for interference detection and channel selection are proposed to enhance the BLE connection robustness. This paper also presents a wide range of experimental evaluations aiming at validating the improvements and providing insights on both these improvements. Particularly, the communication performance of the BLE link layer is assessed in terms of channel usage distribution, supervision timeout ratio (STR) and packet loss rate (PLR) under different interference environments. Results from these experiments (reliability over 97% and 99% under two different harsh environments) highlight the effects of both improvements on the BLE robustness. Meanwhile, the authority of scheduling the whole mechanism is given to the link layer and even the higher application layer. This paper provides a set of solutions for BLE confronting interference in link layer. [ABSTRACT FROM AUTHOR]

We address the problem of distributed power control in a two-tier cellular network, where full-duplex small cells underlay a macro cell in a co-channel deployment scenario. We first formulate the distributed power control problem as a non-cooperative game and then extend it to a repeated game with imperfect public monitoring. The repeated game formulation prevents deceitful small cells from deviating from the social optimal solution for their own benefit. We establish the existence and uniqueness of the Nash equilibrium in the formulated non-cooperative game. We also characterize the set of public perfect equilibrium for the repeated game. A two-phase distributed algorithm is proposed to achieve and enforce a Pareto optimal transmit power profile. The solution obtained by this algorithm is also social optimal. Phase 1 of the algorithm is a fully distributed learning phase based on perturbed Markov chains, where each base station individually learns a Pareto optimal operating point. Phase 2 is composed of two rules: 1) a detection rule based on Page-Hinckley test to detect cheating and 2) a punishment rule to motivate cheating base stations to cooperate. Through theoretical analysis, we prove that the proposed distributed power control mechanism achieves a public perfect equilibrium point of the formulated repeated game. The power control algorithm is also cheat-proof and needs only a small amount of information exchange among network nodes. The effectiveness of the algorithm is shown through numerical analysis. Our proposed model, algorithm, and analysis are also valid for a half-duplex system as a special case. [ABSTRACT FROM AUTHOR]

We consider a heterogeneous cellular network with densely underlaid small cell access points (SAPs). Wireless backhaul provides the data connection from the core network to SAPs. To serve as many SAPs and their corresponding users as possible with guaranteed data rates, admission control of SAPs needs to be performed in wireless backhaul. Such a problem involves joint design of transmit beamformers, power control, and selection of SAPs. In order to tackle such a difficult problem, we apply $\ell_1$-relaxation and propose an iterative algorithm for the $\ell_1$-relaxed problem. The selection of SAPs is made based on the outputs of the iterative algorithm, and we prove such an algorithm converges locally. Furthermore, this algorithm is fast and enjoys low complexity for small-to-medium sized systems. However, its solution depends on the actual channel state information, and resuming the algorithm for each new channel realization may be unrealistic for large systems. Therefore, we make use of the random matrix theory and also propose an iterative algorithm for large systems. Such a large-system iterative algorithm can produce the asymptotically optimum solution for the $\ell_1$-relaxed problem, which only requires large-scale channel coefficients irrespective of the actual channel realization. Near optimum results are achieved by our proposed algorithms in simulations. [ABSTRACT FROM PUBLISHER]

We consider a small cell network (SCN) consisting of $N$ cells, with the small cell base stations (SCBSs) equipped with $N_t \geq 1$ antennas each, serving $K$ single antenna user terminals (UTs) per cell. Under this set up, we address the following question: given certain time average quality of service (QoS) targets for the UTs, what is the minimum transmit power expenditure with which they can be met? Our motivation to consider time average QoS constraint comes from the fact that modern wireless applications such as file sharing, multi-media etc. allow some flexibility in terms of their delay tolerance. Time average QoS constraints can lead to greater transmit power savings as compared to instantaneous QoS constraints since it provides the flexibility to dynamically allocate resources over the fading channel states. We formulate the problem as a stochastic optimization problem whose solution is the design of the downlink beamforming vectors during each time slot. We solve this problem using the approach of Lyapunov optimization and characterize the performance of the proposed algorithm. With this algorithm as the reference, we present two main contributions that incorporate practical design considerations in SCNs. First, we analyze the impact of delays incurred in information exchange between the SCBSs. Second, we impose channel state information (CSI) feedback constraints, and formulate a joint CSI feedback and beamforming strategy. In both cases, we provide performance bounds of the algorithm in terms of satisfying the QoS constraints and the time average power expenditure. Our simulation results show that solving the problem with time average QoS constraints provide greater savings in the transmit power as compared to the instantaneous QoS constraints. [ABSTRACT FROM PUBLISHER]

Wireless communication in vehicular networks is highly vulnerable to electromagnetic interference, which seriously undermines the communication effectiveness. Thus, interference estimation and elimination are essential in vehicular communications. To solve the multitasking problem of interference estimation and cancelation within the transformation domain of vehicular communications where they are divided into the consistency and inconsistency based on the different conditions of spectrum sensing, the present study proposes an iterative Bayesian sparse learning approach for simultaneous interference recovery and elimination which applies multiple Bayesian learning for measured signals, and the structured sparse learning method for simultaneous interference mitigation with signal recovery. Furthermore, the updating optimization based on Bayesian estimation framework is performed to facilitate the learning process and improve the performance of interference estimation and signal reconstruction. Simulation results show that the proposed algorithms achieved more rapid convergence and more accurate recovery (31.84% and 27.88% higher in spectrum sensing with consistency and inconsistency, respectively) than conventional algorithms. During all iterations, the proposed algorithms, because of updating optimization, were more robust than conventional ones, but the computational complexity remained largely the same. To explore the correlation between the parameters and the interference recovery performance, we performed experiments, which revealed linear, logarithmic, and exponential regression correlations for particular forms of interference. We also compared the demodulation performance of the proposed algorithm with existing methods, and it turned out the proposed algorithm also obtained higher gains on average in the bit error rate. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) enhanced multi-unmanned aerial vehicle (UAV) non-orthogonal multiple access (NOMA) networks are investigated. A new transmission framework is proposed, where multiple UAV-mounted base stations employ NOMA to serve multiple groups of ground users with the aid of an IRS. The three-dimensional (3D) placement and transmit power of UAVs, the reflection matrix of the IRS, and the NOMA decoding orders among users are jointly optimized for maximization of the sum rate of considered networks. To tackle the formulated mixed-integer non-convex optimization problem with coupled variables, a block coordinate descent (BCD)-based iterative algorithm is developed. Specifically, the original problem is decomposed into three subproblems, which are alternately solved by exploiting the penalty-based method and the successive convex approximation technique. The proposed BCD-based algorithm is demonstrated to be able to obtain a stationary point of the original problem with polynomial time complexity. Numerical results show that: 1) the proposed NOMA-IRS scheme for multi-UAV networks achieves a higher sum rate compared to the benchmark schemes, i.e., orthogonal multiple access (OMA)-IRS and NOMA without IRS; 2) the use of IRS is capable of providing performance gain for multi-UAV networks by both enhancing channel qualities of UAVs to their served users and mitigating the inter-UAV interference; and 3) optimizing the UAV placement can make the sum rate gain brought by NOMA more distinct due to the flexible decoding order design. [ABSTRACT FROM AUTHOR]

This letter presents a proportional adaptive technique to mitigate the multipath fading effect in advanced wireless communication systems. The designed system consists of a realized ultra‐wideband (UWB) dual antenna array and two universal software radio peripheral (USRP) platforms synchronized by a MIMO cable, with one digital RF phase shifter implemented in the reception chain of one of the two receiving antennas. Without requiring any statistical knowledge channel, the proposed approach adjusts the phase shifter in order to maximize the combined received power proportionally to the amplitude of its gradient. The used antennas operate in different frequencies in the fifth‐generation (Sub‐6 GHz 5G) wireless communication applications. The proposed algorithm has been implemented on a USRP that has been used to carry out experimental measurements on fixed and mobile receiving antennas, and it is compared with other approaches. The measurements reveal, that using the amplitude of the gradient of the received power rather than its sign, as it is proposed in the initial on‐off algorithm presented in a previous published work, allows achieving better performance in combatting fading. The phase adjustment with the proposed algorithm is more efficient than in the other approaches allowing a better reception of the received signal with a higher received power level. The measured performances indicate that gain improvement of 8 to 10 dB can be achieved by using the proportional adaptive technique. [ABSTRACT FROM AUTHOR]

The high-speed railway wireless communication network architecture is gradually transforming from a traditional GSM-Railway (GSM-R) cellular network to a 5G heterogeneous ultra-dense communication network. How to effectively deal with the interference while obtaining the capacity gain has become an inevitable problem. This article proposes a power allocation interference alignment algorithm based on game equilibrium with the goal of joint optimization about throughput and energy efficiency for imperfect channels in high-speed railway communication. Firstly, the imperfect Channel State Information including delay and fading is calculated. Then, in order to improve system throughput and energy efficiency, we establish a game model and prove the existence of Nash equilibrium in the model. At the same time, a power allocation iterative algorithm based on Recurrent Neural Network is proposed. Finally, combined with the interference alignment algorithm based on a maximal signal-to-noise ratio, the optimal power matrix is calculated by iteration to achieve interference management optimization. The simulation results prove that our algorithm has superior performance in improving the system throughput, energy efficiency and transmission reliability in high-speed railway wireless communication with imperfect channels. [ABSTRACT FROM AUTHOR]

The challenge of the fifth generation of wireless systems is to overcome fundamental limits of existing cellular networks by means of advanced technologies such as network densification. Nevertheless, dense and random deployment of the network infrastructure poses new challenges in the network management. In particular, rethinking cell association policies and introducing new specific load balancing strategies will be mandatory to shift traffic from heavy-loaded cells to light-loaded neighbors. Toward this goal, cell biasing is considered one of the most effective way. This letter proposes a low-complexity distributed cell-specific bias algorithm suitable for an actual implementation on highly dense scenarios. This solution takes into account the users’ data rate requests and aims at minimizing the outage rate defined as the amount of unsatisfied data rate requests. Numerical results show that despite its low complexity, the solution achieves performance only slightly lower than the benchmark near-optimum solution. [ABSTRACT FROM AUTHOR]

Presence of noise significantly degrades the contents being transmitted over GSM channel. With the evolution of next generation of communication system, the challenges in noise cancellation in voice along with data transmission are not being addressed effectively by existing filters. Therefore, the proposed system offers a mechanism where emphasis is laid on identification of superior and inferior forms of GSM transient signal followed by cancellation of its noise level. Designed using analytical methodology, the proposed system harness the potential of probability theory to perform a modeling that associates allocated power of the transmitting device with the level of noise. The outcome of the study is found to offer a comprehensive identification of different forms of noise and can precisely determine the level of superior and inferior quality of signal. The outcome significantly assists in designing an accurate filter for noise cancellation in GSM signal. [ABSTRACT FROM AUTHOR]

Coordinated precoding based on interference alignment is a promising technique for improving the throughputs in future wireless multicell networks. In small networks, all base stations can typically jointly coordinate their precoding. In large networks, however, base station clustering is necessary due to the otherwise overwhelmingly high channel state information (CSI) acquisition overhead. In this work, we provide a branch and bound algorithm for finding the globally optimal base station clustering. The algorithm is mainly intended for benchmarking existing suboptimal clustering schemes. We propose a general model for the user throughputs, which only depends on the long-term CSI statistics. The model assumes intracluster interference alignment and is able to account for the CSI acquisition overhead. By enumerating a search tree using a best-first search and pruning sub-trees in which the optimal solution provably cannot be, the proposed method converges to the optimal solution. The pruning is done using specifically derived bounds, which exploit some assumed structure in the throughput model. It is empirically shown that the proposed method has an average complexity that is orders of magnitude lower than that of exhaustive search. [ABSTRACT FROM PUBLISHER]