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 ..

Impact of Transceiver Impairments on the Capacity of Dual-Hop Relay Massive MIMO Systems

Despite the deleterious effect of hardware impairments on communication systems, most prior works have not investigated their impact on widely used relay systems. Most importantly, the application of inexpensive transceivers, being prone to hardware impairments, is the most cost-efficient way for the implementation of massive multiple-input multiple-output (MIMO) systems. Consequently, the direction of this paper is towards the investigation of the impact of hardware impairments on MIMO relay networks with large number of antennas. Specifically, we obtain the general expression for the ergodic capacity of dual-hop (DH) amplify-and-forward (AF) relay systems. Next, given the advantages of the free probability (FP) theory with comparison to other known techniques in the area of large random matrix theory, we pursue a large limit analysis in terms of number of antennas and users by shedding light to the behavior of relay systems inflicted by hardware impairments.Comment: 6 pages, 4 figures, accepted in IEEE Global Communications Conference (GLOBECOM 2015) - Workshop on Massive MIMO: From theory to practice, 201

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

Gaussian Broadcast Channels with an Orthogonal and Bidirectional Cooperation Link

International audienceThis paper considers a system where one transmitter broadcasts a single common message to two receivers linked by a bidirectional cooperation channel, which is assumed to be orthogonal to the downlink channel. Assuming a simplified setup where, in particular, scalar relaying protocols are used and channel coding is not exploited, we want to provide elements of response to several questions of practical interest. Here are the main underlying issues: (1) the way of recombining the signals at the receivers; (2) the optimal number of cooperation rounds; (3) the way of cooperating (symmetrically or asymmetrically, which receiver should start cooperating in the latter case); and (4) the influence of spectral resources. These issues are considered by studying the performance of the assumed system through analytical results when they are derivable and through simulation results. For the particular choices we made, the results sometimes do not coincide with those available for the discrete counterpart of the studied channel

Virtual-MIMO systems with compress-and-forward cooperation

Multiple-input multiple-output (MIMO) systems have recently emerged as one of the most significant wireless techniques, as they can greatly improve the channel capacity and link reliability of wireless communications. These benefits have encouraged extensive research on a virtual MIMO system where the transmitter has multiple antennas and each of the receivers has a single antenna. Single-antenna receivers can work together to form a virtual antenna array and reap some performance benefits of MIMO systems. The idea of receiver-side local cooperation is attractive for wireless networks since a wireless receiver may not have multiple antennas due to size and cost limitations. In this thesis we investigate a virtual-MIMO wireless system using the receiver-side cooperation with the compress-and-forward (CF) protocol. Firstly, to perform CF at the relay, we propose to use standard source coding techniques, based on the analysis of its expected rate bound and the tightness of the bound. We state upper bounds on the system error probabilities over block fading channels. With sufficient source coding rates, the cooperation of the receivers enables the virtual-MIMO system to achieve almost ideal MIMO performance. A comparison of ideal and non-ideal conference links within the receiver group is also investigated. Considering the short-range communication and using a channel-aware adaptive CF scheme, the impact of the non-ideal cooperation link is too slight to impair the system performance significantly. It is also evident that the practicality of CF cooperation will be greatly enhanced if a efficient source coding technique can be used at the relay. It is even more desirable that CF cooperation should not be unduly sensitive to carrier frequency offsets (CFOs). Thus this thesis then presents a practical study of these two issues. Codebook designs of the Voronoi VQ and the tree-structure vector quantization (TSVQ) to enable CF cooperation at the relay are firstly described. A comparison in terms of the codebook design complexity and encoding complexity is presented. It is shown that the TSVQ is much simpler to design and operate, and can achieve a favourable performance-complexity tradeoff. We then demonstrate that CFO can lead to significant performance degradation for the virtual MIMO system. To overcome it, it is proposed to maintain clock synchronization and jointly estimate the CFO between the relay and the destination. This approach is shown to provide a significant performance improvement. Finally, we extend the study to the minimum mean square error (MMSE) detection, as it has a lower complexity compared to maximum likelihood (ML) detection. A closed-form upper bound for the system error probability is derived, based on which we prove that the smallest singular value of the cooperative channel matrix determines the system error performance. Accordingly, an adaptive modulation and cooperation scheme is proposed, which uses the smallest singular value as the threshold strategy. Depending on the instantaneous channel conditions, the system could therefore adapt to choose a suitable modulation type for transmission and an appropriate quantization rate to perform CF cooperation. The adaptive modulation and cooperation scheme not only enables the system to achieve comparable performance to the case with fixed quantization rates, but also eliminates unnecessary complexity for quantization operations and conference link communication

Distributed convolutional-based coding for cooperative systems

Whenever size, power, or other constraints preclude the use of multiple-input multiple-output (MIMO) systems, wireless systems cannot benefit from the well-known advantages of space-time coding (STC) methods. Also the complexity (multiple radio-frequency (RF) front ends at both the transmitter and the receiver), channel estimation, and spatial correlation in centralized MIMO systems degrade the performance. In situations like these, the alternative would be to resort to cooperative communications via multiple relay nodes. When these nodes work cooperatively, they form a virtual MIMO system. The destination receives multiple versions of the same message from the source and one or more relays, and combines these to create diversity. There are two main cooperative diversity techniques for transmission between a pair of nodes through a multiple relay nodes: decode-and-forward (DF) and amplify-and-forward (AF) modes. In the DF mode, the signal received from the source node is demodulated and decoded before retransmission. In the AF mode, the relay node simply amplifies and retransmits the signal received from the source node. No demodulation or decoding of the received signal is performed in this case. In encoded cooperative communication networks, the diversity of the system degrades significantly. This diversity degradation is attributed to the errors made at the relay nodes. Consequently, if better reliability is achieved at the relay nodes, the diversity may improve. or even may be preserved. as compared to the error-free case. In light of this, the objective of this thesis is to devise coding schemes suitable for relay channels that aim at improving the end-to-end performance of such systems. In this thesis, we present a coding scheme suitable for cooperative networks where the source and relays share their antennas to create a virtual transmit array to transmit towards their destination. We focus on the problem of coding for the relay channels. While the relays may use several forwarding strategies, including AF and DF, we focus on coded DF relaying. We derive upper bounded expressions for the bit error rate (BER) assuming M -ary phase shift keying ( M -PSK) transmission and show that the proposed scheme achieves large coding gains and frill diversity relative to the coded non-cooperative case for a wide range of signal-to-noise ratio (SNR) of interest. To improve the detection reliability further, we consider antenna/relay selection on the performance of cooperative networks in conjunction with the distributed coding scheme proposed. For simplicity, we assume that there is one relay that is equipped with n R antennas and only the best antenna is selected. For this scenario, assuming DF and AF relaying, we derive upper bounds on the BER for M -PSK transmission. Our analytical results show that the proposed scheme achieves full diversity for the entire range of BER of interest, unlike the case without antenna selection. In the last part of the thesis, we consider the same system considered in the ideal case but now with system imperfections. In particular, we consider the case when the channel state information is estimated at all nodes involved in the transmission process. We derive upper bounds on the performance with imperfect channel estimation. Our results show that there is a performance degradation due to the presence of channel estimation error. However, the observations made in the case of ideal channel state information still hold for the non-ideal case