<![CDATA[ IEEE Transactions on Vehicular Technology - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 25 2016October 17<![CDATA[Table of Contents]]>6510C1C465<![CDATA[IEEE Transactions on Vehicular Technology publication information]]>6510C2C237<![CDATA[Guest Editorial Emerging Technology for 5G Enabled Vehicular Networks]]>651078277830286<![CDATA[Channel Measurement and Packet-Level Modeling for V2I Spatial Multiplexing Uplinks Using Massive MIMO]]>6510783178431383<![CDATA[Optimal Resource Sharing in 5G-Enabled Vehicular Networks: A Matrix Game Approach]]>6510784478561665<![CDATA[Delay-Optimal Virtualized Radio Resource Scheduling in Software-Defined Vehicular Networks via Stochastic Learning]]>software-defined heterogeneous vehicular network (SERVICE) . Based on this proposed system framework, a delay-optimal virtualized radio resource scheduling scheme is proposed via stochastic learning. The delay optimal problem is formulated as an infinite-horizon average-cost partially observed Markov decision process (POMDP). Then, an equivalent Bellman equation is derived to solve it. The proposed scheme can be divided into two stages, i.e., macro virtualization resource allocation (MaVRA) and micro virtualization resource allocation (MiVRA). The former is executed based on large timescale variables (traffic density), whereas the latter is operated according to short timescale variables (channel state and queue state). Simulation results show that the proposed scheme outperforms traditional schemes.]]>6510785778671695<![CDATA[Secure and Privacy-Aware Cloud-Assisted Video Reporting Service in 5G-Enabled Vehicular Networks]]>6510786878811600<![CDATA[Vehicular Communications for 5G Cooperative Small-Cell Networks]]>6510788278942690<![CDATA[Control Plane Optimization in Software-Defined Vehicular Ad Hoc Networks]]>6510789579041133<![CDATA[On Optimal Device-to-Device Resource Allocation for Minimizing End-to-End Delay in VANETs]]>6510790579161034<![CDATA[Resource Allocation for Video Streaming in Heterogeneous Cognitive Vehicular Networks]]>6510791779301402<![CDATA[Modeling City-Canyon Pedestrian Radio Channels Based on Passive Sounding in In-Service Networks]]>6510793179436365<![CDATA[A Bidirectional Nonisolated Multi-Input DC–DC Converter for Hybrid Energy Storage Systems in Electric Vehicles]]>6510794479552924<![CDATA[Analytical Solution to Energy Management Guaranteeing Battery Life for Hybrid Trucks]]>6510795679712365<![CDATA[Performance Analysis of Digital Communication Systems Over $alpha{-}eta{-}mu$ Fading Channels]]> fading channels. More specifically, we derived novel, unified, and exact closed-form analytical expressions for the cumulative density function (CDF), the moment-generating function (MGF), the average channel capacity, and the average symbol error probability (SEP) for several coherent and non-coherent modulation schemes. Note that the derived expressions are valid for arbitrary values of the fading parameters. The derived expressions are then used to study the implication of the fading parameters on system performance. In addition, the performance over other well-known fading channels, such as and , as well as their inclusive special cases, can be analyzed using our results. To validate the correctness of our derivations, the numerical results are compared with Monte Carlo simulation results. Both results are in perfect agreement over a wide range of average signal-to-noise ratio (SNR) and different values of the fading parameters.]]>6510797279811334<![CDATA[MIMO Precoder Design With a Compensated QR-Decomposition Combination for CoMP Downlink Scenarios]]>6510798279922266<![CDATA[Dual Antenna Selection in Secure Cognitive Radio Networks]]>651079938002921<![CDATA[Two-Way Relay Strategies With a Multiaccess Uplink and Queue Stability Constraints]]>651080038013705<![CDATA[On Secrecy Performance of Multiantenna-Jammer-Aided Secure Communications With Imperfect CSI]]>6510801480241437<![CDATA[Secure Transmission in Wireless Powered Massive MIMO Relaying Systems: Performance Analysis and Optimization]]>6510802580351006<![CDATA[Delay-Optimal Probabilistic Scheduling for Low-Complexity Wireless Links With Fixed Modulation and Coding: A Cross-Layer Design]]>6510803680511469<![CDATA[Phase Noise Degradation in Massive MIMO Downlink With Zero-Forcing and Maximum Ratio Transmission Precoding]]>651080528059863<![CDATA[Energy Dissipation Versus Delay Tradeoffs in a Buffer-Aided Two-Hop Link]]>6510806080711180<![CDATA[Polarization-Based Spectrum Sensing Algorithms for Cognitive Radios: Upper and Practical Bounds and Experimental Assessment]]>Stokes subvector, according to the statistical distribution of observed data expressed as a received electric-field vector and a Stokes vector, respectively. The two GLRT detectors can serve as a practical bound when all statistical parameters are unknown. Theoretical and numerical simulation results of the detection performance for the proposed detectors are presented. Additionally, these polarization-based detectors were thoroughly tested via a realistic wireless regional area network. Our experimental results show that the GLRT-EV detector exhibits better performance than other polarization-based detectors in terms of sample complexity and computational complexity, which is particularly critical in real-time applications.]]>6510807280861751<![CDATA[Link-Adaptive Mapper Designs for Space-Shift-Keying-Modulated MIMO Systems]]>6510808781001915<![CDATA[Constellation Randomization Achieves Transmit Diversity for Single-RF Spatial Modulation]]>6510810181111232<![CDATA[Robust Successive Compute-and-Forward Over Multiuser Multirelay Networks]]>6510811281291520<![CDATA[OFDM Receiver Structure for a Subband-Selective Mitigation of Time-Variant Interference]]>6510813081442938<![CDATA[Outage Analysis of Opportunistic Relay Selection in Underlay Cooperative Cognitive Networks Under General Operation Conditions]]>651081458154879<![CDATA[Optimal Antenna Deployment for Multiuser MIMO Systems Based on Random Matrix Theory]]>6510815581621499<![CDATA[Performance Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Underlay Cognitive Network in the Presence of Cochannel Interference]]>6510816381761234<![CDATA[On the Usage of Geolocation-Aware Spectrum Measurements for Incumbent Location and Transmit Power Detection]]> - norm minimization solution based on geolocation-aware energy detection measurements. In practice, the accuracy of geolocation tagging is limited. We capture the impact as a basis mismatch and derive the necessary condition that needs to be satisfied for successful detection of multiple incumbents' location and transmit power. We find the upper bound for the probability of eliminating the impact of limited geolocation tagging accuracy in a lognormal shadow fading environment, which is applicable to all generic - norm minimization techniques. We propose an algorithm based on orthogonal matching pursuit that decreases the residual in each iteration by allowing a selected set of basis vectors to rotate in a controlled manner. Numerical evaluation of the proposed algorithm in a Licensed Shared Access (LSA) network shows a significant improvement in the probability of missed detection and false alarm.]]>6510817781891407<![CDATA[Impulsive Noise Mitigation in Underwater Acoustic OFDM Systems]]>6510819082022931<![CDATA[Fair Resource Allocation With Interference Mitigation and Resource Reuse for LTE/LTE-A Femtocell Networks]]>6510820382171258<![CDATA[Maximum-Eigenvalue-Based Sensing and Power Recognition for Multiantenna Cognitive Radio System]]>6510821882291227<![CDATA[An Optimized CoMP Transmission for a Heterogeneous Network Using eICIC Approach]]>unfulfilled data rate requests (UDRRs). Due to the computational complexity of the optimal solution, we propose a heuristic procedure and validate its accuracy by providing a comparison with the optimal numerical solution. In particular, our results show that the proposed method outperforms other benchmark solutions in terms of UDRRs and signaling overhead.]]>6510823082391025<![CDATA[Limited-Feedback Massive MISO Systems With Trellis-Coded Quantization for Correlated Channels]]>6510824082542382<![CDATA[Noise-Loop Multiple Access]]>6510825582661472<![CDATA[Robust Layered Transmission in Secure MISO Multiuser Unicast Cognitive Radio Systems]]>self-protecting architecture of layered transmission and artificial noise generation to ensure communication secrecy. The considered nonconvex optimization problem is recast as a convex optimization problem via semi-definite programming (SDP) relaxation. It is shown that the global optimal solution of the original problem can be constructed by exploiting both the primal and the dual optimal solutions of the SDP-relaxed problem. In addition, two suboptimal resource-allocation schemes are proposed for the case when the solution of the dual problem is unavailable for constructing the optimal solution. Simulation results demonstrate significant transmit power savings and robustness against CSI imperfection for the proposed optimal and suboptimal resource-allocation algorithms employing layered transmission compared to baseline schemes employing traditional single-layer transmission.]]>6510826782821391<![CDATA[A Belief-Based Decision-Making Framework for Spectrum Selection in Cognitive Radio Networks]]>6510828382961850<![CDATA[Low-Complexity Channel Estimation and Detection for MIMO-OFDM Receiver With ESPAR Antenna]]>6510829783081428<![CDATA[Modeling and Analysis of Wireless Channels via the Mixture of Gaussian Distribution]]>6510830983212172<![CDATA[Blind Decoding Based on Independent Component Analysis for a Massive MIMO Uplink System in Microcell Rician/Rayleigh Fading Channels]]>651083228330649<![CDATA[Jamming-Resistant Multiradio Multichannel Opportunistic Spectrum Access in Cognitive Radio Networks]]>a priori to the secondary users (SUs). While theoretically sound, the existing solutions may not be effective in practice due to two main concerns. First, the assumptions are not practical, as before the communication starts, PUs' traffic statistics may not be readily available to the SUs. Second and more serious, existing approaches are extremely vulnerable to malicious jamming attacks. By leveraging the same statistic information and stochastic dynamic decision-making process that the SUs would follow, a cognitive attacker with sensing capability can sense and jam the channels to be accessed by SUs, while not interfering PUs. To address these concerns, we formulate the antijamming, multichannel access problem as a nonstochastic multi-armed bandit problem. By leveraging probabilistically shared information between the sender and the receiver, our proposed protocol enables them to hop to the same set of channels with high probability while gaining resilience to jamming attacks without affecting PUs' activities. We analytically show the convergence of the learning algorithms and derive the performance bound based on regret. We further discuss the problem of tracking the best adaptive strategy and characterize the performance bound based on a new regret. Extensive simulation results show that the probabilistic spectrum sensing and access protocol can overcome the limitation of existing solutions and is highly resilient to various jamming attacks even with jammed acknowledgment (ACK) information.]]>6510833183441283<![CDATA[Multiple-Symbol Differential Sphere Detection and Decision-Feedback Differential Detection Conceived for Differential QAM]]>6510834583602094<![CDATA[Position-Based Limited Feedback Scheme for Railway MU-MIMO Systems]]>651083618370880<![CDATA[Mobility-Aware Performance Evaluation of Heterogeneous Wireless Networks With Traffic Offloading]]>6510837183872100<![CDATA[Supporting Fast Rendezvous Guarantee by Randomized Quorum and Latin Square for Cognitive Radio Networks]]>6510838883991866<![CDATA[An Overlapping Coalitional Game for Cooperative Spectrum Sensing and Access in Cognitive Radio Networks]]>6510840084131147<![CDATA[Collaborative High-Accuracy Localization in Mobile Multipath Environments]]>graphical model framework based on particle filtering, and we validate its potential for high-accuracy localization through simulations. In a practical dedicated short-range communication (DSRC) mobile simulation setup, we show that the algorithm can achieve errors of 1 m 90% of the time, even when the fraction of line-of-sight (LOS) signals is less than 35%. We also address design questions such as “how many anchors and what fraction of LOS measurements are needed to achieve a specified target accuracy?” by showing that the Cramer–Rao lower bound (CRLB) for localization can be expressed as a product of two factors: a scalar function that depends only on the parameters of the noise distribution and a matrix that depends only on the geometry of node locations and the underlying connectivity graph. A simplified expression is obtained that provides an insightful understanding of the bound and that helps deduce the scaling behavior of the estimation error as a function of the number of agents and anchors in the network.]]>651084148422761<![CDATA[Sleep Scheduling Protocol for $k$-Coverage of Three-Dimensional Heterogeneous WSNs]]> -covered, i.e., , while redundant sensors must be scheduled to sleep to minimize energy consumption. In this paper, we address the problem of determining the probability of a sensor being redundant for the -coverage of the FoI. We assume that the network is heterogeneous, in which all the sensors may not have the same sensing and/or communication radii. We use a probabilistic approach to estimate the volume of the sensing sphere of an arbitrary sensor that is redundantly covered by its neighbors. We prove a result to determine if a sensor is redundant for -coverage, which is only based on information about the number of neighbors and their type. We propose a distributed protocol to schedule the redundant sensors to sleep, which requires no geographical information. Results demonstrate that the scheduling protocol reduces the number of active sensors and, thereby, prolongs the network lifetime.]]>6510842384311786<![CDATA[Optimization of Spectrum Allocation and Subsidization in Mobile Communication Services]]>6510843284431059<![CDATA[Distributed Resource Allocation in Virtualized Full-Duplex Relaying Networks]]>6510844484601228<![CDATA[A Stackelberg Game Model for Overlay D2D Transmission With Heterogeneous Rate Requirements]]>6510846184751267<![CDATA[A Novel Predictive Handover Protocol for Mobile IP in Vehicular Networks]]>6510847684952541<![CDATA[On Spectrum Sensing Optimal Design in Spatial–Temporal Domain for Cognitive Radio Networks]]>6510849685101466<![CDATA[Distributed Opportunistic Scheduling With <roman>QoS</roman> Constraints for Wireless Networks With Hybrid Links]]>6510851185271162<![CDATA[Performance Characterization on Random Access in LTE-Based Two-Tier Small-Cell Networks]]>651085288537724<![CDATA[Decentralized Time-Synchronized Channel Swapping for Ad Hoc Wireless Networks]]>decentralized time-synchronized channel swapping (DT-SCS), which is a novel protocol for medium access control (MAC) in ad hoc wireless networks. Under the proposed protocol, nodes first converge to synchronous beacon packet transmissions across all available channels at the physical layer, with a balanced number of nodes in each channel. This is done by the novel coupling of distributed synchronization and desynchronization mechanisms—which are based on the concept of pulse-coupled oscillators—at the MAC layer. Decentralized channel swapping can then take place via peer-to-peer swap requests/acknowledgments made between concurrent transmitters in neighboring channels. We benchmark the convergence and network throughput of DT-SCS, TSCH, and the efficient multichannel MAC protocol (seen as the state of the art in decentralized, interference-avoiding, and multichannel MAC protocols) under simulated packet losses at the MAC layer. Moreover, performance results via a Contiki-based deployment on TelosB motes reveal that DT-SCS comprises an excellent candidate for decentralized multichannel MAC-layer coordination by providing for quick convergence to steady state, high bandwidth utilization under interference and hidden nodes, as well as high connectivity.]]>6510853885531670<![CDATA[A Cross-Layer Quality-Oriented Scheme for Energy-Efficient Multimedia Delivery in Wireless Networks]]>6510855485662174<![CDATA[An Analysis Framework for Interuser Interference in IEEE 802.15.6 Body Sensor Networks: A Stochastic Geometry Approach]]>6510856785772141<![CDATA[Phone-to-Phone Communication Utilizing WiFi Hotspot in Energy-Constrained Pocket Switched Networks]]>6510857885902033<![CDATA[Delivery Delay Analysis for Roadside Unit Deployment in Vehicular Ad Hoc Networks With Intermittent Connectivity]]>6510859186023792<![CDATA[A Bias-Reduced Nonlinear WLS Method for TDOA/FDOA-Based Source Localization]]>6510860386151053<![CDATA[<italic>iStep</italic>: A Step-Aware Sampling Approach for Diffusion Profiling in Mobile Sensor Networks]]>iStep, achieving near-optimal profiling precision in terms of the overall profiling process. Leveraging the upper bound of the deviation value in sampling position during each iteration, we build a comprehensive model between sampling interval and the current state parameters, including the distances between the mobile sensors and the pollution source, as well as the confidence interval radius of the source. Building upon this model, we propose an algorithm on computing the step-aware sampling interval. The computational complexity of iStep is , which is in the same order of the radial approach, where is the number of sensors, and is the total number of movement steps in each iteration. Extensive simulation results show that, compared with the radial approach, iStep can improve the average precision by up to 56.8% and the worst precision by up to 59.1%. Moreover, it performs closely to the brute-force approach, which potentially verifies the near-optimal character of iStep.]]>6510861686281636<![CDATA[Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks]]>6510862986432033<![CDATA[A Hybrid Genetic Algorithm for the Minimum Exposure Path Problem of Wireless Sensor Networks Based on a Numerical Functional Extreme Model]]>6510864486572920<![CDATA[An Optimized Seamless Dual-Link Handover Scheme for High-Speed Rail]]>6510865886681342<![CDATA[Consensus-Based Distributed Mixture Kalman Filter for Maneuvering Target Tracking in Wireless Sensor Networks]]>6510866986811250<![CDATA[File Transfer Between Charging Stations Goes Infrastructureless: A Code–Delay Tradeoff]]>651086828695977<![CDATA[Adaptive Service Rate and Vacation Length for Energy-Efficient HeNB Based on Queueing Analysis]]>6510869687091308<![CDATA[Cooperative Transmission in Simultaneous Wireless Information and Power Transfer Networks]]>651087108715427<![CDATA[Second-Order Statistics of $kappa-mu$ Shadowed Fading Channels]]> shadowed fading channels are derived. The new equations provide the capability of modeling the correlation between the time derivative of the shadowed dominant and multipath components of the shadowed fading envelope. Verification of the new equations is performed by reduction to a number of known special cases. It is shown that as the shadowing of the resultant dominant component decreases, the signal crosses lower threshold levels at a reduced rate. Furthermore, the impact of increasing correlation between the slope of the shadowed dominant and multipath components similarly acts to reduce crossings at lower signal levels. The new expressions for the second-order statistics are also compared with field measurements obtained for cellular device-to-device and body-centric communication channels, which are known to be susceptible to shadowed fading.]]>651087158720672<![CDATA[Exploiting Macrodiversity in Massively Distributed Antenna Systems: A Controllable Coordination Perspective]]>visible antennas (VAs) for each mobile terminal (MT). Assuming that only the CSI between a given MT and its VAs is acquired, we use the number of VAs to quantitatively characterize a general partial-CSI condition. Then, we formulate the corresponding CAS problem as a nonconvex integer programming problem. By adopting variable relaxation and successive approximation, we derive a suboptimal solution to the problem based on geometric programming. Simulation results illustrate that the proposed CAS scheme can offer a near-optimal performance gain in terms of achievable sum rate for any randomly chosen number of VAs.]]>651087208724677<![CDATA[Compressive-Sensing-Based Multiuser Detector for the Large-Scale SM-MIMO Uplink]]> AEs is activated for implicitly conveying bits. By contrast, inspired by the compelling benefits of large-scale MIMO (LS-MIMO) systems, here, we propose an LS-SM-MIMO scheme for the uplink (UL), where each user having multiple AEs but only a single radio frequency (RF) chain invokes SM for increasing the UL throughput. At the same time, by relying on hundreds of AEs and a small number of RF chains, the base station (BS) can simultaneously serve multiple users while reducing the power consumption. Due to the large number of AEs of the UL users and the comparably small number of RF chains at the BS, the UL multiuser signal detection becomes a challenging large-scale underdetermined problem. To solve this problem, we propose a joint SM transmission scheme and a carefully designed structured compressive sensing (SCS)-based multiuser detector (MUD) to be used at the users and the BS, respectively. Additionally, the cyclic-prefix single carrier (CPSC) is used to combat the multipath channels, and a simple receive AE selection is used for the improved performance over correlated Rayleigh-fading MIMO channels. We demonstrate that the aggregate SM signal consisting of multiple UL users' SM signals of a CPSC block exhibits distributed sparsity. Moreover, due to the joint SM transmission scheme, aggregate SM signals in the same transmission group exhibit group sparsity. By exploiting these intrinsically sparse features, the proposed SCS-based MUD can reliably detect the resultant SM signals with low complexity. Simulation results demonstrate that the proposed SCS-based MUD ac ieves a better signal detection performance than its counterparts even with higher UL throughput.]]>651087258730857<![CDATA[Receiver Architecture for Frequency Offset Correction and I/Q Imbalance Compensation in Equal Bandwidth Contiguous Carrier Aggregation]]>single complex digital mixer for baseband carrier separation. The receiver architecture also compensates for in-phase and quadrature gain and phase imbalance (IQI) inherent in direct-conversion receivers. It is shown that, in our new architecture, IQI compensation can be done post the digital mixer, thus enabling a low-power implementation to this impairment.]]>651087308735573<![CDATA[Enhanced Buffer Management for Data Delivery to Multiple Destinations in DTNs]]>651087358739536<![CDATA[Adaptive Random Network Coding for Multicasting Hard-Deadline-Constrained Prioritized Data]]>651087398744553<![CDATA[Efficient Video Pricing and Caching in Heterogeneous Networks]]>651087448751575<![CDATA[A Low-Complexity Detection Algorithm for the Primary Synchronization Signal in LTE]]> - means clustering schemes is proposed. The algorithm reduces the complexity of the primary synchronization signal for LTE from 24 complex multiplications, which are currently best known in the literature, to just eight. Simulation results demonstrate that the proposed algorithm has negligible performance degradation with reduced complexity relative to conventional techniques.]]>6510875187571145<![CDATA[Blended Rule-Based Energy Management for PHEV: System Structure and Strategy]]>651087578762708<![CDATA[Joint Channel Training and Feedback for FDD Massive MIMO Systems]]>651087628767640<![CDATA[Two Birds With One Stone: Towards Secure and Interference-Free D2D Transmissions via Constellation Rotation]]>vice versa. To address these two issues, a security-embedded interference avoidance scheme is proposed in this paper. By exploiting the constellation rotation technique, the proposed scheme can create interference-free links for both D2D and cellular communications, thereby significantly improving the system error performance. Moreover, our scheme also provides an inherent secrecy protection at the physical layer, which makes the information exchange between cellular users and that between D2D users confidential from each other.]]>651087678774791<![CDATA[Throughput Analysis of Interference Alignment for a General Centralized Limited Feedback Model]]>651087758781492<![CDATA[Adaptive Flow Assignment and Packet Scheduling for Delay-Constrained Traffic Over Heterogeneous Wireless Networks]]>large end-to-end delay and burst packet losses pose crucial challenges to guarantee goodput performance of real-time traffic. To address these critical issues, we present an Adaptive Flow Assignment and Packet Scheduling (AFAPS) framework. First, we introduce a “horizontal water filling” algorithm, which effectively integrates the channel resources in heterogeneous wireless networks to maximize the aggregate goodput. Second, we propose an alternative path interleaving scheme, which spreads out the packets' departures over multiple communication paths within the delay constraint to mitigate burst losses. The performance of the proposed AFAPS framework is evaluated through semi-physical emulations in EXata involving real Internet traffic traces. Experimental results show that AFAPS outperforms existing multipath data distribution models, in terms of goodput and end-to-end delay.]]>6510878187871075<![CDATA[Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size]]> relays. We propose a new relay selection scheme that incorporates the status of the relay buffers and the instantaneous strength of the wireless links. Specifically, each link is assigned with a weight related to the buffer status; then, the best relay is selected with the largest weight among all the qualified source–relay and relay–destination links. We derive the closed-form expression for the outage probability and the diversity gain by introducing several Markov chains (MCs) to model the evolution of the buffer status. The analysis shows that the proposed scheme can achieve the optimal diversity gain for a small (i.e., ), an improvement in comparison with the existing max-link scheme that achieves the optimal diversity gain only when is sufficiently large, where denotes the buffer size of each relay. The provided theoretical and numerical results confirm the performance gain of the proposed relay selection scheme over the existing max-link scheme.]]>651087888794788<![CDATA[Load-Aware Dynamic Spectrum Access for Small-Cell Networks: A Graphical Game Approach]]>651087948800537<![CDATA[Achievable Rate of Rician Large-Scale MIMO Channels With Transceiver Hardware Impairments]]> - factor, which reveals that the favorable propagation in LS-MIMO systems can remove the influence of hardware impairments. However, we show that the nonideal LS-MIMO system can still achieve high spectral efficiency due to its huge degrees of freedom.]]>651088008806378<![CDATA[Stable A/G MIMO Transmission Aided by Open-Loop Calibrated Channel Estimation and Adaptive Precoding]]> 4 MIMO transmission, compared with the traditional scheme of a single antenna, the spectrum efficiency can be improved by 2 4 times with a stable transmission.]]>651088068811753<![CDATA[Optimal Power Allocation for Artificial Noise Under Imperfect CSI Against Spatially Random Eavesdroppers]]>651088128817732<![CDATA[Introducing IEEE collabratec]]>6510881888181855<![CDATA[Become a published author in 4 to 6 weeks]]>651088198819887<![CDATA[IEEE Global History Network]]>651088208820872<![CDATA[IEEE Vehicular Technology Society Information]]>6510C3C339