<![CDATA[ IEEE Communications Letters - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 4234 2018February 19<![CDATA[Table of contents]]>222C1219284<![CDATA[IEEE Communications Society]]>222C2C285<![CDATA[On Constructions of Reed-Muller Subcodes]]>222220223538<![CDATA[Design of Capacity-Approaching Constrained Codes for DNA-Based Storage Systems]]>$k$ -constrained $q$ -ary data yields a significant improvement in coding redundancy than the prior art sequence replacement method for the $k$ -constrained binary data. Using a simple transformation, standard binary maximum runlength limited sequences can be transformed into maximum runlength limited $q$ -ary sequences which opens the door to applying the vast prior art binary code constructions to DNA-based storage.]]>222224227300<![CDATA[New Constructions of Binary and Ternary Locally Repairable Codes Using Cyclic Codes]]>$d=4$ and some $r$ and with $dge 5$ and some $n$ are shown to be optimal in terms of the upper bounds. In addition, the similar method of the binary case is applied to construct the ternary LRCs with good parameters.]]>222228231485<![CDATA[MDP-Based Model for Interest Scheduling in IoT-NDN Environment]]>222232235875<![CDATA[Placement Delivery Array Design Through Strong Edge Coloring of Bipartite Graphs]]>et al. and a more general class of PDAs proposed by Shangguan et al. as special cases.]]>222236239306<![CDATA[An Efficient Implementation of Lattice Staggered Multicarrier Faster-Than-Nyquist Signaling]]>222240243455<![CDATA[Power Control by GDoF Duality of Treating Interference as Noise]]>$K$ -user interference channel, where interference is treated as Gaussian noise, we demonstrate, for any given GDoF tuple and its power allocation, how to derive a power allocation that yields a dominant GDoF tuple in its reciprocal channel. This finding naturally leads to a fast iterative GDoF-duality-based power control algorithm. Numerical results show that the proposed algorithm achieves competitive sum-rate performance with sophisticated signal-to-interference-plus-noise ratio-based power control scheme.]]>222244247401<![CDATA[Optimum Placement of UAV as Relays]]>222248251599<![CDATA[Shaped Polar Codes for Higher Order Modulation]]>222252255524<![CDATA[LLR-Based SC Decoding of Polar Codes for Two-User Binary-Input MAC]]>222256259531<![CDATA[A Novel Construction of Complementary Sets With Flexible Lengths Based on Boolean Functions]]>222260263312<![CDATA[Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QC-MDPC Codes]]>et al.. The system is based on the juxtaposition of quasi-cyclic LDPC and quasi-cyclic MDPC codes. The idea of our attack is to find an alternative permutation matrix together with an equivalent LDPC code which allow the decoding of any cipher-text with a very high probability. We also apply a recent technique to determine weak keys for this scheme. The results show that the probability of weak keys is high enough that this variant can be ruled out as a possible secure encryption scheme.]]>222264267325<![CDATA[Evolutionary Stability of Reputation-Based Incentive Mechanisms in P2P Systems]]>222268271611<![CDATA[Uncoded Space-Time Labeling Diversity—Application of Media-Based Modulation With RF Mirrors]]>222272275705<![CDATA[Artificial-Noise-Aided Zero-Forcing Synthesis Approach for Secure Multi-Beam Directional Modulation]]>2222762791046<![CDATA[Dual-Mode Generalized Spatial Modulation MIMO for Visible Light Communications]]>222280283467<![CDATA[Exact Bit Error Rate Analysis for Color Shift Keying Modulation]]>222284287979<![CDATA[Mobility and Popularity-Aware Coded Small-Cell Caching]]>222288291300<![CDATA[Mitigation of the Background Radiation for Free-Space Optical IM/DD Systems]]>$L$ , and its error performance approaches that of detection with perfect channel state information and no background radiation, as $L$ becomes large.]]>222292295429<![CDATA[Investigating Route Cache in Named Data Networking]]>2222962991025<![CDATA[Distributed Caching Based on Matching Game in LEO Satellite Constellation Networks]]>222300303889<![CDATA[Secrecy Rate Maximization With Outage Constraint in Multihop Relaying Networks]]>222304307411<![CDATA[Secure Communications in Three-Step Two-Way Energy Harvesting DF Relaying]]>$kappa -mu $ shadowed fading. We evaluate the impact of the fading parameters, and the power splitting factor at the relay, on the secrecy performance. Our results indicate that for a small relay reception interval, secrecy can be enhanced by allocating more power for information decoding. Numerical results are provided to validate the derived results.]]>222308311575<![CDATA[Robust Relay Beamforming Against Jamming Attack]]>222312315348<![CDATA[Distributed TOA-Based Positioning in Wireless Sensor Networks: A Potential Game Approach]]>222316319529<![CDATA[Channel Estimation for mmWave MIMO With Transmitter Hardware Impairments]]>222320323410<![CDATA[Joint 2-D DOA and TOA Estimation for Multipath OFDM Signals Based on Three Antennas]]>222324327881<![CDATA[Analysis of DFT-Based Channel Estimation for Uplink Massive MIMO Systems]]>222328331624<![CDATA[Stochastic Channel Switching of Frequency-Encoded Signals in Molecular Communication Networks]]>2+ signals through gap junction channels. First, we develop a stochastic and generalized model of Ca^{2+} signaling considering three types of noise, such as internal noise, external noise, and gating noise of gap junction channels. Second, we develop a method based on spectral analysis to determine whether cells extract information from frequency-encoded Ca^{2+} signals. Third, we examine numerically whether channel switches propagate Ca^{2+} signals to selected cells in the presence of noise, and show how noise degrades the performance of channel switches.]]>222332335631<![CDATA[Outage Analysis and Power Allocation in Uplink Non-Orthogonal Multiple Access Systems]]>222336339339<![CDATA[Performance of SWIPT for AF MIMO Relay Systems With Direct Link]]>$mathbf {M}_{s}leq {mathbf {min}(mathbf {N}, mathbf {M}_{d})}$ , we propose a simplified measure using singular value decomposition and generalized singular value decomposition techniques. Numerical results for the number of iterations and bit error rate are carried out to evaluate the performance of the three different schemes.]]>222340343503<![CDATA[Joint Altitude and Beamwidth Optimization for UAV-Enabled Multiuser Communications]]>fly-hover-and-communicate protocol, where the ground terminals are partitioned into disjoint clusters that are sequentially served by the UAV as it hovers above the corresponding cluster centers. We jointly optimize the UAV’s flying altitude and antenna beamwidth for throughput optimization in three fundamental multiuser communication models, namely, UAV-enabled downlink multicasting, downlink broadcasting, and uplink multiple access. Results show that the optimal UAV altitude and antenna beamwidth critically depend on the communication model considered.]]>222344347561<![CDATA[Aggregation-Assisted Combining for MIMO Multiple ARQ Systems]]>222348351594<![CDATA[Throughput Analysis of Two-Way NCed-HARQ With Reverse-Link Assistance and Estimated Channel State Information]]>222352355488<![CDATA[Simple and Accurate Low SNR Ergodic Capacity Approximations]]>222356359561<![CDATA[On the Stability of Fast Retrial Multichannel ALOHA With Rate Control for MTC]]>222360363455<![CDATA[Dynamic SCMA Codebook Assignment Methods: A Comparative Study]]>222364367755<![CDATA[Cooperative Low-Power Wideband Sensing Based on 1-bit Quantization]]>222368371625<![CDATA[Starvation Analysis of CDF-Based Scheduling Over Nakagami- $m$ Markov Fading Channels]]>$m$ Markov fading channels. The approximate formula provides a tight result for a large number of users with low computational complexity. Through numerical studies based on our analysis, we investigate the impact of the scheduling parameters and the Nakagami fading parameters on the starving time of the CS algorithm.]]>222372375496<![CDATA[Graph-Based Modeling of Mobile Molecular Communication Systems]]>222376379687<![CDATA[Bayesian Test for Detecting False Data Injection in Wireless Relay Networks]]>222380383435<![CDATA[Scheduling Policies for Wireless Downlink With Correlated Random Connectivity and Multislot Reconfiguration Delay]]>222384387710<![CDATA[Distributed Resource Allocation for D2D Communications Underlaying Cellular Networks in Time-Varying Environment]]>222388391565<![CDATA[Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon]]>mobile assisted trilateration based energy optimum localization is NP-hard. To the best of our knowledge, this is the first such result in an attempt to computationally classify this important problem. We also provide a compact integer linear programming formulation for the problem.]]>222392395342<![CDATA[Complete Targets Coverage in Wireless Sensor Networks With Energy Transfer]]>fixed targets. The goal is to monitor these targets for the longest time period. A key challenge, however, is that sensor nodes have varying energy harvesting rates, meaning that the coverage lifetime of targets is limited by sensor nodes with low energy. To this end, we consider energy sharing between sensor nodes. We model the problem as a mixed integer linear program (MILP). Advantageously, our MILP models non-linear energy conversion rates. We also outline a heuristic for large-scale networks. Our results show energy sharing and non-linear energy conversion rates prolong coverage lifetime. Finally, our heuristic achieves 90% of the optimal coverage lifetime.]]>222396399425<![CDATA[AIF: An Artificial Intelligence Framework for Smart Wireless Network Management]]>2224004031139<![CDATA[PUF-Assisted Group Key Distribution Scheme for Software-Defined Wireless Sensor Networks]]>222404407610<![CDATA[Space-Time Signal Optimization for SWIPT: Linear Versus Nonlinear Energy Harvesting Model]]>222408411302<![CDATA[Resource Allocation for Multiple Device-to-Device Cluster Multicast Communications Underlay Cellular Networks]]>device-to-device cluster (D2DC) multicast communications underlay cellular networks. The transmit power and the channel are allocated to D2DC to maximize the sum effective throughput provided that the cellular communications maintain a certain level of quality of service. We devise a channel allocation scheme using partial information of device locations. For this, we derive the outage probability and an effective throughput of D2DC communications in approximate forms. Numerical results reveal that, when the number of D2DC receivers is large, the proposed scheme achieves the near optimal sum effective throughput, which can be obtained by using full information of device locations.]]>222412415503<![CDATA[Efficient Receive Antenna Selection for Pre-Coding Aided Spatial Modulation]]>222416419414<![CDATA[Theoretical Analysis of 3-D Channel Spatial Correlation and Capacity]]>222420423753<![CDATA[Robust Update Algorithms for Zero-Forcing Detection in Uplink Large-Scale MIMO Systems]]>222424427524<![CDATA[Impact of Imperfect CSI on ASER of Hexagonal and Rectangular QAM for AF Relaying Network]]>222428431520<![CDATA[Cooperative Spectrum Sensing Under Ambient Malicious Interferences]]>222432435783<![CDATA[IEEE Communications Society]]>222C3C375