<![CDATA[ IEEE Communications Letters - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 4234 2017November 23<![CDATA[Table of contents]]>2111C12327289<![CDATA[IEEE Communications Society]]>2111C2C270<![CDATA[RAR: Real-Time Acoustic Ranging in Underwater Sensor Networks]]>211123282331601<![CDATA[Hypergraph-Based Binary Locally Repairable Codes With Availability]]>$(r, t)$ -availability if it can be recovered from $t$ disjoint repair sets of other symbols, each set of size at most $r$ . We refer a systematic code to an LRC with $(r, t)_{i}$ -availability if its information symbols have $(r, t)$ -availability and a code to an LRC with $(r, t)_{a}$ -availability if its all symbols have $(r, t)$ -availability. We construct binary LRCs with $(r, t)_{i}$ -availability from linear $r$ -uniform $t$ -regular hypergraphs. As a special case, we also construct binary LRCs with $(r, t)_{a}$ -availability from labeled linear $r$ -uniform $t$ -regular hypergraphs. Moreover, we extend the hypergraph-based codes to increase the minimum distance. All the proposed codes achieve a well-known Singleton-like bound with equality.]]>211123322335522<![CDATA[The Weight Distributions of Two Classes of Nonbinary Cyclic Codes With Few Weights]]>$F_{p}$ with few weights, where $p$ is an odd prime. The weight distributions of these codes are determined. Some of the cyclic codes are optimal, which refers to meeting a certain bound on linear codes. The number of nonzero weights of these codes is not more than five and these codes can be employed to obtain secret sharing schemes.]]>211123362339354<![CDATA[A BPPE Algorithm for Instantly Decodable Network Coding in Wireless Broadcasting]]>et al., a maximum weight clique selection problem is formulated as an approximation, and a heuristic algorithm called maximum weight clique (MWC) is proposed in maximizing the clique weight. In this letter, a base policy-based partial enumeration (BPPE) algorithm is proposed in addressing the maximum weight clique selection problem. In particular: 1) the necessity of constructing the IDNC graph as in MWC is eliminated and 2) different enumeration lengths could be chosen, so that a consistent performance-run time tradeoff could be achieved. Simulation results testify the effectiveness of BPPE in addressing the maximum weight clique selection problem over existing algorithms in terms of performance-run time tradeoff.]]>211123402343425<![CDATA[Improved Successive-Cancellation Decoding of Polar Codes Based on Recursive Syndrome Decomposition]]>211123442347632<![CDATA[Area-Efficient Reed–Solomon Decoder Using Recursive Berlekamp–Massey Architecture for Optical Communication Systems]]>$mu text{m}$ CMOS technology library. The results illustrate that our decoder needs about 13k gates (excluding FIFO stacks) and operates at 640 MHz to achieve the throughout of 5.1 Gb/s, which can be applied in optical communication systems. Meanwhile, it is at least 11% more area-efficient compared with previously reported RS decoders.]]>2111234823511070<![CDATA[On the Maximum Burst-Correcting Capability of Cyclic Hsu–Kasami–Chien Codes]]>$b$ -burst-correcting cyclic HKC code is given and simplified as a generalized one for Fire codes. An upper bound on the burst-correcting capability of HKC codes is derived, which improves upon a previous bound. Explicit examples of HKC codes are presented. A design guideline for constructing HKC codes with given burst-error and random-error correcting capabilities is presented.]]>211123522355393<![CDATA[Low-Complexity Early Termination Method for Rateless Soft Decoder]]>211123562359404<![CDATA[Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes]]>211123602363517<![CDATA[Reliability-Oriented Decoding Strategy for LDPC Codes-Based D-JSCC System]]>211123642367547<![CDATA[Optimal DoF Region of the $K$ -User MISO BC With Partial CSIT]]>$K$ -user multiple-input-single-output broadcast channel, where the transmitter, equipped with $M$ antennas, serves $K$ users, with $K leq M$ . The transmitter has access to a partial channel state information of the users. This is modeled by letting the variance of the channel state information at the transmitter error of user $i$ scale as $O(P^{-alpha _{i}}$ ) for the signal-to-noise ratio $P$ and some constant $alpha _{i} geq 0$ . In this letter, we derive the optimal degrees-of-freedom region in such setting, and we show that rate-splitting is the key scheme to achieve such a region.]]>211123682371159<![CDATA[Approaching $B log ~(1+{mathrm{ SNR}})$ With Direct Detection and Low-Order Asymmetric Bandpass Filtering]]>$1/f$ roll-off rate) prior to the intensity detection device (a diode or photodiode), we show that the ideal Shannon data rate attainable with coherent receivers can still be asymptotically approached with simple filtering and direct detection. We also discuss practical aspects that partially limit this remarkable behavior, and show that gains are still possible compared with conventional direct detection.]]>211123722375439<![CDATA[Node Deployment Based on Extra Path Creation for Wireless Sensor Networks on Mountain Roads]]>211123762379901<![CDATA[Mitigation of Alien Crosstalk for Downstream DSL Impaired by Multiple Interferers]]>211123802383470<![CDATA[RSD: Rate-Based Sync Deferment for Personal Cloud Storage Services]]>211123842387478<![CDATA[Precoding-Aided Spatial Modulation With Increased Robustness to Channel Correlations]]>211123882391404<![CDATA[Blind Detection for Spatial Modulation Systems Based on Clustering]]>211123922395511<![CDATA[A Spatial Modulation With Space-Phase Constellation for Spatially Correlated Channels]]>$10^{-3}$ compared with the conventional SM in highly correlated channels.]]>211123962399399<![CDATA[Minimizing Probing CostWith mRMR Feature Selection in Network Monitoring]]>211124002403391<![CDATA[Evaluation Methodology for Fast Switching Cloud RAN Systems]]>2111240424071266<![CDATA[Error Performance Optimization Using Logarithmic Barrier Function in Molecular Nanonetworks]]>211124082411487<![CDATA[Alternative Scheduling Decisions for Multipath TCP]]>2111241224151211<![CDATA[A Multi-Objective Routing Strategy for QoS and Energy Awareness in Software-Defined Networks]]>211124162419300<![CDATA[Load Balanced Mobile User Recruitment for Mobile Crowdsensing Systems]]>211124202423395<![CDATA[Fast Uplink Synchronization in LTE-Like Systems]]>211124242427591<![CDATA[Outage Performance for Cooperative NOMA Transmission with an AF Relay]]>211124282431211<![CDATA[Improper Signaling Versus Time-Sharing in the SISO Z-Interference Channel]]>211124322435261<![CDATA[Antenna Tilt Adaptation for Multi-Cell Massive MIMO Systems]]>211124362439338<![CDATA[O-MAC: Opportunistic MAC Protocol for M2M Communication in WiFi White Spaces]]>211124402443614<![CDATA[Survivability-Aware Connectivity Restoration for Partitioned Wireless Sensor Networks]]>211124442447743<![CDATA[On the Performance of a Multi-Tier NOMA Strategy in Coordinated Multi-Point Networks]]>$epsilon _{k}$ ) and the target data rate.]]>211124482451355<![CDATA[Mobility-Aware User Association in Uplink Cellular Networks]]>211124522455639<![CDATA[A Probabilistic Framework for Protocol Conversions in IIoT Networks With Heterogeneous Gateways]]>211124562459555<![CDATA[Optimally Controlled Pure ALOHA Systems for Wireless Sensor Networks]]>211124602463988<![CDATA[Blocking Predation in Cellular Monopoly Through Non-Linear Spectrum Pricing]]>211124642467146<![CDATA[Energy-Efficient Localization Game for Wireless Sensor Networks]]>211124682471354<![CDATA[Evaluation of Macro Diversity Gain in Long Range ALOHA Networks]]>211124722475618<![CDATA[Optimal Transmit Beamforming for Secure SWIPT in a Two-Tier HetNet]]>211124762479789<![CDATA[Partial Overlapped Time-Shifted Pilots for Massive MIMO Systems]]>211124802483551<![CDATA[Improving QoS and QoE Through Seamless Handoff in Software-Defined IEEE 802.11 Mesh Networks]]>211124842487856<![CDATA[A Robust Bisection-Based Estimator for TOA-Based Target Localization in NLOS Environments]]>exactly by means of bisection procedure. The new approach does not require to make any assumptions about the statistics of NLOS bias, nor to try to distinguish which links are NLOS and which are not. Unlike the existing algorithms, the computational complexity of the proposed algorithm is linear in the number of reference nodes. Our simulation results corroborate the effectiveness of the new algorithm in terms of NLOS bias mitigation and show that the performance of our estimator is highly competitive with the performance of the state-of-the-art algorithms. In fact, they show that the novel estimator outperforms slightly the existing ones in general, and that it always provides a feasible solution.]]>211124882491542<![CDATA[Privacy-Aware Blind Cloud Framework for Advanced Healthcare]]>blind” cloud infrastructure to be utilized for storage, processing, and organization of health data. Traditional healthcare systems rely on cloud computing servers for back-end storage and processing. However, cloud servers are heavily vulnerable to privacy threats and the problem is even more intense as physiological data carry sensitive information. To resolve the aforementioned issue, this letter proposes the blind cloud framework. The goal is to take advantage of the enormous computing and storage abilities of the cloud servers, and yet maintain data anonymity simultaneously. To preserve the privacy of the medical data, the cloud server is forcefully blinded, i.e., the identities of the patients are masked off and a pseudo-identity is generated, thereby, obtaining unidentified in-cloud data for storage and analysis. We also propose a parallel method to be executed within the non-cloud servers for efficient and lossless identity management and retrieval. Results indicate that the performance of the processes of pseudo-identity generation and identity retrieval is independent of the data volumes, and negligibly vary with the increase in the number of the clients of the system.]]>2111249224951167<![CDATA[Mixture-Based Modeling of Spatially Correlated Interference in a Poisson Field of Interferers]]>$mathbb {R}^{2}$ or become analytically too intractable. To tackle these issues, we present an alternate approach which not only offers a simpler analytical structure, but also closely mimics the PPP characteristics. This approach at its core models the correlated interferences using a correlation framework constructed using random variable mixtures. In addition, a correlation framework based on the more standard method of linear combination of random variables is also presented for comparison purpose. The performance of these models is studied by deriving the joint complementary cumulative distribution function of signal-to-interference ratios at $N$ arbitrary points. The plots are found to tightly approximate the exact PPP-based results, with the tightness depending on the values of $lambda p$ (interferer intensity), $alpha $ (path loss exponent), and $N$ . The applicability of the mixture-based model is also shown for a multi-antennae MRC receiver where only major derivation steps that simplify the outage probability analysis are shown.]]>211124962499363<![CDATA[Frame Aggregation in Central Controlled 802.11 WLANs: The Latency Versus Throughput Tradeoff]]>211125002503932<![CDATA[ARNC Multicasting of HDCP Data for Cooperative Mobile Devices With Dual Interfaces]]>211125042507337<![CDATA[Max–Min Fair Resource Allocation for SWIPT in Multi-Group Multicast OFDM Systems]]>211125082511637<![CDATA[Utility Regions for DF Relay in OFDMA-Based Secure Communication With Untrusted Users]]>211125122515744<![CDATA[Adaptive Secure Transmission for RF-EH Untrusted Relaying with Alien Eavesdropping]]>211125162519368<![CDATA[eSES: Enhanced Simple Energy Saving for LTE HeNBs]]>211125202523753<![CDATA[DIO Suppression Attack Against Routing in the Internet of Things]]>DIO suppression attack, a novel degradation-of-service attack against RPL. Unlike other attacks in the literature, the DIO suppression attack does not require to steal cryptographic keys from some legitimate node. We show that the attack severely degrades the routing service, and it is far less energy-expensive than a jamming attack.]]>211125242527475<![CDATA[Round-Trip Delay Modeling for Smart Body Area Networks]]>211125282531499<![CDATA[Fog-Based Evaluation Approach for Trustworthy Communication in Sensor-Cloud System]]>211125322535514<![CDATA[Power Control for Energy Efficient D2D Communication in Heterogeneous Networks With Eavesdropper]]>211125362539662<![CDATA[Multi-User Massive MIMO Relay Networks With Space-Constrained 2-D Antenna Arrays]]>211125402543295<![CDATA[On the Secrecy Performance Analysis of SIMO Systems Over $kappa$ – $mu$ Fading Channels]]>$kappa$ –$mu$ fading channels is analyzed. Novel expressions for the average secrecy capacity and the secure outage probability (SOP) are derived. Moreover, simple and explicit expressions of the asymptotic SOP at high signal-to-noise ratio are given in an effort to gain some valuable insights on how various system parameters affect the secrecy performance. The proposed mathematical analysis is compared with Monte–Carlo simulation to verify the accuracy of the derivation.]]>211125442547485<![CDATA[IEEE Communications Society]]>2111C3C390