This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-25 Creation time: 11-40-45 --- Number of references 32 inproceedings 2012-mass-wirtz-dlsd 2012 10 10 S. fileadmin/papers/2012/2012-mass-wirtz-dlsd.pdf Online IEEE Computer Society

Washington, DC, USA

Proceedings of The Ninth IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2012), October 8-11 2012, Las Vegas, NV, USA Las Vegas, USA Ninth IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2012) 8-11 October 2012 en 978-1-4673-2433-5 10.1109/MASS.2012.6502498 1 HannoWirtz TobiasHeer MartinSerror KlausWehrle inproceedings 2012-hummen-seams 2012 6 25 525--532 fileadmin/papers/2012/2012-hummen-seams.pdf Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom-12) IEEE Liverpool, United Kingdom en 978-1-4673-2172-3 10.1109/TrustCom.2012.250 1 RenéHummen Jan HenrikZiegeldorf TobiasHeer HannoWirtz KlausWehrle inproceedings WirtzHHW2012 2012 6 14 653-658 fileadmin/papers/2012/2012_wirtz_icc_mesh_dht.pdf Print Online IEEE Proceedings of the IEEE International Conference on Communications (ICC 2012), Ottawa, Canada Ottawa, Canada ICC 2012 10.-15.06.2012 en 978-1-4577-2051-2 10.1109/ICC.2012.6364336 1 HannoWirtz TobiasHeer RenéHummen KlausWehrle phdthesis heer2011direct 2012 2 7 http://darwin.bth.rwth-aachen.de/opus3/volltexte/2012/3938/ Shaker

Aachen, Germany

Reports on Communications and Distributed Systems 3 RWTH Aachen University Chair for Communication and Distributed Systems Ph.D. Thesis 978-3-8440-0710-7 1 TobiasHeer inproceedings 2011-wirtz-kaleidoscope 2011 12 14 mobile_access fileadmin/papers/2011/2011-wirtz-kaleidoscope.pdf Online

ITU

Proceedings of the ITU-T Kaleidoscope Event 2011, Cape Town, South Africa Cape Town, South Africa ITU-T Kaleidoscope: The fully networked human? 2011-12-12 en 978-92-61-13651-2 1 HannoWirtz RenéHummen NicolaiViol TobiasHeer Mónica AlejandraLora Girón KlausWehrle inproceedings Varj1112:Secure 2011 12 5 Many efforts of the network research community focus on the introduction ofa new identifier to relieve the IP address from its dual role of end-hostidentifier and routable locator. This identifier-locator split introduces anew identifier between human readable domain names and routable IPaddresses. Mapping between identifiers and locators requires additionalname mapping mechanisms because their relation is not trivial. Despite itspopularity and efficiency, the DNS system is not a perfect choice forperforming this mapping because identifiers are not hierarchicallystructured and mappings are frequently updated by users. In this paper wediscuss the features needed to resolve flat identifiers to locators in asecure manner. In particular, we focus on the features and the performancethat identifier-locator split protocols require from a mapping system. Tothis end, we consider a mapping system for an identifier-locator splitbased mobility solution and evaluate its performance. IndexTerms—Identifier-locator split, Name resolution, Host Identity Protocol,Security, DNS, DHT, OpenDHT DHT; DNS; Host Identity Protocol; Security; Identifier-locator split; Nameresolution fileadmin/papers/2011/2011-varjonen-secure.pdf Online IEEE

Piscataway, NJ, USA

IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN), Awarded the NGN Best Paper Award accepted en 978-1-4244-9268-8 1930-529X 1 SamuVarjonen TobiasHeer KennethRimey AndreiGurtov article 2011-heer-iot-journal Springer Wireless Personal Communications Journal 2011 10 61 3 527-542 A direct interpretation of the term Internet of Things refers to the use of standard Internet protocols for the human-to-thing or thing-to-thing communication in embedded networks. Although the security needs are well-recognized in this domain, it is still not fully understood how existing IP security protocols and architectures can be deployed. In this paper, we discuss the applicability and limitations of existing Internet protocols and security architectures in the context of the Internet of Things. First, we give an overview of the deployment model and general security needs. We then present challenges and requirements for IP-based security solutions and highlight specific technical limitations of standard IP security protocols. iotsec fileadmin/papers/2011/2011-heer-iot-challenges.pdf Online Springer

Netherlands

en 0929-6212 10.1007/s11277-011-0385-5 1 TobiasHeer OscarGarcia-Morchon RenéHummen Sye LoongKeoh Sandeep S.Kumar KlausWehrle inproceedings 2011-wirtz-chants 2011 9 23 fileadmin/papers/2011/2011-wirtz-chants.pdf Online ACM

