Search

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]

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]

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]

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]

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]

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]

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]