This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-25 Creation time: 20-51-34 --- Number of references 13 inproceedings 200912BitschSimBetAge 2009 12 1 13--18 In this paper, we present SimBetAge, a delay and disruption tolerant routing protocol for highly dynamic socially structured mobile networks. We exploit the lightweight and egocentric scheme of SimBet routing while at the same time taking the strength and the gradual aging of social relations into account and thereby increase the performance by one order of magnitude, especially in evolving network structures. We explore the model of similarity and betweenness over weighted graphs, and present a simulation on realistic traces from previous experiments, comparing our approach to the original SimBet, Epidemic Routing and Prophet. RatPack fileadmin/papers/2009/2009-12-Bitsch-SimBetAge.pdf http://portal.acm.org/citation.cfm?id=1659029.1659034&coll=DL&dl=GUIDE&CFID=6806120&CFTOKEN=29162094 http://conferences.sigcomm.org/co-next/2009/workshops/unet/papers/Link.pdf Online Paulo Mendes, Oliver Marcé ACM

New York City, NY, USA

U-NET '09 Proceedings of the 1st ACM workshop on User-provided networking: challenges and opportunities, Rome, Italy ACM Rome, Italy 1st ACM workshop on User-provided networking: challenges and opportunities 1 Dec. 2009 en 978-1-60558-750-9 http://doi.acm.org/10.1145/1659029.1659034 1 Jó AgilaBitsch Link NicolaiViol AndréGoliath KlausWehrle inproceedings 2009-sensys-alizai-burstytraffic 2009 11 71-84 wld fileadmin/papers/2009/2009-alizai-sensys-bre.pdf ACM

New York, NY, USA

Proceeding of 7th ACM Conference on Embedded Networked Sensor Systems (Sensys 09), Berkeley, CA, USA Berkley, California Sensys 09 November 2009 en 978-1-60558-519-2 1 Muhammad HamadAlizai OlafLandsiedel Jó AgilaBitsch Link StefanGötz KlausWehrle techreport 200908alizaifgsnburstyrouting 2009 9 63-66 Accurate estimation of link quality is the key to enable efficient routing in wireless sensor networks. Current link estimators focus mainly on identifying long-term stable links for routing, leaving out a potentiality large set of intermediate links offering significant routing progress. Fine-grained analysis of link qualities reveals that such intermediate links are bursty, i.e., stable in the short term. In this paper, we use short-term estimation of wireless links to accurately identify short-term stable periods of transmission on bursty links. Our approach allows a routing protocol to forward packets over bursty links if they offer better routing progress than long-term stable links. We integrate a Short Term Link Estimator and its associated routing strategy with a standard routing protocol for sensor networks. Our evaluation reveals an average of 22% reduction in the overall transmissions when routing over long-range bursty links. Our approach is not tied to any special routing protocol and integrates seamlessly with existing routing protocols and link estimators. wld fileadmin/papers/2009/2009-08-alizai-fgsn-bursty-routing.pdf doku.b.tu-harburg.de/volltexte/2009/581/pdf/proceedings.pdf Print Technical University Hamburg

Technical University Hamburg

Proceedings of the 8th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Hamburg, Germany en 1 Muhammad HamadAlizai OlafLandsiedel Jó AgilaBitsch Link StefanGötz KlausWehrle inproceedings 2009-landsiedel-visa-vipe 2009 8 17 45--52 Although the diversity of platforms for network experimentation is a boon to the development of protocols and distributed systems, it is challenging to exploit its benefits. Implementing or adapting the systems under test for such heterogeneous environments as network simulators, network emulators, testbeds, and end systems is immensely time and work intensive. In this paper, we present VIPE, a unified virtual platform for network experimentation, that slashes the porting effort. It allows to smoothly evolve a single implementation of a distributed system or protocol from its design up into its deployment by leveraging any form of network experimentation tool available. deployment, network experimentation, resource virtualization, simulation fileadmin/papers/2009/2009-landsiedel-visa-vipe.pdf Print ACM Press

New York, NY, USA

Proceedings of the 1st ACM SIGCOMM Workshop on Virtualized Infastructure Systems and Architectures, Barcelona, Spain Barcelona, Spain 1st ACM SIGCOMM Workshop on Virtualized Infastructure Systems and Architectures August 17, 2009 en 978-1-60558-595-6 10.1145/1592648.1592657 1 OlafLandsiedel GeorgKunz StefanGötz KlausWehrle inproceedings securityforpervasivemedicalsensornetworks 2009 7 13 1 http://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-garcia-mobiq.pdf Print IEEE Press

Washington, DC, USA

6th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2009), Toronto ICST/IEEE Toronto, CAN 6th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2009) en 978-963-9799-59-2 10.4108/ICST.MOBIQUITOUS2009.6832 1 OscarGarcia-Morchon ThomasFalck TobiasHeer KlausWehrle inproceedings 200907BitschMOBIQUITOUS09SimBetAge 2009 7 13 1--2 In this paper, we present SimBetAge, an extension to SimBet taking into account the gradual aging of connections in social networks which thereby increases the performance by an order of magnitude, especially in evolving network structures. For this purpose, we redefine similarity and betweenness to make use of weighted social network graphs. poster and abstract RatPack fileadmin/papers/2009/2009-07-Bitsch-Mobiquitous09-SimBetAge.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5326363 Online IEEE

