A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks

Flooding is an essential and critical service in computer networks that is used by many routing protocols to send packets from a source to all nodes in the network. As the packets are forwarded once by each receiving node, many copies of the same packet traverse the network which leads to high redundancy and unnecessary usage of the sparse capacity of the transmission medium. Gossip routing is a well-known approach to improve the flooding in wireless multi-hop networks. Each node has a forwarding probability p that is either statically per-configured or determined by information that is available at runtime, e.g, the node degree. When a packet is received, the node selects a random number r. If the number r is below p, the packet is forwarded and otherwise, in the most simple gossip routing protocol, dropped. With this approach the redundancy can be reduced while at the same time the reachability is preserved if the value of the parameter p (and others) is chosen with consideration of the network topology. This technical report gives an overview of the relevant publications in the research domain of gossip routing and gives an insight in the improvements that can be achieved. We discuss the simulation setups and results of gossip routing protocols as well as further improved flooding schemes. The three most important metrics in this application domain are elaborated: reachability, redundancy, and management overhead. The published studies used simulation environments for their research and thus the assumptions, models, and parameters of the simulations are discussed and the feasibility of an application for real world wireless networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the focus of this survey but publications about other network types and technologies are also included. As percolation theory, epidemiological models, and delay tolerant networks are often referred as foundation, inspiration, or application of gossip routing in wireless networks, a brief introduction to each research domain is included and the applicability of the particular models for the gossip routing is discussed

Scalable and rate adaptive wireless multimedia multicast

