Multiuser MIMO-OFDM Systems using Subcarrier Hopping

Recently space division multiple access (SDMA) assisted multiple-input–multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems invoking multiuser detection (MUD) techniques have attracted substantial research interest, which is capable of exploiting both transmitter multiplexing gain and receiver diversity gain. A new scheme referred to here as slowsubcarrierhopping (SSCH) assisted multiuser SDMA-OFDM, is proposed. It is shown that, with the aid of the so-called uniform SSCH (USSCH) pattern, the multiuser interference (MUI) experienced by the high-throughput SDMA-OFDM system can be effectively suppressed, resulting in a significant performance improvement. In the investigations conducted, the proposed USSCH-aided SDMA-OFDM system was capable of outperforming a range of SDMA-OFDM systems considered, including the conventional SDMA-OFDM system dispensing with the employment of frequency-hopping techniques. For example, at an Eb/N0 value of 12 dB, the proposed USSCH/SDMA-OFDM system reduced the bit error ratio (BER) by about three orders of magnitude, in comparison to the conventional SDMA-OFDM system, while maintaining a similar computational complexity

Slow Frequency Hopping Assisted MC DS-CDMA using Large Area Synchronised Spreading Sequences

The family of Multi-Carrier Direct-Sequence CDMA (MC DS- CDMA) systems exhibits numerous attractive properties, which render them attractive candidates for next-generation wireless communications. We demonstrate that spreading codes exhibiting a so-called interference-free window (IFW) are capable of outperforming classic spreading codes, when the interfering multi-user and multipath components arrive within this IFW. The best possible quasi-synchronous timing of the spreading sequences has to be adjusted with the aid of accurate adaptive timing advance control, which has to be significantly more accurate than that used in the lower-bit-rate second-generation GSM system. Fortunately, the IFW duration may be extended with the advent of multi-carrier DS-CDMA proportionately to the number of subcarriers. Hence the resultant MC DS-CDMA system is capable of exhibiting a near-single-user performance without employing a multi-user detector. A deficiency of the resultant system is that the number of spreading codes exhibiting a certain IFW is limited and so is the IFW duration. This contribution sets out to mitigate the above-mentioned shortcomings so that when the users' delays are in the range of the IFW, we separate them with the aid of the unique, user-specific LAS spreading codes. By contrast, when the users roam at a high distance from the base-station and hence their received signal arrive outside the range of the IFW, we separate them using their unique frequency hopping patterns

Multi-group frequency hopping OFDMA based on statistical multiplexing

In this paper, the multi-group frequency hopping OFDMA (MG-FH OFDMA) based on the statistical multiplexing is proposed for the downlink cellular system. Compared with the existed random frequency hopping OFDMA (RFH-OFDMA) system utilizing the statistical multiplexing, the proposed MG-FH OFDMA invokes the deterministic hopping pattern to reduce the number of subcarrier collisions. By dividing all users into different groups, the subcarriers are utilized sufficiently. Latin Square hopping pattern and user index updating scheme are applied to randomize the subcarrier collisions among users. The user capacity, defined as the maximum number of users served with a basic data-rate in a cell, is calculated with the consideration of intra-cell capacity and the other cell interference (OCI). Results show that the proposed MG-FH OFDMA achieves higher user capacity than that of the RFH-OFDMA

Time-Hopping Multicarrier Code-Division Multiple-Access

A time-hopping multicarrier code-division multiple-access (TH/MC-CDMA) scheme is proposed and investigated. In the proposed TH/MC-CDMA each information symbol is transmitted by a number of time-domain pulses with each time-domain pulse modulating a subcarrier. The transmitted information at the receiver is extracted from one of the, say $M$, possible time-slot positions, i.e., assuming that $M$-ary pulse position modulation is employed. Specifically, in this contribution we concentrate on the scenarios such as system design, power spectral density (PSD) and single-user based signal detection. The error performance of the TH/MC-CDMA system is investigated, when each subcarrier signal experiences flat Nakagami-$m$ fading in addition to additive white Gaussian noise (AWGN). According to our analysis and results, it can be shown that the TH/MC-CDMA signal is capable of providing a near ideal PSD, which is flat over the system bandwidth available, while decreases rapidly beyond that bandwidth. Explicitly, signals having this type of PSD is beneficial to both broadband and ultra-wide bandwidth (UWB) communications. Furthermore, our results show that, when optimum user address codes are employed, the single-user detector considered is near-far resistant, provided that the number of users supported by the system is lower than the number of subcarriers used for conveying an information symbol

Diversity Combining for Fast Frequency Hopping Multiple Access Systems Subjected to Nakagami-m Fading

The achievable performance of various diversity combining schemes used in fast frequency hopping (FFH) aided M-ary frequency shift keying (MFSK) systems operating in a multiple access scenario subjected to Nakagami-m fading is investigated. Specifically, linear, self-normalization, hard limiting majority vote, soft limiting, product combining and order statistics-normalized envelope detection based diversity combining schemes are considered. The comparison of various diversity combining schemes is based on the achievable bit error rate versus the number of simultaneous users supported. It is shown using simulation results that although some of the combining schemes considered result in an inferior performance compared to the optimum soft limiting combiner, they offer the advantage of achieving an acceptable interference suppression performance without requiring side information

Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends

This paper examines the security vulnerabilities and threats imposed by the inherent open nature of wireless communications and to devise efficient defense mechanisms for improving the wireless network security. We first summarize the security requirements of wireless networks, including their authenticity, confidentiality, integrity and availability issues. Next, a comprehensive overview of security attacks encountered in wireless networks is presented in view of the network protocol architecture, where the potential security threats are discussed at each protocol layer. We also provide a survey of the existing security protocols and algorithms that are adopted in the existing wireless network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term evolution (LTE) systems. Then, we discuss the state-of-the-art in physical-layer security, which is an emerging technique of securing the open communications environment against eavesdropping attacks at the physical layer. We also introduce the family of various jamming attacks and their counter-measures, including the constant jammer, intermittent jammer, reactive jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the integration of physical-layer security into existing authentication and cryptography mechanisms for further securing wireless networks. Finally, some technical challenges which remain unresolved at the time of writing are summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201

Performance Evaluation of Distributed-Antenna Communications Systems Using Beam-Hopping

Digital beamforming (DBF) techniques are capable of improving the performance of communications systems significantly. However, if the transmitted signals are conflicted with strong interference, especially, in the direction of the transmitted beams , these directional jamming signals will severely degrade the system performance. In order to efficiently mitigate the interference of the directional jammers, in this contribution a beam-hopping (BH) communications scheme is proposed. In the proposed BH communications scheme, only one pair of the beams is used for transmission and it hops from one to the next according to an assigned BH pattern. In this contribution a range of expressions in terms of the average SINR performance have been derived, when both the uplink and downlink are considered. The average SINR performance of the proposed BH scheme and that of the conventional single-beam (SB) as well as multiple-beam (MB) assisted beam-processing schemes have been investigated. Our analysis and results show that the proposed BH scheme is capable of efficiently combating the directional jamming, with the aid of utilizing the directional gain of the beams generated by both the transmitter and the receiver. Furthermore, the BH scheme is capable of reducing the intercept probability of the communications. Therefore, the proposed BH scheme is suitable for communications, when several distributed antenna arrays are available around a mobile