Global mobile data traffic has more than doubled in the past four years, and will only increase throughout the upcoming years. Modern cellular systems are striving to enable communications at high data rates over wide geographical areas to meet the surge in data demand. This requires advanced technologies to mitigate fundamental effects of wireless communications like path-loss, shadowing, small-scale fading, and interference. Two of such technologies are: i) deploying multiple antennas at the transmitter and receiver, and ii) employing an extra radio, called the relay, to forward messages from the transmitter to the receiver. The advantages of both technologies can be leveraged by using multiple antennas at the relay, transmitter, and receiver. Multiple-antenna relay-assisted communication is emerging as one promising technique for expanding the overall capacity of cellular networks. Taking full advantage of multiple-antenna relay-assisted cellular systems requires transmission strategies for jointly configuring the transmitters and receivers based on knowledge of the wireless propagation medium. This dissertation proposes such transmission strategies for wireless multiple-antenna relay-assisted systems. Two popular types of relays are considered: i) amplify-and-forward relays (the relays simply apply linear signal processing to their observed signals before retransmitting) and ii) decode-and-forward relays (the relays decode their observed signals and then re-encode before retransmitting). The first part of this dissertation considers the three-node multiple-antenna amplify-and-forward relay channel. Algorithms for adaptively selecting the number of data streams and subsets of transmit antennas at the transmitter and relay to provide reliable transmission at a guaranteed rate are proposed. Expressions for extracting spatial characteristics of the end-to-end multiple-antenna relay channel are derived. The second part of the dissertation presents interference management strategies that are developed specifically for two models of multiple-antenna relay interference channels where a number of relays assist multiple transmitters to communicate with multiple receivers. One model uses amplify-and-forward relays while the other uses decode-and-forward relays. Based on the idea of interference alignment, these strategies aim at maximizing the sum of achievable end-to-end rates. Simulation results show that the proposed transmission strategies with multiple-antenna relays achieve higher capacity and reliability than both those without relays and those with single-antenna relays. / text

In this thesis, a novel iterative receiver and its improved version are proposed for relay-assisted multiuser communications, in which multiple users transmit to a destination with the help of a relay and using fast frequency-hopping modulation. Each user employs a channel encoder to protect its information and facilitate interference cancellation at the receiver. The signal received at the relay is either amplified, or partially decoded with a simple energy detector, before being forwarded to the destination. Under flat Rayleigh fading channels, the receiver at the destination can be implemented non-coherently, i.e., it does not require the instantaneous channel information to demodulate the users’ transmitted signals. The proposed iterative algorithm at the destination exploits the soft outputs of the channel decoders to successively extract the maximum likelihood symbols of the users and perform interference cancellation. The iterative method is successfully applied for both cases of amplify-and-forward and partial decode-and-forward relaying. The error performance of the proposed iterative receiver is investigated by computer simulation. Under the same spectral efficiency, simulation results demonstrate the excellent performance of the proposed receiver when compared to the performance of decoding without interference cancellation as well as the performance of the maximum likelihood multiuser detection previously developed for uncoded transmission. Simulation results also suggest that a proper selection of channel coding schemes can help to support significant more users without consuming extra system resources. In addition, to further enhance the receiver’s performance in terms of the bit error rate, an improved version of the iterative receiver is presented. Such an improved receiver invokes inner-loop iterations between the channel decoders and the demappers in such a way that the soft outputs of the channel decoders are also used to refine the outputs of the demappers for every outer-loop iteration. Simulation results indicate a performance gain of about 2.5dB by using the two-loop receiver when compared to the performance of the first proposed receiver.