The methods that are described in this work enable highly efficient audio-visual streaming over wireless digital communication systems to an arbitrary number of receivers. In the focus of this thesis is thus point-to-multipoint transmission at constrained end-to-end delay. A fundamental difference as compared to point-to-point connections between exactly two communicating sending and receiving stations is in conveying information about successful or unsuccessful packet reception at the receiver side. The information to be transmitted is available at the sender, whereas the information about successful reception is only available to the receiver. Therefore, feedback about reception from the receiver to the sender is necessary. This information may be used for simple packet repetition in case of error, or adaptation of the bit rate of transmission to the momentary bit rate capacity of the channel, or both. This work focuses on the single transmission (including retransmissions) of data from one source to multiple destinations at the same time. A comparison with multi-receiver sequentially redundant transmission systems (simulcast MIMO) is made. With respect to feedback, this work considers time division multiple access systems, in which a single channel is used for data transmission and feedback. Therefore, the amount of time that can be spent for transmitting feedback is limited. An increase in time used for feedback transmissions from potentially many receivers results in a decrease in residual time which is usable for data transmission. This has direct impact on data throughput and hence, the quality of service. In the literature, an approach to reduce feedback overhead which is based on simultaneous feedback exists. In the scope of this work, simultaneous feedback implies equal carrier frequency, bandwidth and signal shape, in this case orthogonal frequency-division multiplex signals, during the event of the herein termed feedback aggregation in time. For this scheme, a constant amount of time is spent for feedback, independent of the number of receivers giving feedback about reception. Therefore, also data throughput remains independent of the number of receivers. This property of audio-visual digital transmission is taken for granted for statically configured, single purpose systems, such as terrestrial television. In the scope of this work are, however, multi-user and multi-purpose digital communication networks. Wireless LANs are a well-known example and are covered in detail herein. In suchlike systems, it is of great importance to remain independent of the number of receivers, as otherwise the service of ubiquitous digital connectivity is at the risk of being degraded. In this regard, the thesis at hand elaborates at what bit rates audio-visual transmission to multiple receivers may take place in conjunction with feedback aggregation. It is shown that the scheme achieves a multi-user throughput gain when used in conjunction with adaptivity of the bit rate to the channel. An assumption is the use of an ideal overlay packet erasure correcting code in this case. Furthermore, for delay constrained transmission, such as in so-called live television, throughput bit rates are examined. Applications have to be tolerant to a certain level of residual error in case of delay constrained transmission. Improvement of the rate adaptation algorithm is shown to increase throughput while residual error rates are decreased. Finally, with a consumer hardware prototype for digital live-TV re-distribution in the local wireless network, most of the mechanisms as described herein can be demonstrated.Die in vorliegender Arbeit aufgezeigten Methoden der paketbasierten drahtlosen digitalen Kommunikation ermöglichen es, Fernsehinhalte, aber auch audio-visuelle Datenströme im Allgemeinen, bei hoher Effizienz an beliebig große Gruppen von Empfängern zu verteilen. Im Fokus dieser Arbeit steht damit die Punkt- zu Mehrpunktübertragung bei begrenzter Ende-zu-Ende Verzögerung. Ein grundlegender Unterschied zur Punkt-zu-Punkt Verbindung zwischen genau zwei miteinander kommunizierenden Sender- und Empfängerstationen liegt in der Übermittlung der Information über erfolgreichen oder nicht erfolgreichen Paketempfang auf Seite der Empfänger. Da die zu übertragende Information am Sender vorliegt, die Information über den Erfolg der Übertragung jedoch ausschließlich beim jeweiligen Empfänger, muss eine Erfolgsmeldung auf dem Rückweg von Empfänger zu Sender erfolgen. Diese Information wird dann zum Beispiel zur einfachen Paketwiederholung im nicht erfolgreichen Fall genutzt, oder aber um die Übertragungsrate an die Kapazität des Kanals anzupassen, oder beides. Grundsätzlich beschäftigt sich diese Arbeit mit der einmaligen, gleichzeitigen Übertragung von Information (einschließlich Wiederholungen) an mehrere Empfänger, wobei ein Vergleich zu an mehrere Empfänger sequentiell redundant übertragenden Systemen (Simulcast MIMO) angestellt wird. In dieser Arbeit ist die Betrachtung bezüglich eines Rückkanals auf Zeitduplexsysteme beschränkt. In diesen Systemen wird der Kanal für Hin- und Rückweg zeitlich orthogonalisiert. Damit steht für die Übermittlung der Erfolgsmeldung eine beschränkte Zeitdauer zur Verfügung. Je mehr an Kanalzugriffszeit für die Erfolgsmeldungen der potentiell vielen Empfänger verbraucht wird, desto geringer wird die Restzeit, in der dann entsprechend weniger audio-visuelle Nutzdaten übertragbar sind, was sich direkt auf die Dienstqualität auswirkt. Ein in der Literatur weniger ausführlich betrachteter Ansatz ist die gleichzeitige Übertragung von Rückmeldungen mehrerer Teilnehmer auf gleicher Frequenz und bei identischer Bandbreite, sowie unter Nutzung gleichartiger Signale (hier: orthogonale Frequenzmultiplexsignalformung). Das Schema wird in dieser Arbeit daher als zeitliche Aggregation von Rückmeldungen, engl. feedback aggregation, bezeichnet. Dabei wird, unabhängig von der Anzahl der Empfänger, eine konstante Zeitdauer für Rückmeldungen genutzt, womit auch der Datendurchsatz durch zusätzliche Empfänger nicht notwendigerweise sinkt. Diese Eigenschaft ist aus statisch konfigurierten und für einen einzigen Zweck konzipierten Systemen, wie z. B. der terrestrischen Fernsehübertragung, bekannt. In dieser Arbeit werden im Gegensatz dazu jedoch am Beispiel von WLAN Mehrzweck- und Mehrbenutzersysteme betrachtet. Es handelt sich in derartigen Systemen zur digitalen Datenübertragung dabei um einen entscheidenden Vorteil, unabhängig von der Empfängeranzahl zu bleiben, da es sonst unweigerlich zu Einschränkungen in der Güte der angebotenen Dienstleistung der allgegenwärtigen digitalen Vernetzung kommen muss. Vorliegende Arbeit zeigt in diesem Zusammenhang auf, welche Datenraten unter Benutzung von feedback aggregation in der Verteilung an mehrere Empfänger und in verschiedenen Szenarien zu erreichen sind. Hierbei zeigt sich, dass das Schema im Zusammenspiel mit einer Adaption der Datenrate an den Übertragungskanal inhärent einen Datenratengewinn durch Mehrbenutzerempfang zu erzielen vermag, wenn ein überlagerter idealer Paketauslöschungsschutz-Code angenommen wird. Des weiteren wird bei der Übertragung mit zeitlich begrenzter Ausführungsdauer, z. B. dem sogenannten Live-Fernsehen, aufgezeigt, wie sich die erreichbare Datenrate reduziert und welche Restfehlertoleranz an die Übertragung gestellt werden muss. Hierbei wird ebenso aufgezeigt, wie sich durch Verbesserung der Ratenadaption erstere erhöhen und zweitere verringern lässt. An einem auf handelsüblichen Computer-Systemen realisiertem Prototypen zur Live-Fernsehübertragung können die hierin beschriebenen Mechanismen zu großen Teilen gezeigt werden

