Exploiting Sparsity in Amplify-and-Forward Broadband Multiple Relay Selection

Cooperative communication has attracted significant attention in the last decade due to its ability to increase the spatial diversity order with only single-antenna nodes. However, most of the techniques in the literature are not suitable for large cooperative networks such as device-to-device and wireless sensor networks that are composed of a massive number of active devices, which significantly increases the relay selection complexity. Therefore, to solve this problem and enhance the spatial and frequency diversity orders of large amplify and forward cooperative communication networks, in this paper, we develop three multiple relay selection and distributed beamforming techniques that exploit sparse signal recovery theory to process the subcarriers using the low complexity orthogonal matching pursuit algorithm (OMP). In particular, by separating all the subcarriers or some subcarrier groups from each other and by optimizing the selection and beamforming vector(s) using OMP algorithm, a higher level of frequency diversity can be achieved. This increased diversity order allows the proposed techniques to outperform existing techniques in terms of bit error rate at a lower computation complexity. A detailed performance-complexity tradeoff, as well as Monte Carlo simulations, are presented to quantify the performance and efficiency of the proposed techniques. 2013 IEEE.This publication was made possible by NPRP grant 8-627-2-260 and NPRP grant 6-070-2-024 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors.Scopu

Hybrid Free-Space Optical and Visible Light Communication Link

V součastnosti bezdrátové optické komunikace (optical wireless communication, OWC) získávají širokou pozornost jako vhodný doplněk ke komunikačním přenosům v rádiovém pásmu. OWC nabízejí několik výhod včetně větší šířky přenosového pásma, neregulovaného frekvenčního pásma či odolnosti vůči elektromagnetickému rušení. Tato práce se zabývá návrhem OWC systémů pro připojení koncových uživatelů. Samotná realizace spojení může být provedena za pomoci různých variant bezdrátových technologií, například pomocí OWC, kombinací různých OWC technologií nebo hybridním rádio-optickým spojem. Za účelem propojení tzv. poslední míle je analyzován optický bezvláknový spoj (free space optics, FSO). Tato práce se dále zabývá analýzou přenosových vlastností celo-optického více skokového spoje s důrazem na vliv atmosférických podmínek. V dnešní době mnoho uživatelů tráví čas ve vnitřních prostorech kanceláří či doma, kde komunikace ve viditelném spektru (visible light communication, VLC) poskytuje lepší přenosové parametry pokrytí než úzce směrové FSO. V rámci této práce byla odvozena a experimentálně ověřena závislost pro bitovou chybovost přesměrovaného (relaying) spoje ve VLC. Pro propojení poskytovatele datavých služeb s koncovým uživatelem může být výhodné zkombinovat více přenosových technologií. Proto je navržen a analyzovám systém pro překonání tzv. problému poslední míle a posledního metru kombinující hybridní FSO a VLC technologie.The field of optical wireless communications (OWC) has recently attracted significant attention as a complementary technology to radio frequency (RF). OWC systems offer several advantages including higher bandwidth, an unregulated spectrum, resistance to electromagnetic interference and a high order of reusability. The thesis focuses on the deployment and analyses of end-user interconnections using the OWC systems. Interconnection can be established by many wireless technologies, for instance, by a single OWC technology, a combination of OWC technologies, or by hybrid OWC/RF links. In order to establish last mile outdoor interconnection, a free-space optical (FSO) has to be investigated. In this thesis, the performance of all-optical multi-hop scenarios is analyzed under atmospheric conditions. However, nowadays, many end users spend much time in indoor environments where visible light communication (VLC) technology can provide better transmission parameters and, significantly, better coverage. An analytical description of bit error rate for relaying VLC schemes is derived and experimentally verified. Nonetheless, for the last mile, interconnection of a provider and end users (joint outdoor and indoor connection) can be advantageous when combining multiple technologies. Therefore, a hybrid FSO/VLC system is proposed and analyzed for the interconnection of the last mile and last meter bottleneck

Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks

In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte Carlo simulations.NPRP grant 6-070-2-024 from the Qatar National Research Fund (a member of Qatar Foundation)Scopu

Exploiting Diversity in Broadband Wireless Relay Networks

