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

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Implementation of relay-based systems in wireless cellular networks

Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2010Includes bibliographical references (leaves: 69-72)Text in English; Abstract: Turkish and Englishxiii, 72 leavesThe wireless cellular networks are limited by interference and coverage issues where the users at the edge of the cell usually do not receive enough signal energy. To combat these problems and provide higher signal to interference noise ratio and capacity without increasing the transmit power, the idea of using relays in cellular networks was explored and evaluated in the literature. On the other hand, multiple input multiple output (MIMO) antenna systems have great potential to increase capacity and reliability of a wireless cellular network compared to single input single output systems. Hence, the integration of MIMO systems in the relay-based cellular networks has great potential to meet the growing demands of future communication. In this thesis, we explore the performances in conventional and relay-based wireless systems with single and multiple antennas by ad justing the frequency reuse factor as one and four. We consider wireless cellular based networks where six fixed relays are placed evenly in each cell in a hexagonal layout. A user chooses to receive the transmitted signal either directly from the base station or via one of the relays by employing selection algorithms. Throughout this thesis, we first determine the optimum relay locations considering different relay powers. Then, we investigate the system capacity for the cell with and without relays. Next, we examine the capacity performances by changing the cell diameter and the relay power. Finally, we explore the performances of relay based networks with multiple antennas

Throughput Scaling of Wireless Networks With Random Connections

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) schemes. 2) The $\Theta (n^{1/2})$ throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters. 3) By relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling $\Theta (n)$ is achievable with Pareto-type fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information Theor

An Energy conserving routing scheme for wireless body sensor nanonetwork communication

Current developments in nanotechnology make electromagnetic communication possible at the nanoscale for applications involving body sensor networks (BSNs). This specialized branch of wireless sensor networks, drawing attention from diverse fields, such as engineering, medicine, biology, physics, and computer science, has emerged as an important research area contributing to medical treatment, social welfare, and sports. The concept is based on the interaction of integrated nanoscale machines by means of wireless communications. One key hurdle for advancing nanocommunications is the lack of an apposite networking protocol to address the upcoming needs of the nanonetworks. Recently, some key challenges have been identified, such as nanonodes with extreme energy constraints, limited computational capabilities, terahertz frequency bands with limited transmission range, and so on, in designing protocols for wireless nanosensor networks. This work proposes an improved performance scheme of nanocommunication over terahertz bands for wireless BSNs making it suitable for smart e-health applications. The scheme contains - a new energy-efficient forwarding routine for electromagnetic communication in wireless nanonetworks consisting of hybrid clusters with centralized scheduling; a model designed for channel behavior taking into account the aggregated impact of molecular absorption, spreading loss, and shadowing; and an energy model for energy harvesting and consumption. The outage probability is derived for both single and multilinks and extended to determine the outage capacity. The outage probability for a multilink is derived using a cooperative fusion technique at a predefined fusion node. Simulated using a nano-sim simulator, performance of the proposed model has been evaluated for energy efficiency, outage capacity, and outage probability. The results demonstrate the efficiency of the proposed scheme through maximized energy utilization in both single and multihop communications; multisensor fusion at the fusion node enhances the link quality of the transmission

Joint transceiver design and power optimization for wireless sensor networks in underground mines