New York City, NY, USA

Proceedings of the 6th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2009), Toronto, ON, Canada ICST/IEEE Toronto, ON, Canada 6th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2009) July 13-16, 2009 en 978-963-9799-59-2 10.4108/ICST.MOBIQUITOUS2009.7017 1 Jó AgilaBitsch Link NicolaiViol AndréGoliath KlausWehrle conference 2009-iscc-samad-NNCQ 2009 7 5 763-769 Online IEEE IEEE Symposium on Computers and Communications (ISCC 2009), Sousse, Tunisia Sousse, Tunisia IEEE Symposium on Computers and Communications en 978-1-4244-4671-1 SadeqAli Makram FahadSamad MesutGuenes poster 2009-kunz-nsdi-profab 2009 4 22 fileadmin/papers/2009/2009-kunz-nsdi-protocolFactory.pdf Poster Online USENIX Association

Berkeley, CA, USA

6th USENIX Symposium on Networked Systems Design and Implementation (NSDI'09) en 1 GeorgKunz OlafLandsiedel StefanGötz KlausWehrle article Gross09a Elsevier Performance Evaluation Journal 2009 66 3-5 240--257 JamesGross MarcEmmelmann OscarPuñal AdamWolisz inproceedings Gross09 2009 220--233 Proc. of the 8th International IFIP Networking Conference (NETWORKING'09) JamesGross OscarPuñal MarcEmmelmann inproceedings 200906MobiArchgoetzprotocolorchestration 2009 43-50 The diversity of today's networking environments, such as wired, wireless, cell-based, or multi-hop, is matched by an equally large amount and heterogeneity of specialized protocols, e.g., overlays, Wi-Fi positioning, MANET routing, cross-layer signaling. However, communication is typically performed with a static set of protocols selected at design time based on simplified assumptions ignoring the environment's heterogeneity. In this paper, we argue that protocols can be orchestrated as software components driven purely by their functionality and the demands of the execution environment. Our end-system protocol framework Adapt bases on extensible ontological models that semantically describe protocol and environment properties. At runtime, each connection receives a custom-tailored protocol stack that Adapt orchestrates from the requirements derived from the application, user, and environment. With this approach, end-systems can reason about the functionality and quality of automatically composed and adapted protocol compounds while remaining open to existing and future protocols. https://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-goetz-mobiarch-protocol-orchestration.pdf print Krzysztof Zielinski and Adam Wolisz and Jason Flinn and Anthony LaMarca ACM

New York, NY, USA

print Proceedings of the Fourth ACM International Workshop on Mobility in the Evolving Internet Architecture (ACM MobiArch '09) ACM Sigcomm/Sigmobile Krakow, Poland Fourth ACM International Workshop on Mobility in the Evolving Internet Architecture (ACM MobiArch '09), Krakow, Poland 2009-06-22 en 1 StefanGötz TobiasHeer KlausWehrle inproceedings 2009morchonpodckeyagreementwsn 2009 1 326-327 Brief Announcement Print ACM

New York, NY, USA

Proceedings of the 28th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2009), Calgary Calgary, CN 28th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2009) en 978-963-9799-59-2 10.1145/1582716.1582791 1 OscarGarcia-Morchon TobiasHeer LudoTolhuizen KlausWehrle inproceedings 2009-icc-heer-middleboxes 2009 1 791-796 Today, middleboxes such as firewalls and network address translators have advanced beyond simple packet forwarding and address mapping. They also inspect and filter traffic, detect network intrusion, control access to network resources, and enforce different levels of quality of service. The cornerstones for these security-related network services are end-host authentication and authorization. Using a cryptographic namespace for end-hosts simplifies these tasks since it gives them an explicit and verifiable identity. The Host Identity Protocol (HIP) is a key-exchange protocol that introduces such a cryptographic namespace for secure end-to-end communication. Although HIP was designed with middleboxes in mind, these cannot securely use its namespace because the on-path identity verification is susceptible to replay attacks. Moreover, the binding between HIP as an authentication protocol and IPsec as payload transport is insufficient because on-path middleboxes cannot securely map payload packets to a HIP association. In this paper, we propose to prevent replays attack by treating packet-forwarding middleboxes as first-class citizens that directly interact with end-hosts. Also we propose a method for strengthening the binding between the HIP authentication process and its payload channel with hash-chain-based authorization tokens for IPsec. Our solution allows on-path middleboxes to efficiently leverage cryptographic end-host identities and integrates cleanly into existing protocol standards. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-heer-icc-end-host-authentication.pdf Print Piscataway, NJ, USA

Dresden, Germany

Proceedings of the IEEE International Conference on Communications 2009 (ICC 2009), Dresden, Gemany IEEE Dresden, Germany IEEE International Conference on Communications 2009 (ICC 2009) en 978-1-4244-3435-0 1938-1883 10.1109/ICC.2009.5198984 1 TobiasHeer RenéHummen MiikaKomu StefanGötz KlausWehrle