Resource Allocation for Multiple Access and Broadcast Channels under Quality of Service Requirements Based on Strategy Proof Pricing

The efficient allocation of power is a major concern in today’s wireless communications systems. Due to the high demand in data rate and the scarcity of wireless resources such as power, the multi-user communication systems like the multiple access channel (MAC) and broadcast channel (BC) have become highly competitive environments for the users as well as the system itself. Theory of microeconomics and game theory provide the good analytical manner for the selfish and social welfare conflict problems. Instead of maximizing the system sum rate, our proposed system deals with fulfilling the utility (rate) requirement of all the users with efficient power allocation. The users formulate the signal to interference-plus-noise ratio (SINR) based quality-of-service (QoS) requirements. We propose the framework to allocate the power to each user with universal pricing mechanisms. The prices act as the control signal and are assumed to be some virtual currency in the wireless system. They can influence the physical layer operating points to meet the desired utility requirements. Centralized and distributed power allocation frameworks are discussed separately in the thesis with different pricing schemes. In wireless systems we have users that are rational in the game theoretic sense of making decisions consistently in pursuit of their own individual objectives. Each user’s objective is to maximize the expected value of its own payoff measured on a certain utility scale. Selfishness or self-interest is an important implication of rationality. Therefore, the mobiles which share the same spectrum have incentives to misinterpret their private information in order to obtain more utility. They might behave selfishly and show also malicious behavior by creating increased interference for other mobiles. Therefore, it is important to supervise and influence the operation of the system by pricing and priority (weights) optimization. In the centralized resource allocation, we study the general MAC and BC (with linear and nonlinear receiver) with three types of agents: the regulator, the system optimizer and the mobile users. The regulator ensures the QoS requirements of all users by clever pricing and prevents cheating. The simple system optimizer solves a certain system utility maximization problem to allocate the power with the given prices and weights (priorities). The linear and nonlinear pricing mechanisms are analyzed, respectively. It is shown that linear pricing is a universal pricing only if successive interference cancellation (SIC) for uplink transmission or dirty paper coding (DPC) for downlink transmission is applied at the base station (BS). For MAC without SIC, nonlinear pricing which is logarithmic in power and linear in prices is a universal pricing scheme. The prices, the resulting cost terms, the optimal power allocation to achieve the QoS requirement of each user in the feasible rate region are derived in closed form solutions for MAC with and without SIC using linear and nonlinear pricing frameworks, respectively. The users are willing to maximize their achievable rate and minimize their cost on power by falsely reporting their channel state information (CSI). By predicting the best cheating strategy of the malicious users, the regulator is able to detect the misbehavior and punish the cheaters. The infinite repeated game (RG) is proposed as a counter mechanism with the trigger strategy using the trigger price. We show that by anticipating the total payoff of the proposed RG, the users have no incentive to cheat and therefore our framework is strategy-proof. In the distributed resource allocation, each user allocates its own power by optimizing the individual utility function. The noncooperative game among the users is formulated. The individual prices are introduced to the utility function of each user to shift the Nash equilibrium (NE) power allocation to the desired point. We show that by implicit control of the proposed prices, the best response (BR) power allocation of each user converges rapidly. The Shannon rate-based QoS requirement of each user is achieved with minimum power at the unique NE point. We analyse different behavior types of the users, especially the malicious behavior of misrepresenting the user utility function. The resulting NE power allocation and achievable rates of all users are derived when malicious behavior exists. The strategy-proof mechanism is designed using the punishment prices when the types of the malicious users are detected. The algorithm of the strategy-proof noncooperative game is proposed. We illustrate the convergence of the BR dynamic and the Price of Malice (PoM) by numerical simulations. The uplink transmission within the single cell of heterogeneous networks is exactly the same model as MAC. Therefore, the results of the pricing-based power allocation for MAC can be implemented into heterogeneous networks. Femtocells deployed in the Macrocell network provide better indoor coverage to the user equipments (UEs) with low power consumption and maintenance cost. The industrial vendors show great interest in the access mode, called the hybrid access, in which the macrocell UEs (MUEs) can be served by the nearby Femtocell Access Point (FAP). By adopting hybrid access in the femtocell, the system energy efficiency is improved due to the short distance between the FAP and MUEs while at the same time, the QoS requirements are better guaranteed. However, both the Macrocell base station (MBS) and the FAP are rational and selfish, who maximize their own utilities. The framework to successively apply the hybrid access in femtocell and fulfill the QoS requirement of each UE is important. We propose two novel compensation frameworks to motivate the hybrid access of femtocells. To save the energy consumption, the MBS is willing to motivate the FAP for hybrid access with compensation. The Stackelberg game is formulated where the MBS serves as the leader and the FAP serves as the follower. The MBS maximizes its utility by choosing the compensation prices. The FAP optimizes its utility by selecting the number of MUEs in hybrid access. By choosing the proper compensation price, the optimal number of MUEs served by the FAP to maximize the utility of the MBS coincides with that to maximize the utility of the FAP. Numerous simulation results are conducted, showing that the proposed compensation frameworks result in a win-win solution. In this thesis, based on game theory, mechanism design and pricing framework, efficient power allocation are proposed to guarantee the QoS requirements of all users in the wireless networks. The results are applicable in the multi-user systems such as heterogeneous networks. Both centralized and distributed allocation schemes are analyzed which are suitable for different communication scenarios.Aufgrund der hohen Nachfrage nach Datenrate und wegen der Knappheit an Ressourcen in Funknetzen ist die effiziente Allokation von Leistung ein wichtiges Thema in den heutigen Mehrnutzer-Kommunikationssystemen. Die Spieltheorie bietet Methoden, um egoistische und soziale Konfliktsituationen zu analysieren. Das vorgeschlagene System befasst sich mit der Erfüllung der auf Signal-zu-Rausch-und-Interferenz-Verhältnis (SINR) basierenden Quality-of-Service (QoS)-Anforderungen aller Nutzer mittels effizienter Leistungsallokation, anstatt die Übertragungsrate zu maximieren. Es wird ein Framework entworfen, um die Leistungsallokation mittels universellen Pricing-Mechanismen umzusetzen. In der Dissertation werden zentralisierte und verteilte Leistungsallokationsalgorithmen unter Verwendung verschiedener Pricing-Ansätze diskutiert. Die Nutzer in Funksystemen handeln rational im spieltheoretischen Sinne, indem sie ihre eigenen Nutzenfunktionen maximieren. Die mobilen Endgeräte, die dasselbe Spektrum nutzen, haben den Anreiz durch bewusste Fehlinterpretation ihrer privaten Informationen das eigene Ergebnis zu verbessern. Daher ist es wichtig, die Funktionalität des Systems zu überwachen und durch Optimierung des Pricings und Priorisierungsgewichte zu beeinflussen. Für den zentralisierten Ressourcenallokationsansatz werden der allgemeine Mehrfachzugriffskanal (Multiple Access Channel, MAC) und der Broadcastkanal (BC) mit linearen bzw. nichtlinearen Empfängern untersucht. Die Preise, die resultierenden Kostenterme und die optimale Leistungsallokation, mit der die QoS-Anforderungen in der zulässigen Ratenregion erfüllt werden, werden in geschlossener Form hergeleitet. Lineare und nichtlineare Pricing-Ansätze werden separat diskutiert. Das unendlich oft wiederholte Spiel wird vorgeschlagen, um Spieler vom Betrügen durch Übermittlung falscher Kanalinformationen abzuhalten. Für die verteilten Ressourcenvergabe wird das nichtkooperative Spiel in Normalform verwendet und formuliert. Die Nutzer wählen ihre Sendeleistung zur Maximierung ihrer eigenen Nutzenfunktion. Individuelle Preise werden eingeführt und so angepasst, dass die QoS-Anforderungen mit der Leistungsallokation im eindeutigen Nash-Gleichgewicht erfüllt werden. Verschiedene Arten des Nutzerverhaltens werden bezüglich der Täuschung ihrer Nutzenfunktion analysiert, und ein Strategy-Proof-Mechanismus mit Strafen wird entwickelt. Die Ergebnisse für den MAC sind anwendbar auf heterogene Netzwerke, wobei zwei neuartige Ansätze zur Kompensation bereitgestellt werden, die den hybriden Zugang zu Femtozell-Netzwerken motivieren. Mithilfe des Stackelberg-Spiels wird gezeigt, dass die vorgeschlagenen Ansätze in einer Win-Win-Situation resultieren