Fading is one of the most fundamental impairments to wireless communications. The standard approach to combating fading is by adding redundancy - or diversity - to help increase coverage and transmission speed. Motivated by the results in multiple-input multiple-output technologies, which are usually used at base stations or access points, cooperation commutation has been proposed to improve the performance of wireless networks which consist of low-cost single antenna devices. While the majority of the research in cooperative communication focuses on flat fading for its simplicity and easy analysis, in practice the underlying channels in broadband wireless communication systems such as cellular systems (UMTS/LTE) are more likely to exhibit frequency selective fading. In this dissertation, we consider a frequency selective fading channel model and explore distributed diversity techniques in broadband wireless relay networks, with consideration to practical issues such as channel estimation and complexity-performance tradeoffs. We first study a system model with one source, one destination and multiple decode-and-forward (DF) relays which share a single channel orthogonal to the source. We derive the diversity-multiplexing tradeoff (DMT) for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system at the expense of higher complexity, compared to the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we find special cases when the three relaying strategies have the same DMT. We further present a transceiver design and prove it can achieve the optimal DMT asymptotically. Monte Carlo simulations are presented to corroborate the theoretical analysis. We provide a detailed performance comparison of the three relaying strategies in channels encountered in practice. The work has been extended to systems with multiple amplify-and-forward relays. We propose two relay selection schemes with maximum likelihood sequential estimator and linear zero- forcing equalization at the destination respectively and both schemes can asymptotically achieve the optimal DMT. We next extend the results in the two-hop network, as previously studied, to multi-hop networks. In particular, we consider the routing problem in clustered multi-hop DF relay networks since clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. We propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, our algorithm only requires channel state information in the final hop, which is shown to be essential for reaping the diversity offered by the channel. In addition to exploiting the available diversity, our simple cross-layer algorithm has the flexibility to satisfy an additional routing objective such as maximization of network lifetime. We demonstrate through analysis and simulation that our proposed routing algorithm attains full diversity under certain conditions on the cluster sizes, and its diversity is equal to the diversity of more complicated approaches that require full channel state information. The final part of this dissertation considers channel estimation in relay networks. Channel state information is vital for exploiting diversity in cooperative networks. The existing literature on cooperative channel estimation assumes that block lengths are long and that channel estimation takes place within a fading block. However, if the forwarding delay needs to be reduced, short block lengths are preferred, and adaptive estimation through multiple blocks is required. In particular, we consider estimating the relay-to-destination channel in DF relay systems for which the presence of forwarded information is probabilistic since it is unknown whether the relay participates in the forwarding phase. A detector is used so that the update of the least mean square channel estimate is made only when the detector decides the presence of training data. We use the generalized likelihood ratio test and focus on the detector threshold for deciding whether the training sequence is present. We also propose a heuristic objective function which leads to a proper threshold to improve the convergence speed and reduce the estimation error. Extensive numerical results show the superior performance of using this threshold as opposed to fixed thresholds

Performance analysis of 4G wireless networks using system level simulator

Doutoramento em Engenharia ElectrotécnicaIn the last decade, mobile wireless communications have witnessed an explosive growth in the user’s penetration rate and their widespread deployment around the globe. In particular, a research topic of particular relevance in telecommunications nowadays is related to the design and implementation of mobile communication systems of 4th generation (4G). 4G networks will be characterized by the support of multiple radio access technologies in a core network fully compliant with the Internet Protocol (all IP paradigms). Such networks will sustain the stringent quality of service (QoS) requirements and the expected high data rates from the type of multimedia applications (i.e. YouTube and Skype) to be available in the near future. Therefore, 4G wireless communications system will be of paramount importance on the development of the information society in the near future. As 4G wireless services will continue to increase, this will put more and more pressure on the spectrum availability. There is a worldwide recognition that methods of spectrum managements have reached their limit and are no longer optimal, therefore new paradigms must be sought. Studies show that most of the assigned spectrum is under-utilized, thus the problem in most cases is inefficient spectrum management rather spectrum shortage. There are currently trends towards a more liberalized approach of spectrum management, which are tightly linked to what is commonly termed as Cognitive Radio (CR). Furthermore, conventional deployment of 4G wireless systems (one BS in cell and mobile deploy around it) are known to have problems in providing fairness (users closer to the BS are more benefited relatively to the cell edge users) and in covering some zones affected by shadowing, therefore the use of relays has been proposed as a solution. To evaluate and analyse the performances of 4G wireless systems software tools are normally used. Software tools have become more and more mature in recent years and their need to provide a high level evaluation of proposed algorithms and protocols is now more important. The system level simulation (SLS) tools provide a fundamental and flexible way to test all the envisioned algorithms and protocols under realistic conditions, without the need to deal with the problems of live networks or reduced scope prototypes. Furthermore, the tools allow network designers a rapid collection of a wide range of performance metrics that are useful for the analysis and optimization of different algorithms. This dissertation proposes the design and implementation of conventional system level simulator (SLS), which afterwards enhances for the 4G wireless technologies namely cognitive Radios (IEEE802.22) and Relays (IEEE802.16j). SLS is then used for the analysis of proposed algorithms and protocols.FC

