QoS in LEO satellite networks with multipacket reception

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e TecnologiaLow Earth Orbit (LEO) satellite networks can improve terrestrial wireless networks to allow global broadband services for Mobile Terminals (MT), regardless of the users' location. In this context, hybrid telecommunication systems combining satellites with Long Term Evolution (LTE) networks, like the LightSquared technology, are intended to provide ubiquitous high-speed services. This dissertation analyses the performance of a random access protocol that uses Hybrid Network-assisted Diversity Multiple Access (H-NDMA), for a LEO satellite system network, named by Satellite Random NDMA (SR-NDMA). The protocol also considers a Single Carrier-Frequency Domain Equalization (SC-FDE) scheme for the uplink transmission and a Multipacket Reception (MPR) receiver. In this scenario, the transmission of data packets between MTs and the Base Station (BS) is made through random access and schedule access slots, organized into super-frames with the duration of a Round Trip Time (RTT). A SR-NDMA simulator is implemented to measure the system performance in matters of throughput, energy consumption, system delay and also the protocol capacity to meet Quality of Service (QoS) requirements. A set of simulations tests were made with a random Poisson process tra c generation to validate the analytical model. The capacity to ful l the QoS requirements of a real-time tra c class was also tested.FCT/MEC: MPSat - PTDC/EEA-TEL/099074/2008, OPPORTUNISTIC CR - PTDC/EEA-TEL/115981/2009, Femtocells - PTDC/EEA-TEL/120666/2010 e ADIN - PTDC/EEI-TEL/2990/201

Time diversity solutions to cope with lost packets

A dissertation submitted to Departamento de Engenharia Electrotécnica of Faculdade de Ciências e Tecnologia of Universidade Nova de Lisboa in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engenharia Electrotécnica e de ComputadoresModern broadband wireless systems require high throughputs and can also have very high Quality-of-Service (QoS) requirements, namely small error rates and short delays. A high spectral efficiency is needed to meet these requirements. Lost packets, either due to errors or collisions, are usually discarded and need to be retransmitted, leading to performance degradation. An alternative to simple retransmission that can improve both power and spectral efficiency is to combine the signals associated to different transmission attempts. This thesis analyses two time diversity approaches to cope with lost packets that are relatively similar at physical layer but handle different packet loss causes. The first is a lowcomplexity Diversity-Combining (DC) Automatic Repeat reQuest (ARQ) scheme employed in a Time Division Multiple Access (TDMA) architecture, adapted for channels dedicated to a single user. The second is a Network-assisted Diversity Multiple Access (NDMA) scheme, which is a multi-packet detection approach able to separate multiple mobile terminals transmitting simultaneously in one slot using temporal diversity. This thesis combines these techniques with Single Carrier with Frequency Division Equalizer (SC-FDE) systems, which are widely recognized as the best candidates for the uplink of future broadband wireless systems. It proposes a new NDMA scheme capable of handling more Mobile Terminals (MTs) than the user separation capacity of the receiver. This thesis also proposes a set of analytical tools that can be used to analyse and optimize the use of these two systems. These tools are then employed to compare both approaches in terms of error rate, throughput and delay performances, and taking the implementation complexity into consideration. Finally, it is shown that both approaches represent viable solutions for future broadband wireless communications complementing each other.Fundação para a Ciência e Tecnologia - PhD grant(SFRH/BD/41515/2007); CTS multi-annual funding project PEst-OE/EEI/UI0066/2011, IT pluri-annual funding project PEst-OE/EEI/LA0008/2011, U-BOAT project PTDC/EEATEL/ 67066/2006, MPSat project PTDC/EEA-TEL/099074/2008 and OPPORTUNISTICCR project PTDC/EEA-TEL/115981/200

Performance analysis and protocol design for multipacket reception in wireless networks.

