No description available.

Dans cette thèse, le compromis entre la consommation d'énergie et le délai dans les réseaux de capteurs sans fil est étudié en exploitant efficacement les liens non fiables. Nous proposons une métrique de l'efficacité énergétique et une métrique de délai moyenne qui sont combinés avec le modèle de lien radio à erreur. En utilisant ces deux métriques et un modèle réaliste de lien radio, nous déduisons la limite inférieure et le front de Pareto du compromis Energie-Délai sont calculés pour trois types de systèmes de communication: la communication multi-saut traditionnelle, la communication opportuniste et la communication coopérative MIMO (CMIMO) dans trois différents canaux: le canal a bruit additif blanc Gaussien, le canal a évanouissements rapides de Rayleigh et le canal a évanouissement de Rayleigh par blocs. Les expressions de ces limites faibles sont obtenues et vérifiées par des simulations bidimensionnelles de réseaux de capteurs distribués aléatoirement. Sur la base de l'expression de la borne inférieure du compromis Energie-Délai, un cadre multi-couche est fourni pour optimiser les paramètres des couches physique, MAC et routage sous contrainte de délai. Les résultats obtenus montrent que pour parvenir à une meilleure performance Energie-Délai, les mécanismes de communication suivants devraient être adoptés selon le type de canal : les communications multi-saut traditionnelles sont les plus performantes pour le canal à bruit additif blanc Gaussien, alors que les communications opportunistes le sont pour les canaux à évanouissements de Rayleigh par blocs et enfin le CMIMO pour les canaux à évanouissements rapides de Rayleigh.

Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lies in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study Automatic Repeat-reQuest (ARQ) mechanism that is applicable with OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the full protocol stack simulation results (including IP/UDP and realistic channel model). In this simulation we revealed that the gain of OR to LR can be even more increased by reducing the head-of-the-line problem in ARQ. Even considering the ANChOR overhead through additional headers and feedbacks, it outperforms the original G.hn setup in data rate up to 40% and in latency up to 60%.:1 Introduction 2 1.1 Intra-flow Network Coding 6 1.2 Random Linear Network Coding (RLNC) 7 2 Performance Limits of Routing Protocols in PowerLine Communications (PLC) 13 2.1 System model 14 2.2 Channel model 14 2.3 Upper bound on the achievable data rate 16 2.4 Achieving the upper bound data rate 17 2.5 Potential gain of Opportunistic Routing Protocol (ORP) over Common Single-path Routing Protocol (CSPR) 19 2.6 Evaluation of ORP potential 19 3 Opportunistic Routing: Realizations and Challenges 24 3.1 Vertex priority and cooperation group 26 3.2 Transmission policy in idealized network 34 3.2.1 Basic Routing Rules (BRR) 36 3.3 Transmission policy in real network 40 3.3.1 Purpose of Network Coding (NC) in ORP 41 3.3.2 Extended Basic Routing Rules (BRR) (BRR-E) 43 3.4 Automatic ReQuest reply (ARQ) 50 3.4.1 Retransmission request message contents 51 3.4.2 Retransmission Request (RR) origination and forwarding 66 3.4.3 Retransmission response 67 3.5 Congestion control 68 3.5.1 Congestion control in our work 70 3.6 Network initialization 74 3.7 Formation of the cooperation groups (coalitions) 76 3.8 Advanced Network Coding based Opportunistic Routing protocol (ANChOR) header 77 3.9 Communication of protocol information 77 3.10 ANChOR simulation . .79 3.10.1 ANChOR information in real time .80 3.10.2 Selection of the coding rate 87 3.10.3 Routing Protocol Information (RPI) broadcasting frequency 89 3.10.4 RR contents 91 3.10.5 Selection of RR forwarder 92 3.10.6 ANChOR stability 92 3.11 Summary 95 4 ANChOR in the Gigabit Home Network (G.hn) Protocol 97 4.1 Compatibility with the PLC protocol stack 99 4.2 Channel and noise model 101 4.2.1 In-home scenario 102 4.2.2 Access network scenario 102 4.3 Physical layer (PHY) layer implementation 102 4.3.1 Bit Allocation Algorithm (BAA) 103 4.4 Multiple Access Control layer (MAC) layer 109 4.5 Logical Link Control layer (LLC) layer 111 4.5.1 Reference Automatic Repeat reQuest (ARQ) 111 4.5.2 Hybrid Automatic Repeat reQuest (HARQ) in ANChOR 114 4.5.3 Modeling Protocol Data Unit (PDU) erasures on LLC 116 4.6 Summary 117 5 Study of G.hn with ANChOR 119 5.1 ARQ analysis 119 5.2 Medium and PHY requirements for “good” cooperation 125 5.3 Access network scenario 128 5.4 In-home scenario 135 5.4.1 Modeling packet erasures 136 5.4.2 Linear Dependence Ratio (LDR) 139 5.4.3 Worst case scenario 143 5.4.4 Analysis of in-home topologies 145 6 Conclusions . . . . . . . . . . . . . . . 154 A Proof of the neccessity of the exclusion rule 160 B Gain of ORPs to CSRPs 163 C Broadcasting rule 165 D Proof of optimality of BRR for triangular topology 167 E Reducing the retransmission probability 168 F Calculation of Expected Average number of transmissions (EAX) for topologies with bi-directional links 170 G Feedback overhead of full coding matrices 174 H Block diagram of G.hn physical layer in ns-3 model 175 I PER to BER mapping 177

