<![CDATA[ IEEE Transactions on Wireless Communications - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 7693 2017October 19<![CDATA[Table of contents]]>1610C16294239<![CDATA[IEEE Transactions on Wireless Communications]]>1610C2C283<![CDATA[Aggregating LTE and Wi-Fi: Toward Intra-Cell Fairness and High TCP Performance]]>1610629563082713<![CDATA[Resource Allocation in Non-Orthogonal and Hybrid Multiple Access System With Proportional Rate Constraint]]>1610630963201798<![CDATA[Roadside Unit Caching: Auction-Based Storage Allocation for Multiple Content Providers]]>1610632163342449<![CDATA[Efficient Coded Cooperative Networks With Energy Harvesting and Transferring]]>$m$ fading channels that are independent but not necessarily identically distributed (i.n.i.d.) are considered. The problem of energy efficiency maximization under constraints of the energy causality and a predefined outage probability threshold is formulated and shown to be non-convex. By exploiting fractional and geometric programming, a convex form-based iterative algorithm is developed to solve the problem efficiently. Close-to-optimal power allocation and energy cooperation policies across consecutive transmissions are found. Moreover, the effects of relay locations, wireless energy transmission efficiency, battery capacity as well as the existence of direct links are investigated. The performance comparison with the current state of solutions demonstrates that the proposed policies can manage the harvested energy more efficiently.]]>1610633563491604<![CDATA[On the Performance of Visible Light Communication Systems With Non-Orthogonal Multiple Access]]>1610635063641929<![CDATA[Dynamic Inter-Operator Spectrum Sharing via Lyapunov Optimization]]>dynamic network is considered. We allow both operators to share (a fraction of) their licensed spectrum band with each other by forming a common spectrum band. The objective is to maximize the gain in profits of both operators by sharing their licensed spectrum bands rather than using them exclusively, while considering the fairness among the operators. This is modeled as a two-person bargaining problem, and cast as a stochastic optimization. To solve this problem, we propose centralized and distributed dynamic control algorithms. At each time slot, the proposed algorithms perform the following tasks: 1) determine spectrum price for the operators; 2) make flow control decisions of users data; and 3) jointly allocate spectrum band to the operators and design transmit beamformers, which is known as resource allocation (RA). Since the RA problem is NP-hard, we have to rely on sequential convex programming to approximate its solution. To derive the distributed algorithm, we use alternating direction method of multipliers for solving the RA problem. Numerically, we show that the proposed distributed algorithm achieves almost the same performance as the centralized one. Furthermore, the results show that there is a trade-off between the achieved profits of the operators and the network congestion.]]>1610636563811505<![CDATA[Robust Resource Allocation in Full-Duplex-Enabled OFDMA Femtocell Networks]]>1610638263941880<![CDATA[Joint EH Time Allocation and Distributed Beamforming in Interference-Limited Two-Way Networks With EH-Based Relays]]>1610639564081409<![CDATA[Design and Analysis of Initial Access in Millimeter Wave Cellular Networks]]>$\pi /12$ ) for UPT. Of the considered protocols, the best tradeoff between initial access delay and UPT is achieved under a fast CS protocol.]]>1610640964252244<![CDATA[Locally Orthogonal Training Design for Cloud-RANs Based on Graph Coloring]]>local orthogonality, under which the training sequence of a user is orthogonal to those of the other users in its neighborhood. We model the design of locally orthogonal training sequences as a graph coloring problem. Then, based on the theory of random geometric graph, we show that the minimum training length scales in the order of $\ln K$ , where $K$ is the number of users covered by a CRAN. This implies that the proposed training design yields a scalable solution to sustain the need of large-scale cooperation in CRANs.]]>1610642664371523<![CDATA[Transmission Rate Optimization of Full-Duplex Relay Systems Powered by Wireless Energy Transfer]]>1610643864501407<![CDATA[Further Results on Extended Delivery Time for Secondary Packet Transmission]]>1610645164591142<![CDATA[Performance of Dynamic and Static TDD in Self-Backhauled Millimeter Wave Cellular Networks]]>1610646064782450<![CDATA[Offloading in HCNs: Congestion-Aware Network Selection and User Incentive Design]]>1610647964921164<![CDATA[Physical-Statistical Modeling of Dynamic Indoor Power Delay Profiles]]>$K$ -factor for small-scale variations and the $t$ -location scale distribution parameters for large-scale variations. It turns out that these parameters cannot be assumed to be constant in time and delay. After modeling of time-delay variations of the first order statistics, we generate channel realizations with appropriate second order statistics. As the result, the presented model enables to describe the evolution of the power delay profile in the time domain.]]>1610649365022322<![CDATA[Pareto Optimality for the Single-Stream Transmission in Multiuser Relay Networks]]>161065036513665<![CDATA[Interference Minimization in Cooperative Relay Beamforming With Multiple Communicating Pairs]]>1610651465273627<![CDATA[Lossless In-Network Processing and Its Routing Design in Wireless Sensor Networks]]>1610652865422103<![CDATA[Scatterer Localization Using Large-Scale Antenna Arrays Based on a Spherical Wave-Front Parametric Model]]>1610654365561560<![CDATA[Hybrid Backscatter Communication for Wireless-Powered Heterogeneous Networks]]>1610655765701710<![CDATA[Indirect-Reciprocity Data Fusion Game and Application to Cooperative Spectrum Sensing]]>1610657165851482<![CDATA[Performance Analysis of Overlay Spectrum Sharing in Hybrid Satellite-Terrestrial Systems With Secondary Network Selection]]>${m}$ as well as Rician fading for terrestrial links, we derive closed-form expressions for the outage probability of both primary and secondary networks, and examine their achievable diversity orders. Numerical and simulation results validate our analysis and highlight the performance gains of the proposed schemes for an HSTSSS with and without a direct satellite primary communication link.]]>1610658666011712<![CDATA[Design of Contract-Based Trading Mechanism for a Small-Cell Caching System]]>$\gamma $ . Numerical results are provided to show the optimal quality and the optimal price designed for each CP. In addition, we find that the proposed contract-based mechanism is superior to the benchmarks from the perspective of maximizing the NSP’s profit.]]>1610660266171986<![CDATA[Secure Multiple-Antenna Block-Fading Wiretap Channels With Limited CSI Feedback]]>$B$ -bit feedback of the main channel state information. The feedback bits are sent by the legitimate receiver, at the beginning of each fading block, over an error-free public link with limited capacity. The statistics of the main and the eavesdropper channel state information are known at all nodes. Assuming an average transmit power constraint, we establish upper and lower bounds on the ergodic secrecy capacity. Then, we present a framework to design the optimal codebooks for feedback and transmission. In addition, we show that the proposed lower and upper bounds coincide asymptotically, as the capacity of the feedback link becomes large, i.e., $B{\rightarrow }\infty $ , hence fully characterizing the ergodic secrecy capacity in this case. Besides, we analyze the asymptotic behavior of the presented secrecy rates, at high signal-to-noise ratio, and evaluate the gap between the bounds.]]>1610661866341495<![CDATA[Online Optimization of Interference Coordination Parameters in Small Cell Networks]]>1610663566474311<![CDATA[Energy-Efficient Resource Allocation in Buffer-Aided Wireless Relay Networks]]>1610664866592429<![CDATA[Joint Power Allocation and Beamforming for Energy-Efficient Two-Way Multi-Relay Communications]]>1610666066711594<![CDATA[Fast-Lipschitz Power Control and User-Frequency Assignment in Full-Duplex Cellular Networks]]>1610667266871464<![CDATA[Noncoherent Alamouti Phase-Shift Keying With Full-Rate Encoding and Polynomial-Complexity Maximum-Likelihood Decoding]]>1610668866971041<![CDATA[Cooperative Modulation Classification for Multipath Fading Channels via Expectation-Maximization]]>1610669867111242<![CDATA[A Jamming-Resistant Channel Hopping Scheme for Cognitive Radio Networks]]>1610671267253103<![CDATA[Optimal Beamforming for Gaussian MIMO Wiretap Channels With Two Transmit Antennas]]>wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. The input covariance matrix that achieves the secrecy capacity is determined. In particular, it is shown that the secrecy capacity of this channel can be achieved by linear precoding. Precoding and power allocation schemes that maximize the achievable secrecy rate, and thus achieve the secrecy capacity, are developed. The secrecy capacity is then compared with the achievable secrecy rate of generalized singular value decomposition (GSVD)-based precoding, which is the best previously proposed technique for this problem. Numerical results demonstrate that substantial gain can be obtained in secrecy rate between the proposed and GSVD-based precodings.]]>161067266735782<![CDATA[Joint Hybrid Tx–Rx Design for Wireless Backhaul With Delay-Outage Constraint in Massive MIMO Systems]]>1610673667501040<![CDATA[Joint Downlink and Uplink Energy Minimization in WET-Enabled Networks]]>1610675167651268<![CDATA[Fountain-Coded File Spreading Over Mobile Networks]]>1610676667781806<![CDATA[Interference Coordination via Power Domain Channel Estimation]]>1610677967941743<![CDATA[Content Placement for Wireless Cooperative Caching Helpers: A Tradeoff Between Cooperative Gain and Content Diversity Gain]]>1610679568071317<![CDATA[End-to-End Backlog and Delay Bound Analysis for Multi-Hop Vehicular Ad Hoc Networks]]>$m$ fading channel model among vehicles. From the simulation results, we can see that the supermartingale end-to-end backlog and delay bound are remarkably tight to the real simulation results when compared with the existing standard bounds. The effect of the number of vehicles on the highway on the end-to-end backlog and delay performance is also investigated.]]>1610680868211594<![CDATA[A Generic Simulation Approach for the Fast and Accurate Estimation of the Outage Probability of Single Hop and Multihop FSO Links Subject to Generalized Pointing Errors]]>1610682268371686<![CDATA[Coding, Multicast, and Cooperation for Cache- Enabled Heterogeneous Small Cell Networks]]>long-term average backhaul load for fetching content from external storage subject to the overall cache capacity constraint by optimizing the content placement in all the cells jointly. Both multicast-aware caching and cooperative caching schemes with optimal content placement are proposed. In order to combine the advantages of multicast content delivery and cooperative content sharing, a compound caching technique, which is referred to as multicast-aware cooperative caching, is then developed. For this technique, a greedy approach and a multicast-aware in-cluster cooperative approach are proposed for the small-scale networks and large-scale networks, respectively. Mathematical analysis and simulation results are presented to illustrate the advantages of MDS codes, multicast, and cooperation in terms of reducing the backhaul requirements for cache-enabled small cell networks.]]>1610683868531316<![CDATA[Dual-Regularized Feedback and Precoding for D2D-Assisted MIMO Systems]]>1610685468671010<![CDATA[Angle Domain Hybrid Precoding and Channel Tracking for Millimeter Wave Massive MIMO Systems]]>spatial rotation. The users are then scheduled by the angle division multiple access scheme, which groups users according to their direction of arrivals (DOAs). Meanwhile, a channel tracking method is designed for the subsequent data transmission through a small number of pilot symbols. Specifically, the channel information is divided into the DOA information and the gain information, where the DOA information is tracked by a modified unscented Kalman filter and the gain information is estimated from beam training. Numerical results are provided to corroborate our studies.]]>1610686868801571<![CDATA[Asynchronous Physical-Layer Network Coding: Symbol Misalignment Estimation and Its Effect on Decoding]]>1610688168941988<![CDATA[Multipath Multiplexing for Capacity Enhancement in SIMO Wireless Systems]]>$B$ is transmitted through a wireless channel with $L$ multipath components. Under this assumption, this paper provides a novel and simple OFTN transmission and symbol-by-symbol detection approach that exploits the multiplexing gain obtained by the multipath characteristic of wideband wireless channels. It is shown that the proposed design can achieve a higher transmission rate than the existing one [i.e., orthogonal frequency division multiplexing (OFDM)]. Furthermore, the achievable rate gap between the proposed approach and that of the OFDM increases as the number of receiver antennas increases for a fixed value of $L$ . This implies that the performance gain of the proposed approach can be very significant for a large-scale multi-antenna wireless system. The superiority of the proposed approach is shown theoretically and confirmed via numerical simulations. Specifically, we have found upper-bound average rates of 15 and 28 bps/Hz with the OFDM and proposed approaches, respectively, in a Rayleigh fading channel with 32 receive antennas and signal-to-noise ratio of 15.3 dB. The extension of the proposed approach for different system setups and associated research problems is also discussed.]]>1610689569111802<![CDATA[Enhancing QoE-Aware Wireless Edge Caching With Software-Defined Wireless Networks]]>1610691269252457<![CDATA[Collaborative Multi-Tier Caching in Heterogeneous Networks: Modeling, Analysis, and Design]]>1610692669391800<![CDATA[Incentivizing Crowdsensing With Location-Privacy Preserving]]>$k$ -anonymity is utilized to reduce the risk of location-privacy disclosure. Specifically, we propose a location aggregation method to cluster users into groups for $k$ -anonymity preserving, and meanwhile mitigating the incurred information loss. After that, an incentive mechanism is carefully designed to select efficient users and calculate rational compensations based on clustered groups obtained in location aggregation, where the influences of both the information loss and $k$ -anonymity in location-privacy preserving are captured into group values and sensing costs. Through theoretical analysis and extensive performances evaluated on real and synthetic data, we find out that the incentive payment increases sharply with more stringent privacy protection and the information loss can be further mitigated compared with conventional methods.]]>1610694069524960<![CDATA[Nonlinear MIMO Transceivers Improve Wireless-Powered and Self-Interference-Aided Relaying]]>1610695369661593<![CDATA[Aligned Reverse Frame Structure for Interference Mitigation in Dynamic TDD Systems]]>cross-link interference, because neighboring base stations and user elements transmit in opposite directions. In this paper, we investigate and analyze the characteristics of cross-link interference in dynamic TDD systems. Based on this observation, we propose an aligned reverse frame structure to utilize and cancel the cross-link interference. Mathematical analysis and numerical results verify that the proposed scheme achieves performance enhancement in terms of capacity compared with conventional dynamic TDD systems.]]>1610696769783511<![CDATA[SIR Analysis of OFDM and GFDM Waveforms With Timing Offset, CFO, and Phase Noise]]>1610697969901271<![CDATA[Introducing IEEE Collabratec]]>1610699169912237<![CDATA[IEEE Access]]>1610699269921409<![CDATA[IEEE Communications Society]]>1610C3C3180<![CDATA[Blank page]]>1610C4C43