D13.3 Overall assessment of selected techniques on energy- and bandwidth-efficient communications

Deliverable D13.3 del projecte europeu NEWCOM#The report presents the outcome of the Joint Research Activities (JRA) of WP1.3 in the last year of the Newcom# project. The activities focus on the investigation of bandwidth and energy efficient techniques for current and emerging wireless systems. The JRAs are categorized in three Tasks: (i) the first deals with techniques for power efficiency and minimization at the transceiver and network level; (ii) the second deals with the handling of interference by appropriate low interference transmission techniques; (iii) the third is concentrated on Radio Resource Management (RRM) and Interference Management (IM) in selected scenarios, including HetNets and multi-tier networks.Peer ReviewedPostprint (published version

MAC/PHY Co-Design of CSMA Wireless Networks Using Software Radios.

In the past decade, CSMA-based protocols have spawned numerous network standards (e.g., the WiFi family), and played a key role in improving the ubiquity of wireless networks. However, the rapid evolution of CSMA brings unprecedented challenges, especially the coexistence of different network architectures and communications devices. Meanwhile, many intrinsic limitations of CSMA have been the main obstacle to the performance of its derivatives, such as ZigBee, WiFi, and mesh networks. Most of these problems are observed to root in the abstract interface of the CSMA MAC and PHY layers --- the MAC simply abstracts the advancement of PHY technologies as a change of data rate. Hence, the benefits of new PHY technologies are either not fully exploited, or they even may harm the performance of existing network protocols due to poor interoperability. In this dissertation, we show that a joint design of the MAC/PHY layers can achieve a substantially higher level of capacity, interoperability and energy efficiency than the weakly coupled MAC/PHY design in the current CSMA wireless networks. In the proposed MAC/PHY co-design, the PHY layer exposes more states and capabilities to the MAC, and the MAC performs intelligent adaptation to and control over the PHY layer. We leverage the reconfigurability of software radios to design smart signal processing algorithms that meet the challenge of making PHY capabilities usable by the MAC layer. With the approach of MAC/PHY co-design, we have revisited the primitive operations of CSMA (collision avoidance, carrier signaling, carrier sensing, spectrum access and transmitter cooperation), and overcome its limitations in relay and broadcast applications, coexistence of heterogeneous networks, energy efficiency, coexistence of different spectrum widths, and scalability for MIMO networks. We have validated the feasibility and performance of our design using extensive analysis, simulation and testbed implementation.PHDComputer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/95944/1/xyzhang_1.pd

Radio Resource Management for Wireless Mesh Networks Supporting Heterogeneous Traffic

