Broker-mediated Multiple-Cloud Orchestration Mechanisms for Cloud Computing

Ph.DDOCTOR OF PHILOSOPH

Contention techniques for opportunistic communication in wireless mesh networks

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

Doctor of Philosophy

dissertationWe are seeing an extensive proliferation of wireless devices including various types and forms of sensor nodes that are increasingly becoming ingrained in our daily lives. There has been a significant growth in wireless devices capabilities as well. This proliferation and rapid growth of wireless devices and their capabilities has led to the development of many distributed sensing and computing applications. In this dissertation, we propose and evaluate novel, efficient approaches for localization and computation offloading that harness distributed sensing and computing in wireless networks. In a significant part of this dissertation, we exploit distributed sensing to create efficient localization applications. First, using the sensing power of a set of Radio frequency (RF) sensors, we propose energy efficient approaches for target tracking application. Second, leveraging the sensing power of a distributed set of existing wireless devices, e.g., smartphones, internet-of-things devices, laptops, and modems, etc., we propose a novel approach to locate spectrum offenders. Third, we build efficient sampling approaches to select mobile sensing devices required for spectrum offenders localization. We also enhance our sampling approaches to take into account selfish behaviors of mobile devices. Finally, we investigate an attack on location privacy where the location of people moving inside a private area can be inferred using the radio characteristics of wireless links that are leaked by legitimate transmitters deployed inside the private area, and develop the first solution to mitigate this attack. While we focus on harnessing distributed sensing for localization in a big part of this dissertation, in the remaining part of this dissertation, we harness the computing power of nearby wireless devices for a computation offloading application. Specially, we propose a multidimensional auction for allocating the tasks of a job among nearby mobile devices based on their computational capabilities and also the cost of computation at these devices with the goal of reducing the overall job completion time and being beneficial to all the parties involved

Dealing With Misbehavior In Distributed Systems: A Game-Theoretic Approach

Most distributed systems comprise autonomous entities interacting with each other to achieve their objectives. These entities behave selfishly when making decisions. This behavior may result in strategical manipulation of the protocols thus jeopardizing the system wide goals. Micro-economics and game theory provides suitable tools to model such interactions. We use game theory to model and study three specific problems in distributed systems. We study the problem of sharing the cost of multicast transmissions and develop mechanisms to prevent cheating in such settings. We study the problem of antisocial behavior in a scheduling mechanism based on the second price sealed bid auction. We also build models using extensive form games to analyze the interactions of the attackers and the defender in a security game involving honeypots. Multicast cost sharing is an important problem and very few distributed strategyproof mechanisms exist to calculate the costs shares of the users. These mechanisms are susceptible to manipulation by rational nodes. We propose a faithful mechanism which uses digital signatures and auditing to catch and punish the cheating nodes. Such mechanism will incur some overhead. We deployed the proposed and existing mechanisms on planet-lab to experimentally analyze the overhead and other relevant economic properties of the proposed and existing mechanisms. In a second price sealed bid auction, even though the bids are sealed, an agent can infer the private values of the winning bidders, if the auction is repeated for related items. We study this problem from the perspective of a scheduling mechanism and develop an antisocial strategy which can be used by an agent to inflict losses on the other agents. In a security system attackers and defender(s) interact with each other. Examples of such systems are the honeynets which are used to map the activities of the attackers to gain valuable insight about their behavior. The attackers want to evade the honeypots while the defenders want them to attack the honeypots. These interesting interactions form the basis of our research where we develop a model used to analyze the interactions of an attacker and a honeynet system

Design Experiences on Single and Multi Radio Systems in Wireless Embedded Platforms