The popularity of ubiquitous Internet services has spurred the fast growth of wireless communications by launching data hungry multimedia applications to mobile devices. Powered by spectrum agile cognitive radios, the newly emerged cognitive radio networks (CRN) are proposed to provision the efficient spectrum reuse to improve spectrum utilization. Unlicensed users in CRN, or secondary users (SUs), access the temporarily idle channels in a secondary and opportunistic fashion while preventing harmful interference to licensed primary users (PUs). To effectively detect and exploit the spectrum access opportunities released from a wide spectrum, the heterogeneous wireless channel characteristics and the underlying prioritized spectrum reuse features need to be considered in the protocol design and resource management schemes in CRN, which plays a critical role in unlicensed spectrum sharing among multiple users. The purpose of this dissertation is to address the challenges of utilizing heterogeneous wireless channels in CRN by its intrinsic dynamic and diverse natures, and build the efficient, scalable and, more importantly, practical dynamic spectrum access mechanisms to enable the cost-effective transmissions for unlicensed users. Note that the spectrum access opportunities exhibit the diversity in the time/frequency/space domain, secondary transmission schemes typically follow three design principles including 1) utilizing local free channels within short transmission range, 2) cooperative and opportunistic transmissions, and 3) effectively coordinating transmissions in varying bandwidth. The entire research work in this dissertation casts a systematic view to address these principles in the design of the routing protocols, medium access control (MAC) protocols and radio resource management schemes in CRN. Specifically, as spectrum access opportunities usually have small spatial footprints, SUs only communicate with the nearby nodes in a small area. Thus, multi-hop transmissions in CRN are considered in this dissertation to enable the connections between any unlicensed users in the network. CRN typically consist of intermittent links of varying bandwidth so that the decision of routing is closely related with the spectrum sensing and sharing operations in the lower layers. An efficient opportunistic cognitive routing (OCR) scheme is proposed in which the forwarding decision at each hop is made by jointly considering physical characteristics of spectrum bands and diverse activities of PUs in each single band. Such discussion on spectrum aware routing continues coupled with the sensing selection and contention among multiple relay candidates in a multi-channel multi-hop scenario. An SU selects the next hop relay and the working channel based upon location information and channel usage statistics with instant link quality feedbacks. By evaluating the performance of the routing protocol and the joint channel and route selection algorithm with extensive simulations, we determine the optimal channel and relay combination with reduced searching complexity and improved spectrum utilization. Besides, we investigate the medium access control (MAC) protocol design in support of multimedia applications in CRN. To satisfy the quality of service (QoS) requirements of heterogeneous applications for SUs, such as voice, video, and data, channels are selected to probe for appropriate spectrum opportunities based on the characteristics and QoS demands of the traffic along with the statistics of channel usage patterns. We propose a QoS-aware MAC protocol for multi-channel single hop scenario where each single SU distributedly determines a set of channels for sensing and data transmission to satisfy QoS requirements. By analytical model and simulations, we determine the service differentiation parameters to provision multiple levels of QoS. We further extend our discussion of dynamic resource management to a more practical deployment case. We apply the experiences and skills learnt from cognitive radio study to cellular communications. In heterogeneous cellular networks, small cells are deployed in macrocells to enhance link quality, extend network coverage and offload traffic. As different cells focus on their own operation utilities, the optimization of the total system performance can be analogue to the game between PUs and SUs in CRN. However, there are unique challenges and operation features in such case. We first present challenging issues including interference management, network coordination, and interworking between cells in a tiered cellular infrastructure. We then propose an adaptive resource management framework to improve spectrum utilization and mitigate the co-channel interference between macrocells and small cells. A game-theory-based approach is introduced to handle power control issues under constrained control bandwidth and limited end user capability. The inter-cell interference is mitigated based upon orthogonal transmissions and strict protection for macrocell users. The research results in the dissertation can provide insightful lights on flexible network deployment and dynamic spectrum access for prioritized spectrum reuse in modern wireless systems. The protocols and algorithms developed in each topic, respectively, have shown practical and efficient solutions to build and optimize CRN.

