<![CDATA[ IEEE Transactions on Vehicular Technology - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 25 2017September21<![CDATA[Table of Contents]]>669C1C463<![CDATA[IEEE Vehicular Technology Society Information]]>669C2C2124<![CDATA[Asymptotically Tight Performance Bounds of Diversity Receptions Over $\alpha$-$\mu$ Fading Channels With Arbitrary Correlation]]>$\alpha$ -$\mu$ fading channels result in intractable multifold integrals or infinite series. In this paper, upper and lower bounds are derived for outage probabilities and error rates of maximum-ratio combining (MRC), selection combining (SC), and equal-gain combining (EGC) over the $\alpha$-$\mu$ fading channels with arbitrary correlation. The derived bounds are in closed form and asymptotically tight. Our applied correlation structure uniquely determines the joint probability density function of the $\alpha$- $\mu$ random variables, thus it is a generalization of the other correlation models based on branches’ hyperpower or power correlation. Based on these closed-form bounds, one can easily estimate the performance of MRC, SC, and EGC in large signal-to-noise ratio region, where performing Monte Carlo simulation is time consuming. These new bounds also reveal a fact that SC can in fact outperform EGC under some certain channel conditions. More importantly, these bounds reveal which factors determine the asymptotic performance of diversity reception systems, and provide criteria for system design.]]>66976197632764<![CDATA[Estimating the Cross-Correlation Properties of Large-Scale Parameters in Multilink Distributed Antenna Systems: Synchronous Measurements Versus Repeated Measurements]]>669763376421481<![CDATA[Air-Ground Channel Characterization for Unmanned Aircraft Systems—Part IV: Airframe Shadowing]]>669764376521828<![CDATA[The $\kappa$- $\mu$ Shadowed Fading Model With Integer Fading Parameters]]>$\kappa$ -$\mu$ shadowed fading model with integer fading parameters $\mu$ and $m$ can be represented as a mixture of squared Nakagami- $\hat{m}$ (or Gamma) distributions. Thus, its PDF and CDF can be expressed in a closed form in terms of a finite number of elementary functions (powers and exponentials). The main implications arising from such connection are then discussed, which can be summarized as follows. First, the performance evaluation of communication systems operating in $\kappa$-$\mu$ shadowed fading becomes as simple as if a Nakagami-$\hat{m}$ fading channel was assumed. Second, the $\kappa$-$\mu$ shadowed distribution can be used to approximate the $\kappa$-$\mu$ distribution using a closed-form representation in terms of elementary functions, by choosing a sufficiently large value of $m$ . Finally, restricting the parameters $\mu$ and $m$ to take integ-
r values has limited the impact in practice when fitting the $\kappa$ -$\mu$ shadowed fading model to field measurements. As an application example, the average channel capacity of communication systems operating under $\kappa$-$\mu$ shadowed fading is obtained in closed-form.]]>669765376621059<![CDATA[Exploiting WSSUS Multipath for GNSS Ranging]]>669766376761282<![CDATA[On Divergence-Angle Efficiency of a Laser Beam in Free-Space Optical Communications for High-Speed Trains]]>$^{\circ }$, 2.002$^{\circ }$] to relax the steering speed of the fast steering mirror, which is a major component of the ATP mechanism in an FSO transceiver. In addition, we overcome the negative effects of train vibrations by using a proposed divergence-angle range for a wide beam. The proposed range of divergence angles provides a large link range and effective coverage length, and contact time as compared to a narrow beam.]]>669767776871401<![CDATA[Modified Current Injection Method for Power Flow Analysis in Heavy-Meshed DC Railway Networks With Nonreversible Substations]]>66976887696598<![CDATA[Hardware Trojan Detection Game: A Prospect-Theoretic Approach]]>behavioral framework of prospect theory (PT) which allows capturing the potential uncertainty, risk, and irrational behavior in the decision making of both the attacker and defender. For both the standard rational expected utility (EUT) case and the PT case, a novel algorithm based on fictitious play is proposed and shown to converge to a mixed-strategy Nash equilibrium. For an illustrative case study, thorough analytical results are derived for both EUT and PT to study the properties of the reached equilibrium as well as the impact of key system parameters such as the defender-set fine. Simulation results assess the performance of the proposed framework under both EUT and PT and show that the use of PT will provide invaluable insights on the outcomes of the proposed hardware trojan game, in particular, and system security, in general.]]>669769777101432<![CDATA[Lithium–Sulfur Cell Equivalent Circuit Network Model Parameterization and Sensitivity Analysis]]>669771177211045<![CDATA[A Real-Time Vibration Suppression Strategy in Electric Vehicles]]>669772277291364<![CDATA[Advanced Engine Cooling System Subjected to Ram Air Effect—Nonlinear Adaptive Multiple Input and Multiple Output (NAMIMO) Control]]>$| e | < 0.5{\,^ \circ }{\rm{C}}$ at steady state) and compensate for unknown heat loads and ram air effects. In contrast, the NAB control law consumes the least radiator fan power but realized a larger average temperature tracking error (40% greater than NAMIMO controller) and longer response time (34% greater than NAMIMO controller) and shows weakness when the heat load is low. Finally, the SF controller, characterized by greater oscillation and electrical power consumption (18.9% greater than the NAMIMO controller), was easy to realize and maintained the engine temperature within $| e | < 0.5{\,^ \circ }{\text{C}}$. The main technical contribution of the study is a nonlinear control strategy which regulates the engine temperature while compensating for unknown heat loads and ram air effects.]]>669773077401023<![CDATA[An Isolated/Bidirectional PWM Resonant Converter for V2G(H) EV On-Board Charger]]>669774177501999<![CDATA[Thermal Management in Plug-In Hybrid Electric Vehicles: A Real-Time Nonlinear Model Predictive Control Implementation]]>669775177601994<![CDATA[Optimal Charging of Li-Ion Batteries With Coupled Electro-Thermal-Aging Dynamics]]>669776177701327<![CDATA[Input-Parallel Output-Series DC-DC Boost Converter With a Wide Input Voltage Range, For Fuel Cell Vehicles]]>669777177811183<![CDATA[Achieving Near Maximum Ratio Combining Diversity Gains With Directive Antennas]]>669778277962105<![CDATA[QoE Driven Decentralized Spectrum Sharing in 5G Networks: Potential Game Approach]]>669779778081049<![CDATA[Efficient Codebook-Based Beamforming Algorithm for Millimeter-Wave Massive MIMO Systems]]>analog beamforming components, wherein a transmitter and receiver jointly examine an analog precoder and analog combiner pair according to predesigned codebooks, without using a priori channel information. However, identifying an optimal analog precoder and analog combiner pair using the exhaustive search algorithm (ESA) incurs exponential complexity, causing the number of radio frequency chains to proliferate and hindering the resolution of the phase shifters, which cannot be solved even for highly reasonable system parameters. To reduce the search complexity while maximizing the achievable rate, we propose a low-complexity, near-optimal algorithm developed from a cross-entropy optimization framework. Our simulation results reveal that our algorithm achieves near-optimal performance at a much lower complexity than does the optimal ESA.]]>66978097817554<![CDATA[Throughput Analysis of an Energy Harvesting Multichannel System Under Delay and Energy Storage Constraints]]>669781878321038<![CDATA[Novel Bayesian Inference Algorithms for Multiuser Detection in M2M Communications]]>a posteriori detector has been proposed to detect the active users in LA-CDMA when the user activity factor is known and small. However, such user activity factor is usually unknown and could be large in practice, which makes the multiuser detection for LA-CDMA a challenging task. In this paper, we first formulate the LA-CDMA uplink using single measurement vector (SMV) model and multiple measurement vector (MMV) model, then, propose novel Bayesian inference algorithms to recover the transmitted signals. For SMV model, we first introduce sparse Bayesian learning (SBL) that exploits the sparsity of the transmitted signals, then, add on the known finite-alphabet constraints and introduce Gaussian mixture model method to recover the transmitted signals. For MMV model, pattern coupled SBL (PCSBL) algorithm is introduced that takes into consideration the neighbor coherence of each device, then the block SBL is introduced through exploiting the row sparsity property and the column coherence of each device. The four Bayesian inference methods make use of various priors and hyperparameters, which can be autonomously learned through the training process via expectation maximization (EM) or variational EM iterative algorithms. Furthermore, the proposed Bayesian methods do not require the knowledge of user activity factor. Simulation results have shown that the proposed Bayesian inference methods outperform the classical algorithms.]]>669783378481044<![CDATA[Incentive-Aware Time-Sensitive Data Collection in Mobile Opportunistic Crowdsensing]]>669784978611336<![CDATA[Blind Frequency Synchronization for OFDM Systems With I/Q Imbalance]]>669786278761420<![CDATA[SLNR-Based Precoding for Single Cell Full-Duplex MU-MIMO Systems]]> signal-to-leakage-and-noise ratio (SLNR) precoding for downlink channel and self-interference plus noise covariance matrix aware SLNR precoding for the uplink channel to improve the spectral efficiency of FD mode systems in the Rician fading environment. Unlike zero-forcing and block diagonalization precoding schemes, it has tradeoffs between interference and noise, and again simultaneously support multiple numbers of users and antennas. The problem is formulated as maximizing SLNR to obtain the precoder that optimized the total spectral efficiency of the system. Numerical results confirm that for a given SNR values FD outperforms half duplex as a number of antennas per user in both channels increase, for fixed number of antennas at the base station, for a small power of the self-interference and for all Rician factor.]]>66978777887626<![CDATA[Energy Efficient Precoding Design for SWIPT in MIMO Two-Way Relay Networks]]>66978887896745<![CDATA[Secondary User Interference Characterization for Spatially Random Underlay Networks With Massive MIMO and Power Control]]>669789779121038<![CDATA[Centralized Energy-Efficient Multiuser Multiantenna Relaying in Next-Generation Radio Access Networks]]>$l_1$ norm, along with a block-coordinate descent type algorithm. The active RRHs are then determined in a single attempt by thresholding a group sparsity pattern associated with the set of all RRH relaying matrices. To circumvent a potentially undesirable condition, where the selected subset of RRHs fails to simultaneously satisfy all the destination users’ QoS levels, we conceive a UE admission control mechanism for overcoming the associated infeasibility problem. Our simulation results demonstrate the explicit benefits of the proposed design approach, which results in a significantly lower energy consumption of the relaying subnetwork than conventional cooperative relaying.]]>66979137924908<![CDATA[An SMDP-Based Prioritized Channel Allocation Scheme in Cognitive Enabled Vehicular Ad Hoc Networks]]>66979257933755<![CDATA[Classification of User Trajectories in LTE HetNets Using Unsupervised Shapelets and Multiresolution Wavelet Decomposition]]>66979347946970<![CDATA[Spectrum Sharing With Device-to-Device Successive Relaying and Hybrid Complex Field Network Coding]]>$_1$ and D$_2$) acts as half-duplex two-path successive relays (TPSRs) between two CUs (C$_1$ and C$_2$) while maintaining cellular full-duplex gains. The channel between D$_1$ and D$_2$, referred to as TPSR interrelay interference channel, is exploited to provide D2D access with an ideal throughput of 1 symbol per time slot (sym/TS). To eliminate the interference between C$_1$–C$_2$ and D $_1$–D$_2$ links, we propose a hybrid complex field network coding (HCFNC) scheme for two cases: First, both of D$_1$ and D$_2$ correctly decode cellular data; and second, either D$_1$ or D $_2$ correctly decodes cellular data. For each case, we derive the closed-form-
CU diversity-multiplexing tradeoff (DMT) and data rate, symbol error probability for the HCFNC strategy, and the D2D throughput. Our performance analysis and simulation results show that: first, the proposed scheme achieves the 3 $\times$ 1 multiple-input single-output DMT; second, the CU achievable rate approaches the full-duplex upper bound; and third, the DU average throughput approaches 1 sym/TS at high signal-to-interference-plus-noise ratio, demonstrating that DUs gain full access opportunity to the cellular spectrum.]]>669794779631021<![CDATA[Encoding and Decoding for Multicell Massive MIMO Systems]]>66979647973779<![CDATA[A Fair Power Allocation Approach to NOMA in Multiuser SISO Systems]]>$K$ users and it is proven that the capacity can always be improved for each user, while using less than the total transmit power required to achieve OMA capacities per user.]]>66979747985633<![CDATA[Position-Based Interference Elimination for High-Mobility OFDM Channel Estimation in Multicell Systems]]>669798680001198<![CDATA[Secure Degrees of Freedom of the Asymmetric Gaussian MIMO Interference Channel]]>$M_1$, $M_2$ antennas and receivers have $N_1$, $N_2$ antennas, respectively. The channel is assumed to be fast fading and channel matrices are fixed and full rank. We subdivide the problem into several regimes based on the configuration of antennas at each node and present the exact secure degrees of freedom of corresponding regime. To prove a converse, the outer bound is developed by combining information theoretic derivation and the results of fundamental models. We also provide the achievable schemes based on zero forcing, real interference alignment, and cooperative jamming. One part of private signal is sent in the null space, while the other part is sent in a way that it aligns with cooperative jamming signal at unintended receiver, but leaves the secret message intact at intended receiver. As a consequence of the scheme, the objective s.d.o.f. can be achieved and the system ensures that the confidential messages cannot be eavesdropped by unintended receivers.]]>66980018009443<![CDATA[Transmit Antenna Selection Schemes for Spatial Modulation Systems: Search Complexity Reduction and Large-Scale MIMO Applications]]>669801080211048<![CDATA[Robust Online Spectrum Prediction With Incomplete and Corrupted Historical Observations]]>669802280361665<![CDATA[Sparse Structure-Based Channel Estimation for Uplink SCMA System]]>66980378046998<![CDATA[P$^2$S: A Primary and Passer-By Scheduling Algorithm for On-Demand Charging Architecture in Wireless Rechargeable Sensor Networks]]>$^2$S) algorithm for on-demand charging architecture for large-scale WRSNs. In P$^2$S, task interdependence is utilized to enhance charging efficiency. We exploit a local searching algorithm, in which nearby nodes on the way to primary nodes, which are the targets of wireless charging vehicle's current movement, will be charged as passer-by nodes. Such a strategy not only makes full use of the available remaining time of a charging deadline but solves the complex scheduling problem with spatial and temporal task interdependence as well. Analysis and simulations are conducted to show the superiority of our scheme, revealing that P$^2$S has a higher survival rate and throughput, as well as other performance metrics.]]>669804780581011<![CDATA[VANET Aided D2D Discovery: Delay Analysis and Performance]]>669805980711233<![CDATA[Limited Feedback Scheme for Device-to-Device Communications in 5G Cellular Networks with Reliability and Cellular Secrecy Outage Constraints]]>669807280851390<![CDATA[Distributed Cooperative Two-Cell Zero-Forcing Precoding With Local Channel Correlation]]>66980868102965<![CDATA[On the SEP Analysis of OFDM Index Modulation With Hybrid Low Complexity Greedy Detection and Diversity Reception]]>669810381181291<![CDATA[Throughput of an Energy Harvesting Cognitive Radio Network Based on Prediction of Primary User]]>66981198128936<![CDATA[MIMO Detection With Imperfect Channel State Information Using Expectation Propagation]]>669812981381097<![CDATA[Enhancing Secrecy With Multiantenna Transmission in Millimeter Wave Vehicular Communication Systems]]>669813981511103<![CDATA[Performance Improvement in Wideband Spectrum Sensing Under Fading: Use of Diversity]]>$P$ number of diversity branches. The performance of the proposed algorithms is measured in terms of probability of insufficient spectrum opportunity ($P_{\text{ISO}}$) and probability of excessive interference opportunity ($P_{\text{EIO}}$). The analysis provided in this paper is general and can be used with any fading model and diversity scheme. Experiments are carried out using theoretical analysis and also verified by using Monte-Carlo simulation. Our analysis shows that the proposed algorithms using diversity outperform the channel by channel and ranked channel detection algorithms used under no diversity. Our results also indicate that among the proposed detection algorithms R-SLC performs better.]]>66981528162699<![CDATA[On the Performance of MIMO-SVD Multiplexing Systems in HetNets: A Stochastic Geometry Perspective]]>$K$ tiers of interfering base stations (BSs) and evaluate the coverage probability and achievable spectral efficiency (ASE), assuming max-signal-to-interference ratio (SIR) cell association rule. For this model, the main contributions are 1) studying the coverage probability of MIMO multiplexing systems from a communication link's viewpoint; 2) investigating the cross-stream SIR correlation coefficient and highlighting the impacts of path-loss exponent and the number of receive antennas on the growth of it; and 3) obtaining easy-to-compute closed-form approximates of the coverage probability and ASE. The developed expressions explicitly reveal the impact of many system parameters, including the number of tiers, density of BSs, transmission power, and the number of data streams. Simulations are conducted to confirm the accuracy of our analysis. Various important aspects of HetNets with respect to densification, high multiplexing gains, and large antenna arrays are demonstrated. Results showcase the significance of channel state information at the transmitter on the network's performance. With the results of this paper, further investigations and system designs are made possible.]]>66981638178761<![CDATA[On Artificial-Noise-Aided Transmit Design for Multiuser MISO Systems With Integrated Services]]>66981798195782<![CDATA[Rate-Splitting to Mitigate Residual Transceiver Hardware Impairments in Massive MIMO Systems]]>multiplicative distortion due to phase noise, additive distortion noise and thermal noise amplification. Under both scenarios with perfect and imperfect channel state information at the transmitter (CSIT), we analyze the potential robustness of RS to each separate hardware imperfection. We analytically assess the sum-rate degradation due to hardware imperfections. Interestingly, in the case of imperfect CSIT, we demonstrate that RS is a robust strategy for multiuser MIMO in the presence of phase and amplified thermal noise, since its sum-rate does not saturate at high signal-to-noise ratio (SNR), contrary to conventional techniques. On the other hand, the additive impairments always lead to a sum-rate saturation at high SNR, even after the application of RS. However, RS still enhances the performance. Furthermore, as the number of users increases, the gains provided by RS decrease not only in ideal conditions, but in practical conditions with residual transceiver hardware impairments as well. Notably, although a deterministic equivalent analysis is employed, the analytical and simulation results coincide even for finite system dimensions. As a consequence, the applicability of these results also holds for current “small scale” multiantenna syste-
s.]]>66981968211769<![CDATA[Electromagnetic Emission-Aware Scheduling for the Uplink of Multicell OFDM Wireless Systems]]>66982128222947<![CDATA[A Toeplitz Covariance Matrix Reconstruction Approach for Direction-of-Arrival Estimation]]>66982238237667<![CDATA[Iterative IQ Imbalance Compensation Receiver for Single Carrier Transmission]]>66982388248837<![CDATA[Spectral-Efficient Band Allocation Scheme for Frequency-Domain Pulse-Shaping-Based SC-FDMA Systems]]>frequency-domain pulse shaping (FDPS) to reduce the peak-to-average power ratio of single-carrier frequency-division multiple-access (SC-FDMA) signals is the decrease of system spectral efficiency due to the excess bandwidth wasted in the existing band allocation schemes (BASs). To improve the spectral efficiency of FDPS-based SC-FDMA systems, a novel BAS is proposed, where edge subcarriers for each user are overlapped with those of all its neighbors. However, the spectrum overlapping incurs multiuser interference and degrades the bit error rate (BER) performance. To address this problem, two iterative multiuser detection (MUD) algorithms are proposed based on expectation propagation (EP), termed joint EP (J-EP) and distributed EP (D-EP). Simulation results demonstrate that, aided by either of the EP-based MUD algorithms, the FDPS-based SC-FDMA system with the proposed BAS can work more spectral-efficiently without BER performance degradation compared to those with the existing BASs. In addition, the D-EP algorithm performs nearly the same as J-EP but requires much lower complexity, making it more appealing for large numbers of allocated subcarriers.]]>669824982621419<![CDATA[Adaptive Communications for Stochastic Networks]]>669826382751124<![CDATA[Balancing Buffer-Aided Relay Selection for Cooperative Relaying Systems]]>669827682901328<![CDATA[Cooperative Multicast With Location Aware Distributed Mobile Relay Selection: Performance Analysis and Optimized Design]]>66982918302842<![CDATA[On Relay Selection Schemes for Relay-Assisted D2D Communications in LTE-A Systems]]>669830383141220<![CDATA[Joint Traffic Scheduling and Resource Allocations for Traffic Offloading With Secrecy Provisioning]]>669831583321326<![CDATA[Self-Organizing Algorithms for Interference Coordination in Small Cell Networks]]> $\alpha$-fair utility maximization framework is considered to analyze performance-fairness tradeoff and to quantify the gains achievable in interference-limited networks. The proposed scheme involves limited inter-base station signaling in the form of two step (power and precoder) pricing. Based on this decentralized coordination, autonomous power and precoder update decision rules are considered, leading to algorithms with different characteristics in terms of user data rates, signaling load, and convergence speed. Simulation results in a practical setting show that the proposed pricing-based self-organization can achieve up to $100\%$ improvement in cell-edge data rates when compared to baseline optimization strategies. Furthermore, the convergence of the proposed algorithms is also proved theoretically.]]>66983338346843<![CDATA[SES: A Novel Yet Simple Energy Saving Scheme for Small Cells]]>669834783562441<![CDATA[Optimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks]]>669835783711549<![CDATA[Video-Aware Multicast Opportunistic Routing Over 802.11 Two-Hop Mesh Networks]]>$\mathsf {MORE}$, that offers multicast but is not efficiently applicable to video streaming applications. Our scheme is able to support real-time applications with time constraints. We improve the received video quality by classifying/prioritizing the video traffic and efficiently orchestrating the multiple transmitters involved in multicast routing. The presented scheme, namely $\mathsf {ViMOR}$, is evaluated through extended experimentation in the wireless testbed of NITOS. $\mathsf {ViMOR}$ succeeds in increasing the perceived video quality by up to $\text{270}\%$ in a few scenarios or up to $\text{175}\%$ in average, compared to $\mathsf {MORE}$.]]>66983728384748<![CDATA[Random Packet Inspection Scheme for Network Intrusion Prevention in LTE Core Networks]]>669838583971019<![CDATA[Joint Adaptive Rate and Scheduling for Unicasting Video Streams in Cellular Wireless Networks]]>66983988412859<![CDATA[Matching Theory for Distributed User Association and Resource Allocation in Cognitive Femtocell Networks]]>669841384281265<![CDATA[User Behavior-Aware Scheduling Based on Time–Frequency Resource Conversion]]>669842984441043<![CDATA[A Novel Phase-Difference Fingerprinting Technique for Localization of Unknown Emitters]]>669844584571397<![CDATA[Full-Duplex Amplify-and-Forward Relaying: Power and Location Optimization]]>669845884681257<![CDATA[Enhanced Channel Access for Connection State of Bluetooth Low Energy Networks]]>669846984811730<![CDATA[Performance Improvement for RF Energy-Harvesting Relays via Relay Selection]]>66984828494812<![CDATA[Energy-Efficient Cross-Layer Design of Wireless Mesh Networks for Content Sharing in Online Social Networks]]>${\text{40}}\%$. Specifically, the composite betweenness based caching strategy is capable of reducing the energy dissipation of the mesh clients by ${\text{358}}\%$, compared to its singular betweenness based counterpart.]]>669849585092001<![CDATA[Coverage Contribution Area Based $k$ -Coverage for Wireless Sensor Networks]]>$k$-coverage problem, which requires a selection of a minimum subset of nodes among the deployed ones such that each point in the target region is covered by at least $k$ nodes. We present both centralized and distributed protocols to tackle this fundamental problem. Our protocols are based on a novel concept of Coverage Contribution Area, which helps to get a lower sensor spatial density. Furthermore, our protocols take the residual energies of the sensors into consideration. This consideration combined with the low sensor spatial density ensures that our protocols can prolong the network lifetime to a greater extent, which is crucial to WSNs due to the limited energy supply and the difficulties of energy recharging. We also conduct extensive simulations to verify our proposed algorithms, and the results show that they are superior over existing ones.]]>669851085231361<![CDATA[Capacity of Large-Scale Wireless Networks Under Jamming: Modeling and Analyses]]>66985248534356<![CDATA[Localized Mobility Management for 5G Ultra Dense Network]]>669853585521371<![CDATA[Adaptive Centralized Clustering Framework for Software-Defined Ultra-Dense Wireless Networks]]>K-Cut method is proposed to partition the graph, achieving a ($1-1/K$) approximation of the optimum in a polynomial time-complexity, where $K$ is the number of clusters. As a result, $K$ can be adaptively adjusted to leverage among the optimality loss, throughput, and complexity. Numerical results show that our adaptive centralized framework performs significantly better than other centralized or semidistributed clustering schemes in terms of throughput.]]>66985538557463<![CDATA[Asymmetric Multilevel Diversity Coding Systems With Perfect Secrecy]]>66985588562259<![CDATA[Precoder Designs for MIMO Gaussian Multiple Access Wiretap Channels]]>66985638568462<![CDATA[A Cooperative Multihop Transmission Scheme for Two-Way Amplify-and-Forward Relay Networks]]>66985698574837<![CDATA[Exact Statistical Characterization of $2\times 2$ Gram Matrices with Arbitrary Variance Profile]]>$\mathbf {W}=\mathbf {H}\mathbf {H}^\dagger$, where $\mathbf {H}$ is a $2\times 2$ complex central Gaussian matrix whose elements have arbitrary variances. With such arbitrary variance profile, this random matrix model fundamentally departs from classical Wishart models and presents a significant challenge as the classical analytical toolbox no longer directly applies. We derive new exact expressions for the distribution of $\mathbf {W}$ and that of its eigenvalues by means of an explicit parameterization of the group of unitary matrices. Our results yield remarkably simple expressions, which are further leveraged to study the outage data rate of a dual-antenna communication system under different variance profiles.]]>66985758579217<![CDATA[Analysis of Correlated MRC With Transmit Antenna Selection Under $\eta$–$\mu$ Fading]]>$\eta$–$\mu$ fading is analyzed. Exact and asymptotic expressions for the cumulative distributing function (CDF) and probability density function (PDF) are derived. These new results are used to evaluate the outage capacity and the asymptotic average bit error rate for different binary modulations. The obtained theoretical results are validated through Monte Carlo simulations.]]>66985808584344<![CDATA[Lagrangian Detection for Generalized Space-Shift Keying MIMO Systems]]>66985858589386<![CDATA[On Outage of WPC System With Relay Selection Over Nakagami- $m$ Fading Channels]]>$m$ fading channels.]]>66985908594386<![CDATA[Recursive Pseudo-Bayesian Access Class Barring for M2M Communications in LTE Systems]]>Bayesian ACB algorithms that estimate the number of active machine devices based only on the number of idle preambles in each slot. In the commercial LTE systems, eNodeB cannot instantaneously distinguish if a particular preamble is sent from a single device (i.e., success) or multiple devices (i.e., collision). However, the idle preambles can be instantaneously detected at the base station (BS) in each slot. Numerical results show that the proposed algorithms yield quite similar performance with the ideal ACB algorithm, assuming that the exact number of active devices is known to the eNodeB.]]>66985958599499<![CDATA[High-Mobility OFDM Downlink Transmission With Large-Scale Antenna Array]]>66986008604423<![CDATA[A Blind Adaptive Tuning Algorithm for Reliable and Energy-Efficient Communication in IEEE 802.15.4 Networks]]>Blind ADaptive Access Parameter Tuning (BADAPT) for reliable and energy-efficient communication in IEEE 802.15.4 networks without using the ACK mechanism. Unlike previous adaptive algorithms that require a costly ACK to notify a sensor node whether a packet is successfully transmitted or not, the BADAPT allows sensor nodes to merely use the locally measured busy channel probabilities to estimate individual reliability under unknown operating conditions. Simulation results show that the BADAPT is effective both in stationary and dynamic scenarios.]]>66986058609571<![CDATA[Imagine a community hopeful for the future]]>669861086101453<![CDATA[IEEE Global History Network]]>66986118611872<![CDATA[Become a published author in 4 to 6 weeks]]>66986128612888<![CDATA[IEEE Vehicular Technology Society]]>669C3C3144