Zheng, Pengxuan.Thesis (M.Phil.)--Chinese University of Hong Kong, 2007.Includes bibliographical references (leaves 53-57).Abstracts in English and Chinese.Abstract --- p.iAcknowledgments --- p.vTable of Contents --- p.viList of Figures --- p.viiiList of Tables --- p.ixChapter Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Motivation --- p.1Chapter 1.2 --- Related Work --- p.2Chapter 1.3 --- Our Contribution --- p.3Chapter 1.4 --- Organization of the Thesis --- p.4Chapter Chapter 2 --- Background Overview --- p.6Chapter 2.1.1 --- Traditional Wireless Networks --- p.6Chapter 2.2 --- Exponential Backoff --- p.7Chapter 2.2.1 --- Introduction --- p.7Chapter 2.2.2 --- Algorithm --- p.8Chapter 2.2.3 --- Assumptions --- p.9Chapter 2.3 --- System Description --- p.9Chapter 2.3.1 --- MPR Capability --- p.9Chapter 2.3.2 --- Backoff Slot --- p.10Chapter 2.3.3 --- Carrier-sensing and Non-carrier-sensing Systems --- p.11Chapter Chapter 3 --- Multipacket Reception in WLAN --- p.12Chapter 3.1 --- MAC Protocol Description --- p.13Chapter 3.2 --- Physical Layer Methodology --- p.16Chapter 3.2.1 --- Blind RTS Separation --- p.17Chapter 3.2.2 --- Data Packet Detection --- p.19Chapter Chapter 4 --- Exponential Backoff with MPR --- p.21Chapter 4.1 --- Analytical Model --- p.22Chapter 4.1.1 --- Markov Model --- p.22Chapter 4.1.2 --- Relations betweenpt andpc --- p.23Chapter 4.2 --- Simulation Settings --- p.26Chapter 4.3 --- Asymptotic Behavior of Exponential Backoff --- p.27Chapter 4.3.1 --- Convergence ofpt andpc --- p.27Chapter 4.3.2 --- Convergence of Npt --- p.29Chapter Chapter 5 --- Non-carrier-sensing System --- p.31Chapter 5.1 --- Performance Analysis --- p.31Chapter 5.1.1 --- Throughput Derivation --- p.31Chapter 5.1.2 --- Throughput Analysis --- p.32Chapter 5.1.3 --- Convergence of S --- p.36Chapter 5.2 --- Infinite Population Model --- p.38Chapter 5.2.1 --- Attempt Rate --- p.38Chapter 5.2.2 --- Asymptotic Throughput of Non-carrier-sensing System --- p.39Chapter Chapter 6 --- Carrier-sensing System --- p.43Chapter 6.1 --- Throughput Derivation --- p.43Chapter 6.2 --- Asymptotic Behavior --- p.44Chapter Chapter 7 --- General MPR Model --- p.48Chapter Chapter 8 --- Conclusions --- p.51Bibliography --- p.5

Serviços pós-4G em redes de satélite LEO com recepção multi-pacote e com handover

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de ComputadoresUm pacote com erros, quer seja devido à existência de colisões ou ruído no canal, é normalmente descartado e necessita de ser retransmitido, levando a perdas de desempenho. A junção do protocolo H-ARQ (Hybrid Automatic Retransmission reQuest) com técnicas de recepção multi-pacote e com diversidade temporal como o NDMA (Network Diversity Multiple Access), melhoram o desempenho, visto terem a capacidade de pedir transmissões extra e combinar todos os sinais recebidos no mesmo período. Contudo, o atraso provocado pelo tempo de ida e volta na comunicação com uma rede de satélites, limita o número de retransmissões que possam ser pedidas pelos terminais para garantir qualidade de serviço. Esta tese considera o desenho de um protocolo híbrido que combina H-ARQ com NDMA para redes satélites com tráfego atribuído a pedido. O protocolo S-NDMA (Satellite NDMA) é apresentado, juntamente com modelos analíticos para o seu desempenho. É analisada a sua eficiência energética, tendo em conta requisitos de qualidade de serviço (QoS). O sistema é feito para satélites de órbita baixa (LEO) e com SC-FDE (Single-Carrier with Frequency Domain Equalization). É feita também uma comparação de desempenhos deste esquema com H-NDMA (Hybrid-NDMA), mostrando que é eficiente em termos energéticos e que cumpre requisitos de QoS para serviços exigentes como videochamadas. São necessários vários satélites para cobrir uma vasta área do planeta. Como os satélites estão em constante movimento, a zona de cobertura associada a cada satélite também se desloca. Isto leva a uma necessidade do terminal móvel trocar constantemente de ligação para um novo satélite. Nesta dissertação são propostos dois esquemas para S-NDMA: o tradicional com interrupção temporária de ligação, e um novo com continuidade de ligação baseado em SIMO distribuído. São estudadas a viabilidade e desempenho dos dois esquemas, analisando-se a eficiência energética, o efeito de Doppler, o ponto óptimo de troca e o atraso no tempo na comunicação entre terminais móveis e satélites

Relay-assisted Multiple Access with Full-duplex Multi-Packet Reception