Utilizing Advanced Network Context to Optimize Software-Defined Networks

Legacy network systems and protocols are mostly static and keep state information in silo-style storage, thus making state migration, transformation and re-use difficult. Software-Defined Network (SDN) approaches in unison with Network Function Virtualization (NFV) allow for more flexibility, yet they are currently restricted to a limited set of state migration options. Additionally, existing systems and protocols are mostly tailored to meet the requirements of specific application scenarios. As a result, the protocols cannot easily be adapted to novel application demands, organically growing networks, etc. Impeding the sharing of networking and system state, along with lacking support for dynamic transitions between systems and protocols, severely limits the ability to optimally manage resources and dynamically adapt to a desirable overall configuration. These limitations not only affect the network performance but also hinder the deployment of new and innovative protocols as a hard break is usually not feasible and thus full support for legacy systems is required. On the one hand, we propose a generalized way to collect, store, transform, and share context between systems and protocols in both the legacy Internet as well as NFV/SDN-driven networks. This allows us to share state information between multiple systems and protocols from NFs over BGP routers to protocols on all layers of the network stack. On the other hand, we introduce an architecture for designing modular protocols that are built with transition in mind. We argue that the modular design of systems and protocols can remove the key limitations of today’s monolithic protocols and allow for a more dynamic network management. First, we design and implement a Storage and Transformation Engine for Advanced Net- working context (STEAN) which constitutes a shared context storage, making network state information available to other systems and protocols. Its pivotal feature is the ability to allow for state transformation as well as for persisting state to enable future re-use. Second, we provide a Blueprint for Switching Between Mechanisms that serves as a framework and guideline for developers to standardize and ease the process of designing and implementing systems and protocols that support transitions as a first order principle. By means of experimentation, we show that our architecture covers a diverse set of challenging use cases in legacy systems—such as Wireless Multihop Networks (WMNs)—as well as in NFV/SDN-enabled systems. In particular, we demonstrate the feasibility of our approach by migrating state information between two instances of the PRADS NF in a virtualized Mininet environment, and show that our solution outperforms state of the art frameworks that are specifically built for NF migration. We further demonstrate that a dynamic switch between WMN routing protocols is possible at runtime and that the state information can be reutilized for bootstrapping novel protocol modules, thus minimizing the control overhead