Ad hoc network is intrinsically autonomous and self-configuring network that does not require any dedicated centralized management. For specialized applications such as, military operations, search-and-rescue missions, security and surveillance, patient monitoring, hazardous material monitoring, 4G (4th Generation) coverage extension, and rural communication; ad hoc networks provide an intelligent, robust, flexible and cost effective solution for the wireless communication needs. As in centralized wireless systems, ad hoc networks are also expected to support high data rates, low delays, and large node density in addition to many other QoS (Quality of Service) requirements. However, due to unique ad hoc network characteristics, spectrum scarcity, computational limit of current state-of-the-art technology, power consumption, and memory; meeting QoS requirements is very challenging in ad hoc networks. Studies have shown cross layer to be very effective in enhancing QoS performance under spectrum scarcity and other constraints. In this dissertation, our main goal is to enhance performance (e.g., throughput, delay, scalability, fairness) by developing novel cross layer techniques in single-hop single channel general ad hoc networks. Our dissertation mainly consists of three main sections. In the first section, we identify major challenges intrinsic to ad hoc networks that affect QoS performance under spectrum constraint (i.e., single channel). In the later parts of the dissertation, we investigate and propose novel distributed techniques for ad hoc networks to tackle identified challenges. Different from our main goal, albeit closely related; in the first section we propose a conceptual cross layer frame work for interaction control and coordination. In this context, we identify various functional blocks, and show through simulations that global and local perturbations through parametric correlation can be used for performance optimization. In the second section, we propose MAC (Medium Access Control) scheduling approaches for omni-directional antenna environment to enhance throughput, delay, scalability and fairness performance under channel fading conditions. First, we propose a novel cooperative ratio-based MAC scheduling scheme for finite horizon applications. In this scheduling scheme, each node cooperatively adapts access probability in every window based on its own and neighbors` backlogs and channel states to enhance throughput, scalability and fairness performance. Further, in the second section, we propose two novel relay based MAC scheduling protocols (termed as 2rcMAC and IrcMAC) that make use of relays for reliable transmission with enhanced throughput and delay performance. The proposed protocols make use of spatial diversity due to relay path(s) provided they offer higher data rates compared to the direct path. Simulation results confirm improved performance compared to existing relay based protocols. In the third section, we make use of directional antenna technology to enhance spatial reuse and thus increase network throughput and scalability in ad hoc networks. In this section, we introduce problems that arise as a result of directional communication. We consider two such problems and propose techniques that consequently lead to throughput, delay and scalability enhancement. Specifically, we consider destination location and tracking problem as our first problem. We propose a novel neighbor discovery DMAC (Directional MAC) protocol that probabilistically searches for the destination based on elapsed time, distance, average velocity and beam-width. Results confirm improved performance compared to commonly used random sector and last sector based directional MAC protocols. Further, we identify RTS/CTS collisions as our second problem which leads to appreciable throughput degradation in ad hoc networks. In this respect, we investigate and propose a fully distributed asynchronous polarization based DMAC protocol. In this protocol, each node senses its neighborhood on both linear polarization channels and adapts polarization to enhance throughput and scalability. Throughput and delay comparisons against the basic DMAC protocol clearly show throughput, scalability and delay improvements.

Many robotic systems are remotely operated nowadays that require uninterrupted connection and safe mission planning. Such systems are commonly found in military drones, search and rescue operations, mining robotics, agriculture, and environmental monitoring. Different robotic systems may employ disparate communication modalities such as radio network, visible light communication, satellite, infrared, Wi-Fi. However, in an autonomous mission where the robots are expected to be interconnected, communication constrained environment frequently arises due to the out of range problem or unavailability of the signal. Furthermore, several automated projects (building construction, assembly line) do not guarantee uninterrupted communication, and a safe project plan is required that optimizes collision risks, cost, and duration. In this thesis, we propose four pronged approaches to alleviate some of these issues: 1) Communication aware world mapping; 2) Communication preserving using the Line-of-Sight (LoS); 3) Communication aware safe planning; and 4) Multi-Objective motion planning for navigation. First, we focus on developing a communication aware world map that integrates traditional world models with the planning of multi-robot placement. Our proposed communication map selects the optimal placement of a chain of intermediate relay vehicles in order to maximize communication quality to a remote unit. We also vi propose an algorithm to build a min-Arborescence tree when there are multiple remote units to be served. Second, in communication denied environments, we use Line-of-Sight (LoS) to establish communication between mobile robots, control their movements and relay information to other autonomous units. We formulate and study the complexity of a multi-robot relay network positioning problem and propose approximation algorithms that restore visibility based connectivity through the relocation of one or more robots. Third, we develop a framework to quantify the safety score of a fully automated robotic mission where the coexistence of human and robot may pose a collision risk. A number of alternate mission plans are analyzed using motion planning algorithms to select the safest one. Finally, an efficient multi-objective optimization based path planning for the robots is developed to deal with several Pareto optimal cost attributes.

Communication over a wireless channel is a challenging task because of the inherent fading effects. Any wireless communication system employs some form of diversity improving techniques in order to improve the reliability of the channel. This thesis deals with efficient code design for two different spatial diversity techniques, viz, diversity by employing multiple antennas at the transmitter and/or the receiver, and diversity through cooperative commu- nication between users. In other words, this thesis deals with efficient code design for (1) multiple-input multiple-output (MIMO) channels, and (2) wireless relay channels. Codes for the MIMO channel are termed space-time (ST) codes and those for the relay channels are called distributed ST codes. The first part of the thesis focuses on ST code construction for MIMO fading channel with perfect channel state information (CSI) at the receiver, and no CSI at the transmitter. As a measure of performance we use the rate-diversity tradeoff and the Diversity-Multiplexing Gain (D-MG) Tradeoff, which are two different tradeoffs characterizing the tradeoff between the rate and the reliability achievable by any ST code. We provide two types of code constructions that are optimal with respect to the rate-diversity tradeoff; one is based on the rank-distance codes which are traditionally applied as codes for storage devices, and the second construction is based on a matrix representation of a cayley algebra. The second contribution in ST code constructions is related to codes with a certain nonvanishing determinant (NVD) property. Motivation for these constructions is a recent result on the necessary and sufficient conditions for an ST code to achieve the D-MG tradeoff. Explicit code constructions satisfying these conditions are provided for certain number of transmit antennas. The second part of the thesis focuses on distributed ST code construction for wireless relay channel. The transmission protocol follows a two-hop model wherein the source broadcasts a vector in the first hop and in the second hop the relays transmit a vector that is a transformation of the received vector by a relay-specific unitary transformation. While the source and relays do not have CSI, at the destination we assume two different scenarios (a) destina- tion with complete CSI (b) destination with only the relay-destination CSI. For both these scenarios, we derive a Chernoff bound on the pair-wise error probability and propose code design criteria. For the first case, we provide explicit construction of distributed ST codes with lower decoding complexity compared to codes based on some earlier system models. For the latter case, we propose a novel differential encoding and differential decoding technique and also provide explicit code constructions. At the heart of all these constructions is the cyclic division algebra (CDA) and its matrix representations. We translate the problem of code construction in each of the above scenarios to the problem of constructing CDAs satisfying certain properties. Explicit examples are provided to illustrate each of these constructions.

This thesis addresses the design of low-complexity coding schemes for wireless relay networks and multiple access channels. The first part of the thesis is on wireless relay networks and the second part is on multiple access channels. Distributed space-time coding is a well known technique to achieve spatial diversity in wireless networks wherein, several geographically separated nodes assist a source node to distributively transmit a space-time block code (STBC) to the destination. Such STBCs are referred to as Distributed STBCs (DSTBCs). In the first part of the thesis, we focus on designing full diversity DSTBCs with some nice properties which make them amenable for implementation in practice. Towards that end, a class of full diversity DST-BCs referred to as Co-ordinate Interleaved DSTBCs (CIDSTBCs) are proposed for relay networks with two-antenna relays. To construct CIDSTBCs, a technique called co-ordinate vector interleaving is introduced wherein, the received signals at different antennas of the relay are processed in a combined fashion. Compared to the schemes where the received signals at different antennas of the relay are processed independently, we show that CIDSTBCs provide coding gain which comes in with negligible increase in the processing complexity at the relays. Subsequently, we design single-symbol ML decodable (SSD) DSTBCs for relay networks with single-antenna nodes. In particular, two classes of SSD DSTBCs referred to as (i) Semi-orthogonal SSD Precoded DSTBCs and (ii) Training-Symbol Embedded (TSE) SSD DSTBCs are proposed. A detailed analysis on the maximal rate of such DSTBCs is presented and explicit DSTBCs achieving the maximal rate are proposed. It is shown that the proposed codes have higher rates than the existing SSD DSTBCs. In the second part, we study two-user Gaussian Multiple Access Channels (GMAC). Capacity regions of two-user GMAC are well known. Though, capacity regions of such channels provide insights into the achievable rate pairs in an information theoretic sense, they fail to provide information on the achievable rate pairs when we consider finitary restrictions on the input alphabets and analyze some real world practical signal constellations like QAM and PSK signal sets. Hence, we study the capacity aspects of two-user GMAC with finite input alphabets. In particular, Constellation Constrained (CC) capacity regions of two-user SISO-GMAC are computed for several orthogonal and non-orthogonal multiple access schemes (abbreviated as O-MA and NO-MA schemes respectively). It is first shown that NO-MA schemes strictly offer larger capacity regions than the O-MA schemes for finite input alphabets. Subsequently, for NO-MA schemes, code pairs based on Trellis Coded Modulation (TCM) are proposed such that any rate pair on the CC capacity region can be approached. Finally, we consider a two-user Multiple-Input Multiple-Output (MIMO) fading MAC and design STBC pairs such that ML decoding complexity is reduced.