The heterogeneity of inter-contact time distributions: its importance for routing in delay tolerant networks

Prior work on routing in delay tolerant networks (DTNs) has commonly made the assumption that each pair of nodes shares the same inter-contact time distribution as every other pair. The main argument in this paper is that researchers should also be looking at heterogeneous inter-contact time distributions. We demonstrate the presence of such heterogeneity in the often-used Dartmouth Wi-Fi data set. We also show that DTN routing can benefit from knowing these distributions. We first introduce a new stochastic model focusing on the inter-contact time distributions between all pairs of nodes, which we validate on real connectivity patterns. We then analytically derive the mean delivery time for a bundle of information traversing the network for simple single copy routing schemes. The purpose is to examine the theoretic impact of heterogeneous inter-contact time distributions. Finally, we show that we can exploit this user diversity to improve routing performance.Comment: 6 page

Emulating opportunistic networks with KauNet Triggers

In opportunistic networks the availability of an end-to-end path is no longer required. Instead opportunistic networks may take advantage of temporary connectivity opportunities. Opportunistic networks present a demanding environment for network emulation as the traditional emulation setup, where application/transport endpoints only send and receive packets from the network following a black box approach, is no longer applicable. Opportunistic networking protocols and applications additionally need to react to the dynamics of the underlying network beyond what is conveyed through the exchange of packets. In order to support IP-level emulation evaluations of applications and protocols that react to lower layer events, we have proposed the use of emulation triggers. Emulation triggers can emulate arbitrary cross-layer feedback and can be synchronized with other emulation effects. After introducing the design and implementation of triggers in the KauNet emulator, we describe the integration of triggers with the DTN2 reference implementation and illustrate how the functionality can be used to emulate a classical DTN data-mule scenario

Unterbrechungstolerante Fahrzeugkommunikation im öffentlichen Personennahverkehr

Communication systems play an important role in the efficient operation of public transport networks. Recently, traditional voice-centric real-time communication is complemented and often replaced by data-centric asynchronous machine-to-machine communication. Disruption tolerant networking in combination with license-exempt high bandwidth technologies have the potential to reduce infrastructure investments and operating costs for such applications, because a continuous end-to-end connectivity is no longer required. In this thesis the feasibility of such a system is investigated and confirmed. First, realistic use-cases are introduced and the requirements to the communication system are analyzed. Then the channel characteristics of several WLAN-based technologies are experimentally evaluated in real public transport scenarios. Since the results are promising, the next step is gaining a deeper understanding of the special mobility properties in public transport networks. Therefore, we analyze existing traces as well as our own newly acquired trace. Our trace features additional operator meta-data that is not available for existing traces, and we report on unexpected properties that have not been quantified before. Then the trace is combined with the experimentally obtained channel parameters in order to analyze the characteristics of inter-vehicle contacts. We present the statistical distribution of situation-specific contact events and the impact of radio range on contact capacity. Then results of all steps above are used to propose a routing scheme that is optimized for public transport networks. In the final simulation-based evaluation we show that this router outperforms previously proposed algorithms.Kommunikationssysteme leisten einen wichtigen Beitrag zum effizienten Betrieb des öffentlichen Personennahverkehrs. Seit einigen Jahren wird dabei der Sprechfunk zunehmend durch asynchronen M2M-Datenfunk ergänzt und in vielen Anwendungsgebieten sogar vollständig ersetzt. Die Kombination aus unterbrechungstoleranten Netzwerken und lizenzfreien Drahtlostechnologien birgt ein erhebliches Potential zur Reduzierung von Infrastrukturinvestitionen und Betriebskosten, da für diese Anwendungen eine dauerhafte Ende-zu-Ende Verbindung nicht mehr erforderlich ist. In dieser Arbeit wird die Machbarkeit eines solchen Systems untersucht und belegt. Zunächst werden dazu Anwendungsfälle vorgestellt und deren Anforderungen an das Kommunikationssystem analysiert. Dann werden die Kanalcharakteristika mehrerer WLAN-Technologien im realen ÖPNV-Umfeld experimentell ermittelt und bewertet. Auf Grundlage der erfolgversprechenden Ergebnisse werden im nächsten Schritt die besonderen Mobilitätseigenschaften von ÖPNV-Netzen untersucht. Zu diesen Zweck analysieren wir existierende und eigene, neu aufgezeichnete Bewegungsdaten von ÖPNV-Fahrzeugen. Unsere Daten enthalten dabei zusätzliche Metadaten der Verkehrsbetriebe, die zuvor nicht verfügbar waren, so dass wir unerwartete Effekte beschreiben und erstmals quantifizieren können. Anschließend werden die Bewegungsdaten mit den zuvor experimentell erfassten Kanaleigenschaften kombiniert, um so die Kommunikationskontakte zwischen den Fahrzeugen genauer zu betrachten. Wir stellen die statistische Verteilung der situationsabhängigen Kontaktereignisse vor, sowie den Einfluss der Funkreichweite auf die Kontaktkapazität. Dann werden die Ergebnisse aller vorhergehenden Schritte verwendet, um ein neues, optimiertes Routingverfahren für ÖPNV-Netze vorzuschlagen. In der simulationsbasierten Evaluation belegen wir, dass dieser Router die Leistung bisher bekannter Verfahren übertrifft

DTN Routing as a Resource Allocation Problem

Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, and so these approaches have only an incidental effect on routing such metrics as maximum or average delivery delay. In this paper, we present rapid, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities which determine how packets should be replicated in the system. We evaluate rapid rigorously through a prototype deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real DTN at this scale. Our results suggest that rapid significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads RAPID is within 10% of the optimal performance

DTN Routing as a Resource Allocation Problem

Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, and so these approaches have only an incidental effect on routing such metrics as maximum or average delivery delay. In this paper, we present rapid, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities which determine how packets should be replicated in the system. We evaluate rapid rigorously through a prototype deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real DTN at this scale. Our results suggest that rapid significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads RAPID is within 10% of the optimal performance