Generalized Adaptive Network Coding Aided Successive Relaying Based Noncoherent Cooperation

A generalized adaptive network coding (GANC) scheme is conceived for a multi-user, multi-relay scenario, where the multiple users transmit independent information streams to a common destination with the aid of multiple relays. The proposed GANC scheme is developed from adaptive network coded cooperation (ANCC), which aims for a high flexibility in order to: 1) allow arbitrary channel coding schemes to serve as the cross-layer network coding regime; 2) provide any arbitrary trade-off between the throughput and reliability by adjusting the ratio of the source nodes and the cooperating relay nodes. Furthermore, we incorporate the proposed GANC scheme in a novel successive relaying aided network (SRAN) in order to recover the typical 50% half-duplex relaying-induced throughput loss. However, it is unrealistic to expect that in addition to carrying out all the relaying functions, the relays could additionally estimate the source-to-relay channels. Hence noncoherent detection is employed in order to obviate the power-hungry channel estimation. Finally, we intrinsically amalgamate our GANC scheme with the joint network-channel coding (JNCC) concept into a powerful three-stage concatenated architecture relying on iterative detection, which is specifically designed for the destination node (DN). The proposed scheme is also capable of adapting to rapidly time-varying network topologies, while relying on energy-efficient detection

Reliable Transmission of Short Packets through Queues and Noisy Channels under Latency and Peak-Age Violation Guarantees

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary memoryless Bernoulli process, placed in a single-server queue and then transmitted over a wireless channel. A variable-length stop-feedback coding scheme---a general strategy that encompasses simple automatic repetition request (ARQ) and more sophisticated hybrid ARQ techniques as special cases---is used by the transmitter to convey the information packets to the receiver. By leveraging finite-blocklength results, the delay violation and the peak-age violation probabilities are characterized without resorting to approximations based on large-deviation theory as in previous literature. Numerical results illuminate the dependence of delay and peak-age violation probability on system parameters such as the frame size and the undetected error probability, and on the chosen packet-management policy. The guidelines provided by our analysis are particularly useful for the design of low-latency ultra-reliable communication systems.Comment: To appear in IEEE journal on selected areas of communication (IEEE JSAC

Cross-layer design for wireless sensor relay networks

In recent years, the idea of wireless sensor networks has gathered a great deal of attention. A distributed wireless sensor network may have hundreds of small sensor nodes. Each individual sensor contains both processing and communication elements and is designed in some degree to monitor the environmental events specified by the end user of the network. Information about the environment is gathered by sensors and delivered to a remote collector. This research conducts an investigation with respect to the energy efficiency and the cross-layer design in wireless sensor networks. Motivated by the multipath utilization and transmit diversity capability of space-time block codes (STBC), a new energy efficient cooperative routing algorithm using the STBC is proposed. Furthermore, the steady state performance of the network is analyzed via a Markov chain model. The proposed approach in this dissertation can significantly reduce the energy consumption and improve the power efficiency. This work also studies the application of differential STBC for wireless multi-hop sensor networks over fading channels. Using differential STBC, multiple sensors are selected acting as parallel relay nodes to receive and relay collected data. The proposed technique offers low complexity, since it does not need to track or estimate the time-varying channel coefficients. Analysis and simulation results show that the new approach can improve the system performance. This dissertation models the cooperative relay method for sensor networks using a Markov chain and an M/G/1 queuing system. The analytical and simulation results indicate system improvements in terms of throughput and end-to-end delay. Moreover, the impact of network resource constraints on the performance of multi-hop sensor networks with cooperative relay is also investigated. The system performance under assumptions of infinite buffer or finite buffer sizes is studied, the go through delay and the packet drop probability are improved compared to traditional single relay method. Moreover, a packet collision model for crucial nodes in wireless sensor networks is introduced. Using such a model, a space and network diversity combining (SNDC) method is designed to separate the collision at the collector. The network performance in terms of throughput, delay, energy consumption and efficiency are analyzed and evaluated

Sparse Signal Processing and Statistical Inference for Internet of Things

Data originating from many devices within the Internet of Things (IoT) framework can be modeled as sparse signals. Efficient compression techniques of such data are essential to reduce the memory storage, bandwidth, and transmission power. In this thesis, I develop some theory and propose practical schemes for IoT applications to exploit the signal sparsity for efficient data acquisition and compression under the frameworks of compressed sensing (CS) and transform coding. In the context of CS, the restricted isometry constant of finite Gaussian measurement matrices is investigated, based on the exact distributions of the extreme eigenvalues of Wishart matrices. The analysis determines how aggressively the signal can be sub-sampled and recovered from a small number of linear measurements. The signal reconstruction is guaranteed, with a predefined probability, via various recovery algorithms. Moreover, the measurement matrix design for simultaneously acquiring multiple signals is considered. This problem is important for IoT networks, where a huge number of nodes are involved. In this scenario, the presented analytical methods provide limits on the compression of joint sparse sources by analyzing the weak restricted isometry constant of Gaussian measurement matrices. Regarding transform coding, two efficient source encoders for noisy sparse sources are proposed, based on channel coding theory. The analytical performance is derived in terms of the operational rate-distortion and energy-distortion. Furthermore, a case study for the compression of real signals from a wireless sensor network using the proposed encoders is considered. These techniques can reduce the power consumption and increase the lifetime of IoT networks. Finally, a frame synchronization mechanism has been designed to achieve reliable radio links for IoT devices, where optimal and suboptimal metrics for noncoherent frame synchronization are derived. The proposed tests outperform the commonly used correlation detector, leading to accurate data extraction and reduced power consumption

A highly efficient receiver for satellite-based Automatic Identification System signal detection

An innovative receiver architecture for the satellitebased Automatic Identification System (AIS) has been recently proposed. In this paper, we describe a few modifications that can be introduced on the algorithms for synchronization and detection, that provide an impressive performance improvement with respect to the previous system. The receiver architecture has been designed for an on-board implementation, and for this reason all algorithms have been realized keeping the complexity as low as possible. A prototype for the proposed receiver has been implemented by the University of Parma and CGS S.p.A. Compagnia Generale per 10 Spazio under the ESA project FENICE

Distance Bounding Protocols on TH-UWB Link and their Analysis over Noisy Channels

Relay attacks represent nowadays a critical threat to authentication protocols. They cab be thwarted by deploying distance bounding protocols on an UWB radio. Exploiting the characteristics of time-hopping UWB radios to enhance distance bounding protocols leads to two design strategies. The first one is based on a secret time-hopping code while the mapping code is public. The second strategy exploits a secret mapping code with a public time-hopping code. The merits of each strategy are established over noise-free and noist channels as well as for different radio parameters

Low-resolution ADC receiver design, MIMO interference cancellation prototyping, and PHY secrecy analysis.

This dissertation studies three independent research topics in the general field of wireless communications. The first topic focuses on new receiver design with low-resolution analog-to-digital converters (ADC). In future massive multiple-input-multiple-output (MIMO) systems, multiple high-speed high-resolution ADCs will become a bottleneck for practical applications because of the hardware complexity and power consumption. One solution to this problem is to adopt low-cost low-precision ADCs instead. In Chapter II, MU-MIMO-OFDM systems only equipped with low-precision ADCs are considered. A new turbo receiver structure is proposed to improve the overall system performance. Meanwhile, ultra-low-cost communication devices can enable massive deployment of disposable wireless relays. In Chapter III, the feasibility of using a one-bit relay cluster to help a power-constrained transmitter for distant communication is investigated. Nonlinear estimators are applied to enable effective decoding. The second topic focuses prototyping and verification of a LTE and WiFi co-existence system, where the operation of LTE in unlicensed spectrum (LTE-U) is discussed. LTE-U extends the benefits of LTE and LTE Advanced to unlicensed spectrum, enabling mobile operators to offload data traffic onto unlicensed frequencies more efficiently and effectively. With LTE-U, operators can offer consumers a more robust and seamless mobile broadband experience with better coverage and higher download speeds. As the coexistence leads to considerable performance instability of both LTE and WiFi transmissions, the LTE and WiFi receivers with MIMO interference canceller are designed and prototyped to support the coexistence in Chapter IV. The third topic focuses on theoretical analysis of physical-layer secrecy with finite blocklength. Unlike upper layer security approaches, the physical-layer communication security can guarantee information-theoretic secrecy. Current studies on the physical-layer secrecy are all based on infinite blocklength. Nevertheless, these asymptotic studies are unrealistic and the finite blocklength effect is crucial for practical secrecy communication. In Chapter V, a practical analysis of secure lattice codes is provided