<![CDATA[ IEEE Transactions on Vehicular Technology - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 25 2018May 24<![CDATA[Table of Contents]]>675C1C464<![CDATA[IEEE Vehicular Technology Society Information]]>675C2C2175<![CDATA[Passive/Active BTMS For EV Lithium-Ion Batteries]]>675370937191701<![CDATA[Model-Based Lithium-Ion Battery Resistance Estimation From Electric Vehicle Operating Data]]>675372037281239<![CDATA[Internet-Distributed Vehicle-in-the-Loop Simulation for HEVs]]>675372937393193<![CDATA[Hierarchical Energy Optimization Strategy and Its Integrated Reliable Battery Fault Management for Hybrid Hydraulic-Electric Vehicle]]>675374037546115<![CDATA[Control-Configured-Vehicle Design and Implementation on an X-by-Wire Electric Vehicle]]>675375537661248<![CDATA[An On-Line Energy Management Strategy Based on Trip Condition Prediction for Commuter Plug-In Hybrid Electric Vehicles]]>675376737814609<![CDATA[Coordinated Longitudinal and Lateral Motion Control for Four Wheel Independent Motor-Drive Electric Vehicle]]>675378237901745<![CDATA[Design and Verification of a Virtual Drive Test Methodology for Vehicular LTE-A Applications]]>675379137991615<![CDATA[Geometry-Based Localization for GPS Outage in Vehicular Cyber Physical Systems]]>675380038122238<![CDATA[Internet of Vehicles: Sensing-Aided Transportation Information Collection and Diffusion]]>675381338251889<![CDATA[An Extension of the <inline-formula><tex-math notation="LaTeX">$kappa$</tex-math> </inline-formula>-<inline-formula><tex-math notation="LaTeX">$mu$</tex-math></inline-formula> Shadowed Fading Model: Statistical Characterization and Applications]]> $kappa$-$mu$ shadowed and the classical Beckmann fading models: the Fluctuating Beckmann (FB) fading model. This new model considers the clustering of multipath waves on which the line-of-sight (LoS) components randomly fluctuate, together with the effect of in-phase/quadrature power imbalance in the LoS and non-LoS components. Thus, it unifies a variety of important fading distributions as the one-sided Gaussian, Rayleigh, Nakagami-$m$, Rician, $kappa$ -$mu$, $eta$-$mu$, $eta$ -$kappa$, Beckmann, Rician shadowed, and the $kappa$- $mu$ shadowed distribution. The chief probability functions of the FB fading model, namely probability density function, cumulative distribution function, and moment generating function are derived. The second-order statistics such as the level crossing rate and the average fade duration are also analyzed. These results can be used to derive some performance metrics of interest of wireless communication systems operating over FB fading channels]]>67538263837998<![CDATA[Hough-Transform-Based Cluster Identification and Modeling for V2V Channels Based on Measurements]]>675383838521778<![CDATA[A Geometry-Based Stochastic Channel Model for the Millimeter-Wave Band in a 3GPP High-Speed Train Scenario]]>$K$-factor, and the second-order statistics for the delay and angle domains. Finally, for the design of mmWave HST communication systems, the time-varying channel characteristics are evaluated in the delay and Doppler domains.]]>675385338652229<![CDATA[Entanglement-Assisted Classical Communication Over Quantum Channels for Binary Markov Sources]]>a posteriori algorithm is employed for CC decoding to exploit the Markov source statistics during the iterative decoding process. Extrinsic information transfer chart analysis is performed to evaluate the benefit of the extrinsic mutual information gleaned from the CC decoder for sources with different correlations. We evaluate the bit error rate performance of the proposed coding scheme and compare it with the relevant benchmark schemes, including the turbo coding-based SD scheme. We demonstrate that a near-capacity performance can be achieved using the proposed scheme and when utilizing sources having a high correlation coefficient of $rho =0.9$, the proposed coding scheme performs within 0.53 dB from the entanglement-assisted classical capacity.]]>67538663873718<![CDATA[Mobility Dataset Generation for Vehicular Social Networks Based on Floating Car Data]]>675387438861472<![CDATA[Learning and Inferring a Driver's Braking Action in Car-Following Scenarios]]>accuracy, sensitivity, and specificity. The comparison results show that the GMM–HMM obtains the best performance, with an accuracy of 90%, sensitivity of 84%, and specificity of 97%. Thus, we believe that this method has great potential for real-world active safety systems.]]>675388738991210<![CDATA[Electrolytic Capacitorless Current-Fed Single-Phase Pulsating DC Link Inverter]]>675390039081462<![CDATA[Joint Beamforming and User Selection in Multiuser Collaborative MIMO SWIPT Systems With Nonnegligible Circuit Energy Consumption]]>67539093923855<![CDATA[A Doppler Effect Based Framework for Wi-Fi Signal Tracking in Search and Rescue Operations]]>67539243936862<![CDATA[Uplink Spectral Efficiency Analysis and Optimization for Massive SC-SM MIMO With Frequency Domain Detection]]>675393739491106<![CDATA[Robust Reputation-Based Cooperative Spectrum Sensing via Imperfect Common Control Channel]]>675395039631157<![CDATA[Polarization Sensitive Array Based Physical-Layer Security]]>675396439811406<![CDATA[Coverage, Capacity, and Energy Efficiency Analysis in the Uplink of mmWave Cellular Networks]]>$text{SINR}$ ) coverage in the uplink of millimeter wave cellular networks. By using a distance-dependent line-of-sight (LOS) probability function, the location of LOS and nonLOS users are modeled as two independent nonhomogeneous Poisson point processes, with each having a different pathloss exponent. The analysis takes account of per-user fractional power control (FPC), which couples the transmission of users based on location-dependent channel inversion. We consider the following scenarios in our analysis: 1) pathloss-based FPC (PL-FPC) which is performed using the measured pathloss and 2) distance-based FPC (D-FPC) which is performed using the measured distance. Using the developed framework, we derive expressions for the area spectral efficiency and energy efficiency. Results suggest that in terms of $text{SINR}$ coverage, D-FPC outperforms PL-FPC scheme at high $text{SINR}$ where the future networks are expected to operate. It achieves equal or better area spectral efficiency and energy efficiency compared with the PL-FPC scheme. Contrary to the conventional ultra-high frequency cellular networks, in both FPC schemes, the $text{SINR}$ coverage decreases as the cell density becomes greater than a threshold, while the area spectral efficiency experiences a slow growth region.]]>675398239971389<![CDATA[Joint Sub-Nyquist Spectrum Sensing Scheme With Geolocation Database Over TV White Space]]>a priori information from geolocation database, therefore enabling spectrum sensing to be performed only on a limited number of potentially vacant channels over TV white space. Theoretical analyses and simulation results show that the proposed joint scheme speeds up the sensing process with enhanced detection performance and smaller required sampling rate, whereas the updated channel information from wideband spectrum sensing reduces the risk of interferences to the dynamic incumbent users.]]>67539984007887<![CDATA[Interference-Free Graph Based TDMA Protocol for Underwater Acoustic Sensor Networks]]>675400840191216<![CDATA[Miss and Forward: Exploiting Diversity With Intrasession Network Coding]]>Miss-and-Forward (MF), a new paradigm for intrasession network coding, in which a special relay called “helper” is assigned to exploit the rich diversity. In accordance, a network coding based scheme is designed, which has the ability to restore the “missed” information and in the meanwhile retains the benefit of state-of-the-art batched sparse coding. Mathematically, we show that the source of throughput gain is the higher ranked end-to-end transfer matrix. Besides, we provide a systematical design to address some practical issues such as helper selection and rank distribution estimation. Both numerical and simulation results show that our method significantly outperforms fountain codes and existing network coding schemes.]]>675402040301072<![CDATA[Distributed Joint Source Coding and Trellis Coded Modulation for Symbol-Based Markov Sources]]>a posteriori algorithm is invoked. Furthermore, the Slepian–Wolf (SW) bound of symbol-based sources having spatiotemporal correlation is derived and the benefits of exploiting the spatiotemporal correlation using the proposed coding scheme are demonstrated by our extrinsic information transfer chart analysis. It is shown from our simulation results that upon exploiting the spatiotemporal correlation of the sources, the proposed coding scheme is capable of operating within 0.02 b of the SW bound.]]>67540314041927<![CDATA[Inverse Multipath Fingerprinting for Millimeter Wave V2I Beam Alignment]]>675404240581492<![CDATA[Dual-Band Full-Duplex Tx/Rx Antennas for Vehicular Communications]]>675405940702659<![CDATA[Resource Allocation and Admission Control for an Energy Harvesting Cooperative OFDMA Network]]>675407140861352<![CDATA[UAV Relay in VANETs Against Smart Jamming With Reinforcement Learning]]>67540874097857<![CDATA[Energy-Spectral-Efficiency Analysis and Optimization of Heterogeneous Cellular Networks: A Large-Scale User-Behavior Perspective]]>675409841121597<![CDATA[ON–OFF Analog Beamforming for Massive MIMO]]>on or off to form a beam according to the channel state information at transmitters. This on–off analog beamforming (OABF) scheme has the advantages in terms of both hardware complexities and algorithmic complexities. OABF can completely remove the high-cost, power-consuming, and bulky analog phase shifters that are extensively employed by traditional analog beamforming schemes; it only requires the deployment of low-cost analog switches that are easy to implement. Moreover, we show that the beams formed by such simple antenna on–off switch operations can achieve rather good performances with low-complexity beamforming algorithms. Specifically, we first propose two optimal signal-to-noise ratio maximization algorithms to determine the on–off state of each switch under the per-antenna power constraint and the total power constraint, respectively. After that, we theoretically prove that OABF can achieve the full diversity gain and the full array gain with complexities up to a polynomial order. Numerical results are consistent with our theoretical analysis. We believe that the simple structure of OABF makes massive MIMO much easier to implement in real systems.]]>67541134123839<![CDATA[Integer-Forcing Message Recovering in Interference Channels]]>67541244135909<![CDATA[Space-Time Blind Equalization of Dispersive MIMO Systems Driven by QAM Signals]]>67541364148780<![CDATA[Cooperative Spectrum Sensing Using Quantized Energy Statistics in the Absence of Dedicated Reporting Channel]]>67541494160982<![CDATA[Flexible Coverage for Backhaul-Limited Ultradense Heterogeneous Networks: Throughput Analysis and <inline-formula><tex-math notation="LaTeX">$eta$</tex-math></inline-formula>-Optimal Biasing]]>$eta$ -optimal biasing adjustment model is proposed for flexible coverage. This model aims to optimize the coverage for throughput improvement while matching the backhaul capacity. The simulation results show that average user and SBS throughput can be improved significantly by $2 times$ when backhaul is constrained. Due to the transmit power and interference constraints on access link, there is no need to allocate too much bandwidth to backhaul, which provides guidance for self-backhaul resource allocation.]]>675416141721115<![CDATA[Semianalytical Approach to the PDF of SINR in HPHT and LPLT Single-Frequency Networks]]>675417341811172<![CDATA[Efficient Transmission in Multiantenna Two-Way AF Relaying Networks]]>67541824191524<![CDATA[Performance Analysis of Media-Based Modulation With Imperfect Channel State Information]]>on/off status of radio frequency mirrors (which are parasitic elements) placed near the transmit antenna. The MBM alphabet (which is the set of channel fade coefficients corresponding to all possible mirror on/off status vectors) is estimated at the receiver through pilot transmissions. In this paper, we analyze the effect of imperfect channel estimation on the bit error performance of MBM. We present the analysis for generalized spatial modulation MBM (GSM-MBM). We analyze the performance for two types of detectors, namely the commonly studied mismatched detector, and the true maximum-likelihood (ML) detector that maximizes the likelihood by taking the statistics of the channel estimate into account. First, we derive an exact average pairwise error probability (PEP) expression for the mismatched detector using characteristic function approach, and obtain a union bound based upper bound on the average bit error probability (BEP). Next, given the estimate of the MBM alphabet, we derive the true ML detector for GSM-MBM, and derive an exact average PEP expression (by averaging the conditional PEP over the statistics of the channel estimate) and an upper bound on the average BEP. The exactness of the average PEP and the tightness of the average BEP upper bounds of the detectors are validated through simulations.]]>675419242071909<![CDATA[Robust Chance-Constrained Secure Transmission for Cognitive Satellite–Terrestrial Networks]]>$mathcal{S}$-procedure and Bernstein-type inequality restriction techniques, to obtain a safe approximate solution. In the meantime, the computational complexities of the proposed schemes are analyzed. Finally, the effectiveness of the proposed schemes are demonstrated by numerical results with different system parameters.]]>67542084219749<![CDATA[SBL-Based Joint Sparse Channel Estimation and Maximum Likelihood Symbol Detection in OSTBC MIMO-OFDM Systems]]>67542204232890<![CDATA[Throughput and Delay Analysis of HARQ With Code Combining Over Double Rayleigh Fading Channels]]>$epsilon$ -outage capacity, the average number of transmissions, and the throughput of HARQ-CC. Moreover, we evaluate the delay experienced by Poisson-arriving packets for HARQ-CC. We provide analytical expressions for the average waiting time, the packets sojourn time, the average consumed power, and the energy efficiency. In our investigation, we take into account the impact of imperfect feedback on different performance metrics. Additionally, we explore the tradeoff between energy efficiency and the throughput. The proposed scheme is shown to maintain the outage probability below a specified threshold $epsilon$, which ensures the link reliability. Meanwhile, HARQ-CC adapts implicitly the transmission rate to the channel conditions such that the throughput is maximized. Our results demonstrate that HARQ-CC allows improving the achievable communication rate compared to fixed time diversity schemes. To maximize the throughput of HARQ-CC, the rate per HARQ round should be less than the rate required to meet the outage constraint. Our investigation of the performance of HARQ-CC over Rayleigh and double Rayleigh channels shows that double Rayleigh channels have a higher severity of fading and result in a larger degradation of the throughput. Our analysis reveals that HARQ with incremental redundancy achieves a larger throughput compared to -
ARQ-CC, whereas HARQ-CC is simpler to implement, has a lower decoding complexity, and requires less memory resources.]]>675423342471377<![CDATA[Joint Azimuth, Elevation, and Delay Estimation for 3-D Indoor Localization]]>https://github.com/FWen/JADE.git.]]>67542484261977<![CDATA[Dense Small Cell Networks: From Noise-Limited to Dense Interference-Limited]]> 1) the noise-limited regime, 2) the signal-dominated regime, 3) the interference-dominated regime, and 4) the interference-limited regime. To characterize the performance regime, we propose a unified framework analyzing the future 5G wireless networks over generalized shadowing/fading channels, in which the user association schemes based on the strongest instantaneous received power and the strongest average received power can be studied, while NLoS/LoS transmissions and multislop path loss model are considered. Simulation results indicate that different factors, i.e., noise, desired signal, and interference, successively and separately dominate the network performance with the increase of BS density. Hence, our results shed new light on the design and management of SCNs in urban and rural areas with different BS deployment densities.]]>67542624277963<![CDATA[Blind Sub-Nyquist Spectrum Sensing With Modulated Wideband Converter]]>67542784288989<![CDATA[Uplink Spectral Efficiency Analysis of Decoupled Access in Multiuser MIMO HetNets]]>675428943021483<![CDATA[Feedback-Assisted Correlated Packet Transmission With a Helper]]>$M$ erroneously received packets only by transmitting one helper packet utilizing the source correlation among the packets. This system is referred to as $M$-in-1 helper transmission. The helper packet is constructed simply by taking binary exclusive-OR of the $M$ erroneously received information packets, notified via the feedback channel. To identify the tradeoff between source correlation and performance gain due to coding and diversity, we start our investigation with in-depth analyses on rate regions and outage probabilities with $M=lbrace 2, 3rbrace$. We also evaluate the influence of unequal power and/or redundancy allocations between the helper and information packets. Finally, we provide the analytical results on achievable diversity order with arbitrary integer values of $M$. It is shown that $M$-in-1 helper transmission can always achieve $M$th-order diversity. Furthermore, $(M+1)$th-order diversity can be achieved with $M$ being odd when the source correlation is very high; however, it cannot be achieved with $M$ being even.]]>675430343151486<![CDATA[Amplifier-Coupled Tone Reservation for Minimization of OFDM Nonlinear Distortion]]>675431643241144<![CDATA[Security Shortcomings and Countermeasures for the SAE J1939 Commercial Vehicle Bus Protocol]]>67543254339991<![CDATA[Over-the-Air Tests of High-Speed Moving LTE Users in a Reverberation Chamber]]>675434043491344<![CDATA[Optimal Nonuniform Steady mmWave Beamforming for High-Speed Railway]]>67543504358696<![CDATA[Secure Message Communication Protocol Among Vehicles in Smart City]]>$text{CH}$ s are verified by series of messages exchanged between $text{CH}$ s and the $text{CA}$. The verified $text{CH}$ s are responsible for authentication of vehicles in the second level authentication, followed by exchange of messages between $text{CH}$ and vehicle. The security analysis using widely accepted Burrows–Abadi–Needham logic, formal security analysis using random oracle model and verification using the widely known automated validation of Internet security protocols and applications (AVISPA) tool, and also the informal security analysis have been done with respect to various types of attacks. Moreover, a comparative analysis of the proposed scheme with existing related schemes reveals that it generates low overhead and latency, and high reliability during messages exchange between vehicles and the $text{CA}$.]]>675435943731278<![CDATA[Exploiting Active Subareas for Multicopy Routing in VDTNs]]>675437443883367<![CDATA[On Effective Capacity and Effective Energy Efficiency in Relay-Assisted Wireless Networks]]>67543894400730<![CDATA[Device-to-Device Content Delivery in Cellular Networks: Multicast or Unicast]]>675440144141274<![CDATA[Mobility-Aware Participant Recruitment for Vehicle-Based Mobile Crowdsensing]]>deterministic and probabilistic models. We first prove that the vehicle recruitment problem under both models is NP-hard. Then, for the deterministic trajectory model, an efficient LP-relaxation-based heuristic algorithm is proposed, and an approximation ratio is analyzed. For the probabilistic trajectory model, we propose a greedy algorithm and analyze its performance with a guaranteed approximation ratio. Finally, we evaluate the performance of the proposed schemes through simulations.]]>67544154426872<![CDATA[Temporal Centrality-Balanced Traffic Management for Space Satellite Networks]]>67544274439854<![CDATA[Graph-Based Joint User-Centric Overlapped Clustering and Resource Allocation in Ultradense Networks]]>675444044531034<![CDATA[Distributed Opportunistic Spectrum Access in an Unknown and Dynamic Environment: A Stochastic Learning Approach]]>67544544465992<![CDATA[Adaptive and Distributed Radio Resource Allocation in Densely Deployed Wireless LANs: A Game-Theoretic Approach]]>675446644751231<![CDATA[Connectivity Analysis of Vehicles Moving on a Highway With One Entry and Exit]]>675447644861430<![CDATA[Optimal DASH-Multicasting Over LTE]]>675448745001607<![CDATA[An Evolutionary Game Theoretic Approach for Stable and Optimized Clustering in VANETs]]> static and mobile scenarios. The simulation results demonstrate the effectiveness and robustness of our proposed EGT approach for different populations and speeds, thus reducing the overhead of frequent cluster reformation in VANETs.]]>675450145131849<![CDATA[Collaborative Computation Offloading for Multiaccess Edge Computing Over Fiber–Wireless Networks]]>67545144526603<![CDATA[ShiftRoute: Achieving Location Privacy for Map Services on Smartphones]]> meaningful location information. The basic idea is to strategically shift the endpoints to nearby ones, such that: 1) the semantic meanings encoded in these endpoints (e.g., their addresses) change much, i.e., location privacy is largely protected; 2) the routes returned by map services change little, i.e., service usability is preserved. Specifically, we design a protocol to allow a mobile client to retrieve point of interests (POIs) close to the original endpoints, and an algorithm that selects shifted endpoints from these POIs, that achieves the privacy property of geo-indistinguishability. We implement an application of ShiftRoute on Android, and conduct experiments with real traces from a production map service. Experimental results show that ShiftRoute strikes a good tradeoff between location privacy and service usability.]]>675452745382190<![CDATA[Smart Multi-RAT Access Based on Multiagent Reinforcement Learning]]>675453945511190<![CDATA[Self-Dimensioning and Planning of Small Cell Capacity in Multitenant 5G Networks]]>675455245641028<![CDATA[Admission Control of Wireless Virtual Networks in H<roman>et</roman>H<roman>et</roman>N <roman>ets</roman>]]>67545654576939<![CDATA[Primary User Boundary Detection in Cognitive Radio Networks: Estimated Secondary User Locations and Impact of Malicious Secondary Users]]>$K$ nearest neighbor based malicious SU detection algorithms are utilized.]]>675457745881205<![CDATA[Cell Association With User Behavior Awareness in Heterogeneous Cellular Networks]]>67545894601860<![CDATA[Data Uploading in Hybrid V2V/V2I Vehicular Networks: Modeling and Cooperative Strategy]]>67546024614712<![CDATA[Socially Aware Caching Strategy in Device-to-Device Communication Networks]]>675461546291095<![CDATA[Standard Condition Number Distributions of Finite Wishart Matrices for Cognitive Radio Networks]]>67546304634469<![CDATA[Structured Turbo Compressed Sensing for Massive MIMO Channel Estimation Using a Markov Prior]]>structured turbo compressed sensing (Turbo-CS) framework for the design and analysis of structured sparse channel estimation algorithms. In this framework, a Markov prior is used to model the structured sparsity in massive MIMO channels. Then we extend the Turbo-CS algorithm for independent and identically distributed priors to propose a structured Turbo-CS algorithm to solve the resulting sparse channel estimation problem with the Markov chain prior. We also accurately characterize the performance of the algorithm using state evolution. As compared to the existing algorithms, both the state evolution analysis and simulations show that the structured Turbo-CS algorithm can substantially enhance the channel estimation performance.]]>67546354639689<![CDATA[User-Centric Joint Transmission in Virtual-Cell-Based Ultra-Dense Networks]]>67546404644438<![CDATA[Physical Layer Security for Cooperative NOMA Systems]]>67546454649374<![CDATA[Achievable Rate of the Multiuser Two-Way Full-Duplex Relay System]]>67546504654454<![CDATA[EXIT Chart Aided Convergence Analysis of Recursive Soft <inline-formula> <tex-math notation="LaTeX">$m$</tex-math></inline-formula>-Sequence Initial Acquisition in Nakagami-m Fading Channels]]>$m$-sequences using recursive soft sequence estimation (RSSE) in the context of Nakagami-m fading channels. Explicitly, the novelty of our work is based on employing a new type of EXIT charts operating without using interleavers. This is a challenge, because the original EXIT charts rely on the employment of long, high-delay interleavers for ensuring that the inputs to the decoders become uncorrelated. We then evaluate the performance of various classes of $m$-sequences with the aid of the proposed EXIT charts and demonstrate that the $m$-sequences generated by the lower order polynomials maximize the mutual information more promptly with the aid of our RSSE scheme than those that belong to a higher order polynomial.]]>67546554660923<![CDATA[Joint Power Allocation and Constellation Design for Cognitive Radio Systems]]>67546614665604<![CDATA[Ergodic Capacity of Multiuser Hybrid Satellite-Terrestrial Fixed-Gain AF Relay Networks With CCI and Outdated CSI]]>m fading channels of pertinent links. By deploying multiple antennas at the satellite, we derive a novel and accurate analytical expression of the achievable EC by making use of the complementary moment generating function transform. More importantly, we carry out the EC analysis under both uncorrelated and correlated shadowed-Rician fading channels of satellite links. Our numerical and simulation results attest the accuracy of the proposed analysis and reveal the impact of various system/channel parameters on EC of the considered HSTAFRN.]]>67546664671544<![CDATA[Mobility Robustness Optimization for Handover Failure Reduction in LTE Small-Cell Networks]]>67546724676664<![CDATA[Reliability of Broadcast Communications Under Sparse Random Linear Network Coding]]>67546774682751<![CDATA[Collision-Aware Resource Access Scheme for LTE-Based Machine-to-Machine Communications]]>67546834688518<![CDATA[Introducing IEEE collabratec]]>675468946891855<![CDATA[Become a published author in 4 to 6 weeks]]>67546904690887<![CDATA[IEEE Vehicular Technology Society]]>675C3C3144