New York, NY, USA

Proceedings of the ACM MobiCom Workshop on Challenged Networks (Chants 2011), Las Vegas, NV, USA Las Vegas, NV, USA ACM MobiCom Workshop on Challenged Networks (Chants 2011) 2011-09-23 en 978-1-4503-0870-0 10.1145/2030652.2030666 1 HannoWirtz TobiasHeer RobertBackhaus KlausWehrle inproceedings 2011-hummen-pisa-demo 2011 6 15 15 35--36 mobile_access fileadmin/papers/2011/2011-hummen-wisec-pisa-sa-demo.pdf Online ACM

New York, NY, USA

Proceedings of the fourth ACM Conference on Wireless Network Security, Hamburg, Germany Hamburg, Germany Wireless Network Security 2011 (WiSec 2011) en 1559-1662 10.1145/2073290.2073297 1 RenéHummen HannoWirtz NicolaiViol TobiasHeer KlausWehrle inproceedings 2011-nsdi-slicetime-weingaertner 2011 3 30 https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-weingaertner-nsdi-slicetime-camera_ready_14P.pdf Online USENIX

Berkeley, CA, USA

Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11), Boston, MA, USA Boston, Massachusetts en 1 EliasWeingaertner FlorianSchmidt Hendrikvom Lehn TobiasHeer KlausWehrle miscellaneous 2011-hummen-adaptationlayer 2011 3 25 iotsec fileadmin/papers/2011/2011-hummen-smartobjects-adaptationlayer.pdf Online Interconnecting Smart Objects with the Internet Workshop en 1 RenéHummen TobiasHeer KlausWehrle proceedings 2010-wirtz-kuvs-service-overlay 2010 10 Service discovery in traditional networks is realized either by broadcasting requests in the network or by a central entity that holds the necessary information of every service in the network. These techniques are applicable in wireless networks as well, however, only under certain limiting conditions. The authors present a generic overlay that caters to the special requirements of providing and discovering services in wireless mesh networks. The focus of the approach lies on maintaining scalability in large-scale dynamic networks as well as routing efficiency with regard to the communication characteristics of the underlying network. RWTH Aachen University - ComSys /fileadmin/papers/2010/2010-wirtz-kuvs-service-overlay.pdf Gesellschaft für Informatik KuVS

Berlin, Germany

3rd GI/ITG KuVS Fachgespräch on NG SDPs, Berlin, Germany Berlin, Germany 3rd GI/ITG KuVS Fachgespräch on NG SDPs October 14, 2010 english HannoWirtz TobiasHeer KlausWehrle inproceedings 2010-heer-pisa-sa 2010 8 2 1 588-593 With the goal of providing ubiquitous wireless services (e.g., tourist guides, environmental information, pedestrian navigation), municipal wireless networks are currently being established all around the world. For municipalities, it is often challenging to achieve the bandwidth and coverage that is necessary for many of the envisioned network services. At the same time, Wi-Fi-sharing communities achieve high bandwidth and good coverage at a very low cost by capitalizing on the dense deployment of private access points in urban areas. However, from a technical, conceptual, and security perspective, Wi-Fi sharing community networks resemble a patchwork of heterogeneous networks instead of one well-planned city-wide network. This patchwork character stands in stark contrast to a uniform, secure platform for public and commercial services desirable for the economic success of such a network. Hence, despite its cost-efficiency, the community-based approach cannot be adopted by municipalities easily. In this paper, we show how to realize municipal wireless services on top of a Wi-Fi-sharing infrastructure in a technically sound and economically attractive fashion. In particular, we focus on how to securely provide services to mobile clients with and without client-side software support. Our solution cleanly separates the roles of controlling and administering the network from providing bandwidth and wireless access. With this separation, commercial ISPs and citizens with their private Wi-Fi can contribute to the network infrastructure. This allows municipalities in turn to focus their resources on municipal wireless services. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-heer-icc-pisa-sa.pdf Print IEEE Press

Washington, DC, USA