The progress of radio technology has made several flavors of radio available on the market.Wireless sensor network platform designers have used these radios to build a variety of platforms. Withnew applications and different types of radios on wireless sensing nodes, it is often hard to interconnectdifferent types of networks. Hence, often additional radios have to be integrated onto existingplatforms or new platforms have to be built. Additionally, the energy consumption of these nodes have to be optimized to meetlifetime requirements of years without recharging.In this thesis, we address two issues of single and multi radio platform designfor wireless sensor network applications - engineering issues and energy optimization.We present a set of guiding principles from our design experiences while building 3 real life applications,namely asset tracking, burglar tracking and finally in-situ psychophysiological stress monitoring of human subjects in behavioral studies.In the asset tracking application, we present our design of a tag node that can be hidden inside valuable personal assets such asprinters or sofas in a home. If these items are stolen, a city wide anchor node infrastructure networkwould track them throughout the city. We also present our design for the anchor node.In the burglar tracking application, we present the design of tag nodes and the issueswe faced while integrating it with a GSM radio. Finally, we discuss our experiencesin designing a bridge node, that connects body worn physiological sensorsto a Bluetooth enabled mobile smartphone. We present the software framework that acts as middleware toconnect to the bridge, parse the sensor data, and send it to higher layers of the softwareframework.We describe 2 energy optimization schemes that are used in the Asset Tracking and the Burglar Tracking applications, that enhance the lifetime of the individual applications manifold.In the asset tracking application,we design a grouping scheme that helps increase reliability of detection of the tag nodes at theanchor nodes while reducing the energy consumption of the group of tag nodes travelling together.We achieve an increase of 5 times improvement in lifetime of the entire group. In the Burglar Tracking application, weuse sensing to determine when to turn the GSM radio on and transmit data by differentiatingturns and lane changes. This helps us reduce the number of times the GSM radio is woken up, thereby increasing thelifetime of the tag node while it is being tracked. This adds 8 minutes of trackablelifetime to the burglar tracking tag node. We conclude this thesis by observing the futuretrends of platform design and radio evolution

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Collective Communications and Computation Mechanisms on the RF Channel for Organic Printed Smart Labels and Resource-limited IoT Nodes

Radio Frequency IDentification (RFID) and Wireless Sensor Networks (WSN) are seen as enabler technologies for realizing the Internet of Things (IoT). Organic and printed Electronics (OE) has the potential to provide low cost and all-printable smart RFID labels in high volumes. With regard to WSN, power harvesting techniques and resource-efficient communications are promising key technologies to create sustainable and for the environment friendly sensing devices. However, the implementation of OE smart labels is only allowing printable devices of ultra-low hardware complexity, that cannot employ standard RFID communications. And, the deployment of current WSN technology is far away from offering battery-free and low-cost sensing technology. To this end, the steady growth of IoT is increasing the demand for more network capacity and computational power. With respect to wireless communications research, the state-of-the-art employs superimposed radio transmission in form of physical layer network coding and computation over the MAC to increase information flow and computational power, but lacks on practicability and robustness so far. With regard to these research challenges we developed in particular two approaches, i.e., code-based Collective Communications for dense sensing environments, and time-based Collective Communications (CC) for resource-limited WSNs. In respect to the code-based CC approach we exploit the principle of superimposed radio transmission to acquire highly scalable and robust communications obtaining with it at the same time as well minimalistic smart RFID labels, that can be manufactured in high volume with present-day OE. The implementation of our code-based CC relies on collaborative and simultaneous transmission of randomly drawn burst sequences encoding the data. Based on the framework of hyper-dimensional computing, statistical laws and the superposition principle of radio waves we obtained the communication of so called ensemble information, meaning the concurrent bulk reading of sensed values, ranges, quality rating, identifiers (IDs), and so on. With 21 transducers on a small-scale reader platform we tested the performance of our approach successfully proving the scalability and reliability. To this end, we implemented our code-based CC mechanism into an all-printable passive RFID label down to the logic gate level, indicating a circuit complexity of about 500 transistors. In respect to time-based CC approach we utilize the superimposed radio transmission to obtain resource-limited WSNs, that can be deployed in wide areas for establishing, e.g., smart environments. In our application scenario for resource-limited WSN, we utilize the superimposed radio transmission to calculate functions of interest, i.e., to accomplish data processing directly on the radio channel. To prove our concept in a case study, we created a WSN with 15 simple nodes measuring the environmental mean temperature. Based on our analysis about the wireless computation error we were able to minimize the stochastic error arbitrarily, and to remove the systematic error completely