Wireless mesh networking has emerged as a promising technology for future broadband wireless access, providing a viable and economical solution for both peer-to-peer applications and Internet access. The success of wireless mesh networks (WMNs) is highly contingent on effective radio resource management. In conventional wireless networks, system throughput is usually a common performance metric. However, next-generation broadband wireless access networks including WMNs are anticipated to support multimedia traffic (e.g., voice, video, and data traffic). With heterogeneous traffic, quality-of-service (QoS) provisioning and fairness support are also imperative. Recently, wireless mesh networking for suburban/rural residential areas has been attracting a plethora of attentions from industry and academia. With austere suburban and rural networking environments, multi-hop communications with decentralized resource allocation are preferred. In WMNs without powerful centralized control, simple yet effective resource allocation approaches are desired for the sake of system performance melioration. In this dissertation, we conduct a comprehensive research study on the topic of radio resource management for WMNs supporting multimedia traffic. In specific, this dissertation is intended to shed light on how to effectively and efficiently manage a WMN for suburban/rural residential areas, provide users with high-speed wireless access, support the QoS of multimedia applications, and improve spectrum utilization by means of novel radio resource allocation. As such, five important resource allocation problems for WMNs are addressed, and our research accomplishments are briefly outlined as follows: Firstly, we propose a novel node clustering algorithm with effective subcarrier allocation for WMNs. The proposed node clustering algorithm is QoS-aware, and the subcarrier allocation is optimality-driven and can be performed in a decentralized manner. Simulation results show that, compared to a conventional conflict-graph approach, our proposed approach effectively fosters frequency reuse, thereby improving system performance; Secondly, we propose three approaches for joint power-frequency-time resource allocation. Simulation results show that all of the proposed approaches are effective in provisioning packet-level QoS over their conventional resource allocation counterparts. Our proposed approaches are of low complexity, leading to preferred candidates for practical implementation; Thirdly, to further enhance system performance, we propose two low-complexity node cooperative resource allocation approaches for WMNs with partner selection/allocation. Simulation results show that, with beneficial node cooperation, both proposed approaches are promising in supporting QoS and elevating system throughput over their non-cooperative counterparts; Fourthly, to further utilize the temporarily available radio spectrum, we propose a simple channel sensing order for unlicensed secondary users. By sensing the channels according to the descending order of their achievable rates, we prove that a secondary user should stop at the first sensed free channel for the sake of optimality; and Lastly, we derive a unified optimization framework to effectively attain different degrees of performance tradeoff between throughput and fairness with QoS support. By introducing a bargaining floor, the optimal tradeoff curve between system throughput and fairness can be obtained by solving the proposed optimization problem iteratively

Enabling Efficient, Robust, and Scalable Wireless Multi-Hop Networks: A Cross-Layer Approach Exploiting Cooperative Diversity

The practical performance in terms of throughput, robustness, and scalability of traditional Wireless Multihop Networks (WMNs) is limited. The key problem is that such networks do not allow for advanced physical layers, which typically require (a) spatial diversity via multiple antennas, (b) timely Channel State Information (CSI) feedback, and (c) a central instance that coordinates nodes. We propose Corridor-based Routing to address these issues. Our approach widens traditional hop-by-hop paths to span multiple nodes at each hop, and thus provide spatial diversity. As a result, at each hop, a group of transmitters cooperates at the physical layer to forward data to a group of receivers. We call two subsequent groups of nodes a stage. Since all nodes participating in data forwarding at a certain hop are part of the same fully connected stage, corridors only require one-hop CSI feedback. Further, each stage operates independently. Thus, Corridor-based Routing does not require a network-wide central instance, and is scalable. We design a protocol that builds end-to-end corridors. As expected, this incurs more overhead than finding a traditional WMN path. However, if the resulting corridor provides throughput gains, the overhead compensates after a certain number of transmitted packets. We adapt two physical layers to the aforementioned stage topology, namely, Orthogonal Frequency-Division Multiple Access (OFDMA), and Interference Alignment (IA). In OFDMA, we allocate each subchannel to a link of the current stage which provides good channel conditions. As a result, we avoid deep fades, which enables OFDMA to transmit data robustly in scenarios in which traditional schemes cannot operate. Moreover, it achieves higher throughputs than such schemes. To minimize the transmission time at each stage, we present an allocation mechanism that takes into account both the CSI, and the amount of data that each transmitter needs to transmit. Further, we address practical issues and implement our scheme on software-defined radios. We achieve roughly 30% average throughput gain compared to a WMN not using corridors. We analyze OFDMA in theory, simulation, and practice. Our results match in all three domains. Further, we design a physical layer for corridor stages based on IA in the frequency domain. Our practical experiments show that IA often performs poorly because the decoding process augments noise. We find that the augmentation factor depends only on the channel coefficients of the subchannels that IA uses. We design a mechanism to determine which transmitters should transmit to which receivers on which subchannels to minimize noise. Since the number of possible combinations is very large, we use heuristics that reduce the search space significantly. Based on this design, we present the first practical frequency IA system. Our results show that our approach avoids noise augmentation efficiently, and thus operates robustly. We observe that IA is most suitable for stages with specific CSI and traffic conditions. In such scenarios, the throughput gain compared to a WMN not using corridors is 25% on average, and 150% in the best case. Finally, we design a decision engine which estimates the performance of both OFDMA and IA for a given stage, and chooses the one which achieves the highest throughput. We evaluate corridors with up to five stages, and achieve roughly 20% average throughput gain. We conclude that switching among physical layers to adapt to the particular CSI and traffic conditions of each stage is crucial for efficient and robust operation

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters