<![CDATA[ Journal of Communications and Networks - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 5449605 2016July 28<![CDATA[Cloud radio access network: Virtualizing wireless access for dense heterogeneous systems]]>182135149954<![CDATA[Low-complexity distributed algorithms for uplink CoMP in heterogeneous LTE networks]]>182150161505<![CDATA[Evaluating C-RAN fronthaul functional splits in terms of network level energy and cost savings]]>182162172902<![CDATA[Robust transceiver designs in multiuser MISO broadcasting with simultaneous wireless information and power transmission]]>182173181470<![CDATA[Tight bounds and invertible average error probability expressions over composite fading channels]]>G), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian O-fu notion, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.]]>182182189568<![CDATA[Anonymity-based authenticated key agreement with full binding property]]>182190200376<![CDATA[The design of a ultra-low power RF wakeup sensor for wireless sensor networks]]>182201209946<![CDATA[Low-complexity MIMO detection algorithm with adaptive interference mitigation in DL MU-MIMO systems with quantization error]]>182210217311<![CDATA[Frequency-code domain contention in multi-antenna multicarrier wireless networks]]>1822182261057<![CDATA[An optimal schedule algorithm trade-off among lifetime, sink aggregated information and sample cycle for wireless sensor networks]]>182227237393<![CDATA[A proxy acknowledgement mechanism for TCP variants in mobile ad hoc networks]]>182238245733<![CDATA[A reliable group key management scheme for broadcast encryption]]>182246260692<![CDATA[Effect of energy harvesting on stable throughput in cooperative relay systems]]>182261269385<![CDATA[Advertisement]]>18211126<![CDATA[Call for papers]]>18211185<![CDATA[Call for papers]]>18211143<![CDATA[Front cover]]>182c1c1126<![CDATA[Back cover [Table of Contents]]]>182c4c4124<![CDATA[Inside front cover]]>182c2c2109<![CDATA[Inside back cover]]>182c3c3127