Literature Database Entry


Hermann Lichte, "Quantifying and Reducing the Cost of Cooperative Relaying in Wireless Multi-Hop Networks," PhD Thesis (Dissertation), Institute of Computer Science, University of Paderborn, June 2011. (Advisor: Holger Karl; Referee: Falko Dressler)


Fast and reliable data transmission in wireless networks is hard to achieve due to interference and fading. Interference limits spatial reuse in the network and fading leads to high error rates for transmissions. These error rates can be exponentially reduced by cooperative relaying. With this approach, neighboring nodes can help the transmission by repeating the signal via independent channels. In large wireless multi-hop networks, this poses two major problems. First, the additional transmission of relays causes additional interference. To achieve a desired outage capacity, receivers span guard zones to mitigate interference and thereby affect spatial reuse by consuming area – the so-called spatial consumption. Second, retransmission requires additional channel resources which typically reduces data rate – the so-called multiplexing loss. Without careful studies it is not obvious when these costs pay off. Therefore, I study how the additional interference due to relaying affects the network's performance in two steps: First, I analyze the spatial consumption of the cooperative transmission using geometry. Second, I combine this analysis with outage capacity expressions. With the resulting analytical framework, I show that although relays require additional space by blocking neighbors, the diversity gain compensates for interference. I identify the operating regions of cooperative relaying and show that, especially at high robustness requirements, cooperative relaying even leads to better spatial reuse than conventional transmission approaches. To reduce multiplexing loss for unicasts, I develop a routing-informed Medium Access Control (MAC) protocol that schedules a single relay retransmission such that it assists in two successive point-to-point transmissions, so-called two-for-one cooperation. I show how to integrate the proposed protocol into the IEEE 802.11 Wireless Local Area Network (WLAN) standard by modifying an open-source Linux WLAN driver. Measurement results show the efficiency of two-for-one cooperation in multi-hop networks. Contrary to unicasts, multiplexing loss is not a cost anymore for broadcasts as in this case retransmissions happen anyway. Thus, to make broadcasts robust against fading, cooperative relaying can be used without sacrificing data rate. To broadcast as quickly as possible (i.e., with low latency), only a subset of nodes should retransmit messages. I find that existing heuristics for determining this so-called broadcast set have poor delivery ratios with fading channels. I identify the static unit disk model of transmission ranges to be the source of the problem and propose a probabilistic model as a replacement. I additionally exploit cooperation diversity during construction of the broadcast set to gain improved reliability while still keeping the size of the set and hence the latency low. Simulation results show that the proposed Probabilistic Cooperation Diversity Broadcast (PCDB) decreases the time for broadcasts while still distributing packets to all nodes with high probability. The simulation and measurement results in this thesis require implementations of the same MAC protocols on different platforms. To untie this complex development process, I propose to automate its most error-prone parts: Implementation of MAC automata, analysis, and code generation. To do so, I formalize cooperative MAC protocols by an easy-to-use specification language and propose strategies to construct compilers to automatically analyze validity and performance of the specification and to translate the specified protocols into program code for implementation.

Quick access

BibTeX BibTeX


Hermann Lichte

BibTeX reference

    author = {Lichte, Hermann},
    referee = {Dressler, Falko},
    advisor = {Karl, Holger},
    title = {{Quantifying and Reducing the Cost of Cooperative Relaying in Wireless Multi-Hop Networks}},
    institution = {Institute of Computer Science},
    year = {2011},
    month = {June},
    location = {Paderborn},
    school = {University of Paderborn},
    type = {PhD Thesis (Dissertation)},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.