\A Ro- bust Node Selection Strategy for Lifetime Extension in Wireless Sensor Networks

Distributed Wireless Sensor Networks (WSNs) consist of energy-constrained sensor nodes that may be deployed in large numbers in order to monitor a given area, track military targets, detect civilian targets or for other purposes. In such densely deployed environments, multiple transmissions can lead to collisions resulting in packet losses and network congestion. This can increase latency and reduce energy efficiency. These networks also feature significant redundancy since nodes close to each other often sense similar data. Therefore, it may be adequate to employ only a subset of the deployed nodes at any given time in the network. In this thesis, node subsets are selected in a manner that coverage and connectivity are consistently achieved. The working subsets are changed after predetermined durations. A framework using concepts from spatial statistics is developed as an approach to selecting the subset of sensor nodes. Proximal nodes negotiate with each other using energy information, to decide which nodes stay working while others go to sleep mode. The algorithm is executed autonomously by the network. The approach presented ensures that the selected subsets while not necessarily exclusive of previous selections covers the region of interest. Simulation results show that the algorithm is robust and retains some level of redundancy. The algorithm shows significant improvement in energy consumption compared with a network with no selection. The selected subset is shown to be able to withstand significant levels of fault in the network. Conclusions regarding the flexibility and application scenarios of the algorithm are drawn and opportunities for future work indicated

Signal Processing for Compressed Sensing Multiuser Detection

The era of human based communication was longly believed to be the main driver for the development of communication systems. Already nowadays we observe that other types of communication impact the discussions of how future communication system will look like. One emerging technology in this direction is machine to machine (M2M) communication. M2M addresses the communication between autonomous entities without human interaction in mind. A very challenging aspect is the fact that M2M strongly differ from what communication system were designed for. Compared to human based communication, M2M is often characterized by small and sporadic uplink transmissions with limited data-rate constraints. While current communication systems can cope with several 100 transmissions, M2M envisions a massive number of devices that simultaneously communicate to a central base-station. Therefore, future communication systems need to be equipped with novel technologies facilitating the aggregation of massive M2M. The key design challenge lies in the efficient design of medium access technologies that allows for efficient communication with small data packets. Further, novel physical layer aspects have to be considered in order to reliable detect the massive uplink communication. Within this thesis physical layer concepts are introduced for a novel medium access technology tailored to the demands of sporadic M2M. This concept combines advances from the field of sporadic signal processing and communications. The main idea is to exploit the sporadic structure of the M2M traffic to design physical layer algorithms utilizing this side information. This concept considers that the base-station has to jointly detect the activity and the data of the M2M nodes. The whole framework of joint activity and data detection in sporadic M2M is known as Compressed Sensing Multiuser Detection (CS-MUD). This thesis introduces new physical layer concepts for CS-MUD. One important aspect is the question of how the activity detection impacts the data detection. It is shown that activity errors have a fundamentally different impact on the underlying communication system than data errors have. To address this impact, this thesis introduces new algorithms that aim at controlling or even avoiding the activity errors in a system. It is shown that a separate activity and data detection is a possible approach to control activity errors in M2M. This becomes possible by considering the activity detection task in a Bayesian framework based on soft activity information. This concept allows maintaining a constant and predictable activity error rate in a system. Beyond separate activity and data detection, the joint activity and data detection problem is addressed. Here a novel detector based on message passing is introduced. The main driver for this concept is the extrinsic information exchange between different entities being part of a graphical representation of the whole estimation problem. It can be shown that this detector is superior to state-of-the-art concepts for CS-MUD. Besides analyzing the concepts introduced simulatively, this thesis also shows an implementation of CS-MUD on a hardware demonstrator platform using the algorithms developed within this thesis. This implementation validates that the advantages of CS-MUD via over-the-air transmissions and measurements under practical constraints

Improved Spatial Modulation Techniques for Wireless Communications

Transmission and reception methods with multiple antennas have been demonstrated to be very useful in providing high data rates and improving reliability in wireless communications. In particular, spatial modulation (SM) has recently emerged as an attractive transmission method for multiple-antennas systems due to its better energy efficiency and lower system complexity. This thesis is concerned with developing transmission techniques to improve the spectral efficiency of SM where antenna/subcarrier index involves in conveying information bits. In the first part of the thesis, new transmission techniques are developed for SM over frequency-flat fading channels. The first proposed scheme is based on a high-rate space-time block code instead of using the classical Alamouti STBC, which helps to increase the spectral efficiency and achieve a transmit diversity order of two. A simplified maximum likelihood detection is also developed for this proposed scheme. Analysis of coding gains and simulation results demonstrate that the proposed scheme outperforms previously-proposed SM schemes at high data transmission rates. Then, a new space-shift keying (SSK) modulation scheme is proposed which requires a smaller number of transmit antennas than that required in the bi-space shift keying (BiSSK). Such a proposed SSK-based scheme is obtained by multiplexing two in-phase and quadrature generalized SSK streams and optimizing the carrier signals transmitted by the activated antennas. Performance of the proposed scheme is compared with other SSK-based schemes via minimum Euclidean distance analysis and computer simulation. The third scheme proposed in this part is an improved version of quadrature SM (QSM). The main feature of this proposed scheme is to send a second constellation symbol over the in-phase and quadrature antenna dimensions. A significant performance advantage of the proposed scheme is realized at the cost of a slight increase in the number of radio-frequency (RF) chains. Performance comparisons with the most recent SM schemes confirm the advantage of the proposed scheme. The last contribution of the first part is an optimal constellation design for QSM to minimize the average probability of error. It is shown that, the error performance of QSM not only depends on the Euclidean distances between the amplitude phase modulation (APM) symbols and the energies of APM symbols, but also on the in-phase and quadrature components of the QSM symbols. The analysis of the union bound of the average error probability reveals that at a very large number of transmit antennas, the optimal constellations for QSM converge to a quadrature phase shift keying (QPSK) constellation. Simulation results demonstrate the performance superiority of the obtained constellations over other modulation schemes. In the second part of the thesis, the applications of SM in frequency-selective fading channels are studied. First, a new transmission scheme that employs SM for each group of subcarriers in orthogonal frequency-division multiplexing (OFDM) transmission is investigated. Specifically, OFDM symbols in each group are passed through a precoder to maximize the diversity and coding gains, while SM is applied in each group to convey more information bits by antenna indices. Performance analysis and simulation results are carried out to demonstrate the superiority of the proposed scheme over a previously-proposed combination of SM and OFDM. Next, the performance of OFDM based on index modulation and a flexible version of OFDM, knows as OFDM with multiple constellations, is compared for both case of "no precoding'' and "with precoding'' of data symbols. It is shown that the precoded OFDM with multiple constellations outperforms precoded-IM based OFDM systems over frequency-selective fading channels. The last part of the thesis investigates a multiuser downlink transmission system based on in-phase and quadrature space-shift keying modulation and precoding to reduce the minimum number of transmit antennas while keeping the complexity of the receiver low. In addition to the maximum likelihood (ML) detection, the low complexity zero forcing (ZF) receiver is also studied. Theoretical upper bounds for the error probabilities of both ML and ZF receivers are obtained and corroborated with simulation results

Telecommunication Systems

This book is based on both industrial and academic research efforts in which a number of recent advancements and rare insights into telecommunication systems are well presented. The volume is organized into four parts: "Telecommunication Protocol, Optimization, and Security Frameworks", "Next-Generation Optical Access Technologies", "Convergence of Wireless-Optical Networks" and "Advanced Relay and Antenna Systems for Smart Networks." Chapters within these parts are self-contained and cross-referenced to facilitate further study