International Conference on Computer Communication Networks, ICCCN 2010, Zurich Zurich, Switzerland International Conference on Computer Communication Networks, ICCCN 2010 en 978-1-4244-7114-0 10.1109/ICCCN.2010.5560103 1 TobiasHeer ThomasJansen RenéHummen HannoWirtz StefanGötz EliasWeingaertner KlausWehrle inproceedings 2010-percomws-heer-munifi Proceedings of the Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010), IEEE. 2010 4 2 1 588 - 593 Municipal Wi-Fi networks aim at providing Internet access and selected mobile network services to citizens, travelers, and civil servants. The goals of these networks are to bridge the digital divide, stimulate innovation, support economic growth, and increase city operations efficiency. While establishing such urban networks is financially challenging for municipalities, Wi-Fi-sharing communities accomplish good coverage and ubiquitous Internet access by capitalizing on the dense deployment of private access points in urban residential areas. By combining Wi-Fi communities and municipal Wi-Fi, a collaborative municipal Wi-Fi system promises cheap and ubiquitous access to mobile city services. However, the differences in intent, philosophy, and technical realization between community and municipal Wi-Fi networks prevent a straight-forward combination of both approaches. In this paper, we highlight the conceptual and technical challenges that need to be solved to create collaborative municipal Wi-Fi networks. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-heer-percomws-collaborative-municipal-wi-fi.pdf Print IEEE Press

Washington, DC, USA

Proceedings of the Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010), Mannheim, Germany. Mannheim, Germany Sixth IEEE PerCom Workshop on Pervasive Wireless Networking (PWN 2010) April 02, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470505 TobiasHeer RenéHummen NicolaiViol HannoWirtz 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 article 2009-pik-heer-leicht PIK Journal 2009 1 32 1/09 48-52 Diploma Thesis Award Article Print K.G. Saur Verlag

Munich, Germany

de 0930-5157 TobiasHeer article inproceedingsreference200903099502213244 Proceedings of the 11th Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance 2009) 2009 37 2 49-50 Accepted as poster presentation. https://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-weingaertner-time-accurate-sigmetrics09.pdf Print ACM SIGMETRICS

New York, NY, USA

ACM en 0163-5999 10.1145/1639562.1639580 1 EliasWeingaertner FlorianSchmidt TobiasHeer KlausWehrle 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 inproceedings goetz2008adapt 2008 12 10 5343/2008 287-292 Although modularized protocol frameworks are flexible and adaptive to the increasing heterogeneity of networking environments, it remains a challenge to automatically compose communication stacks from protocol modules. The typical static classification into network layers or class hierarchies cannot appropriately accommodate cross-cutting changes such as overlay routing or cross-layer signaling. In this paper, we discuss how protocol composition can be driven by functionality and demand at runtime based on extensible semantic models of protocols and their execution environment. Such an approach allows to reason about the functionality and quality of automatically composed and adapted protocol compounds and it is open to existing and future protocols. https://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-goetz-mobiarch-adapt.pdf Print Karin Anna Hummel and James P. G. Sterbenz Springer-Verlag

Tiergartenstraße 17, 69121 Heidelberg, Germany

Lecture Notes in Computer Science Proceedings of the 3rd International Workshop on Self-Organizing Systems, Vienna, Austria Vienna, Austria 3rd International Workshop on Self-Organizing Systems (IWSOS) 2008-12-10 en 978-3-540-92156-1 10.1007/978-3-540-92157-8\_27 1 StefanGötz ChristianBeckel TobiasHeer KlausWehrle inproceedings heer-2008-conext-alpha 2008 12 1 23:1--23:12 http://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-heer-conext-alpha.pdf Print ACM

New York, NY, USA

CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference, Madrid, Spain Madrid, Spain ACM Conext 2008 December 2008 en 978-1-60558-210-8 10.1145/1544012.1544035 1 TobiasHeer StefanGötz OscarGarcia-Morchon KlausWehrle conference 2008-heer-pisa-full 2008 6 16 1 1-7 The proliferation of broadband Internet connections has lead to an almost pervasive coverage of densely populated areas with private wireless access points. To leverage this coverage, sharing of access points as Internet uplinks among users has first become popular in communities of individuals and has recently been adopted as a business model by several companies. However, existing implementations and proposals suffer from the security risks of directly providing Internet access to strangers. In this paper, we present the P2P Wi-Fi Internet Sharing Architecture PISA, which eliminates these risks by introducing secure tunneling, cryptographic identities, and certificates as primary security concepts. Thus, PISA offers nomadic users the same security that they expect from a wired Internet connection at home. Based on its three fundamental mechanisms, PISA achieves a flexibility which opens significant advantages over existing systems. They include user mobility, anonymity, service levels with different performance and availability characteristics, and different revenue models for operators. With this combination of key features, PISA forms an essential basis for global, seamless, and secure Wi-Fi sharing for large communities. mobile_access http://www.comsys.rwth-aachen.de/fileadmin/papers/2008/2008-heer-ict-secure-wifi.pdf Print IEEE

Washington, DC, USA