Avec les grands développements des technologies de communication sans fil, les réseaux de capteurs sans fil (WSN) ont attiré beaucoup d’attention dans le monde entier au cours de la dernière décennie. Les réseaux de capteurs sans fil sont maintenant utilisés pour a surveillance sanitaire, la gestion des catastrophes, la défense, les télécommunications, etc. De tels réseaux sont utilisés dans de nombreuses applications industrielles et commerciales comme la surveillance des processus industriels et de l’environnement, etc. Un réseau WSN est une collection de transducteurs spécialisés connus sous le nom de noeuds de capteurs avec une liaison de communication distribuée de manière aléatoire dans tous les emplacements pour surveiller les paramètres. Chaque noeud de capteur est équipé d’un transducteur, d’un processeur de signal, d’une unité d’alimentation et d’un émetteur-récepteur. Les WSN sont maintenant largement utilisés dans l’industrie minière souterraine pour surveiller certains paramètres environnementaux, comme la quantité de gaz, d’eau, la température, l’humidité, le niveau d’oxygène, de poussière, etc. Dans le cas de la surveillance de l’environnement, un WSN peut être remplacé de manière équivalente par un réseau à relais à entrées et sorties multiples (MIMO). Les réseaux de relais multisauts ont attiré un intérêt de recherche important ces derniers temps grâce à leur capacité à augmenter la portée de la couverture. La liaison de communication réseau d’une source vers une destination est mise en oeuvre en utilisant un schéma d’amplification/transmission (AF) ou de décodage/transfert (DF). Le relais AF reçoit des informations du relais précédent et amplifie simplement le signal reçu, puis il le transmet au relais suivant. D’autre part, le relais DF décode d’abord le signal reçu, puis il le transmet au relais suivant au deuxième étage s’il peut parfaitement décoder le signal entrant. En raison de la simplicité analytique, dans cette thèse, nous considérons le schéma de relais AF et les résultats de ce travail peuvent également être développés pour le relais DF. La conception d’un émetteur/récepteur pour le relais MIMO multisauts est très difficile. Car à l’étape de relais L, il y a 2L canaux possibles. Donc, pour un réseau à grande échelle, il n’est pas économique d’envoyer un signal par tous les liens possibles. Au lieu de cela, nous pouvons trouver le meilleur chemin de la source à la destination qui donne le rapport signal sur bruit (SNR) de bout en bout le plus élevé. Nous pouvons minimiser la fonction objectif d’erreur quadratique moyenne (MSE) ou de taux d’erreur binaire (BER) en envoyant le signal utilisant le chemin sélectionné. L’ensemble de relais dans le chemin reste actif et le reste des relais s’éteint, ce qui permet d’économiser de l’énergie afin d’améliorer la durée de vie du réseau. Le meilleur chemin de transmission de signal a été étudié dans la littérature pour un relais MIMO à deux bonds mais est plus complexe pour un ...With the great developments in wireless communication technologies, Wireless Sensor Networks (WSNs) have gained attention worldwide in the past decade and are now being used in health monitoring, disaster management, defense, telecommunications, etc. Such networks are used in many industrial and consumer applications such as industrial process and environment monitoring, among others. A WSN network is a collection of specialized transducers known as sensor nodes with a communication link distributed randomly in any locations to monitor environmental parameters such as water level, and temperature. Each sensor node is equipped with a transducer, a signal processor, a power unit, and a transceiver. WSNs are now being widely used in the underground mining industry to monitor environmental parameters, including the amount of gas, water, temperature, humidity, oxygen level, dust, etc. The WSN for environment monitoring can be equivalently replaced by a multiple-input multiple-output (MIMO) relay network. Multi-hop relay networks have attracted significant research interest in recent years for their capability in increasing the coverage range. The network communication link from a source to a destination is implemented using the amplify-and-forward (AF) or decode-and-forward (DF) schemes. The AF relay receives information from the previous relay and simply amplifies the received signal and then forwards it to the next relay. On the other hand, the DF relay first decodes the received signal and then forwards it to the next relay in the second stage if it can perfectly decode the incoming signal. For analytical simplicity, in this thesis, we consider the AF relaying scheme and the results of this work can also be developed for the DF relay. The transceiver design for multi-hop MIMO relay is very challenging. This is because at the L-th relay stage, there are 2L possible channels. So, for a large scale network, it is not economical to send the signal through all possible links. Instead, we can find the best path from source-to-destination that gives the highest end-to-end signal-to-noise ratio (SNR). We can minimize the mean square error (MSE) or bit error rate (BER) objective function by sending the signal using the selected path. The set of relay in the path remains active and the rest of the relays are turned off which can save power to enhance network life-time. The best path signal transmission has been carried out in the literature for 2-hop MIMO relay and for multiple relaying it becomes very complex. In the first part of this thesis, we propose an optimal best path finding algorithm at perfect channel state information (CSI). We consider a parallel multi-hop multiple-input multiple-output (MIMO) AF relay system where a linear minimum mean-squared error (MMSE) receiver is used at the destination. We simplify the parallel network into equivalent series multi-hop MIMO relay link using best relaying, where the best relay ..