The popularity of ubiquitous Internet services has spurred the fast growth of wireless communications by launching data hungry multimedia applications to mobile devices. Powered by spectrum agile cognitive radios, the newly emerged cognitive radio networks (CRN) are proposed to provision the efficient spectrum reuse to improve spectrum utilization. Unlicensed users in CRN, or secondary users (SUs), access the temporarily idle channels in a secondary and opportunistic fashion while preventing harmful interference to licensed primary users (PUs). To effectively detect and exploit the spectrum access opportunities released from a wide spectrum, the heterogeneous wireless channel characteristics and the underlying prioritized spectrum reuse features need to be considered in the protocol design and resource management schemes in CRN, which plays a critical role in unlicensed spectrum sharing among multiple users. The purpose of this dissertation is to address the challenges of utilizing heterogeneous wireless channels in CRN by its intrinsic dynamic and diverse natures, and build the efficient, scalable and, more importantly, practical dynamic spectrum access mechanisms to enable the cost-effective transmissions for unlicensed users. Note that the spectrum access opportunities exhibit the diversity in the time/frequency/space domain, secondary transmission schemes typically follow three design principles including 1) utilizing local free channels within short transmission range, 2) cooperative and opportunistic transmissions, and 3) effectively coordinating transmissions in varying bandwidth. The entire research work in this dissertation casts a systematic view to address these principles in the design of the routing protocols, medium access control (MAC) protocols and radio resource management schemes in CRN. Specifically, as spectrum access opportunities usually have small spatial footprints, SUs only communicate with the nearby nodes in a small area. Thus, multi-hop transmissions in CRN are considered in this dissertation to enable the connections between any unlicensed users in the network. CRN typically consist of intermittent links of varying bandwidth so that the decision of routing is closely related with the spectrum sensing and sharing operations in the lower layers. An efficient opportunistic cognitive routing (OCR) scheme is proposed in which the forwarding decision at each hop is made by jointly considering physical characteristics of spectrum bands and diverse activities of PUs in each single band. Such discussion on spectrum aware routing continues coupled with the sensing selection and contention among multiple relay candidates in a multi-channel multi-hop scenario. An SU selects the next hop relay and the working channel based upon location information and channel usage statistics with instant link quality feedbacks. By evaluating the performance of the routing protocol and the joint channel and route selection algorithm with extensive simulations, we determine the optimal channel and relay combination with reduced searching complexity and improved spectrum utilization. Besides, we investigate the medium access control (MAC) protocol design in support of multimedia applications in CRN. To satisfy the quality of service (QoS) requirements of heterogeneous applications for SUs, such as voice, video, and data, channels are selected to probe for appropriate spectrum opportunities based on the characteristics and QoS demands of the traffic along with the statistics of channel usage patterns. We propose a QoS-aware MAC protocol for multi-channel single hop scenario where each single SU distributedly determines a set of channels for sensing and data transmission to satisfy QoS requirements. By analytical model and simulations, we determine the service differentiation parameters to provision multiple levels of QoS. We further extend our discussion of dynamic resource management to a more practical deployment case. We apply the experiences and skills learnt from cognitive radio study to cellular communications. In heterogeneous cellular networks, small cells are deployed in macrocells to enhance link quality, extend network coverage and offload traffic. As different cells focus on their own operation utilities, the optimization of the total system performance can be analogue to the game between PUs and SUs in CRN. However, there are unique challenges and operation features in such case. We first present challenging issues including interference management, network coordination, and interworking between cells in a tiered cellular infrastructure. We then propose an adaptive resource management framework to improve spectrum utilization and mitigate the co-channel interference between macrocells and small cells. A game-theory-based approach is introduced to handle power control issues under constrained control bandwidth and limited end user capability. The inter-cell interference is mitigated based upon orthogonal transmissions and strict protection for macrocell users. The research results in the dissertation can provide insightful lights on flexible network deployment and dynamic spectrum access for prioritized spectrum reuse in modern wireless systems. The protocols and algorithms developed in each topic, respectively, have shown practical and efficient solutions to build and optimize CRN.