Proc. of 15th International Conference on Telecommunication (ICT), St. Petersburg, Russian Federation St. Petersburg, Russian Federation 15th International Conference on Telecommunication (ICT) 16-19 June 2008 en 978-1-4244-2035-3 1 TobiasHeer StefanGötz EliasWeingaertner KlausWehrle article 200808WeingaertnerSIGMETRICSPERSyncNetWorkEmulation SIGMETRICS Performance Evaluation Review 2008 36 2 58-63 Network emulation, in which real systems interact with a network simulation, is a common evaluation method in computer networking research. Until now, the simulation in charge of representing the network has been required to be real-time capable, as otherwise a time drift between the simulation and the real network devices may occur and corrupt the results. In this paper, we present our work on synchronized network emulation. By adding a central synchronization entity and by virtualizing real systems for means of control, we can build-up network emulations which contain both unmodified x86 systems and network simulations of any complexity. This is a revised version of a paper originally presented at the ACM HotMetrics 2008 workshop. print en 0163-5999 10.1145/1453175.1453185 1 EliasWeingaertner FlorianSchmidt TobiasHeer KlausWehrle inbook 2008-heer-hipbook-lhip 2008 1 121-163 http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470997907.html Print Andrei Gurtov Wiley and Sons

West Sussex, England, UK

8 Host Identity Protocol (HIP): Towards the Secure Mobile Internet en 978-0-470-99790-1 TobiasHeer inbook 2008-heer-hipbook-security 2008 1 13-42 http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470997907.html Print Andrei Gurtov Wiley and Sons

West Sussex, England, UK

2 Host Identity Protocol (HIP): Towards the Secure Mobile Internet en 978-0-470-99790-1 TobiasHeer inproceedings 2007-heer-pisa Seventh IEEE International Conference on Peer-to-Peer Computing, P2P 2007 2007 9 2 1 251-252 http://www.comsys.rwth-aachen.de/fileadmin/papers/2007/2007-p2p-heer-pisa.pdf Print IEEE

Washington, DC, USA

Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing, 2007. P2P 2007, Galway, Ireland. Galway, Ireland Seventh IEEE International Conference on Peer-to-Peer Computing, 2007. P2P 2007. en 978-0-7695-2986-8 10.1109/P2P.2007.12 1 TobiasHeer ShaohuiLi KlausWehrle article LandsiedelEtAl2007 Special Issue on Peer-to-Peer of the it - Information Technology Journal 2007 49 5 298-303 Mobile ad-hoc networks and distributed hash tables share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc networks. In this paper, we show that with some local knowledge we can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore, we discuss practical challenges such as Churn, load balacing and security of the Mobile Hash Table. A special focus is put on the differences and new challenges that the use of a DHT in a mobile environment poses. http://it-Information-Technology.de Print Oldenbourg Verlag

Munich, Germany

en 1611-2776 1 OlafLandsiedel TobiasHeer KlausWehrle inproceedings GarciaMorchonEtAl2007 2007 1 Print IEEE

Washington, DC, USA

1 Proceedings of the third International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2007 IEEE CollaborateCom en 978-1-4244-1318-8 1 OscarGarcia-Morchon HeribertBaldus TobiasHeer KlausWehrle inproceedings 2006-heer-percomws-adapt-dht 2006 3 16 1 1-6 http://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2006-heer-percomws-dht-adhoc.pdf Print IEEE

Washington, DC, USA

In Proceedings of 3. IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P'06), Pisa, Italy. Pisa, Italy IEEE International Workshop on Mobile Peer-to-Peer Computing March 2006 en 0-7695-2520-2 10.1109/PERCOMW.2006.16 1 TobiasHeer StefanGötz SimonRieche KlausWehrle inproceedings 2005-heer-p2p-ad-hoc 2005 1 73-76 DS-Group student project Print GI, Gesellschaft für Informatik

Bonn, Germany

Proceedings of GI-Informatiktage 2005 Bonn GI Informatiktage 2005 de 3-88579-436-5 1 TobiasHeer inproceedings 2006-heer-gi2004 2004 9 51 239-244 Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics – namely scalability, flexibility, and resilience – they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concerning the applicability of Distributed Hash Tables in mobile ad-hoc scenarios: Do new problems arise when both technologies are used together? Are there any synergy effects when both technologies are combined? Are the results and assumptions, made for the infrastructural Internet, still true if a mobile ad-hoc network is used instead? In this paper, we discuss these and further questions and offer some solutions for using Distributed Hash Tables in ad-hoc networks. Print GI. LNI

Bonn, Germany

LNI Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004, Bonn, Germany Ulm, Germany GI-Jahrestagung Informatik 2004 en 3-88579-380-6 1 TobiasHeer HeikoNiedermayer LeoPetrak SimonRieche KlausWehrle