The effect of full-duplex cooperative relaying in a random access multiuser network is investigated here. First, we model the self-interference incurred due to full-duplex operation, assuming multi-packet reception capabilities for both the relay and the destination node. Traffic at the source nodes is considered saturated and the cooperative relay, which does not have packets of its own, stores a source packet that it receives successfully in its queue when the transmission to the destination has failed. We obtain analytical expressions for key performance metrics at the relay, such as arrival and service rates, stability conditions, and average queue length, as functions of the transmission probabilities, the self interference coefficient, and the links' outage probabilities. Furthermore, we study the impact of the relay node and the self-interference coefficient on the per-user and aggregate throughput, and the average delay per packet. We show that perfect self-interference cancelation plays a crucial role when the SINR threshold is small, since it may result to worse performance in throughput and delay comparing with the half-duplex case. This is because perfect self-interference cancelation can cause an unstable queue at the relay under some conditions.Comment: Accepted for publication in the IEEE Transactions on Wireless Communication

COOPERATIVE NETWORKING AND RELATED ISSUES: STABILITY, ENERGY HARVESTING, AND NEIGHBOR DISCOVERY

This dissertation deals with various newly emerging topics in the context of cooperative networking. The first part is about the cognitive radio. To guarantee the performance of high priority users, it is important to know the activity of the high priority communication system but the knowledge is usually imperfect due to randomness in the observed signal. In such a context, the stability property of cognitive radio systems in the presence of sensing errors is studied. General guidelines on controlling the operating point of the sensing device over its receiver operating characteristics are also given. We then consider the hybrid of different modes of operation for cognitive radio systems with time-varying connectivity. The random connectivity gives additional chances that can be utilized by the low priority communication system. The second part of this dissertation is about the random access. We are specifically interested in the scenario when the nodes are harvesting energy from the environment. For such a system, we accurately assess the effect of limited, but renewable, energy availability on the stability region. The effect of finite capacity batteries is also studied. We next consider the exploitation of diversity amongst users under random access framework. That is, each user adapts its transmission probability based on the local channel state information in a decentralized manner. The impact of imperfect channel state information on the stability region is investigated. Furthermore, it is compared to the class of stationary scheduling policies that make centralized decisions based on the channel state feedback. The backpressure policy for cross-layer control of wireless multi-hop networks is known to be throughput-optimal for i.i.d. arrivals. The third part of this dissertation is about the backpressure-based control for networks with time-correlated arrivals that may exhibit long-range dependency. It is shown that the original backpressure policy is still throughput-optimal but with increased average network delay. The case when the arrival rate vector is possibly outside the stability region is also studied by augmenting the backpressure policy with the flow control mechanism. Lastly, the problem of neighbor discovery in a wireless sensor network is dealt. We first introduce the realistic effect of physical layer considerations in the evaluation of the performance of logical discovery algorithms by incorporating physical layer parameters. Secondly, given the lack of knowledge of the number of neighbors along with the lack of knowledge of the individual signal parameters, we adopt the viewpoint of random set theory to the problem of detecting the transmitting neighbors. Random set theory is a generalization of standard probability theory by assigning sets, rather than values, to random outcomes and it has been applied to multi-user detection problem when the set of transmitters are unknown and dynamically changing

CROSS-LAYER ASPECTS OF COGNITIVE WIRELESS NETWORKS

We study cognitive wireless networks from a cross-layer perspective, where we investigate the effects of the PHY layer parameters and enhancements on the MAC layer performance. We quantify the benefit of using sophisticated techniques such as cooperative communications and network coding in cognitive networks. The first part deals with unicast scenarios. We first study the problem of random access over time varying channels with cognitive nodes adjusting their access probabilities according to the decentralized channel state information they acquire at the PHY layer. We derive the conditions for our random access scheme to outperform orthogonal access. We then study the case where a set of secondary users (SUs) opportunistically accesses the primary user's (PU) spectrum whenever it is idle. Since sensing errors are unavoidable, we study the effect of the interference from the SUs on the stable throughput of the PU. We then compute the range of the SUs' transmission parameters that guarantees the stability of the PU queue. In order to balance the negative effects of the interference from the SUs, we propose a PHY layer relaying protocol between the PU and SU networks that is based on distributed orthogonal space-time block codes. Under this protocol, it is shown that the PU's throughput gain from relaying increases with the number of SUs. Moreover, the SUs might benefit from relaying the PU's packets as well. Next, we propose and analyze access schemes at the SUs aiming at exploiting the SU's knowledge of the statistics of various channels and of the average arrival rate to the PU. The motivation is that although the traditional opportunistic spectrum access (OSA) guarantees full protection to the PUs, it is sometimes too conservative if the interference caused by the SUs at the PU receiver is negligible. We derive the conditions under which schemes without sensing outperform schemes with sensing since they offer to the SU more data transmission duration. The second part of the dissertation deals with cognitive multicasting networks. First, we study relay assisted multicasting. The relay delivers the unsuccessful packets of the source during the idle slots of the source which are determined by sensing. This avoids allocating any explicit resources to the relay. We then substantiate the benefit of using network coding (NC) at the relay. Finally, we study the problem of reliable spectrum sensing and opportunistic access on channels with stochastic traffic in batch processing systems such as NC. We show how an SU can leverage the structure induced by block-based NC on PUs' channels to mitigate the effects of channel sensing errors and improve the throughput. We consider two different objectives at the SU: quickest detection of an idle slot and throughput maximization. We validate our results with real radio measurements taken in software-defined radio based wireless network tests