In der vorliegenden Arbeit werden praktische Protokolle für spontane drahtlose Multi-Hop Maschennetze vorgestellt, diese betrachten das drahtlose System ganzheitlich und berücksichtigen damit die Besonderheiten des drahtlosen Mediums, wie Fading, Interferenz sowie starke Signaldämpfung aufgrund von Entfernung bzw. Hindernissen. Interferenz ist eine Hauptursache für Paketverlust, Durchsatz und Latenz können durch die gleichzeitige Verwendung mehrerer interferenzfreier Kanäle verbessert werden. In Sensor- bzw. Community-Netzen kommt preiswerte und energiesparende Hardware zum Einsatz, die Verwendung zusätzlicher Antennen bzw. Radios ist deshalb nicht möglich. Andererseits werden aber zukünftige drahtlose Netze eine 100-mal höhere Knotendichte, verglichen mit heutigen Netzen, zeigen. Durch die Ausnutzung der im System inhärent vorliegenden Ressource Nutzer (Multi-User Diversität) werden durch Kooperation virtuelle Multi-Antennen und Multi-Radiosysteme aufgebaut. Aufgrund des großen Abstands zwischen den Knoten erreicht man erstens eine hohe räumliche Diversität und zweitens lassen sich damit auch negative Effekte, wie Interferenz zwischen benachbarten Kanälen, minimieren. Es werden Algorithmen sowohl für die Mediumzugriff- als auch die Routing-Schicht vorgestellt. Da keine spezielle physikalische Schicht notwendig ist, kann IEEE 802.11 verwendet werden. Schließlich kann auch auf die bereits heute verfügbare IEEE 802.11 Hardware, die nur eine Kanalumschaltzeit im Millisekundenbereich erlaubt, zurückgegriffen werden. Die zwei vorgestellten Protokolle eignen sich für Umgebungen mit hoher bzw. geringer Interferenz durch fremde WiFi-Netze. Bezüglich Durchsatz werden moderne Protokolle, wie DSR auf Basis von IEEE 802.11 und ETX-Metrik, um ein Vielfaches übertroffen, außerdem ist die Latenz klein und das TCP/IP-Protokoll kann unverändert verwendet werden. / In this work practical protocols are introduced for spontaneous wireless multi-hop mesh networks which contemplate the wireless system integrally and therefore take into account particular features of the wireless medium, like fading, interference as well as strong signal attenuation due to distance or obstacles. Interference is one of the main causes for packet loss. Throughput and latency can be improved by the simultaneous use of several non-interfering channels. In sensor or community networks inexpensive and energy-saving hardware is used. Additional antennas or radios are impossible therefore; on the other hand future wireless networks will show a 100 times higher node density in comparison with today''s networks, however. By the usage of the resource user (multi-user diversity), that is inherently present in the system virtual multi-antennas and multi-radio systems can be built up by cooperation. Firstly, a high spatial diversity can be achieved due to the large distance between the nodes and secondly, negative effects like interference can be minimized between neighboring channels. Algorithms are introduced both for medium access and routing layer. Since a special physical layer is not required IEEE 802.11 can be used. These days already available 802.11 hardware, which allows a channel switching time in milliseconds, is finally usable. The two protocols introduced here are suitable for environments with a high or low interference caused by foreign WiFi networks. Regarding their performance modern protocols like DSR based on 802.11 and ETX metric are surpassed by far. Moreover, the latency is small and the TCP/IP protocol can be used in its unchanged form.

Auf dem Gebiet der drahtlosen Kommunikation und insbesondere auf den tieferen Netzwerkschichten sind gewaltige Fortschritte zu verzeichnen. Innovative Konzepte und Technologien auf der physikalischen Schicht (PHY) gehen dabei zeitnah in zelluläre Netze ein. Drahtlose Maschennetzwerke (WMNs) können mit diesem Innovationstempo nicht mithalten. Die Mehrnutzer-Kommunikation ist ein Grundpfeiler vieler angewandter PHY Technologien, die sich in WMNs nur ungenügend auf die etablierte Schichtenarchitektur abbilden lässt. Insbesondere ist das Problem des Scheduling in WMNs inhärent komplex. Erstaunlicherweise ist der Mehrfachzugriff mit Trägerprüfung (CSMA) in WMNs asymptotisch optimal obwohl das Verfahren eine geringe Durchführungskomplexität aufweist. Daher stellt sich die Frage, in welcher Weise das dem CSMA zugrunde liegende Konzept des konkurrierenden Wettbewerbs (engl. Contention) für die Integration innovativer PHY Technologien verwendet werden kann. Opportunistische Kommunikation ist eine Technik, die die inhärenten Besonderheiten des drahtlosen Kanals ausnutzt. In der vorliegenden Dissertation werden CSMA-basierte Protokolle für die opportunistische Kommunikation in WMNs entwickelt und evaluiert. Es werden dabei opportunistisches Routing (OR) im zustandslosen Kanal und opportunistisches Scheduling (OS) im zustandsbehafteten Kanal betrachtet. Ziel ist es, den Durchsatz von elastischen Paketflüssen gerecht zu maximieren. Es werden Modelle für Überlastkontrolle, Routing und konkurrenzbasierte opportunistische Kommunikation vorgestellt. Am Beispiel von IEEE 802.11 wird illustriert, wie der schichtübergreifende Entwurf in einem Netzwerksimulator prototypisch implementiert werden kann. Auf Grundlage der Evaluationsresultate kann der Schluss gezogen werden, dass die opportunistische Kommunikation konkurrenzbasiert realisierbar ist. Darüber hinaus steigern die vorgestellten Protokolle den Durchsatz im Vergleich zu etablierten Lösungen wie etwa DCF, DSR, ExOR, RBAR und ETT. / In the field of wireless communication, a tremendous progress can be observed especially at the lower layers. Innovative physical layer (PHY) concepts and technologies can be rapidly assimilated in cellular networks. Wireless mesh networks (WMNs), on the other hand, cannot keep up with the speed of innovation at the PHY due to their flat and decentralized architecture. Many innovative PHY technologies rely on multi-user communication, so that the established abstraction of the network stack does not work well for WMNs. The scheduling problem in WMNs is inherent complex. Surprisingly, carrier sense multiple access (CSMA) in WMNs is asymptotically utility-optimal even though it has a low computational complexity and does not involve message exchange. Hence, the question arises whether CSMA and the underlying concept of contention allows for the assimilation of advanced PHY technologies into WMNs. In this thesis, we design and evaluate contention protocols based on CSMA for opportunistic communication in WMNs. Opportunistic communication is a technique that relies on multi-user diversity in order to exploit the inherent characteristics of the wireless channel. In particular, we consider opportunistic routing (OR) and opportunistic scheduling (OS) in memoryless and slow fading channels, respectively. We present models for congestion control, routing and contention-based opportunistic communication in WMNs in order to maximize both throughput and fairness of elastic unicast traffic flows. At the instance of IEEE 802.11, we illustrate how the cross-layer algorithms can be implemented within a network simulator prototype. Our evaluation results lead to the conclusion that contention-based opportunistic communication is feasible. Furthermore, the proposed protocols increase both throughput and fairness in comparison to state-of-the-art approaches like DCF, DSR, ExOR, RBAR and ETT.