Spectrum Sensing and Multiple Access Schemes for Cognitive Radio Networks

Increasing demands on the radio spectrum have driven wireless engineers to rethink approaches by which devices should access this natural, and arguably scarce, re- source. Cognitive Radio (CR) has arisen as a new wireless communication paradigm aimed at solving the spectrum underutilization problem. In this thesis, we explore a novel variety of techniques aimed at spectrum sensing which serves as a fundamental mechanism to find unused portions of the electromagnetic spectrum. We present several spectrum sensing methods based on multiple antennas and evaluate their receiving operating characteristics. We study a cyclostationary feature detection technique by means of multiple cyclic frequencies. We make use of a spec- trum sensing method called sequential analysis that allows us to significantly decrease the time needed for detecting the presence of a licensed user. We extend this scheme allowing each CR user to perform the sequential analysis algorithm and send their local decision to a fusion centre. This enables for an average faster and more accurate detection. We present an original technique for accounting for spatial and temporal cor- relation influence in spectrum sensing. This reflects on the impact of the scattering environment on detection methods using multiple antennas. The approach is based on the scattering geometry and resulting correlation properties of the received signal at each CR device. Finally, the problem of spectrum sharing for CR networks is addressed in or- der to take advantage of the detected unused frequency bands. We proposed a new multiple access scheme based on the Game Theory. We examine the scenario where a random number of CR users (considered as players) compete to access the radio spec- trum. We calculate the optimal probability of transmission which maximizes the CR throughput along with the minimum harm caused to the licensed users’ performance

TOWARD LAYERLESS COOPERATION AND RATE CONTROL IN WIRELESS MULTI-ACCESS CHANNELS

In wireless networks, a transmitted message may successfully reach multiple nodes simultaneously, which is referred to as the Wireless Multicast Advantage. As such, intermediate nodes have the ability to capture the message and then contribute to the communication toward the ultimate destination by cooperatively relaying the received message. This enables cooperative communication, which has been shown to counteract the effects of fading and attenuation in wireless networks. There has been a great deal of work addressing cooperative methods and their resulting benefits, but most of the work to date has focused on physical-layer techniques and on information-theoretic considerations. While compatible with these, the main thrust of this dissertation is to explore a new approach by implementing cooperation at the network layer. First, we illustrate the idea in a multi-hop multi-access wireless network, in which a set of source users generate packets to deliver to a common destination. An opportunistic and dynamic cooperation protocol is proposed at the network level, where users with a better channel to the destination have the capability and option to relay packets from users that are farther afield. The proposed mode of cooperation protocol is new and relies on MAC/Network-level of relaying, but also takes into account physical-layer parameters that determine successful reception at the destination and/or the relay. We explicitly characterize the stable throughput and average delay performance. Our analysis reveals that cooperation at the network layer leads to substantial performance gains for both performance metrics. Next, on top of the network-layer cooperation, we investigate enhanced cooperative techniques that exploit more sophisticated physical-layer properties. Specifically, we consider dynamic decode-and-forward, superposition coding, and multipacket reception capability, and we quantify the extent to which the enhancement techniques can further improve the stable throughput region. Then we revert back to the two-user multi-access channel with single-packet reception, which has been extensively studied in the case of no cooperation. After cooperation is permitted between the two users, we revisit the relationship between the stability region and the throughput region under both scheduled access and random access schemes. Finally, we shift our focus from the packet-level to bit-level multi-access channels. By exploiting the bit-nature of a packet, we create a bridge between traditional physical-layer-based transmission rates and classical MAC/Network-layer-based throughput rates. We first obtain the closed form of the stability region in bits/slot. Then, as a separate, but related issue, we look at the minimum delivery time policy; for any initial queue size vector, the optimal policy that empties all bits in the system within the shortest time is characterized