This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-04-20 Creation time: 10-06-04 --- Number of references 394 inproceedings 2024-wagner-madtls 2024 7 1 https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-wagner-madtls.pdf 19th ACM ASIA Conference on Computer and Communications Security (ACM AsiaCCS '24), Singapur Singapur ACM ASIA Conference on Computer and Communications Security (AsiaCCS) July 1-5, 2024 unpublished 1 EricWagner DavidHeye MartinSerror IkeKunze KlausWehrle MartinHenze inproceedings 2024_dahlmanns_ipv6-deployments 2024 5 10 Internet-wide studies provide extremely valuable insight into how operators manage their Internet of Things (IoT) deployments in reality and often reveal grievances, e.g., significant security issues. However, while IoT devices often use IPv6, past studies resorted to comprehensively scan the IPv4 address space. To fully understand how the IoT and all its services and devices is operated, including IPv6-reachable deployments is inevitable-although scanning the entire IPv6 address space is infeasible. In this paper, we close this gap and examine how to best discover IPv6-reachable IoT deployments. To this end, we propose a methodology that allows combining various IPv6 scan direction approaches to understand the findability and prevalence of IPv6-reachable IoT deployments. Using three sources of active IPv6 addresses and eleven address generators, we discovered 6658 IoT deployments. We derive that the available address sources are a good starting point for finding IoT deployments. Additionally, we show that using two address generators is sufficient to cover most found deployments and save time as well as resources. Assessing the security of the deployments, we surprisingly find similar issues as in the IPv4 Internet, although IPv6 deployments might be newer and generally more up-to-date: Only 39% of deployments have access control in place and only 6.2% make use of TLS inviting attackers, e.g., to eavesdrop sensitive data. Internet of Things, security, Internet measurements, IPv6, address generators internet-of-production IEEE Proceedings of the 2024 IEEE/IFIP Network Operations and Management Symposium (NOMS '24), May 6-10, 2024, Seoul, Korea Seoul, Korea 2024 IEEE Network Operations and Management Symposium May 6-10, 2024 accepted 1 MarkusDahlmanns FelixHeidenreich JohannesLohmöller JanPennekamp KlausWehrle MartinHenze inproceedings 2024-dahlmanns-doctoralsym 2024 5 10 Advances like Industry 4.0 lead to a rising number of Internet-connected industrial deployments and thus an Industrial Internet of Things with growing attack vectors. To uphold a secure and safe operation of these deployments, industrial protocols nowadays include security features, e.g., end-to-end secure communication. However, so far, it is unclear how well these features are used in practice and which obstacles might prevent operators from securely running their deployments. In this research description paper, we summarize our recent research activities to close this gap. Specifically, we show that even secure-by-design protocols are by far no guarantee for secure deployments. Instead, many deployments still open the doors for eavesdropping attacks or malicious takeovers. Additionally, we give an outlook on how to overcome identified obstacles allowing operators to configure their deployments more securely. IEEE Proceedings of the 2024 IEEE/IFIP Network Operations and Management Symposium (NOMS '24), May 6-10, 2024, Seoul, Korea Seoul, Korea 2024 IEEE Network Operations and Management Symposium May 6-10, 2024 accepted 1 MarkusDahlmanns KlausWehrle inproceedings 2024-kunze-spintrap 2024 5 7 IEEE/IFIP Proceedings of the 2024 IEEE/IFIP Network Operations and Management Symposium (NOMS '24) 2024 IEEE/IFIP Network Operations and Management Symposium accepted 1 IkeKunze ConstantinSander LarsTissen BenediktBode KlausWehrle inproceedings 2024-kunze-civic 2024 5 internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-kunze-civic.pdf Proceedings of the 7th IEEE International Conference on Industrial Cyber-Physical Systems (ICPS '24) accepted 1 IkeKunze DominikScheurenberg LiamTirpitz SandraGeisler KlausWehrle article 2024_lohmoeller_sovereignty-survey Data & Knowledge Engineering 2024 3 19 151 Data ecosystems emerged as a new paradigm to facilitate the automated and massive exchange of data from heterogeneous information sources between different stakeholders. However, the corresponding benefits come with unforeseen risks as sensitive information is potentially exposed, questioning their reliability. Consequently, data security is of utmost importance and, thus, a central requirement for successfully realizing data ecosystems. Academia has recognized this requirement, and current initiatives foster sovereign participation via a federated infrastructure where participants retain local control over what data they offer to whom. However, recent proposals place significant trust in remote infrastructure by implementing organizational security measures such as certification processes before the admission of a participant. At the same time, the data sensitivity incentivizes participants to bypass the organizational security measures to maximize their benefit. This issue significantly weakens security, sovereignty, and trust guarantees and highlights that organizational security measures are insufficient in this context. In this paper, we argue that data ecosystems must be extended with technical means to (re)establish dependable guarantees. We underpin this need with three representative use cases for data ecosystems, which cover personal, economic, and governmental data, and systematically map the lack of dependable guarantees in related work. To this end, we identify three enablers of dependable guarantees, namely trusted remote policy enforcement, verifiable data tracking, and integration of resource-constrained participants. These enablers are critical for securely implementing data ecosystems in data-sensitive contexts. Data sharing; Confidentiality; Integrity protection; Data Markets; Distributed databases internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-lohmoeller-data-sovereignty-survey.pdf Elsevier 0169-023X 10.1016/j.datak.2024.102301 1 JohannesLohmöller JanPennekamp RomanMatzutt Carolin VictoriaSchneider EduardVlad ChristianTrautwein KlausWehrle incollection 2024_pennekamp_blockchain-industry 2024 3 7 105 531-564 Competitive industrial environments impose significant requirements on data sharing as well as the accountability and verifiability of related processes. Here, blockchain technology emerges as a possible driver that satisfies demands even in settings with mutually distrustful stakeholders. We identify significant benefits achieved by blockchain technology for Industry 4.0 but also point out challenges and corresponding design options when applying blockchain technology in the industrial domain. Furthermore, we survey diverse industrial sectors to shed light on the current intersection between blockchain technology and industry, which provides the foundation for ongoing as well as upcoming research. As industrial blockchain applications are still in their infancy, we expect that new designs and concepts will develop gradually, creating both supporting tools and groundbreaking innovations. internet-of-production Springer Advances in Information Security 17 Blockchains – A Handbook on Fundamentals, Platforms and Applications 978-3-031-32145-0 10.1007/978-3-031-32146-7_17 1 JanPennekamp LennartBader EricWagner JensHiller RomanMatzutt KlausWehrle incollection 2024_matzutt_blockchain-content 2024 3 7 105 301-336 Augmenting public blockchains with arbitrary, nonfinancial content fuels novel applications that facilitate the interactions between mutually distrusting parties. However, new risks emerge at the same time when illegal content is added. This chapter thus provides a holistic overview of the risks of content insertion as well as proposed countermeasures. We first establish a simple framework for how content is added to the blockchain and subsequently distributed across the blockchain’s underlying peer-to-peer network. We then discuss technical as well as legal implications of this form of content distribution and give a systematic overview of basic methods and high-level services for inserting arbitrary blockchain content. Afterward, we assess to which extent these methods and services have been used in the past on the blockchains of Bitcoin Core, Bitcoin Cash, and Bitcoin SV, respectively. Based on this assessment of the current state of (unwanted) blockchain content, we discuss (a) countermeasures to mitigate its insertion, (b) how pruning blockchains relates to this issue, and (c) how strategically weakening the otherwise desired immutability of a blockchain allows for redacting objectionable content. We conclude this chapter by identifying future research directions in the domain of blockchain content insertion. Blockchain content insertion; Illicit content; Pruning; Redaction Springer Advances in Information Security 10 Blockchains – A Handbook on Fundamentals, Platforms and Applications 978-3-031-32145-0 10.1007/978-3-031-32146-7_10 1 RomanMatzutt MartinHenze DirkMüllmann KlausWehrle inproceedings 2024-wagner-acns-aggregate 2024 3 5 https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-wagner-mac-aggregation.pdf 22nd International Conference on Applied Cryptography and Network Security (ACNS '24), Abu Dhabi, UAE Abu Dhabi, UAE International Conference on Applied Cryptography and Network Security (ACNS) March 5-9, 2024 accepted 1 EricWagner MartinSerror KlausWehrle MartinHenze poster 2024-dahlmanns-sul 2024 3 5 19 ven2us https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-dahlmanns-slt.pdf VDE ETG/FNN-Tutorial 2024 Schutz- und Leittechnik, March 05-06, 2024, Leipzig, Germany Leipzig, Germany VDE ETG/FNN-Tutorial 2024 Schutz- und Leittechnik March 05-06, 2024 1 MarkusDahlmanns AndreasWark Carl-HeinzGenzel KlausWehrle miscellaneous 2024-wolsing-deployment 2024 3 With the escalating threats posed by cyberattacks on Industrial Control Systems (ICSs), the development of customized Industrial Intrusion Detection Systems (IIDSs) received significant attention in research. While existing literature proposes effective IIDS solutions evaluated in controlled environments, their deployment in real-world industrial settings poses several challenges. This paper highlights two critical yet often overlooked aspects that significantly impact their practical deployment, i.e., the need for sufficient amounts of data to train the IIDS models and the challenges associated with finding suitable hyperparameters, especially for IIDSs training only on genuine ICS data. Through empirical experiments conducted on multiple state-of-the-art IIDSs and diverse datasets, we establish the criticality of these issues in deploying IIDSs. Our findings show the necessity of extensive malicious training data for supervised IIDSs, which can be impractical considering the complexity of recording and labeling attacks in actual industrial environments. Furthermore, while other IIDSs circumvent the previous issue by requiring only benign training data, these can suffer from the difficulty of setting appropriate hyperparameters, which likewise can diminish their performance. By shedding light on these challenges, we aim to enhance the understanding of the limitations and considerations necessary for deploying effective cybersecurity solutions in ICSs, which might be one reason why IIDSs see few deployments. Industrial Intrusion Detection Systems, Cyber-Physical Systems, Industrial Control Systems, Deployment https://arxiv.org/pdf/2403.01809 submitted English KonradWolsing EricWagner FrederikBasels PatrickWagner KlausWehrle article 2024_pennekamp_supply-chain-survey ACM Computing Surveys 2024 2 1 56 2 Supply chains form the backbone of modern economies and therefore require reliable information flows. In practice, however, supply chains face severe technical challenges, especially regarding security and privacy. In this work, we consolidate studies from supply chain management, information systems, and computer science from 2010--2021 in an interdisciplinary meta-survey to make this topic holistically accessible to interdisciplinary research. In particular, we identify a significant potential for computer scientists to remedy technical challenges and improve the robustness of information flows. We subsequently present a concise information flow-focused taxonomy for supply chains before discussing future research directions to provide possible entry points. information flows; data communication; supply chain management; data security; data sharing; systematic literature review internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-pennekamp-supply-chain-survey.pdf ACM 0360-0300 10.1145/3606693 1 JanPennekamp RomanMatzutt ChristopherKlinkmüller LennartBader MartinSerror EricWagner SidraMalik MariaSpiß JessicaRahn TanGürpinar EduardVlad Sander J. J.Leemans Salil S.Kanhere VolkerStich KlausWehrle article 2024_pennekamp_supply-chain-sensing IEEE Access 2024 1 8 12 9350-9368 Supply chains increasingly develop toward complex networks, both technically in terms of devices and connectivity, and also anthropogenic with a growing number of actors. The lack of mutual trust in such networks results in challenges that are exacerbated by stringent requirements for shipping conditions or quality, and where actors may attempt to reduce costs or cover up incidents. In this paper, we develop and comprehensively study four scenarios that eventually lead to end-to-end-secured sensing in complex IoT-based supply chains with many mutually distrusting actors, while highlighting relevant pitfalls and challenges—details that are still missing in related work. Our designs ensure that sensed data is securely transmitted and stored, and can be verified by all parties. To prove practical feasibility, we evaluate the most elaborate design with regard to performance, cost, deployment, and also trust implications on the basis of prevalent (mis)use cases. Our work enables a notion of secure end-to-end sensing with minimal trust across the system stack, even for complex and opaque supply chain networks. blockchain technology; reliability; security; trust management; trusted computing; trusted execution environments internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2024/2024-pennekamp-secure-sensing.pdf 2169-3536 10.1109/ACCESS.2024.3350778 1 JanPennekamp FritzAlder LennartBader GianlucaScopelliti KlausWehrle Jan TobiasMühlberg inproceedings 2024-dahlmanns-fps 2024 14551 Security configurations remain challenging for trained administrators. Nowadays, due to the advent of the Internet of Things (IoT), untrained users operate numerous and heterogeneous Internet-facing services in manifold use case-specific scenarios. In this work, we close the growing gap between the complexity of IoT security configuration and the expertise of the affected users. To this end, we propose ColPSA, a platform for collective and privacy-aware security advice that allows users to optimize their configuration by exchanging information about what security can be realized given their IoT deployment and scenario. Mohamed Mosbah, Florence Sèdes, Nadia Tawbi, Toufik Ahmed, Nora Boulahia-Cuppens, Joaquin Garcia-Alfaro Springer Cham Lecture Notes in Computer Science Proceedings of the 16th International Symposium on Foundations and Practice of Security (FPS '23), December 11-13, 2023, Bordeaux, France Bordeaux, France International Symposium on Foundations and Practice of Security 2023 (FPS 23) December 11-13, 2023 unpublished 10.1007/978-3-031-57540-2_2 1 MarkusDahlmanns RomanMatzutt ChrisDax KlausWehrle inproceedings 2023_lohmoeller_transparency 2023 11 27 data usage control; data ecosystems; transparency logs https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-lohmoeller-transparency.pdf ACM Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS ’23), November 26-30, 2023, Copenhagen, Denmark Copenhagen, Denmark November 26-30, 2023 979-8-4007-0050-7/23/11 10.1145/3576915.3624371 1 JohannesLohmöller EduardVlad MarkusDahlmanns KlausWehrle inproceedings 2023_matzutt_street_problems 2023 11 27 3591-3593 Municipalities increasingly depend on citizens to file digital reports about issues such as potholes or illegal trash dumps to improve their response time. However, the responsible authorities may be incentivized to ignore certain reports, e.g., when addressing them inflicts high costs. In this work, we explore the applicability of blockchain technology to hold authorities accountable regarding filed reports. Our initial assessment indicates that our approach can be extended to benefit citizens and authorities in the future. street problems; accountability; consortium blockchain; privacy https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-matzutt-street-problems.pdf ACM Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS ’23), November 26-30, 2023, Copenhagen, Denmark Copenhagen, Denmark November 26-30, 2023 979-8-4007-0050-7/23/11 10.1145/3576915.3624367 1 RomanMatzutt JanPennekamp KlausWehrle inproceedings 2023_sloun_accessibility 2023 11 27 3543-3545 The generation of datasets is one of the most promising approaches to collecting the necessary behavior data to train machine learning models for host-based intrusion detection. While various dataset generation methods have been proposed, they are often limited and either only generate network traffic or are restricted to a narrow subset of applications. We present Vulcan, a preliminary framework that uses accessibility features to generate datasets by simulating user interactions for an extendable set of applications. It uses behavior profiles that define realistic user behavior and facilitate dataset updates upon changes in software versions, thus reducing the effort required to keep a dataset relevant. Preliminary results show that using accessibility features presents a promising approach to improving the quality of datasets in the HIDS domain. Intrusion Detection, Dataset Generation, Accessibility Features https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-sloun-vulcan-accessibility.pdf ACM Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS '23), November 26-30, 2023, Copenhagen, Denmark Copenhagen, Denmark November 26-30, 2023 979-8-4007-0050-7/23/11 10.1145/3576915.3624404 1 Christianvan Sloun KlausWehrle article 2023_pennekamp_purchase_inquiries ACM Transactions on Internet Technology 2023 11 17 23 4 Dynamic and flexible business relationships are expected to become more important in the future to accommodate specialized change requests or small-batch production. Today, buyers and sellers must disclose sensitive information on products upfront before the actual manufacturing. However, without a trust relation, this situation is precarious for the involved companies as they fear for their competitiveness. Related work overlooks this issue so far: Existing approaches only protect the information of a single party only, hindering dynamic and on-demand business relationships. To account for the corresponding research gap of inadequately privacy-protected information and to deal with companies without an established trust relation, we pursue the direction of innovative privacy-preserving purchase inquiries that seamlessly integrate into today's established supplier management and procurement processes. Utilizing well-established building blocks from private computing, such as private set intersection and homomorphic encryption, we propose two designs with slightly different privacy and performance implications to securely realize purchase inquiries over the Internet. In particular, we allow buyers to consider more potential sellers without sharing sensitive information and relieve sellers of the burden of repeatedly preparing elaborate yet discarded offers. We demonstrate our approaches' scalability using two real-world use cases from the domain of production technology. Overall, we present deployable designs that offer two-way privacy for purchase inquiries and, in turn, fill a gap that currently hinders establishing dynamic and flexible business relationships. In the future, we expect significantly increasing research activity in this overlooked area to address the needs of an evolving production landscape. bootstrapping procurement; secure industrial collaboration; private set intersection; homomorphic encryption; Internet of Production internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-pennekamp-purchase-inquiries.pdf ACM 1533-5399 10.1145/3599968 1 JanPennekamp MarkusDahlmanns FrederikFuhrmann TimoHeutmann AlexanderKreppein DennisGrunert ChristophLange Robert H.Schmitt KlausWehrle inproceedings 2023_bader_reputation-systems 2023 11 Consumers frequently interact with reputation systems to rate products, services, and deliveries. While past research extensively studied different conceptual approaches to realize such systems securely and privacy-preservingly, these concepts are not yet in use in business-to-business environments. In this paper, (1) we thus outline which specific challenges privacy-cautious stakeholders in volatile supply chain networks introduce, (2) give an overview of the diverse landscape of privacy-preserving reputation systems and their properties, and (3) based on well-established concepts from supply chain information systems and cryptography, we further propose an initial concept that accounts for the aforementioned challenges by utilizing fully homomorphic encryption. For future work, we identify the need of evaluating whether novel systems address the supply chain-specific privacy and confidentiality needs. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (LNICST) SCM; confidentiality; anonymity; voter; votee; FHE internet-of-production https://jpennekamp.de/wp-content/papercite-data/pdf/bpt+23.pdf Springer Proceedings of the 20th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous '23), November 14-17, 2023, Melbourne, VIC, Australia Melbourne, VIC, Australia November 14-17, 2023 accepted 1867-8211 1 LennartBader JanPennekamp EmildeonThevaraj MariaSpiß Salil S.Kanhere KlausWehrle article 2023_lamberts_metrics-sok Journal of Systems Research 2023 10 31 3 1 Industrial systems are increasingly threatened by cyberattacks with potentially disastrous consequences. To counter such attacks, industrial intrusion detection systems strive to timely uncover even the most sophisticated breaches. Due to its criticality for society, this fast-growing field attracts researchers from diverse backgrounds, resulting in 130 new detection approaches in 2021 alone. This huge momentum facilitates the exploration of diverse promising paths but likewise risks fragmenting the research landscape and burying promising progress. Consequently, it needs sound and comprehensible evaluations to mitigate this risk and catalyze efforts into sustainable scientific progress with real-world applicability. In this paper, we therefore systematically analyze the evaluation methodologies of this field to understand the current state of industrial intrusion detection research. Our analysis of 609 publications shows that the rapid growth of this research field has positive and negative consequences. While we observe an increased use of public datasets, publications still only evaluate 1.3 datasets on average, and frequently used benchmarking metrics are ambiguous. At the same time, the adoption of newly developed benchmarking metrics sees little advancement. Finally, our systematic analysis enables us to provide actionable recommendations for all actors involved and thus bring the entire research field forward. internet-of-production, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-lamberts-metrics-sok.pdf eScholarship Publishing 2770-5501 10.5070/SR33162445 1 OlavLamberts KonradWolsing EricWagner JanPennekamp JanBauer KlausWehrle MartinHenze inproceedings 2023-kunze-spin-bit-in-the-wild 2023 10 https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-kunze-spin-bit-in-the-wild.pdf ACM Proceedings of the Internet Measurement Conference (IMC '23) Internet Measurement Conference 2023 10.1145/3618257.3624844 1 IkeKunze ConstantinSander KlausWehrle inproceedings 2023-sander-quic-ecn 2023 10 legato https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-sander-quic-ecn.pdf https://arxiv.org/abs/2309.14273 ACM Proceedings of the Internet Measurement Conference (IMC '23) Internet Measurement Conference 2023 979-8-4007-0382-9/23/10 10.1145/3618257.3624821 1 ConstantinSander IkeKunze LeoBlöcher MikeKosek KlausWehrle inproceedings 2023-wagner-lcn-repel 2023 10 https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-wagner-repel.pdf IEEE 48th IEEE Conference on Local Computer Networks (LCN), Daytona Beach, Florida, US Daytona Beach, Florida, US IEEE Conference on Local Computer Networks (LCN) Oktober 1-5, 2023 accepted en 1 EricWagner NilsRothaug KonradWolsing LennartBader KlausWehrle MartinHenze inproceedings 2023-redefine-mpc-cosimulation Proceedings of the 14th IEEE International Conference on Smart Grid Communications (SmartGridComm 2023) 2023 10 redefine IEEE Proceedings of the 14th IEEE International Conference on Smart Grid Communications (SmartGridComm 2023) accepted 1 TobiasHeins RenéGlebke MirkoStoffers SriramGurumurthy JanHeesemann MartinaJosevski AntonelloMonti KlausWehrle inproceedings 2023_wolsing_ensemble 2023 9 25 14345 102-122 Industrial Intrusion Detection Systems (IIDSs) play a critical role in safeguarding Industrial Control Systems (ICSs) against targeted cyberattacks. Unsupervised anomaly detectors, capable of learning the expected behavior of physical processes, have proven effective in detecting even novel cyberattacks. While offering decent attack detection, these systems, however, still suffer from too many False-Positive Alarms (FPAs) that operators need to investigate, eventually leading to alarm fatigue. To address this issue, in this paper, we challenge the notion of relying on a single IIDS and explore the benefits of combining multiple IIDSs. To this end, we examine the concept of ensemble learning, where a collection of classifiers (IIDSs in our case) are combined to optimize attack detection and reduce FPAs. While training ensembles for supervised classifiers is relatively straightforward, retaining the unsupervised nature of IIDSs proves challenging. In that regard, novel time-aware ensemble methods that incorporate temporal correlations between alerts and transfer-learning to best utilize the scarce training data constitute viable solutions. By combining diverse IIDSs, the detection performance can be improved beyond the individual approaches with close to no FPAs, resulting in a promising path for strengthening ICS cybersecurity. Lecture Notes in Computer Science (LNCS), Volume 14345 Intrusion Detection; Ensemble Learning; ICS internet-of-production, rfc https://jpennekamp.de/wp-content/papercite-data/pdf/wkw+23.pdf Springer Proceedings of the 28th European Symposium on Research in Computer Security (ESORICS '23), September 25-29, 2023, The Hague, The Netherlands The Hague, The Netherlands 28th European Symposium on Research in Computer Security (ESORICS '23) September 25-29, 2023 978-3-031-51475-3 0302-9743 10.1007/978-3-031-51476-0_6 1 KonradWolsing DominikKus EricWagner JanPennekamp KlausWehrle MartinHenze inproceedings 2023_bodenbenner_fairsensor 2023 7 20 The long-term utility and reusability of measurement data from production processes depend on the appropriate contextualization of the measured values. These requirements further mandate that modifications to the context need to be recorded. To be (re-)used at all, the data must be easily findable in the first place, which requires arbitrary filtering and searching routines. Following the FAIR guiding principles, fostering findable, accessible, interoperable and reusable (FAIR) data, in this paper, the FAIR Sensor Ecosystem is proposed, which provides a contextualization middleware based on a unified data metamodel. All information and relations which might change over time are versioned and associated with temporal validity intervals to enable full reconstruction of a system's state at any point in time. A technical validation demonstrates the correctness of the FAIR Sensor Ecosystem, including its contextualization model and filtering techniques. State-of-the-art FAIRness assessment frameworks rate the proposed FAIR Sensor Ecosystem with an average FAIRness of 71%. The obtained rating can be considered remarkable, as deductions mainly result from the lack of fully appropriate FAIRness metrics and the absence of relevant community standards for the domain of the manufacturing industry. FAIR Data; Cyber-Physical Systems; Data Management; Data Contextualization; Internet of Production internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-bodenbenner-fair-ecosystem.pdf IEEE Proceedings of the 21th IEEE International Conference on Industrial Informatics (INDIN '23), July 17-20, 2023, Lemgo, Germany Lemgo, Germany July 17-20, 2023 978-1-6654-9313-0 2378-363X 10.1109/INDIN51400.2023.10218149 1 MatthiasBodenbenner JanPennekamp BenjaminMontavon KlausWehrle Robert H.Schmitt inproceedings 2023-dahlmanns-docker 2023 7 10 797-811 Containerization allows bundling applications and their dependencies into a single image. The containerization framework Docker eases the use of this concept and enables sharing images publicly, gaining high momentum. However, it can lead to users creating and sharing images that include private keys or API secrets—either by mistake or out of negligence. This leakage impairs the creator's security and that of everyone using the image. Yet, the extent of this practice and how to counteract it remains unclear. In this paper, we analyze 337,171 images from Docker Hub and 8,076 other private registries unveiling that 8.5% of images indeed include secrets. Specifically, we find 52,107 private keys and 3,158 leaked API secrets, both opening a large attack surface, i.e., putting authentication and confidentiality of privacy-sensitive data at stake and even allow active attacks. We further document that those leaked keys are used in the wild: While we discovered 1,060 certificates relying on compromised keys being issued by public certificate authorities, based on further active Internet measurements, we find 275,269 TLS and SSH hosts using leaked private keys for authentication. To counteract this issue, we discuss how our methodology can be used to prevent secret leakage and reuse. network security; security configuration; secret leakage; container ven2us, internet-of-production, https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-dahlmanns-asiaccs.pdf ACM Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security (ASIACCS '23), July 10-14, 2023, Melbourne, VIC, Australia Melbourne, VIC, Australia ASIA CCS '23 July 10-14, 2023 979-8-4007-0098-9/23/07 10.1145/3579856.3590329 1 MarkusDahlmanns ConstantinSander RobinDecker KlausWehrle inproceedings 2023_pennekamp_benchmarking_comparison 2023 6 15 13901 489-505 Benchmarking is an essential tool for industrial organizations to identify potentials that allows them to improve their competitive position through operational and strategic means. However, the handling of sensitive information, in terms of (i) internal company data and (ii) the underlying algorithm to compute the benchmark, demands strict (technical) confidentiality guarantees—an aspect that existing approaches fail to address adequately. Still, advances in private computing provide us with building blocks to reliably secure even complex computations and their inputs, as present in industry benchmarks. In this paper, we thus compare two promising and fundamentally different concepts (hardware- and software-based) to realize privacy-preserving benchmarks. Thereby, we provide detailed insights into the concept-specific benefits. Our evaluation of two real-world use cases from different industries underlines that realizing and deploying secure information systems for industry benchmarking is possible with today's building blocks from private computing. Lecture Notes in Computer Science (LNCS), Volume 13901 real-world computing; trusted execution environments; homomorphic encryption; key performance indicators; benchmarking internet-of-production https://jpennekamp.de/wp-content/papercite-data/pdf/plv+23.pdf Springer Proceedings of the 35th International Conference on Advanced Information Systems Engineering (CAiSE '23), June 12-16, 2023, Zaragoza, Spain Zaragoza, Spain 35th International Conference on Advanced Information Systems Engineering (CAiSE '23) June 12-16, 2023 978-3-031-34559-3 0302-9743 10.1007/978-3-031-34560-9_29 1 JanPennekamp JohannesLohmöller EduardVlad JoschaLoos NiklasRodemann PatrickSapel Ina BereniceFink SethSchmitz ChristianHopmann MatthiasJarke GüntherSchuh KlausWehrle MartinHenze inproceedings 2023-grote-mvca-fairness 2023 6 https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-grote-mvca-fairness.pdf IFIP/IEEE Proceedings of the Network Traffic Measurement and Analysis Conference (TMA '23) 978-3-903176-58-4 10.23919/TMA58422.2023.10199019 1 LaurenzGrote IkeKunze ConstantinSander KlausWehrle article 2023-circres-wu-comp-ecosystem Circulation research 2023 4 14 132 8 1084-1100 Online en 10.1161/CIRCRESAHA.123.321765 1 ZhuojunWu JohannesLohmöller ChristianeKuhl KlausWehrle JoachimJankowski incollection 2023_pennekamp_crd-a.i 2023 2 8 35-60 The Internet of Production (IoP) leverages concepts such as digital shadows, data lakes, and a World Wide Lab (WWL) to advance today’s production. Consequently, it requires a technical infrastructure that can support the agile deployment of these concepts and corresponding high-level applications, which, e.g., demand the processing of massive data in motion and at rest. As such, key research aspects are the support for low-latency control loops, concepts on scalable data stream processing, deployable information security, and semantically rich and efficient long-term storage. In particular, such an infrastructure cannot continue to be limited to machines and sensors, but additionally needs to encompass networked environments: production cells, edge computing, and location-independent cloud infrastructures. Finally, in light of the envisioned WWL, i.e., the interconnection of production sites, the technical infrastructure must be advanced to support secure and privacy-preserving industrial collaboration. To evolve today’s production sites and lay the infrastructural foundation for the IoP, we identify five broad streams of research: (1) adapting data and stream processing to heterogeneous data from distributed sources, (2) ensuring data interoperability between systems and production sites, (3) exchanging and sharing data with different stakeholders, (4) network security approaches addressing the risks of increasing interconnectivity, and (5) security architectures to enable secure and privacy-preserving industrial collaboration. With our research, we evolve the underlying infrastructure from isolated, sparsely networked production sites toward an architecture that supports high-level applications and sophisticated digital shadows while facilitating the transition toward a WWL. Cyber-physical production systems; Data streams; Industrial data processing; Industrial network security; Industrial data security; Secure industrial collaboration internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-pennekamp-iop-a.i.pdf Springer Interdisciplinary Excellence Accelerator Series Internet of Production: Fundamentals, Applications and Proceedings 978-3-031-44496-8 10.1007/978-3-031-44497-5_2 1 JanPennekamp AnastasiiaBelova ThomasBergs MatthiasBodenbenner AndreasBührig-Polaczek MarkusDahlmanns IkeKunze MoritzKröger SandraGeisler MartinHenze DanielLütticke BenjaminMontavon PhilippNiemietz LuciaOrtjohann MaximilianRudack Robert H.Schmitt UweVroomen KlausWehrle MichaelZeng incollection 2023_rueppel_crd-b2.ii 2023 2 8 221-246 The main objectives in production technology are quality assurance, cost reduction, and guaranteed process safety and stability. Digital shadows enable a more comprehensive understanding and monitoring of processes on shop floor level. Thus, process information becomes available between decision levels, and the aforementioned criteria regarding quality, cost, or safety can be included in control decisions for production processes. The contextual data for digital shadows typically arises from heterogeneous sources. At shop floor level, the proximity to the process requires usage of available data as well as domain knowledge. Data sources need to be selected, synchronized, and processed. Especially high-frequency data requires algorithms for intelligent distribution and efficient filtering of the main information using real-time devices and in-network computing. Real-time data is enriched by simulations, metadata from product planning, and information across the whole process chain. Well-established analytical and empirical models serve as the base for new hybrid, gray box approaches. These models are then applied to optimize production process control by maximizing the productivity under given quality and safety constraints. To store and reuse the developed models, ontologies are developed and a data lake infrastructure is utilized and constantly enlarged laying the basis for a World Wide Lab (WWL). Finally, closing the control loop requires efficient quality assessment, immediately after the process and directly on the machine. This chapter addresses works in a connected job shop to acquire data, identify and optimize models, and automate systems and their deployment in the Internet of Production (IoP). Process control; Model-based control; Data aggregation; Model identification; Model optimization internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-rueppel-iop-b2.i.pdf Springer Interdisciplinary Excellence Accelerator Series Internet of Production: Fundamentals, Applications and Proceedings 978-3-031-44496-8 10.1007/978-3-031-44497-5_7 1 Adrian KarlRüppel MuzafferAy BenediktBiernat IkeKunze MarkusLandwehr SamuelMann JanPennekamp PascalRabe Mark P.Sanders DominikScheurenberg SvenSchiller TiandongXi DirkAbel ThomasBergs ChristianBrecher UweReisgen Robert H.Schmitt KlausWehrle incollection 2023_klugewilkes_crd-b2.iv 2023 2 8 303-328 The increasing product variability and lack of skilled workers demand for autonomous, flexible production. Since assembly is considered a main cost driver and accounts for a major part of production time, research focuses on new technologies in assembly. The paradigm of Line-less Mobile Assembly Systems (LMAS) provides a solution for the future of assembly by mobilizing all resources. Thus, dynamic product routes through spatiotemporally configured assembly stations on a shop floor free of fixed obstacles are enabled. In this chapter, we present research focal points on different levels of LMAS, starting with the macroscopic level of formation planning, followed by the mesoscopic level of mobile robot control and multipurpose input devices and the microscopic level of services, such as interpreting autonomous decisions and in-network computing. We provide cross-level data and knowledge transfer through a novel ontology-based knowledge management. Overall, our work contributes to future safe and predictable human-robot collaboration in dynamic LMAS stations based on accurate online formation and motion planning of mobile robots, novel human-machine interfaces and networking technologies, as well as trustworthy AI-based decisions. Lineless mobile assembly systems (LMAS); Formation planning; Online motion planning; In-network computing; Interpretable AI; Human-machine collaboration; Ontology-based knowledge management internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-klugewilkes-iop-b2.iv.pdf Springer Interdisciplinary Excellence Accelerator Series Internet of Production: Fundamentals, Applications and Proceedings 978-3-031-44496-8 10.1007/978-3-031-44497-5_13 1 AlineKluge-Wilkes RalphBaier DanielGossen IkeKunze AleksandraMüller AmirShahidi DominikWolfschläger ChristianBrecher BurkhardCorves MathiasHüsing VerenaNitsch Robert H.Schmitt KlausWehrle inproceedings 2023-lorz-cired 2023 3286-3290 ven2us 27th International Conference on Electricity Distribution (CIRED 2023), Rome, Italy, June 12-15, 2023 Rome, Italy International Conference & Exhibition on Electricity Distribution (CIRED) June 12-15, 2023 10.1049/icp.2023.0864 1 TobiasLorz JohannJaeger AntigonaSelimaj ImmanuelHacker AndreasUlbig Jan-PeterHeckel ChristianBecker MarkusDahlmanns Ina BereniceFink KlausWehrle GerritErichsen MichaelSchindler RainerLuxenburger GuosongLin inproceedings 2022_kus_ensemble 2022 12 8 RWTH-2022-10809 Industrial intrusion detection promises to protect networked industrial control systems by monitoring them and raising an alarm in case of suspicious behavior. Many monolithic intrusion detection systems are proposed in literature. These detectors are often specialized and, thus, work particularly well on certain types of attacks or monitor different parts of the system, e.g., the network or the physical process. Combining multiple such systems promises to leverage their joint strengths, allowing the detection of a wider range of attacks due to their diverse specializations and reducing false positives. We study this concept's feasibility with initial results of various methods to combine detectors. rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-kus-ensemble-poster.pdf RWTH Aachen University 38th Annual Computer Security Applications Conference (ACSAC '22), December 5-9, 2022, Austin, TX, USA RWTH Aachen University Austin, TX, USA 38th Annual Computer Security Applications Conference (ACSAC '22) December 5-9, 2022 10.18154/RWTH-2022-10809 1 DominikKus KonradWolsing JanPennekamp EricWagner MartinHenze KlausWehrle inproceedings 2022_pennekamp_cumul 2022 12 8 RWTH-2022-10811 Anonymous communication on the Internet is about hiding the relationship between communicating parties. At NDSS '16, we presented a new website fingerprinting approach, CUMUL, that utilizes novel features and a simple yet powerful algorithm to attack anonymization networks such as Tor. Based on pattern observation of data flows, this attack aims at identifying the content of encrypted and anonymized connections. Apart from the feature generation and the used classifier, we also provided a large dataset to the research community to study the attack at Internet scale. In this paper, we emphasize the impact of our artifacts by analyzing publications referring to our work with respect to the dataset, feature extraction method, and source code of the implementation. Based on this data, we draw conclusions about the impact of our artifacts on the research field and discuss their influence on related cybersecurity topics. Overall, from 393 unique citations, we discover more than 130 academic references that utilize our artifacts, 61 among them are highly influential (according to SemanticScholar), and at least 35 are from top-ranked security venues. This data underlines the significant relevance and impact of our work as well as of our artifacts in the community and beyond. https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-pennekamp-cumul-artifacts.pdf https://www.acsac.org/2022/program/artifacts_competition/ ACSA Cybersecurity Artifacts Competition and Impact Award at 38th Annual Computer Security Applications Conference (ACSAC '22), December 5-9, 2022, Austin, TX, USA Austin, TX, USA 38th Annual Computer Security Applications Conference (ACSAC '22) December 5-9, 2022 10.18154/RWTH-2022-10811 1 JanPennekamp MartinHenze AndreasZinnen FabianLanze KlausWehrle AndriyPanchenko inproceedings 2022-wireless-anycast Proceedings of the 61st IEEE Conference on Decision and Control (CDC 2022) 2022 12 reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-glebke-wireless-anycast.pdf IEEE Proceedings of the 61st IEEE Conference on Decision and Control (CDC 2022) 10.1109/CDC51059.2022.9992864 1 RenéGlebke JanScheiper StefanLenz MirkoStoffers KlausWehrle inproceedings 2022-kunze-coin-transport 2022 11 https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-kunze-coin-transport.pdf Proceedings of the 1st Workshop on New IP and Beyond, co-located with the 30th IEEE International Conference on Network Protocols Lexington, Kentucky, USA 1st Workshop on New IP and Beyond, co-located with the 30th IEEE International Conference on Network Protocols 30 October, 2022 10.1109/ICNP55882.2022.9940379 1 IkeKunze DirkTrossen KlausWehrle inproceedings 2022_lohmoeller_sovereignty 2022 9 5 3306 51-63 Data ecosystems are the foundation of emerging data-driven business models as they (i) enable an automated exchange between their participants and (ii) provide them with access to huge and heterogeneous data sources. However, the corresponding benefits come with unforeseen risks as also sensitive information is potentially exposed. Consequently, data security is of utmost importance and, thus, a central requirement for the successful implementation of these ecosystems. Current initiatives, such as IDS and GAIA-X, hence foster sovereign participation via a federated infrastructure where participants retain local control. However, these designs place significant trust in remote infrastructure by mostly implementing organizational security measures such as certification processes prior to admission of a participant. At the same time, due to the sensitive nature of involved data, participants are incentivized to bypass security measures to maximize their own benefit: In practice, this issue significantly weakens sovereignty guarantees. In this paper, we hence claim that data ecosystems must be extended with technical means to reestablish such guarantees. To underpin our position, we analyze promising building blocks and identify three core research directions toward stronger data sovereignty, namely trusted remote policy enforcement, verifiable data tracking, and integration of resource-constrained participants. We conclude that these directions are critical to securely implement data ecosystems in data-sensitive contexts. internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-lohmoeller-deco.pdf CEUR Workshop Proceedings Proceedings of the 1st International Workshop on Data Ecosystems (DEco '22), co-located with the 48th International Conference on Very Large Databases (VLDB '22), September 5-9, 2022, Sydney, Australia, Sydney, Australia International Workshop on Data Ecosystems (DEco '22) September 5, 2022 1613-0073 1 JohannesLohmöller JanPennekamp RomanMatzutt KlausWehrle article 2022-henze-tii-prada IEEE Transactions on Cloud Computing 2022 9 10 3 1661-1674 In past years, cloud storage systems saw an enormous rise in usage. However, despite their popularity and importance as underlying infrastructure for more complex cloud services, today’s cloud storage systems do not account for compliance with regulatory, organizational, or contractual data handling requirements by design. Since legislation increasingly responds to rising data protection and privacy concerns, complying with data handling requirements becomes a crucial property for cloud storage systems. We present Prada , a practical approach to account for compliance with data handling requirements in key-value based cloud storage systems. To achieve this goal, Prada introduces a transparent data handling layer, which empowers clients to request specific data handling requirements and enables operators of cloud storage systems to comply with them. We implement Prada on top of the distributed database Cassandra and show in our evaluation that complying with data handling requirements in cloud storage systems is practical in real-world cloud deployments as used for microblogging, data sharing in the Internet of Things, and distributed email storage. https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-henze-tii-prada.pdf Online en 2168-7161 10.1109/TCC.2020.3000336 1 MartinHenze RomanMatzutt JensHiller ErikMühmer Jan HenrikZiegeldorf Johannesvan der Giet KlausWehrle proceedings 2022-wolsing-radarsec 2022 9 rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-wolsing-radar.pdf IEEE Edmonton, Canada 47th IEEE Conference on Local Computer Networks (LCN) September 26-29, 2022 10.1109/LCN53696.2022.9843801 1 KonradWolsing AntoineSaillard JanBauer EricWagner Christianvan Sloun Ina BereniceFink MariSchmidt KlausWehrle MartinHenze inproceedings 2022-wolsing-simple 2022 9 978-3-031-17143-7 574--594 Cyberattacks against industrial control systems pose a serious risk to the safety of humans and the environment. Industrial intrusion detection systems oppose this threat by continuously monitoring industrial processes and alerting any deviations from learned normal behavior. To this end, various streams of research rely on advanced and complex approaches, i.e., artificial neural networks, thus achieving allegedly high detection rates. However, as we show in an analysis of 70 approaches from related work, their inherent complexity comes with undesired properties. For example, they exhibit incomprehensible alarms and models only specialized personnel can understand, thus limiting their broad applicability in a heterogeneous industrial domain. Consequentially, we ask whether industrial intrusion detection indeed has to be complex or can be SIMPLE instead, i.e., Sufficient to detect most attacks, Independent of hyperparameters to dial-in, Meaningful in model and alerts, Portable to other industrial domains, Local to a part of the physical process, and computationally Efficient. To answer this question, we propose our design of four SIMPLE industrial intrusion detection systems, such as simple tests for the minima and maxima of process values or the rate at which process values change. Our evaluation of these SIMPLE approaches on four state-of-the-art industrial security datasets reveals that SIMPLE approaches can perform on par with existing complex approaches from related work while simultaneously being comprehensible and easily portable to other scenarios. Thus, it is indeed justified to raise the question of whether industrial intrusion detection needs to be inherently complex. https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-wolsing-simple.pdf Atluri, Vijayalakshmi and Di Pietro, Roberto and Jensen, Christian D. and Meng, Weizhi Springer Nature Switzerland Proceedings of the 27th European Symposium on Research in Computer Security (ESORICS '22), September 26-30, 2022, Copenhagen, Denmark Copenhagen, Denmark 27th European Symposium on Research in Computer Security (ESORICS) September 26-30, 2022 10.1007/978-3-031-17143-7_28 1 KonradWolsing LeaThiemt Christianvan Sloun EricWagner KlausWehrle MartinHenze inproceedings 2022-sander-h3-prio-hol 2022 6 27 legato https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-sander-h3-prio-hol.pdf https://tma.ifip.org/2022/wp-content/uploads/sites/11/2022/06/tma2022-paper28.pdf IFIP Proceedings of the Network Traffic Measurement and Analysis Conference (TMA '22) Enschede Network Traffic Measurement and Analysis Conference 27.06.22-30.06.22 978-3-903176-47-8 1 ConstantinSander IkeKunze KlausWehrle inproceedings 2022_dahlmanns_tlsiiot 2022 5 31 252-266 The ongoing trend to move industrial appliances from previously isolated networks to the Internet requires fundamental changes in security to uphold secure and safe operation. Consequently, to ensure end-to-end secure communication and authentication, (i) traditional industrial protocols, e.g., Modbus, are retrofitted with TLS support, and (ii) modern protocols, e.g., MQTT, are directly designed to use TLS. To understand whether these changes indeed lead to secure Industrial Internet of Things deployments, i.e., using TLS-based protocols, which are configured according to security best practices, we perform an Internet-wide security assessment of ten industrial protocols covering the complete IPv4 address space. Our results show that both, retrofitted existing protocols and newly developed secure alternatives, are barely noticeable in the wild. While we find that new protocols have a higher TLS adoption rate than traditional protocols (7.2 % vs. 0.4 %), the overall adoption of TLS is comparably low (6.5 % of hosts). Thus, most industrial deployments (934,736 hosts) are insecurely connected to the Internet. Furthermore, we identify that 42 % of hosts with TLS support (26,665 hosts) show security deficits, e.g., missing access control. Finally, we show that support in configuring systems securely, e.g., via configuration templates, is promising to strengthen security. industrial communication; network security; security configuration internet-of-production, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-dahlmanns-asiaccs.pdf ACM Proceedings of the 2022 ACM Asia Conference on Computer and Communications Security (ASIACCS '22), May 30-June 3, 2022, Nagasaki, Japan Nagasaki, Japan ASIACCS '22 May 30-June 3, 2022 978-1-4503-9140-5/22/05 10.1145/3488932.3497762 1 MarkusDahlmanns JohannesLohmöller JanPennekamp JörnBodenhausen KlausWehrle MartinHenze inproceedings 2022_kus_iids_generalizability 2022 5 30 73-84 Anomaly-based intrusion detection promises to detect novel or unknown attacks on industrial control systems by modeling expected system behavior and raising corresponding alarms for any deviations. As manually creating these behavioral models is tedious and error-prone, research focuses on machine learning to train them automatically, achieving detection rates upwards of 99 %. However, these approaches are typically trained not only on benign traffic but also on attacks and then evaluated against the same type of attack used for training. Hence, their actual, real-world performance on unknown (not trained on) attacks remains unclear. In turn, the reported near-perfect detection rates of machine learning-based intrusion detection might create a false sense of security. To assess this situation and clarify the real potential of machine learning-based industrial intrusion detection, we develop an evaluation methodology and examine multiple approaches from literature for their performance on unknown attacks (excluded from training). Our results highlight an ineffectiveness in detecting unknown attacks, with detection rates dropping to between 3.2 % and 14.7 % for some types of attacks. Moving forward, we derive recommendations for further research on machine learning-based approaches to ensure clarity on their ability to detect unknown attacks. anomaly detection; machine learning; industrial control system internet-of-production, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-kus-iids-generalizability.pdf ACM Proceedings of the 8th ACM Cyber-Physical System Security Workshop (CPSS '22), co-located with the 17th ACM ASIA Conference on Computer and Communications Security (ASIACCS '22), May 30-June 3, 2022, Nagasaki, Japan 978-1-4503-9176-4/22/05 10.1145/3494107.3522773 1 DominikKus EricWagner JanPennekamp KonradWolsing Ina BereniceFink MarkusDahlmanns KlausWehrle MartinHenze inproceedings WagnerSWH2022 2022 5 18 201-206 /fileadmin/papers/2022/2022-wagner-bpmac.pdf ACM Proceedings of the 15th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec '22) San Antonio, Texas, USA 15th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec '22) 978-1-4503-9216-7/22/05 10.1145/3507657.3528554 1 EricWagner MartinSerror KlausWehrle MartinHenze inproceedings 2022_wagner_ccchain 2022 5 4 Blockchain technology promises to overcome trust and privacy concerns inherent to centralized information sharing. However, current decentralized supply chain management systems do either not meet privacy and scalability requirements or require a trustworthy consortium, which is challenging for increasingly dynamic supply chains with constantly changing participants. In this paper, we propose CCChain, a scalable and privacy-aware supply chain management system that stores all information locally to give companies complete sovereignty over who accesses their data. Still, tamper protection of all data through a permissionless blockchain enables on-demand tracking and tracing of products as well as reliable information sharing while affording the detection of data inconsistencies. Our evaluation confirms that CCChain offers superior scalability in comparison to alternatives while also enabling near real-time tracking and tracing for many, less complex products. supply chain management; blockchain; permissionless; deployment; tracing and tracking; privacy internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-wagner-ccchain.pdf IEEE Proceedings of the 2022 IEEE International Conference on Blockchain and Cryptocurrency (ICBC '22), May 2-5, 2022, Shanghai, China Shanghai, China May 2-5, 2022 978-1-6654-9538-7/22 10.1109/ICBC54727.2022.9805503 1 EricWagner RomanMatzutt JanPennekamp LennartBader IrakliBajelidze KlausWehrle MartinHenze inproceedings 2022_matzutt_redactchain 2022 5 3 Blockchains gained tremendous attention for their capability to provide immutable and decentralized event ledgers that can facilitate interactions between mutually distrusting parties. However, precisely this immutability and the openness of permissionless blockchains raised concerns about the consequences of illicit content being irreversibly stored on them. Related work coined the notion of redactable blockchains, which allow for removing illicit content from their history without affecting the blockchain's integrity. While honest users can safely prune identified content, current approaches either create trust issues by empowering fixed third parties to rewrite history, cannot react quickly to reported content due to using lengthy public votings, or create large per-redaction overheads. In this paper, we instead propose to outsource redactions to small and periodically exchanged juries, whose members can only jointly redact transactions using chameleon hash functions and threshold cryptography. Multiple juries are active at the same time to swiftly redact reported content. They oversee their activities via a global redaction log, which provides transparency and allows for appealing and reversing a rogue jury's decisions. Hence, our approach establishes a framework for the swift and transparent moderation of blockchain content. Our evaluation shows that our moderation scheme can be realized with feasible per-block and per-redaction overheads, i.e., the redaction capabilities do not impede the blockchain's normal operation. redactable blockchain; illicit content; chameleon hash functions; threshold cryptography mynedata; impact-digital; digital-campus https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-matzutt-redactchain.pdf IEEE Proceedings of the 2022 IEEE International Conference on Blockchain and Cryptocurrency (ICBC '22), May 2-5, 2022, Shanghai, China Shanghai, China May 2-5, 2022 978-1-6654-9538-7/22 10.1109/ICBC54727.2022.9805508 1 RomanMatzutt VincentAhlrichs JanPennekamp RomanKarwacik KlausWehrle article 2022_brauner_iop ACM Transactions on Internet of Things 2022 5 1 3 2 The Industrial Internet-of-Things (IIoT) promises significant improvements for the manufacturing industry by facilitating the integration of manufacturing systems by Digital Twins. However, ecological and economic demands also require a cross-domain linkage of multiple scientific perspectives from material sciences, engineering, operations, business, and ergonomics, as optimization opportunities can be derived from any of these perspectives. To extend the IIoT to a true Internet of Production, two concepts are required: first, a complex, interrelated network of Digital Shadows which combine domain-specific models with data-driven AI methods; and second, the integration of a large number of research labs, engineering, and production sites as a World Wide Lab which offers controlled exchange of selected, innovation-relevant data even across company boundaries. In this article, we define the underlying Computer Science challenges implied by these novel concepts in four layers: Smart human interfaces provide access to information that has been generated by model-integrated AI. Given the large variety of manufacturing data, new data modeling techniques should enable efficient management of Digital Shadows, which is supported by an interconnected infrastructure. Based on a detailed analysis of these challenges, we derive a systematized research roadmap to make the vision of the Internet of Production a reality. Internet of Production; World Wide Lab; Digital Shadows; Industrial Internet of Things internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-brauner-digital-transformation.pdf ACM 2691-1914 10.1145/3502265 1 PhilippBrauner ManuelaDalibor MatthiasJarke IkeKunze IstvánKoren GerhardLakemeyer MartinLiebenberg JudithMichael JanPennekamp ChristophQuix BernhardRumpe Wilvan der Aalst KlausWehrle AndreasWortmann MartinaZiefle techreport draft-irtf-coinrg-use-cases-02 2022 3 draft-irtf-coinrg-use-cases-02 expires: 8 September 2022 (work in progress) https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/draft-irtf-coinrg-use-cases-02.pdf https://datatracker.ietf.org/doc/draft-irtf-coinrg-use-cases/ Online IETF Trust Internet Drafts Internet Engineering Task Force Internet Engineering Task Force IkeKunze KlausWehrle DirkTrossen Marie-JoséMontpetit Xavierde Foy DavidGriffin MiguelRio article 2022-wolsing-aistracks Journal of Marine Science and Engineering 2022 1 14 10 1 The automatic identification system (AIS) was introduced in the maritime domain to increase the safety of sea traffic. AIS messages are transmitted as broadcasts to nearby ships and contain, among others, information about the identification, position, speed, and course of the sending vessels. AIS can thus serve as a tool to avoid collisions and increase onboard situational awareness. In recent years, AIS has been utilized in more and more applications since it enables worldwide surveillance of virtually any larger vessel and has the potential to greatly support vessel traffic services and collision risk assessment. Anomalies in AIS tracks can indicate events that are relevant in terms of safety and also security. With a plethora of accessible AIS data nowadays, there is a growing need for the automatic detection of anomalous AIS data. In this paper, we survey 44 research articles on anomaly detection of maritime AIS tracks. We identify the tackled AIS anomaly types, assess their potential use cases, and closely examine the landscape of recent AIS anomaly research as well as their limitations. automatic identification system; AIS; anomaly detection; maritime safety; maritime security; maritime surveillance https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/2022-wolsing-aistracks.pdf https://www.mdpi.com/2077-1312/10/1/112 en 10.3390/jmse10010112 1 KonradWolsing LinusRoepert JanBauer KlausWehrle inproceedings lorenz-ven2us-2022 2022 Power grids are increasingly faced with the introduction of decentralized, highly volatile power supplies from renewable energies and high loads occurring from e-mobility. However, today’s static grid protection cannot manage all upcoming conditions while providing a high level of dependability and security. It forms a bottleneck of a future decarbonizing grid development. In our research project, we develop and verify an adaptive grid protection algorithm. It calculates situation dependent protection parameters for the event of power flow shifts and topology changes caused by volatile power supplies due to the increase of renewable generation and the rapid expansion of e-mobility. As a result the distribution grid can be operated with the optimally adapted protection parameters and functions for changing operating states. To safely adjust the values on protection hardware in the field, i.e., safe from hardware failures and cyberattacks, we research resilient and secure communication concepts for the adaptive and interconnected grid protection system. Finally, we validate our concept and system by demonstrations in the laboratory and field tests. ven2us Proceedings of the CIRED workshop on E-mobility and power distribution systems 2022, June 2-3, 2022, Porto, Portugal Porto CIRED workshop on E-mobility and power distribution systems 2022 June 2-3, 2022 10.1049/icp.2022.0768 1 MatthiasLorenz Tobias MarkusPletzer MalteSchuhmacher TorstenSowa MichaelDahms SimonStock DavoodBabazadeh ChristianBecker JohannJaeger TobiasLorz MarkusDahlmanns Ina BereniceFink KlausWehrle AndreasUlbig PhilippLinnartz AntigonaSelimaj ThomasOffergeld inproceedings 2021_pennekamp_laser 2021 12 21 Following the recent Internet of Things-induced trends on digitization in general, industrial applications will further evolve as well. With a focus on the domains of manufacturing and production, the Internet of Production pursues the vision of a digitized, globally interconnected, yet secure environment by establishing a distributed knowledge base. Background. As part of our collaborative research of advancing the scope of industrial applications through cybersecurity and privacy, we identified a set of common challenges and pitfalls that surface in such applied interdisciplinary collaborations. Aim. Our goal with this paper is to support researchers in the emerging field of cybersecurity in industrial settings by formalizing our experiences as reference for other research efforts, in industry and academia alike. Method. Based on our experience, we derived a process cycle of performing such interdisciplinary research, from the initial idea to the eventual dissemination and paper writing. This presented methodology strives to successfully bootstrap further research and to encourage further work in this emerging area. Results. Apart from our newly proposed process cycle, we report on our experiences and conduct a case study applying this methodology, raising awareness for challenges in cybersecurity research for industrial applications. We further detail the interplay between our process cycle and the data lifecycle in applied research data management. Finally, we augment our discussion with an industrial as well as an academic view on this research area and highlight that both areas still have to overcome significant challenges to sustainably and securely advance industrial applications. Conclusions. With our proposed process cycle for interdisciplinary research in the intersection of cybersecurity and industrial application, we provide a foundation for further research. We look forward to promising research initiatives, projects, and directions that emerge based on our methodological work. internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-pennekamp-laser-collaboration.pdf ACSA Proceedings of the Workshop on Learning from Authoritative Security Experiment Results (LASER '20), co-located with the 36th Annual Computer Security Applications Conference (ACSAC '20), December 7-11, 2020, Austin, TX, USA Austin, TX, USA Learning from Authoritative Security Experiment Results (LASER '20) December 8, 2020 978-1-891562-81-5 10.14722/laser-acsac.2020.23088 1 JanPennekamp ErikBuchholz MarkusDahlmanns IkeKunze StefanBraun EricWagner MatthiasBrockmann KlausWehrle MartinHenze inproceedings 2021-kunze-spin-tracker 2021 12 7 15–21 https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kunze-spin-tracker.pdf ACM Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC (EPIQ '21) 9781450391351 10.1145/3488660.3493804 1 IkeKunze ConstantinSander KlausWehrle JanRüth inproceedings 2021-krude-nfp-pred 2021 12 7 maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-krude-nfp-pred.pdf ACM The 17th International Conference on emerging Networking EXperiments and Technologies (CoNEXT '21) 978-1-4503-9098-9/21/12 10.1145/3485983.3494842 1 JohannesKrude JanRüth DanielSchemmel FelixRath Iohannes-HeorhFolbort KlausWehrle inproceedings 2021_mitseva_sequences 2021 11 17 2411-2413 Website fingerprinting (WFP) is a special case of traffic analysis, where a passive attacker infers information about the content of encrypted and anonymized connections by observing patterns of data flows. Although modern WFP attacks pose a serious threat to online privacy of users, including Tor users, they usually aim to detect single pages only. By ignoring the browsing behavior of users, the attacker excludes valuable information: users visit multiple pages of a single website consecutively, e.g., by following links. In this paper, we propose two novel methods that can take advantage of the consecutive visits of multiple pages to detect websites. We show that two up to three clicks within a site allow attackers to boost the accuracy by more than 20% and to dramatically increase the threat to users' privacy. We argue that WFP defenses have to consider this new dimension of the attack surface. Traffic Analysis; Website Fingerprinting; Web Privacy https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-mitseva-fingerprinting-sequences.pdf ACM Proceedings of the 28th ACM SIGSAC Conference on Computer and Communications Security (CCS '21), November 15-19, 2021, Seoul, Korea Seoul, Korea November 15-19, 2021 978-1-4503-8454-4/21/11 10.1145/3460120.3485347 1 AsyaMitseva JanPennekamp JohannesLohmöller TorstenZiemann CarlHoerchner KlausWehrle AndriyPanchenko inproceedings 2021_pennekamp_bootstrapping 2021 11 15 RWTH-2021-09499 In addition to quality improvements and cost reductions, dynamic and flexible business relationships are expected to become more important in the future to account for specific customer change requests or small-batch production. Today, despite reservation, sensitive information must be shared upfront between buyers and sellers. However, without a trust relation, this situation is precarious for the involved companies as they fear for their competitiveness following information leaks or breaches of their privacy. To address this issue, the concepts of confidential computing and cloud computing come to mind as they promise to offer scalable approaches that preserve the privacy of participating companies. In particular, designs building on confidential computing can help to technically enforce privacy. Moreover, cloud computing constitutes an elegant design choice to scale these novel protocols to industry needs while limiting the setup and management overhead for practitioners. Thus, novel approaches in this area can advance the status quo of bootstrapping new relationships as they provide privacy-preserving alternatives that are suitable for immediate deployment. bootstrapping procurement; business relationships; secure industrial collaboration; privacy; Internet of Production internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-pennekamp-bootstrapping.pdf RWTH Aachen University Blitz Talk at the 2021 Cloud Computing Security Workshop (CCSW '21), co-located with the 28th ACM SIGSAC Conference on Computer and Communications Security (CCS '21), November 15-19, 2021, Seoul, Korea RWTH Aachen University Seoul, Korea November 14, 2021 10.18154/RWTH-2021-09499 JanPennekamp FrederikFuhrmann MarkusDahlmanns TimoHeutmann AlexanderKreppein DennisGrunert ChristophLange Robert H.Schmitt KlausWehrle inproceedings 2021-sander-shardingrevisited 2021 11 2 legato /fileadmin/papers/2021/2021-sander-sharding-revisited.pdf https://arxiv.org/abs/2110.14239 ACM Proceedings of the Internet Measurement Conference (IMC '21) Internet Measurement Conference 2021 02.11.21 - 04.11.21 978-1-4503-9129-0/21/11 10.1145/3487552.3487832 1 ConstantinSander LeoBlöcher KlausWehrle JanRüth article 2021_kretschmer_cookies ACM Transactions on the Web 2021 11 1 15 4 The General Data Protection Regulation (GDPR) is in effect since May of 2018. As one of the most comprehensive pieces of legislation concerning privacy, it sparked a lot of discussion on the effect it would have on users and providers of online services in particular, due to the large amount of personal data processed in this context. Almost three years later, we are interested in revisiting this question to summarize the impact this new regulation has had on actors in the World Wide Web. Using Scopus, we obtain a vast corpus of academic work to survey studies related to changes on websites since and around the time, the GDPR went into force. Our findings show that the emphasis on privacy increased w.r.t. online services, but plenty potential for improvements remains. Although online services are on average more transparent regarding data processing practices in their public data policies, a majority of these policies still either lack information required by the GDPR (e.g., contact information for users to file privacy inquiries), or do not provide this information in a user-friendly form. Additionally, we summarize that online services more often provide means for their users to opt out of data processing, but regularly obstruct convenient access to such means through unnecessarily complex and sometimes illegitimate interface design. Our survey further details that this situation contradicts the preferences expressed by users both verbally and through their actions, and researchers have proposed multiple approaches to facilitate GDPR-conform data processing without negatively impacting the user experience. Thus, we compiled reoccurring points of criticism by privacy researchers and data protection authorities into a list of four guidelines for service providers to consider. Cookies; Privacy; GDPR; Web; Privacy Legislation; Fingerprinting https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kretschmer-tweb-cookies.pdf ACM 1559-1131 10.1145/3466722 1 MichaelKretschmer JanPennekamp KlausWehrle proceedings fink-lcn-demons-2021 2021 10 4 nerd-nrw https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-fink-lcn-demons.pdf IEEE online Edmonton, Canada 46th IEEE Conference on Local Computer Networks (LCN) October 4-7, 2021 10.1109/LCN52139.2021.9524879 1 Ina BereniceFink MartinSerror KlausWehrle techreport draft-kunze-coinrg-transport-issues-05 2021 10 draft-kunze-coinrg-transport-issues-05 Expires: 28 April 2022 (work in progress) https://www.comsys.rwth-aachen.de/fileadmin/papers/2022/draft-kunze-coinrg-transport-issues-05.pdf https://datatracker.ietf.org/doc/draft-kunze-coinrg-transport-issues/ IETF Trust Internet Drafts Internet Engineering Task Force Internet Engineering Task Force IkeKunze KlausWehrle DirkTrossen inproceedings 2021_reuter_demo 2021 9 14 Website fingerprinting (WFP) attacks on the anonymity network Tor have become ever more effective. Furthermore, research discovered that proposed defenses are insufficient or cause high overhead. In previous work, we presented a new WFP defense for Tor that incorporates multipath transmissions to repel malicious Tor nodes from conducting WFP attacks. In this demo, we showcase the operation of our traffic splitting defense by visually illustrating the underlying Tor multipath transmission using LED-equipped Raspberry Pis. Electronic Communications of the EASST, Volume 080 Onion Routing; Website Fingerprinting; Multipath Traffic; Privacy https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-reuter-splitting-demo.pdf TU Berlin Proceedings of the 2021 International Conference on Networked Systems (NetSys '21), September 13-16, 2021, Lübeck, Germany Lübeck, Germany September 13-16, 2021 1863-2122 10.14279/tuj.eceasst.80.1151 1 SebastianReuter JensHiller JanPennekamp AndriyPanchenko KlausWehrle article 2021_pennekamp_accountable_manufacturing Automation 2021 9 13 2 3 202-219 The Internet of Things provides manufacturing with rich data for increased automation. Beyond company-internal data exploitation, the sharing of product and manufacturing process data along and across supply chains enables more efficient production flows and product lifecycle management. Even more, data-based automation facilitates short-lived ad hoc collaborations, realizing highly dynamic business relationships for sustainable exploitation of production resources and capacities. However, the sharing and use of business data across manufacturers and with end customers add requirements on data accountability, verifiability, and reliability and needs to consider security and privacy demands. While research has already identified blockchain technology as a key technology to address these challenges, current solutions mainly evolve around logistics or focus on established business relationships instead of automated but highly dynamic collaborations that cannot draw upon long-term trust relationships. We identify three open research areas on the road to such a truly accountable and dependable manufacturing enabled by blockchain technology: blockchain-inherent challenges, scenario-driven challenges, and socio-economic challenges. Especially tackling the scenario-driven challenges, we discuss requirements and options for realizing a blockchain-based trustworthy information store and outline its use for automation to achieve a reliable sharing of product information, efficient and dependable collaboration, and dynamic distributed markets without requiring established long-term trust. blockchain; supply chain management; Industry 4.0; manufacturing; secure industrial collaboration; scalability; Industrial Internet of Things; Internet of Production internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-pennekamp-manufacturing.pdf MDPI 2673-4052 10.3390/automation2030013 1 JanPennekamp RomanMatzutt Salil S.Kanhere JensHiller KlausWehrle article 2021_matzutt_coinprune_v2 IEEE Transactions on Network and Service Management 2021 9 10 18 3 3064-3078 Popular cryptocurrencies continue to face serious scalability issues due to their ever-growing blockchains. Thus, modern blockchain designs began to prune old blocks and rely on recent snapshots for their bootstrapping processes instead. Unfortunately, established systems are often considered incapable of adopting these improvements. In this work, we present CoinPrune, our block-pruning scheme with full Bitcoin compatibility, to revise this popular belief. CoinPrune bootstraps joining nodes via snapshots that are periodically created from Bitcoin's set of unspent transaction outputs (UTXO set). Our scheme establishes trust in these snapshots by relying on CoinPrune-supporting miners to mutually reaffirm a snapshot's correctness on the blockchain. This way, snapshots remain trustworthy even if adversaries attempt to tamper with them. Our scheme maintains its retrospective deployability by relying on positive feedback only, i.e., blocks containing invalid reaffirmations are not rejected, but invalid reaffirmations are outpaced by the benign ones created by an honest majority among CoinPrune-supporting miners. Already today, CoinPrune reduces the storage requirements for Bitcoin nodes by two orders of magnitude, as joining nodes need to fetch and process only 6 GiB instead of 271 GiB of data in our evaluation, reducing the synchronization time of powerful devices from currently 7 h to 51 min, with even larger potential drops for less powerful devices. CoinPrune is further aware of higher-level application data, i.e., it conserves otherwise pruned application data and allows nodes to obfuscate objectionable and potentially illegal blockchain content from their UTXO set and the snapshots they distribute. blockchain; block pruning; synchronization; bootstrapping; scalability; velvet fork; Bitcoin mynedata; impact_digital; digital_campus https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-matzutt-coinprune-v2.pdf English 1932-4537 10.1109/TNSM.2021.3073270 1 RomanMatzutt BenediktKalde JanPennekamp ArthurDrichel MartinHenze KlausWehrle article 2021_pennekamp_ercim ERCIM News 2021 7 9 126 24-25 In industrial settings, significant process improvements can be achieved when utilising and sharing information across stakeholders. However, traditionally conservative companies impose significant confidentiality requirements for any (external) data processing. We discuss how privacy-preserving computation can unlock secure and private collaborations even in such competitive environments. internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-pennekamp-ercim-news.pdf https://ercim-news.ercim.eu/en126/special/unlocking-secure-industrial-collaborations-through-privacy-preserving-computation ERCIM EEIG 0926-4981 JanPennekamp MartinHenze KlausWehrle inproceedings 2021-kunze-efm-evaluation 2021 7 22 - 28 /fileadmin/papers/2021/2021-kunze-efm-evaluation.pdf ACM ANRW '21: Proceedings of the Applied Networking Research Workshop Virtual Event Applied Networking Research Workshop (ANRW '21) July 2021 10.1145/3472305.3472319 1 IkeKunze KlausWehrle JanRüth inproceedings 2021-kunze-signal-detection 2021 6 10 internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kunze-signal-detection.pdf IEEE Proceedings of the 2021 IEEE 30th International Symposium on Industrial Electronics (ISIE) 978-1-7281-9023-5 2163-5145 10.1109/ISIE45552.2021.9576221 1 IkeKunze PhilippNiemietz LiamTirpitz RenéGlebke DanielTrauth ThomasBergs KlausWehrle inproceedings 2021-glebke-service-based-forwarding 2021 6 10 reflexes /fileadmin/papers/2021/2021-glebke-service-based-forwarding.pdf IEEE Proceedings of the 2021 IEEE International Conference on High Performance Switching and Routing: Workshop on Semantic Addressing and Routing for Future Networks (SARNET-21) 978-1-6654-4005-9 2325-5609 10.1109/HPSR52026.2021.9481814 1 RenéGlebke DirkTrossen IkeKunze DavidLou JanRüth MirkoStoffers KlausWehrle inproceedings 2021_mangel_reshare 2021 6 8 12731 265-283 As decision-making is increasingly data-driven, trustworthiness and reliability of the underlying data, e.g., maintained in knowledge graphs or on the Web, are essential requirements for their usability in the industry. However, neither traditional solutions, such as paper-based data curation processes, nor state-of-the-art approaches, such as distributed ledger technologies, adequately scale to the complex requirements and high throughput of continuously evolving industrial data. Motivated by a practical use case with high demands towards data trustworthiness and reliability, we identify the need for digitally-verifiable data immutability as a still insufficiently addressed dimension of data quality. Based on our discussion of shortcomings in related work, we thus propose ReShare, our novel concept of digital transmission contracts with bilateral signatures, to address this open issue for both RDF knowledge graphs and arbitrary data on the Web. Our quantitative evaluation of ReShare’s performance and scalability reveals only moderate computation and communication overhead, indicating significant potential for cost-reductions compared to today’s approaches. By cleverly integrating digital transmission contracts with existing Web-based information systems, ReShare provides a promising foundation for data sharing and reuse in Industry 4.0 and beyond, enabling digital accountability through easily-adoptable digitally-verifiable data immutability and non-repudiation. Lecture Notes in Computer Science (LNCS), Volume 12731 Digital transmission contracts; Trust; Data immutability; Non-repudiation; Accountability; Data dynamics; Linked Data; Knowledge graphs internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-mangel-eswc-reshare.pdf Springer Proceedings of the 18th Extended Semantic Web Conference (ESWC '21), June 6-10, 2021, Heraklion, Greece Heraklion, Greece June 6-10, 2021 978-3-030-77384-7 0302-9743 10.1007/978-3-030-77385-4_16 1 SimonMangel LarsGleim JanPennekamp KlausWehrle StefanDecker inproceedings 2021-kunze-coordinate-transformation 2021 5 11 334-340 in-network computing; latency; approximation internet-of-production,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kunze-coordinate-transformation.pdf IEEE Proceedings of the 4th IEEE International Conference on Industrial Cyber-Physical Systems (ICPS '21) 978-1-7281-6207-2 10.1109/ICPS49255.2021.9468247 1 IkeKunze RenéGlebke JanScheiper MatthiasBodenbenner Robert H.Schmitt KlausWehrle article 2021_buckhorst_lmas Procedia CIRP 2021 5 3 99 448-453 Assembly systems must provide maximum flexibility qualified by organization and technology to offer cost-compliant performance features to differentiate themselves from competitors in buyers' markets. By mobilization of multipurpose resources and dynamic planning, Line-less Mobile Assembly Systems (LMASs) offer organizational reconfigurability. By proposing a holarchy to combine LMASs with the concept of an Internet of Production (IoP), we enable LMASs to source valuable information from cross-level production networks, physical resources, software nodes, and data stores that are interconnected in an IoP. The presented holarchy provides a concept of how to address future challenges, meet the requirements of shorter lead times, and unique lifecycle support. The paper suggests an application of decision making, distributed sensor services, recommender-based data reduction, and in-network computing while considering safety and human usability alike. Proceedings of the 14th CIRP Conference on Intelligent Computation in Manufacturing Engineering (ICME '20), July 14-17, 2020, Gulf of Naples, Italy Internet of Production; Line-less Mobile Assembly System; Industrial Assembly; Smart Factory internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-buckhorst-holarchy.pdf Elsevier Gulf of Naples, Italy July 14-17, 2020 2212-8271 10.1016/j.procir.2021.03.064 1 Armin F.Buckhorst BenjaminMontavon DominikWolfschläger MelanieBuchsbaum AmirShahidi HenningPetruck IkeKunze JanPennekamp ChristianBrecher MathiasHüsing BurkhardCorves VerenaNitsch KlausWehrle Robert H.Schmitt article 2021_bader_privaccichain Information Processing & Management 2021 5 1 58 3 The benefits of information sharing along supply chains are well known for improving productivity and reducing costs. However, with the shift towards more dynamic and flexible supply chains, privacy concerns severely challenge the required information retrieval. A lack of trust between the different involved stakeholders inhibits advanced, multi-hop information flows, as valuable information for tracking and tracing products and parts is either unavailable or only retained locally. Our extensive literature review of previous approaches shows that these needs for cross-company information retrieval are widely acknowledged, but related work currently only addresses them insufficiently. To overcome these concerns, we present PrivAccIChain, a secure, privacy-preserving architecture for improving the multi-hop information retrieval with stakeholder accountability along supply chains. To address use case-specific needs, we particularly introduce an adaptable configuration of transparency and data privacy within our design. Hence, we enable the benefits of information sharing as well as multi-hop tracking and tracing even in supply chains that include mutually distrusting stakeholders. We evaluate the performance of PrivAccIChain and demonstrate its real-world feasibility based on the information of a purchasable automobile, the e.GO Life. We further conduct an in-depth security analysis and propose tunable mitigations against common attacks. As such, we attest PrivAccIChain's practicability for information management even in complex supply chains with flexible and dynamic business relationships. multi-hop collaboration; tracking and tracing; Internet of Production; e.GO; attribute-based encryption internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-bader-ipm-privaccichain.pdf Elsevier 0306-4573 10.1016/j.ipm.2021.102529 1 LennartBader JanPennekamp RomanMatzutt DavidHedderich MarkusKowalski VolkerLücken KlausWehrle inproceedings 2021-kunze-aqm-tofino-p4 2021 5 72-80 internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-kunze-aqm-tofino-p4.pdf IFIP/IEEE Proceedings of the International Symposium on Integrated Network Management (IM '21) Virtual Event International Symposium on Integrated Network Management (IM '21) May 2021 978-1-7281-9041-9 1 IkeKunze MoritzGunz DavidSaam KlausWehrle JanRüth inproceedings 2021_dahlmanns_entrust 2021 4 28 78–87 The ongoing digitization of industrial manufacturing leads to a decisive change in industrial communication paradigms. Moving from traditional one-to-one to many-to-many communication, publish/subscribe systems promise a more dynamic and efficient exchange of data. However, the resulting significantly more complex communication relationships render traditional end-to-end security futile for sufficiently protecting the sensitive and safety-critical data transmitted in industrial systems. Most notably, the central message brokers inherent in publish/subscribe systems introduce a designated weak spot for security as they can access all communication messages. To address this issue, we propose ENTRUST, a novel solution for key server-based end-to-end security in publish/subscribe systems. ENTRUST transparently realizes confidentiality, integrity, and authentication for publish/subscribe systems without any modification of the underlying protocol. We exemplarily implement ENTRUST on top of MQTT, the de-facto standard for machine-to-machine communication, showing that ENTRUST can integrate seamlessly into existing publish/subscribe systems. cyber-physical system security; publish-subscribe security; end-to-end security internet-of-production, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-dahlmanns-entrust.pdf ACM Proceedings of the 1st ACM Workshop on Secure and Trustworthy Cyber-Physical Systems (SaT-CPS '21), co-located with the 11th ACM Conference on Data and Application Security and Privacy (CODASPY '21), April 26-28, 2021, Virtual Event, USA Virtual Event, USA ACM Workshop on Secure and Trustworthy Cyber-Physical Systems April 28, 2021 978-1-4503-8319-6/21/04 10.1145/3445969.3450423 1 MarkusDahlmanns JanPennekamp Ina BereniceFink BerndSchoolmann KlausWehrle MartinHenze inproceedings 2021-sander-zoom-cc 2021 3 internet-of-production /fileadmin/papers/2021/2021-sander-zoom-fairness-aqm.pdf https://arxiv.org/abs/2107.00904 Springer Proceedings of the Passive and Active Measurement Conference (PAM '21) Passive and Active Measurement Conference (PAM 2021) 10.1007/978-3-030-72582-2_1 1 ConstantinSander IkeKunze KlausWehrle JanRüth article 2021_schomakers_insights Computer Law Review International 2021 2 15 22 1 8-15 Social media, cloud computing, and the Internet of Things connect people around the globe, offering manifold benefits. However, the technological advances and increased user participation generate novel challenges for users' privacy. From the users' perspective, the consequences of data disclosure depend on the perceived sensitivity of that data. But in light of the new technological opportunities to process and combine data, it is questionable whether users can adequately evaluate risks of data disclosures. As mediating authority, data protection laws such as the European General Data Protection Regulation try to protect user data, granting enhanced protection to "special categories" of data. This article assesses the legal, technological, and users' perspectives on information sensitivity and their interplay. Technologically, all data can be referred to as "potentially sensitive." The legal and users' perspective on information sensitivity deviate from this standpoint, as some data types are granted special protection by law but are not perceived as very sensitive by users and vice versa. The key findings here suggest the GDPR adequately protecting users' privacy but for small adjustments. Information Sensitivity, Privacy, European Data Protection Law 1610-7608 10.9785/cri-2021-220103 1 Eva-MariaSchomakers ChantalLidynia DirkMüllmann RomanMatzutt KlausWehrle IndraSpiecker gen. Döhmann MartinaZiefle inproceedings 2019_rut_schomakers_privacy 2021 1 27 857-870 Social media, cloud computing, and the Internet of Things connect people around the globe, offering manifold benefits. However, the technological advances and increased user participation generate novel challenges for users' privacy. From the users' perspective, the consequences of data disclosure depend on the perceived sensitivity of that data. But in light of the new technological opportunities to process and combine data, it is questionable whether users can adequately evaluate risks of data disclosures. As mediating authority, data protection laws such as the European General Data Protection Regulation try to protect user data, granting enhanced protection to "special categories" of data. In this paper, we assess the legal, technological, and users' perspectives on information sensitivity and their interplay. Technologically, all data can be referred to as "potentially sensitive." The legal and users' perspective on information sensitivity deviate from this standpoint, as some data types are granted special protection by law but are not perceived as very sensitive by users and vice versa. Our key findings still suggest the GDPR adequately protecting users' privacy but for small adjustments. Information Sensitivity,Privacy,European Data Protection Law mynedata https://www.comsys.rwth-aachen.de/fileadmin/papers/2021/2021-schomakers-3perspectives.pdf https://dl.gi.de/handle/20.500.12116/34788 https://arxiv.org/abs/1911.06569 Gesellschaft für Informatik

Bonn

INFORMATIK 2020 Karlsruhe, Germany INFORMATIK 2020 2020-09-28 to 2020-10-01 English 10.18420/inf2020_76 1 Eva-MariaSchomakers ChantalLidynia DirkMüllmann RomanMatzutt KlausWehrle IndraSpiecker gen. Döhmann MartinaZiefle article 2021-wehrle-energy Energy Technology 2021 9 2 10.1002/ente.202000937 1 FriedirchWiegel EdoardoDe Din AntonelloMonti KlausWehrle MarcHiller MartinaZitterbart VeitHagenmeyer inproceedings 2020_pennekamp_benchmarking 2020 12 15 31-44 Benchmarking the performance of companies is essential to identify improvement potentials in various industries. Due to a competitive environment, this process imposes strong privacy needs, as leaked business secrets can have devastating effects on participating companies. Consequently, related work proposes to protect sensitive input data of companies using secure multi-party computation or homomorphic encryption. However, related work so far does not consider that also the benchmarking algorithm, used in today's applied real-world scenarios to compute all relevant statistics, itself contains significant intellectual property, and thus needs to be protected. Addressing this issue, we present PCB — a practical design for Privacy-preserving Company Benchmarking that utilizes homomorphic encryption and a privacy proxy — which is specifically tailored for realistic real-world applications in which we protect companies' sensitive input data and the valuable algorithms used to compute underlying key performance indicators. We evaluate PCB's performance using synthetic measurements and showcase its applicability alongside an actual company benchmarking performed in the domain of injection molding, covering 48 distinct key performance indicators calculated out of hundreds of different input values. By protecting the privacy of all participants, we enable them to fully profit from the benefits of company benchmarking. practical encrypted computing; homomorphic encryption; algorithm confidentiality; benchmarking; key performance indicators; industrial application; Internet of Production internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-company-benchmarking.pdf https://eprint.iacr.org/2020/1512 HomomorphicEncryption.org Proceedings of the 8th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC '20), December 15, 2020, Virtual Event Virtual Event December 15, 2020 978-3-00-067798-4 10.25835/0072999 1 JanPennekamp PatrickSapel Ina BereniceFink SimonWagner SebastianReuter ChristianHopmann KlausWehrle MartinHenze inproceedings 2020_pennekamp_parameter_exchange 2020 12 10 510-525 Nowadays, collaborations between industrial companies always go hand in hand with trust issues, i.e., exchanging valuable production data entails the risk of improper use of potentially sensitive information. Therefore, companies hesitate to offer their production data, e.g., process parameters that would allow other companies to establish new production lines faster, against a quid pro quo. Nevertheless, the expected benefits of industrial collaboration, data exchanges, and the utilization of external knowledge are significant. In this paper, we introduce our Bloom filter-based Parameter Exchange (BPE), which enables companies to exchange process parameters privacy-preservingly. We demonstrate the applicability of our platform based on two distinct real-world use cases: injection molding and machine tools. We show that BPE is both scalable and deployable for different needs to foster industrial collaborations. Thereby, we reward data-providing companies with payments while preserving their valuable data and reducing the risks of data leakage. secure industrial collaboration; Bloom filter; oblivious transfer; Internet of Production internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-parameter-exchange.pdf ACM Proceedings of the 36th Annual Computer Security Applications Conference (ACSAC '20), December 7-11, 2020, Austin, TX, USA Austin, TX, USA December 7-11, 2020 978-1-4503-8858-0/20/12 10.1145/3427228.3427248 1 JanPennekamp ErikBuchholz YannikLockner MarkusDahlmanns TiandongXi MarcelFey ChristianBrecher ChristianHopmann KlausWehrle proceedings fink-lcn-demons-2020 2020 11 15 nerd-nrw https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-fink-lcn-mud-smartphone.pdf IEEE online Sydney, Australia 45th IEEE Conference on Local Computer Networks (LCN) November 16-19, 2020 10.1109/LCN48667.2020.9314782 1 Ina BereniceFink MartinSerror KlausWehrle inproceedings 2020_delacadena_trafficsliver 2020 11 12 1971-1985 Website fingerprinting (WFP) aims to infer information about the content of encrypted and anonymized connections by observing patterns of data flows based on the size and direction of packets. By collecting traffic traces at a malicious Tor entry node — one of the weakest adversaries in the attacker model of Tor — a passive eavesdropper can leverage the captured meta-data to reveal the websites visited by a Tor user. As recently shown, WFP is significantly more effective and realistic than assumed. Concurrently, former WFP defenses are either infeasible for deployment in real-world settings or defend against specific WFP attacks only. To limit the exposure of Tor users to WFP, we propose novel lightweight WFP defenses, TrafficSliver, which successfully counter today’s WFP classifiers with reasonable bandwidth and latency overheads and, thus, make them attractive candidates for adoption in Tor. Through user-controlled splitting of traffic over multiple Tor entry nodes, TrafficSliver limits the data a single entry node can observe and distorts repeatable traffic patterns exploited by WFP attacks. We first propose a network-layer defense, in which we apply the concept of multipathing entirely within the Tor network. We show that our network-layer defense reduces the accuracy from more than 98% to less than 16% for all state-of-the-art WFP attacks without adding any artificial delays or dummy traffic. We further suggest an elegant client-side application-layer defense, which is independent of the underlying anonymization network. By sending single HTTP requests for different web objects over distinct Tor entry nodes, our application-layer defense reduces the detection rate of WFP classifiers by almost 50 percentage points. Although it offers lower protection than our network-layer defense, it provides a security boost at the cost of a very low implementation overhead and is fully compatible with today’s Tor network. Traffic Analysis; Website Fingerprinting; Privacy; Anonymous Communication; Onion Routing; Web Privacy https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-delacadena-trafficsliver.pdf https://github.com/TrafficSliver ACM Proceedings of the 27th ACM SIGSAC Conference on Computer and Communications Security (CCS '20), November 9-13, 2020, Orlando, FL, USA Virtual Event, USA November 9-13, 2020 978-1-4503-7089-9/20/11 10.1145/3372297.3423351 1 WladimirDe la Cadena AsyaMitseva JensHiller JanPennekamp SebastianReuter JulianFilter KlausWehrle ThomasEngel AndriyPanchenko inproceedings 2020-dahlmanns-imc-opcua 2020 10 27 101-110 Due to increasing digitalization, formerly isolated industrial networks, e.g., for factory and process automation, move closer and closer to the Internet, mandating secure communication. However, securely setting up OPC UA, the prime candidate for secure industrial communication, is challenging due to a large variety of insecure options. To study whether Internet-facing OPC UA appliances are configured securely, we actively scan the IPv4 address space for publicly reachable OPC UA systems and assess the security of their configurations. We observe problematic security configurations such as missing access control (on 24% of hosts), disabled security functionality (24%), or use of deprecated cryptographic primitives (25%) on in total 92% of the reachable deployments. Furthermore, we discover several hundred devices in multiple autonomous systems sharing the same security certificate, opening the door for impersonation attacks. Overall, in this paper, we highlight commonly found security misconfigurations and underline the importance of appropriate configuration for security-featuring protocols. industrial communication; network security; security configuration internet-of-production, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-dahlmanns-imc-opcua.pdf ACM Proceedings of the Internet Measurement Conference (IMC '20), October 27-29, 2020, Pittsburgh, PA, USA Pittsburgh, PA, USA ACM Internet Measurement Conference 2020 October 27-29, 2020 978-1-4503-8138-3/20/10 10.1145/3419394.3423666 1 MarkusDahlmanns JohannesLohmöller Ina BereniceFink JanPennekamp KlausWehrle MartinHenze inproceedings 2020_matzutt_anonboot 2020 10 7 531-542 Distributed anonymity services, such as onion routing networks or cryptocurrency tumblers, promise privacy protection without trusted third parties. While the security of these services is often well-researched, security implications of their required bootstrapping processes are usually neglected: Users either jointly conduct the anonymization themselves, or they need to rely on a set of non-colluding privacy peers. However, the typically small number of privacy peers enable single adversaries to mimic distributed services. We thus present AnonBoot, a Sybil-resistant medium to securely bootstrap distributed anonymity services via public blockchains. AnonBoot enforces that peers periodically create a small proof of work to refresh their eligibility for providing secure anonymity services. A pseudo-random, locally replicable bootstrapping process using on-chain entropy then prevents biasing the election of eligible peers. Our evaluation using Bitcoin as AnonBoot's underlying blockchain shows its feasibility to maintain a trustworthy repository of 1000 peers with only a small storage footprint while supporting arbitrarily large user bases on top of most blockchains. anonymization; bootstrapping; public blockchain; Sybil attack; anonymity network; cryptocurrency tumbler; Bitcoin; Tor impact_digital; digital_campus https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-matzutt-anonboot.pdf ACM Proceedings of the 15th ACM ASIA Conference on Computer and Communications Security (ASIACCS '20), October 5-9, 2020, Taipei, Taiwan Taipei, Taiwan ASIACCS 2020 October 5-9, 2020 978-1-4503-6750-9/20/10 10.1145/3320269.3384729 1 RomanMatzutt JanPennekamp ErikBuchholz KlausWehrle article serror-iiotsec-tii-2020 IEEE Transactions on Industrial Informatics 2020 9 11 17 5 2985-2996 nerd-nrw https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-serror-tii-iiotsec.pdf https://ieeexplore.ieee.org/document/9195014 online 1941-0050 10.1109/TII.2020.3023507 1 MartinSerror SachaHack MartinHenze MarkoSchuba KlausWehrle inproceedings 2020-kirchhof-wowmom-ccncps 2020 8 31 internet-of-production, reflexes https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-kirchhof-wireless-mac-improvements.pdf IEEE Computer Society online International Symposium on a World of Wireless, Mobile and Multimedia Networks: Workshop on Communication, Computing, and Networking in Cyber Physical Systems (WoWMoM-CCNCPS'2020), August 31 - September 3, 2020, Cork, Ireland Cork, Ireland August 31 - September 3, 2020 10.1109/WoWMoM49955.2020.00068 1 Jörg ChristianKirchhof MartinSerror RenéGlebke KlausWehrle article 2020_niemietz_stamping Procedia Manufacturing 2020 7 11 49 61-68 Sharing data between companies throughout the supply chain is expected to be beneficial for product quality as well as for the economical savings in the manufacturing industry. To utilize the available data in the vision of an Internet of Production (IoP) a precise condition monitoring of manufacturing and production processes that facilitates the quantification of influences throughout the supply chain is inevitable. In this paper, we consider stamping processes in the context of an Internet of Production and the preliminaries for analytical models that utilize the ever-increasing available data. Three research objectives to cope with the amount of data and for a methodology to monitor, analyze and evaluate the influence of available data onto stamping processes have been identified: (i) State detection based on cyclic sensor signals, (ii) mapping of in- and output parameter variations onto process states, and (iii) models for edge and in-network computing approaches. After discussing state-of-the-art approaches to monitor stamping processes and the introduction of the fineblanking process as an exemplary stamping process, a research roadmap for an IoP enabling modeling framework is presented. Proceedings of the 8th International Conference on Through-Life Engineering Service (TESConf '19), October 27-29, 2019, Cleveland, OH, USA Stamping Process; Industry 4.0; Fine-blanking; Internet of production; Condition monitoring; Data analytics internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-niemietz-stamping-modelling.pdf Elsevier Cleveland, OH, USA October 27-29, 2019 2351-9789 10.1016/j.promfg.2020.06.012 1 PhilippNiemietz JanPennekamp IkeKunze DanielTrauth KlausWehrle ThomasBergs inproceedings 2020_pennekamp_supply_chain_sensing 2020 7 1 Trust along digitalized supply chains is challenged by the aspect that monitoring equipment may not be trustworthy or unreliable as respective measurements originate from potentially untrusted parties. To allow for dynamic relationships along supply chains, we propose a blockchain-backed supply chain monitoring architecture relying on trusted hardware. Our design provides a notion of secure end-to-end sensing of interactions even when originating from untrusted surroundings. Due to attested checkpointing, we can identify misinformation early on and reliably pinpoint the origin. A blockchain enables long-term verifiability for all (now trustworthy) IoT data within our system even if issues are detected only after the fact. Our feasibility study and cost analysis further show that our design is indeed deployable in and applicable to today's supply chain settings. supply chain; trusted computing; trusted execution; blockchain; Internet of Production; condition monitoring internet-of-production https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-supply-chain-sensing.pdf IEEE Proceedings of the 5th International Workshop on Cyber-Physical Systems Security (CPS-Sec '20), co-located with the 8th IEEE Conference on Communications and Network Security (CNS '20), June 29-July 1, 2020, Avignon, France Avignon, France June 29-July 1, 2020 978-1-7281-4760-4 10.1109/CNS48642.2020.9162337 1 JanPennekamp FritzAlder RomanMatzutt Jan TobiasMühlberg FrankPiessens KlausWehrle inproceedings 2020-schemmel-porse 2020 7 symbiosys https://arxiv.org/pdf/2005.06688.pdf https://arxiv.org/abs/2005.06688 Computer Aided Verification (CAV 2020) 32nd International Conference on Computer Aided Verification 10.1007/978-3-030-53288-8_18 1 DanielSchemmel JulianBüning CésarRodríguez DavidLaprell KlausWehrle inproceedings 2020_matzutt_coinprune 2020 6 24 298-306 Bitcoin was the first successful decentralized cryptocurrency and remains the most popular of its kind to this day. Despite the benefits of its blockchain, Bitcoin still faces serious scalability issues, most importantly its ever-increasing blockchain size. While alternative designs introduced schemes to periodically create snapshots and thereafter prune older blocks, already-deployed systems such as Bitcoin are often considered incapable of adopting corresponding approaches. In this work, we revise this popular belief and present CoinPrune, a snapshot-based pruning scheme that is fully compatible with Bitcoin. CoinPrune can be deployed through an opt-in velvet fork, i.e., without impeding the established Bitcoin network. By requiring miners to publicly announce and jointly reaffirm recent snapshots on the blockchain, CoinPrune establishes trust into the snapshots' correctness even in the presence of powerful adversaries. Our evaluation shows that CoinPrune reduces the storage requirements of Bitcoin already by two orders of magnitude today, with further relative savings as the blockchain grows. In our experiments, nodes only have to fetch and process 5 GiB instead of 230 GiB of data when joining the network, reducing the synchronization time on powerful devices from currently 5 h to 46 min, with even more savings for less powerful devices. blockchain; block pruning; synchronization; bootstrapping; scalability; velvet fork; Bitcoin mynedata; impact_digital; digital_campus https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-matzutt-coinprune.pdf https://coinprune.comsys.rwth-aachen.de IEEE Proceedings of the 19th IFIP Networking 2020 Conference (NETWORKING '20), June 22-26, 2020, Paris, France Paris, France NETWORKING 2020 June 22-26, 2020 978-3-903176-28-7 1 RomanMatzutt BenediktKalde JanPennekamp ArthurDrichel MartinHenze KlausWehrle inproceedings 2020-serror-networking-qwin 2020 6 21 consent https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-serror-qwin.pdf https://ieeexplore.ieee.org/abstract/document/9142792 IFIP online Proceedings of the 19th IFIP Networking 2020 Conference (NETWORKING '20), June 22-26, 2020, Paris, France Paris, France IFIP NETWORKING Conference June 22-26, 2020 978-3-903176-28-7 1 MartinSerror EricWagner RenéGlebke KlausWehrle inproceedings 2020_pennekamp_supply_chain_accountability 2020 6 7 Today's supply chains are becoming increasingly flexible in nature. While adaptability is vastly increased, these more dynamic associations necessitate more extensive data sharing among different stakeholders while simultaneously overturning previously established levels of trust. Hence, manufacturers' demand to track goods and to investigate root causes of issues across their supply chains becomes more challenging to satisfy within these now untrusted environments. Complementarily, suppliers need to keep any data irrelevant to such routine checks secret to remain competitive. To bridge the needs of contractors and suppliers in increasingly flexible supply chains, we thus propose to establish a privacy-preserving and distributed multi-hop accountability log among the involved stakeholders based on Attribute-based Encryption and backed by a blockchain. Our large-scale feasibility study is motivated by a real-world manufacturing process, i.e., a fine blanking line, and reveals only modest costs for multi-hop tracing and tracking of goods. supply chain; multi-hop tracking and tracing; blockchain; attribute-based encryption; Internet of Production internet-of-production https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-pennekamp-supply-chain-privacy.pdf IEEE Proceedings of the 2020 IEEE International Conference on Communications Workshops (ICC Workshops '20), 1st Workshop on Blockchain for IoT and Cyber-Physical Systems (BIoTCPS '20), June 7-11, 2020, Dublin, Ireland Dublin, Ireland June 7-11, 2020 978-1-7281-7440-2 2474-9133 10.1109/ICCWorkshops49005.2020.9145100 1 JanPennekamp LennartBader RomanMatzutt PhilippNiemietz DanielTrauth MartinHenze ThomasBergs KlausWehrle inproceedings 2020-mann-ur-weldseamstudy 2020 6 https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-mann-weld-seam-geometry-control.pdf Proceedings of the 2020 Internal Conference on Ubiquitous Robots Internal Conference on Ubiquitous Robots June 22-26, 2020 10.1109/UR49135.2020.9144839 1 SamuelMann RenéGlebke IkeKunze DominikScheurenberg RahulSharma UweReisgen KlausWehrle DirkAbel article 2020_gleim_factDAG IEEE Internet of Things Journal 2020 4 14 7 4 3243-3253 In the production industry, the volume, variety and velocity of data as well as the number of deployed protocols increase exponentially due to the influences of IoT advances. While hundreds of isolated solutions exist to utilize this data, e.g., optimizing processes or monitoring machine conditions, the lack of a unified data handling and exchange mechanism hinders the implementation of approaches to improve the quality of decisions and processes in such an interconnected environment. The vision of an Internet of Production promises the establishment of a Worldwide Lab, where data from every process in the network can be utilized, even interorganizational and across domains. While numerous existing approaches consider interoperability from an interface and communication system perspective, fundamental questions of data and information interoperability remain insufficiently addressed. In this paper, we identify ten key issues, derived from three distinctive real-world use cases, that hinder large-scale data interoperability for industrial processes. Based on these issues we derive a set of five key requirements for future (IoT) data layers, building upon the FAIR data principles. We propose to address them by creating FactDAG, a conceptual data layer model for maintaining a provenance-based, directed acyclic graph of facts, inspired by successful distributed version-control and collaboration systems. Eventually, such a standardization should greatly shape the future of interoperability in an interconnected production industry. Data Management; Data Versioning; Interoperability; Industrial Internet of Things; Worldwide Lab internet-of-production https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-gleim-iotj-iop-interoperability.pdf IEEE 2327-4662 10.1109/JIOT.2020.2966402 1 LarsGleim JanPennekamp MartinLiebenberg MelanieBuchsbaum PhilippNiemietz SimonKnape AlexanderEpple SimonStorms DanielTrauth ThomasBergs ChristianBrecher StefanDecker GerhardLakemeyer KlausWehrle article 2020_mann_welding_layers Advanced Structured Materials 2020 4 1 125 101-118 A connected, digitalized welding production unlocks vast and dynamic potentials: from improving state of the art welding to new business models in production. For this reason, offering frameworks, which are capable of addressing multiple layers of applications on the one hand and providing means of data security and privacy for ubiquitous dataflows on the other hand, is an important step to enable the envisioned advances. In this context, welding production has been introduced from the perspective of interlaced process layers connecting information sources across various entities. Each layer has its own distinct challenges from both a process view and a data perspective. Besides, investigating each layer promises to reveal insight into (currently unknown) process interconnections. This approach has been substantiated by methods for data security and privacy to draw a line between secure handling of data and the need of trustworthy dealing with sensitive data among different parties and therefore partners. In conclusion, the welding production has to develop itself from an accumulation of local and isolated data sources towards a secure industrial collaboration in an Internet of Production. Proceedings of the 1st International Conference on Advanced Joining Processes (AJP '19) Welding Production; Industrie 4.0; Internet of Production; Data Security; Data Privacy Internet-of-Production https://www.comsys.rwth-aachen.de/fileadmin/papers/2020/2020-mann-welding-layers.pdf Springer Ponta Delgada, Azores, Portugal October 24-25, 2019 978-981-15-2956-6 1869-8433 10.1007/978-981-15-2957-3_8 1 SamuelMann JanPennekamp TobiasBrockhoff AnahitaFarhang MahsaPourbafrani LukasOster Merih SeranUysal RahulSharma UweReisgen KlausWehrle Wilvan der Aalst inproceedings 2020_matzutt_coralis 2020 1 7 529-534 Traditionally, the university landscape is highly federated, which hinders potentials for coordinated collaborations. While the lack of a strict hierarchy on the inter-university level is critical for ensuring free research and higher education, this concurrency limits the access to high-quality education materials. Especially regarding resources such as lecture notes or exercise tasks we observe a high susceptibility to redundant work and lacking quality assessment of material created in isolation by individual university institutes. To remedy this situation, in this paper we propose CORALIS, a decentralized marketplace for offering, acquiring, discussing, and improving education resources across university borders. Our design is based on a permissioned blockchain to (a) realize accountable access control via simple on-chain license terms, (b) trace the evolution of encrypted containers accumulating bundles of shareable education resources, and (c) record user comments and ratings for further improving the quality of offered education material. blockchain platform; permissioned blockchain; education material; quality assessment; collaborative work impact_digital https://comsys.rwth-aachen.de/fileadmin/papers/2020/2020-matzutt-coralis.pdf IEEE Proceedings of the 34th International Conference on Information Networking (ICOIN '20), January 7-10, 2020, Barcelona, Spain Barcelona, Spain January 7-10, 2020 978-1-7281-4199-2 10.1109/ICOIN48656.2020.9016478 1 RomanMatzutt JanPennekamp KlausWehrle article 2020-wehrle-digitalshadows Der Profilbereich "Information & Communication Technology" 2020 0179-079X 10.18154/RWTH-2021-02496 MatthiasJarke Wilvan der Aalst ChristianBrecher MatthiasBrockmann IstvánKoren GerhardLakemeyer BernhardRumpe GüntherSchuh KlausWehrle MartinaZiefle inproceedings 2019-krude-online-reprogramming 2019 12 9 maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-krude-online-reprogramming.pdf ACM 1st ACM CoNEXT Workshop on Emerging in-Network Computing Paradigms (ENCP '19) 978-1-4503-7000-4/19/12 10.1145/3359993.3366643 1 JohannesKrude JacoHofmann MatthiasEichholz KlausWehrle AndreasKoch MiraMezini inproceedings 2019-glebke-in-network-cv 2019 12 9 reflexes,maki,internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-glebke-in-network-cv.pdf Online ACM 1st ACM CoNEXT Workshop on Emerging in-Network Computing Paradigms (ENCP '19) en 978-1-4503-7000-4/19/12 10.1145/3359993.3366646 1 RenéGlebke JohannesKrude IkeKunze JanRüth FelixSenger KlausWehrle inproceedings 2019_pennekamp_securityConsiderations 2019 12 4 The productivity and sustainability advances for (smart) manufacturing resulting from (globally) interconnected Industrial IoT devices in a lab of labs are expected to be significant. While such visions introduce opportunities for the involved parties, the associated risks must be considered as well. In particular, security aspects are crucial challenges and remain unsolved. So far, single stakeholders only had to consider their local view on security. However, for a global lab, we identify several fundamental research challenges in (dynamic) scenarios with multiple stakeholders: While information security mandates that models must be adapted wrt. confidentiality to address these new influences on business secrets, from a network perspective, the drastically increasing amount of possible attack vectors challenges today's approaches. Finally, concepts addressing these security challenges should provide backwards compatibility to enable a smooth transition from today's isolated landscape towards globally interconnected IIoT environments. secure industrial collaboration; interconnected cyber-physical systems; stakeholders; Internet of Production internet-of-production; iotrust https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-security-considerations.pdf IEEE Proceedings of the 3rd IEEE Global Conference on Internet of Things (GCIoT '19), December 4–7, 2019, Dubai, United Arab Emirates Dubai, United Arab Emirates December 4–7, 2019 978-1-7281-4873-1 10.1109/GCIoT47977.2019.9058413 1 JanPennekamp MarkusDahlmanns LarsGleim StefanDecker KlausWehrle inproceedings 2019-rueth-quic-userstudy 2019 12 maki,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-rueth-quic-userstudy.pdf https://arxiv.org/abs/1910.07729 ACM In Proceedings of the 15th International Conference on emerging Networking EXperiments and Technologies (CoNEXT '19) Orlando, Florida, USA International Conference on emerging Networking EXperiments and Technologies 9.12.2019-12.12.2019 10.1145/3359989.3365416 1 JanRüth KonradWolsing KlausWehrle OliverHohlfeld article 2019-unterberg-matclass Production Engineering 2019 11 13 13 6 743-749 internet-of-production 10.1007/s11740-019-00928-w 1 MartinUnterberg PhillipNiemietz DanielTrauth KlausWehrle ThomasBergs inproceedings 2019_delacadena_countermeasure 2019 11 12 2533-2535 Website fingerprinting (WFP) is a special type of traffic analysis, which aims to infer the websites visited by a user. Recent studies have shown that WFP targeting Tor users is notably more effective than previously expected. Concurrently, state-of-the-art defenses have been proven to be less effective. In response, we present a novel WFP defense that splits traffic over multiple entry nodes to limit the data a single malicious entry can use. Here, we explore several traffic-splitting strategies to distribute user traffic. We establish that our weighted random strategy dramatically reduces the accuracy from nearly 95% to less than 35% for four state-of-the-art WFP attacks without adding any artificial delays or dummy traffic. https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-delacadena-splitting-defense.pdf ACM Proceedings of the 26th ACM SIGSAC Conference on Computer and Communications Security (CCS '19), November 11-15, 2019, London, United Kingdom London, United Kingdom November 11-15, 2019 978-1-4503-6747-9/19/11 10.1145/3319535.3363249 1 WladimirDe la Cadena AsyaMitseva JanPennekamp JensHiller FabianLanze ThomasEngel KlausWehrle AndriyPanchenko inproceedings 2019_pennekamp_dataflows 2019 11 11 27-38 The Internet of Production (IoP) envisions the interconnection of previously isolated CPS in the area of manufacturing across institutional boundaries to realize benefits such as increased profit margins and product quality as well as reduced product development costs and time to market. This interconnection of CPS will lead to a plethora of new dataflows, especially between (partially) distrusting entities. In this paper, we identify and illustrate these envisioned inter-organizational dataflows and the participating entities alongside two real-world use cases from the production domain: a fine blanking line and a connected job shop. Our analysis allows us to identify distinct security and privacy demands and challenges for these new dataflows. As a foundation to address the resulting requirements, we provide a survey of promising technical building blocks to secure inter-organizational dataflows in an IoP and propose next steps for future research. Consequently, we move an important step forward to overcome security and privacy concerns as an obstacle for realizing the promised potentials in an Internet of Production. Internet of Production; dataflows; Information Security internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-dataflows.pdf ACM Proceedings of the 5th ACM Workshop on Cyber-Physical Systems Security and PrivaCy (CPS-SPC '19), co-located with the 26th ACM SIGSAC Conference on Computer and Communications Security (CCS '19), November 11-15, 2019, London, United Kingdom London, United Kingdom November 11-15, 2019 978-1-4503-6831-5/19/11 10.1145/3338499.3357357 1 JanPennekamp MartinHenze SimoSchmidt PhilippNiemietz MarcelFey DanielTrauth ThomasBergs ChristianBrecher KlausWehrle inproceedings 2019-hiller-lcn-sessionsharing 2019 10 14 internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-hiller-lcn-case_for_tls_session_sharing.pdf IEEE IEEE 44th LCN Symposium on Emerging Topics in Networking (LCN Symposium), Osnabrück, Germany Osnabrück, Germany 44th IEEE Conference on Local Computer Networks (LCN) October 14-17, 2019 en 978-1-7281-2561-9 10.1109/LCNSymposium47956.2019.9000667 1 JensHiller MartinHenze TorstenZimmermann OliverHohlfeld KlausWehrle inproceedings 2019-hiller-icnp-tailoringOR 2019 10 10 An increasing number of IoT scenarios involve mobile, resource-constrained IoT devices that rely on untrusted networks for Internet connectivity. In such environments, attackers can derive sensitive private information of IoT device owners, e.g., daily routines or secret supply chain procedures, when sniffing on IoT communication and linking IoT devices and owner. Furthermore, untrusted networks do not provide IoT devices with any protection against attacks from the Internet. Anonymous communication using onion routing provides a well-proven mechanism to keep the relationship between communication partners secret and (optionally) protect against network attacks. However, the application of onion routing is challenged by protocol incompatibilities and demanding cryptographic processing on constrained IoT devices, rendering its use infeasible. To close this gap, we tailor onion routing to the IoT by bridging protocol incompatibilities and offloading expensive cryptographic processing to a router or web server of the IoT device owner. Thus, we realize resource-conserving access control and end-to-end security for IoT devices. To prove applicability, we deploy onion routing for the IoT within the well-established Tor network enabling IoT devices to leverage its resources to achieve the same grade of anonymity as readily available to traditional devices. internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-hiller-tailoring.pdf IEEE Proceedings of the 27th IEEE International Conference on Network Protocols (ICNP '19), October 7-10, 2019, Chicago, IL, USA Chicago, IL, USA 27th IEEE International Conference on Network Protocols (ICNP 2019) 7-10. Oct. 2019 978-1-7281-2700-2 2643-3303 10.1109/ICNP.2019.8888033 1 JensHiller JanPennekamp MarkusDahlmanns MartinHenze AndriyPanchenko KlausWehrle inproceedings 2019-dahlmanns-icnp-knowledgeSystem 2019 10 7 More and more traditional services, such as malware detectors or collaboration services in industrial scenarios, move to the cloud. However, this behavior poses a risk for the privacy of clients since these services are able to generate profiles containing very sensitive information, e.g., vulnerability information or collaboration partners. Hence, a rising need for protocols that enable clients to obtain knowledge without revealing their requests exists. To address this issue, we propose a protocol that enables clients (i) to query large cloud-based knowledge systems in a privacy-preserving manner using Private Set Intersection and (ii) to subsequently obtain individual knowledge items without leaking the client’s requests via few Oblivious Transfers. With our preliminary design, we allow clients to save a significant amount of time in comparison to performing Oblivious Transfers only. Poster Session private query protocol; knowledge system; remote knowledge; private set intersection; oblivious transfer kimusin; internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-dahlmanns-knowledge-system.pdf IEEE Proceedings of the 27th IEEE International Conference on Network Protocols (ICNP '19), October 7-10, 2019, Chicago, IL, USA Chicago, IL, USA 27th IEEE International Conference on Network Protocols (ICNP 2019) 7-10. Oct. 2019 978-1-7281-2700-2 2643-3303 10.1109/ICNP.2019.8888121 1 MarkusDahlmanns ChrisDax RomanMatzutt JanPennekamp JensHiller KlausWehrle inproceedings 2019_pennekamp_multipath 2019 10 7 Users of an onion routing network, such as Tor, depend on its anonymity properties. However, especially malicious entry nodes, which know the client’s identity, can also observe the whole communication on their link to the client and, thus, conduct several de-anonymization attacks. To limit this exposure and to impede corresponding attacks, we propose to multipath traffic between the client and the middle node to reduce the information an attacker can obtain at a single vantage point. To facilitate the deployment, only clients and selected middle nodes need to implement our approach, which works transparently for the remaining legacy nodes. Furthermore, we let clients control the splitting strategy to prevent any external manipulation. Poster Session https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-multipathing.pdf IEEE Proceedings of the 27th IEEE International Conference on Network Protocols (ICNP '19), October 7-10, 2019, Chicago, IL, USA Chicago, IL, USA 27th IEEE International Conference on Network Protocols (ICNP 2019) 7-10. Oct. 2019 978-1-7281-2700-2 2643-3303 10.1109/ICNP.2019.8888029 1 JanPennekamp JensHiller SebastianReuter WladimirDe la Cadena AsyaMitseva MartinHenze ThomasEngel KlausWehrle AndriyPanchenko inproceedings 2019-hiller-aeit-regaining 2019 9 Smart Grids require extensive communication to enable safe and stable energy supply in the age of decentralized and dynamic energy production and consumption. To protect the communication in this critical infrastructure, public authorities mandate smart meter gateways (SMGWs) to intercept all inbound and outbound communication of premises such as a factory or smart home, and forward the communication data on secure channels established by the SMGW itself to be in control of the communication security. However, using the SMGW as proxy, local devices can neither review the security of these remote connections established by the SMGW nor enforce higher security guarantees than established by the all in one configuration of the SMGW which does not allow for use case-specific security settings. We present mechanisms that enable local devices to regain this insight and control over the full connection, i.e., up to the final receiver, while retaining the SMGW's ability to ensure a suitable security level. Our evaluation shows modest computation and transmission overheads for this increased security in the critical smart grid infrastructure. ECSEL; European Union (EU); Horizon 2020; CONNECT Innovative smart components, modules and appliances for a truly connected, efficient and secure smart grid; Grant Agreement No 737434 connect https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-hiller-aeit-regaining.pdf IEEE Proceedings of the 2019 AEIT International Annual Conference, September 18-20, 2019, Firenze, Italy Firenze, Italy AEIT International Annual Conference September 18-20, 2019 978-8-8872-3745-0 10.23919/AEIT.2019.8893406 1 JensHiller KarstenKomanns MarkusDahlmanns KlausWehrle inproceedings 2019-krude-chain-opt 2019 8 23 With the move of Software-defined networking from fixed to programmable data planes, network functions are written with P4 or eBPF for targets such as programmable switches, CPU based flow processors and commodity CPUs. These data plane programs are, however, limited in per-packet time budget (e.g., 67.2 ns at 10GbE) and program size, making program optimization imperative. Existing approaches focus on optimizing the distribution of flow rules in fixed data planes or they are limited to a single switch. We see great potential in integrating the network topology into program optimization. maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-krude-chain-opt.pdf ACM NetPL '19: ACM SIGCOMM Workshop on Networking and Programming Languages Beijing, China 978-1-4503-6877-3/19/08 10.1145/3341561.3349590 1 JohannesKrude MatthiasEichholz MaximilianWinck KlausWehrle MiraMezini inproceedings 2019-sander-depcci 2019 8 18 maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-sander-deepcci.pdf https://arxiv.org/abs/1907.02323 ACM In Proceedings of the ACM SIGCOMM Workshop on Network Meets AI & ML (NetAI '19) Beijing, China Workshop on Network Meets AI & ML 18.08.2019 10.1145/3341216.3342211 1 ConstantinSander JanRüth OliverHohlfeld KlausWehrle inproceedings 2019-wolsing-quicperf 2019 7 22 maki,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-wolsing-quicperf.pdf https://arxiv.org/abs/1906.07415 ACM In Proceedings of the Applied Networking Research Workshop (ANRW '19) Montreal, Quebec, Canada Applied Networking Research Workshop at IETF-105 2019-07-22 10.1145/3340301.3341123 1 KonradWolsing JanRüth KlausWehrle OliverHohlfeld inproceedings 2019-hohlfeld-bpfperf 2019 6 25 maki,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-hohlfeld-bpfperf.pdf IEEE IEEE International Conference on Network Softwarization (NetSoft) IEEE International Conference on Network Softwarization 10.1109/NETSOFT.2019.8806651 1 OliverHohlfeld JohannesKrude Jens HelgeReelfs JanRüth KlausWehrle inproceedings 2019_pennekamp_infrastructure 2019 5 8 31-37 New levels of cross-domain collaboration between manufacturing companies throughout the supply chain are anticipated to bring benefits to both suppliers and consumers of products. Enabling a fine-grained sharing and analysis of data among different stakeholders in an automated manner, such a vision of an Internet of Production (IoP) introduces demanding challenges to the communication, storage, and computation infrastructure in production environments. In this work, we present three example cases that would benefit from an IoP (a fine blanking line, a high pressure die casting process, and a connected job shop) and derive requirements that cannot be met by today’s infrastructure. In particular, we identify three orthogonal research objectives: (i) real-time control of tightly integrated production processes to offer seamless low-latency analysis and execution, (ii) storing and processing heterogeneous production data to support scalable data stream processing and storage, and (iii) secure privacy-aware collaboration in production to provide a basis for secure industrial collaboration. Based on a discussion of state-of-the-art approaches for these three objectives, we create a blueprint for an infrastructure acting as an enabler for an IoP. Internet of Production; Cyber-Physical Systems; Data Processing; Low Latency; Secure Industrial Collaboration internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-pennekamp-iop-infrastructure.pdf IEEE Proceedings of the 2nd IEEE International Conference on Industrial Cyber-Physical Systems (ICPS '19), May 6-9, 2019, Taipei, TW Taipei, TW May 6-9, 2019 978-1-5386-8500-6/19 10.1109/ICPHYS.2019.8780276 1 JanPennekamp RenéGlebke MartinHenze TobiasMeisen ChristophQuix RihanHai LarsGleim PhilippNiemietz MaximilianRudack SimonKnape AlexanderEpple DanielTrauth UweVroomen ThomasBergs ChristianBrecher AndreasBührig-Polaczek MatthiasJarke KlausWehrle techreport 2019-rueth-blitzstart 2019 5 8 arXiv:1905.03144 [cs.NI] 1--8 https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-rueth-blitzstart.pdf https://arxiv.org/abs/1905.03144 Online COMSYS, RWTH Aachen University

Ahornstr. 55, 52074 Aachen, Germany

COMSYS, RWTH Aachen University Technical Report en JanRüth KonradWolsing MartinSerror KlausWehrle OliverHohlfeld inproceedings 2019_wagner_dispute_resolution 2019 5 Blockchain systems promise to mediate interactions of mutually distrusting parties without a trusted third party. However, protocols with full smart contract-based security are either limited in functionality or complex, with high costs for secured interactions. This observation leads to the development of protocol-specific schemes to avoid costly dispute resolution in case all participants remain honest. In this paper, we introduce SmartJudge, an extensible generalization of this trend for smart contract-based two-party protocols. SmartJudge relies on a protocol-independent mediator smart contract that moderates two-party interactions and only consults protocol-specific verifier smart contracts in case of a dispute. This way, SmartJudge avoids verification costs in absence of disputes and sustains interaction confidentiality among honest parties. We implement verifier smart contracts for cross-blockchain trades and exchanging digital goods and show that SmartJudge can reduce costs by 46-50% and 22% over current state of the art, respectively. Ethereum,Bitcoin,smart contracts,two-party protocols,dispute resolution,cross-blockchain trades mynedata, impact-digital, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-wagner-dispute.pdf IEEE IEEE International Conference on Blockchain and Cryptocurrency 2019 (ICBC 2019) Seoul, South Korea IEEE International Conference on Blockchain and Cryptocurrency 2019 English 10.1109/BLOC.2019.8751312 1 EricWagner AchimVölker FrederikFuhrmann RomanMatzutt KlausWehrle techreport 2019-hohlfeld-santa-tr 2019 4 1 arXiv:1904.00671 [cs.NI] 1--14 maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-hohlfeld-santatr.pdf https://arxiv.org/abs/1904.00671 Online COMSYS, RWTH Aachen University

Ahornstr. 55, 52074 Aachen, Germany

COMSYS, RWTH Aachen University Technical Report en OliverHohlfeld HelgeReelfs JanRüth FlorianSchmidt TorstenZimmermann JensHiller KlausWehrle article 2019_henze_flexible_netzwerkstrukturen_iop ITG-news 2019 4 02/2019 7-8 internet-of-production,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-henze-itg-iop-networkarchitectures.pdf Informationstechnische Gesellschaft im VDE

Frankfurt am Main

MartinHenze RenéGlebke KlausWehrle inproceedings 2019-glebke-wirelessgain 2019 3 25 reflexes,spp https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-glebke-wirelessgain.pdf ACM In Proceedings of the International Workshop on Edge Systems, Analytics and Networking (EdgeSys 2019) Dresden, Germany International Workshop on Edge Systems, Analytics and Networking (EdgeSys 2019) 25.03.2019 10.1145/3301418.3313943 1 SebastianGallenmüller RenéGlebke StephanGünther EricHauser MauriceLeclaire StefanReif JanRüth AndreasSchmidt GeorgCarle ThorstenHerfet WolfgangSchröder-Preikschat KlausWehrle inproceedings 2019-glebke-hicss-integrated 2019 1 8 7252-7261 internet-of-production,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2019/2019-glebke-integrated.pdf Online University of Hawai'i at Manoa / AIS Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), Wailea, HI, USA en 978-0-9981331-2-6 10.24251/HICSS.2019.871 1 RenéGlebke MartinHenze KlausWehrle PhilippNiemietz DanielTrauth PatrickMattfeld ThomasBergs article 2019_wehrle_dagstuhl_beginners ACM SIGCOMM Computer Communication Review 2019 1 49 1 24-30 Reproducibility is one of the key characteristics of good science, but hard to achieve for experimental disciplines like Internet measurements and networked systems. This guide provides advice to researchers, particularly those new to the field, on designing experiments so that their work is more likely to be reproducible and to serve as a foundation for follow-on work by others. 0146-4833 10.1145/3314212.3314217 VaibhavBajpai AnnaBrunstrom AnjaFeldmann WolfgangKellerer AikoPras HenningSchulzrinne GeorgiosSmaragdakis MatthiasWählisch KlausWehrle inproceedings 2018-bader-ethereum-car-insurance 2018 12 9 mynedata, internet-of-production, rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-bader-ethereum-car-insurance.pdf https://ieeexplore.ieee.org/document/8644136 IEEE 2018 IEEE Globecom Workshops (GC Wkshps) Abu Dhabi, United Arab Emirates 1st International Workshop on Blockchain in IoT, co-located with IEEE Globecom 2018 2018-12-09 10.1109/GLOCOMW.2018.8644136 1 LennartBader Jens ChristophBürger RomanMatzutt KlausWehrle proceedings 2018-QuicTesting 2018 12 4 erc,symbiosys https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-rath-quictesting.pdf https://dl.acm.org/citation.cfm?id=3284853 https://arxiv.org/abs/1811.12099 ACM Heraklion, Greece EPIQ'18 Workshop Paper 4.12.2018 en 978-1-4503-6082-1 10.1145/3284850.3284853 1 FelixRath DanielSchemmel KlausWehrle inproceedings 2018-zimmermann-webready 2018 12 4 maki https://dl.acm.org/citation.cfm?id=3281434 https://arxiv.org/abs/1810.05554 https://http2.netray.io/interleaving.html ACM Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies (CoNEXT), Crete, Greete Crete, Greece CoNEXT 2018 4.12.18 - 7.12.18 en 10.1145/3281411.3281434 1 TorstenZimmermann BenediktWolters OliverHohlfeld KlausWehrle inproceedings 2018-ziegeldorf-shield 2018 12 1-15 iop,mynedata https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-ziegeldorf-acsac-shield.pdf ACM

New York, NY, USA

Proceedings of the 34rd Annual Computer Security Applications Conference San Juan, Puerto Rico, USA The 34rd Annual Computer Security Applications Conference (ACSAC 2018) 2018-12-03 - 2018-12-07 English 10.1145/3274694.3274716 1 Jan HenrikZiegeldorf JanMetzke KlausWehrle article 2018-stoffers-on-automated-memoization ACM Transactions on Modeling and Computer Simulation (TOMACS) 2018 10 28 4 Article 26 26:1-26:25 memosim,symbiosys file:2213 10.1145/3186316 1 MirkoStoffers DanielSchemmel OscarSoria Dustmann KlausWehrle inproceedings 2018-hiller-lcn-lowlatencyiiot 2018 10 connect,iop,nerd-nrw https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-hiller-lcn-secure_low_latency_communication_iiot.pdf IEEE 43rd IEEE Conference on Local Computer Networks (LCN), Chicago, USA Chicago, USA 43nd IEEE Conference on Local Computer Networks (LCN) October 1-4, 2018 en 978-1-5386-4413-3 10.1109/LCN.2018.8638027 1 JensHiller MartinHenze MartinSerror EricWagner Jan NiklasRichter KlausWehrle inproceedings 2018-hohlfeld-santa 2018 9 3 maki,ssiclops,reflexes https://ieeexplore.ieee.org/document/8493053 IEEE Proceedings of the 2018 30th International Teletraffic Congress (ITC 30), Vienna, Austria Vienna, Austria International Teletraffic Congress ITC 30 03.09.2018 - 07-09.2018 en 10.1109/ITC30.2018.00015 1 OliverHohlfeld Jens HelgeReelfs JanRüth FlorianSchmidt TorstenZimmermann JensHiller KlausWehrle inproceedings 2018-soria-dustmann-parti 2018 9 symbiosys file:2195 Proceedings of the 2018 Conference on Automated Software Engineering (ASE'18) 10.1145/3238147.3238179 1 OscarSoria Dustmann KlausWehrle CristianCadar inproceedings 2018-serror-ares-iotsec 2018 8 27 consent, iotrust https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-serror-iotsecfor-in-network-security.pdf ACM online Proceedings of the 2nd International Workshop on Security and Forensics of IoT (IoT-SECFOR), co-located with the 13th International Conference on Availability, Reliability and Security (ARES 2018), Hamburg, Germany Hamburg, Germany International Conference on Availability, Reliability and Security August 27--30, 2018 978-1-4503-6448-5 10.1145/3230833.3232802 1 MartinSerror MartinHenze SachaHack MarkoSchuba KlausWehrle inproceedings 2018-krude-circuit 2018 8 20 1-7 maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-krude-xocks.pdf ACM Proceedings of the 2018 Afternoon Workshop on Kernel Bypassing Networks (KBNets'18) Budapest, Hungary Afternoon Workshop on Kernel Bypassing Networks 20.8.2018 10.1145/3229538.3229539 1 JohannesKrude MirkoStoffers KlausWehrle inproceedings 2018-rueth-reflexnetcompute 2018 8 20 reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-rueth-reflexnetcompute.pdf ACM Proceedings of the ACM SIGCOMM 2018 1st Workshop on In-Network Computing (NetCompute '18) Budapest, Hungary ACM SIGCOMM 2018 1st Workshop on In-Network Computing (NetCompute 2018) 20.08.2018 10.1145/3229591.3229592 1 JanRüth RenéGlebke KlausWehrle VedadCausevic SandraHirche inproceedings 2018-cav-schemmel-liveness 2018 7 14 symbiosys https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-schemmel-symbolic-liveness-analysis-of-real-world-software.pdf Computer Aided Verification (CAV 2018) Oxford, Great Britain 30th International Conference on Computer Aided Verification 2018-07-14 to 2018-07-17 en 10.1007/978-3-319-96142-2_27 1 DanielSchemmel JulianBüning OscarSoria Dustmann ThomasNoll KlausWehrle article 2018-serror-tvt-fb IEEE Transactions on Vehicular Technology 2018 7 67 7 5778-5792 koi https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-serror-tvt-fbl-performance.pdf IEEE online 0018-9545 10.1109/TVT.2018.2794178 1 YulinHu MartinSerror KlausWehrle JamesGross inproceedings 2018-serror-wowmom-relaying 2018 6 11 iop https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-serror-wowmom-relaying.pdf IEEE online 19th IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (IEEE WoWMoM 2018), Chania, Greece Chania, Crete, Greece WoWMoM June 12-15, 2018 978-1-5386-4725-7 10.1109/WoWMoM.2018.8449807 1 MartinSerror SebastianVaaßen KlausWehrle JamesGross inproceedings 2018-hiller-ic2e-cpplintegration 2018 4 19 241-249 ssiclops,iop https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-hiller-ic2e-policy-aware-cloud.pdf https://ieeexplore.ieee.org/document/8360335 IEEE Proceedings of the 2018 IEEE International Conference on Cloud Engineering (IC2E 2018), Orlando, Florida, USA Orlando, Florida, USA 2018 IEEE International Conference on Cloud Engineering (IC2E 2018) 2018-04-19 978-1-5386-5008-0 10.1109/IC2E.2018.00050 1 JensHiller MaelKimmerlin MaxPlauth SeppoHeikkila StefanKlauck VilleLindfors FelixEberhardt DariuszBursztynowski Jesus LlorenteSantos OliverHohlfeld KlausWehrle inproceedings 2018-matzutt-bitcoin-content-countermeasures 2018 4 17 364-370 Since the introduction of Bitcoin in 2008, blockchain systems have seen an enormous increase in adoption. By providing a persistent, distributed, and append-only ledger, blockchains enable numerous applications such as distributed consensus, robustness against equivocation, and smart contracts. However, recent studies show that blockchain systems such as Bitcoin can be (mis)used to store arbitrary content. This has already been used to store arguably objectionable content on Bitcoin's blockchain. Already single instances of clearly objectionable or even illegal content can put the whole system at risk by making its node operators culpable. To overcome this imminent risk, we survey and discuss the design space of countermeasures against the insertion of such objectionable content. Our analysis shows a wide spectrum of potential countermeasures, which are often combinable for increased efficiency. First, we investigate special-purpose content detectors as an ad hoc mitigation. As they turn out to be easily evadable, we also investigate content-agnostic countermeasures. We find that mandatory minimum fees as well as mitigation of transaction manipulability via identifier commitments significantly raise the bar for inserting harmful content into a blockchain. Bitcoin,blockchain,security,objectionable content,countermeasure mynedata,iop https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-matzutt-blockchain-contents-countermeasures.pdf https://ieeexplore.ieee.org/document/8360355 IEEE Proceedings of the First IEEE Workshop on Blockchain Technologies and Applications (BTA), co-located with the IEEE International Conference on Cloud Engineering 2018 (IC2E 2018) Orlando, Florida, USA First IEEE Workshop on Blockchain Technologies and Applications (BTA) 2018-04-17 English 978-1-5386-5008-0 10.1109/IC2E.2018.00070 1 RomanMatzutt MartinHenze Jan HenrikZiegeldorf JensHiller KlausWehrle inproceedings 2018-rueth-reflexdemo 2018 4 15 reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-rueth-reflexdemo.pdf IEEE Computer Society In Proceedings of IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Honolulu, HI, USA International Conference on Computer Communications (INFOCOM) 15.04.2018 - 19.04.2018 en 10.1109/INFCOMW.2018.8406844 1 JanRüth RenéGlebke TanjaUlmen KlausWehrle inproceedings 2018-cpsbench-schemmel-equiv 2018 4 10 symbiosys,reflexes file:2196 Proceedings of the 1st Workshop on Benchmarking Cyber-Physical Networks and Systems (CPSBench'18) Porto, Portugal 1st Workshop on Benchmarking Cyber-Physical Networks and Systems 2018-04-10 978-1-5386-6742-2 10.1109/CPSBench.2018.00011 1 DanielSchemmel RenéGlebke MirkoStoffers KlausWehrle article 2016-fgcs-ziegeldorf-bitcoin Future Generation Computer Systems 2018 3 80 448-466 Pseudonymity, anonymity, and untraceability rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018-ziegeldorf-fgcs-bitcoin.pdf Online Elsevier en 0167-739X 10.1016/j.future.2016.05.018 1 Jan HenrikZiegeldorf RomanMatzutt MartinHenze FredGrossmann KlausWehrle inproceedings 2018-matzutt-bitcoin-content 2018 2 26 Blockchains primarily enable credible accounting of digital events, e.g., money transfers in cryptocurrencies. However, beyond this original purpose, blockchains also irrevocably record arbitrary data, ranging from short messages to pictures. This does not come without risk for users as each participant has to locally replicate the complete blockchain, particularly including potentially harmful content. We provide the first systematic analysis of the benefits and threats of arbitrary blockchain content. Our analysis shows that certain content, e.g., illegal pornography, can render the mere possession of a blockchain illegal. Based on these insights, we conduct a thorough quantitative and qualitative analysis of unintended content on Bitcoin's blockchain. Although most data originates from benign extensions to Bitcoin's protocol, our analysis reveals more than 1600 files on the blockchain, over 99% of which are texts or images. Among these files there is clearly objectionable content such as links to child pornography, which is distributed to all Bitcoin participants. With our analysis, we thus highlight the importance for future blockchain designs to address the possibility of unintended data insertion and protect blockchain users accordingly. mynedata https://www.comsys.rwth-aachen.de/fileadmin/papers/2018/2018_matzutt_bitcoin-contents_preproceedings-version.pdf 2018-01-07 Online Springer Proceedings of the 22nd International Conference on Financial Cryptography and Data Security (FC), Nieuwpoort, Curaçao Nieuwpoort, Curaçao Financial Cryptography and Data Security 2018 en 10.1007/978-3-662-58387-6_23 1 RomanMatzutt JensHiller MartinHenze Jan HenrikZiegeldorf DirkMüllmann OliverHohlfeld KlausWehrle inproceedings 2018-tzimmermann-split 2018 2 14 iop https://jenshiller.com/publication/2018-zimmermann-ewsn-split/2018-zimmermann-ewsn-split.pdf https://dl.acm.org/citation.cfm?id=3234847.3234854 ACM Proceedings of the 15th European Conference on Wireless Sensor Networks (EWSN 2018), Madrid, Spain Madrid, Spain European Conference on Wireless Sensor Networks (EWSN 2018) 14.2.2018 - 16.2.2018 en 978-0-9949886-2-1 1 TorstenZimmermann JensHiller Jens HelgeReelfs PascalHein KlausWehrle inproceedings 2018-dedin-energy-packets 2018 Proceedings of the Ninth International Conference on Future Energy Systems (ACM e-Energy '18) Karlsruhe, Germany Ninth International Conference on Future Energy Systems 2018-06-15 10.1145/3208903.3208931 1 EdoardoDe Din AntonelloMonti VeitHagenmeyer KlausWehrle article 2017-pennekamp-pmc-survey Pervasive and Mobile Computing 2017 12 42 58-76 With the increasing proliferation of smartphones, enforcing privacy of smartphone users becomes evermore important. Nowadays, one of the major privacy challenges is the tremendous amount of permissions requested by applications, which can significantly invade users' privacy, often without their knowledge. In this paper, we provide a comprehensive review of approaches that can be used to report on applications' permission usage, tune permission access, contain sensitive information, and nudge users towards more privacy-conscious behavior. We discuss key shortcomings of privacy enforcement on smartphones so far and identify suitable actions for the future. Smartphones; Permission Granting; Privacy; Nudging trinics https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-pennekamp-pmc-survey.pdf Online Elsevier en 1574-1192 10.1016/j.pmcj.2017.09.005 1 JanPennekamp MartinHenze KlausWehrle inproceedings 2017-poormohammady 13th International Conference on Network and Service Management 2017 11 26 Online IEEE 13th International Conference on Network and Service Management, Tokyo, Japan en 10.23919/CNSM.2017.8256009 1 EhsanPoormohammady Jens HelgeReelfs MirkoStoffers KlausWehrle ApostolosPapageorgiou incollection 2017-cps-henze-network 2017 11 13 25-56 sensorcloud,ipacs Song, Houbing and Fink, Glenn A. and Jeschke, Sabina Wiley-IEEE Press First 2 Security and Privacy in Cyber-Physical Systems: Foundations, Principles and Applications en 978-1-119-22604-8 10.1002/9781119226079.ch2 1 MartinHenze JensHiller RenéHummen RomanMatzutt KlausWehrle Jan HenrikZiegeldorf inproceedings 2017-henze-mobiquitous-cloudanalyzer 2017 11 7 262-271 Developers of smartphone apps increasingly rely on cloud services for ready-made functionalities, e.g., to track app usage, to store data, or to integrate social networks. At the same time, mobile apps have access to various private information, ranging from users' contact lists to their precise locations. As a result, app deployment models and data flows have become too complex and entangled for users to understand. We present CloudAnalyzer, a transparency technology that reveals the cloud usage of smartphone apps and hence provides users with the means to reclaim informational self-determination. We apply CloudAnalyzer to study the cloud exposure of 29 volunteers over the course of 19 days. In addition, we analyze the cloud usage of the 5000 most accessed mobile websites as well as 500 popular apps from five different countries. Our results reveal an excessive exposure to cloud services: 90 % of apps use cloud services and 36 % of apps used by volunteers solely communicate with cloud services. Given the information provided by CloudAnalyzer, users can critically review the cloud usage of their apps. Privacy; Smartphones; Cloud Computing; Traffic Analysis trinics https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-henze-mobiquitous-cloudanalyzer.pdf Online ACM Proceedings of the 14th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous '17), November 7-10, 2017, Melbourne, VIC, Australia Melbourne, VIC, Australia November 7-10, 2017 en 978-1-4503-5368-7 10.1145/3144457.3144471 1 MartinHenze JanPennekamp DavidHellmanns ErikMühmer Jan HenrikZiegeldorf ArthurDrichel KlausWehrle inproceedings 2017-liew-schemmel-fp 2017 10 30 symbiosys file:1848 Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering Urbana-Champaign, IL, USA en 978-1-5386-2684-9/17 1 DanielLiew DanielSchemmel CristianCadar AlastairDonaldson RafaelZähl KlausWehrle inproceedings 2017-panchenko-wpes-fingerprinting 2017 10 30 https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-panchenko-wpes-fingerprinting.pdf Online ACM Proceedings of the 16th Workshop on Privacy in the Electronic Society (WPES), co-located with the 24th ACM Conference on Computer and Communications Security (CCS), Dallas, TX, USA en 978-1-4503-5175-1 10.1145/3139550.3139564 1 AndriyPanchenko AsyaMitseva MartinHenze FabianLanze KlausWehrle ThomasEngel inproceedings 2017-stoffers-dsrt-memo-ident 2017 10 18 33-42 Automatic Memoization; Accelerating Parameter Studies; Performance Prediction memosim,symbiosys http://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-stoffers-dsrt-memo-ident.pdf Online IEEE Proceedings of the 21st IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2017), Rome, Italy Rome, Italy en 10.1109/DISTRA.2017.8167664 1 MirkoStoffers RalfBettermann KlausWehrle proceedings 2017-SymPerfPoster 2017 8 21 spp,erc,symbiosys,reflexes https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-rath-sym-perf-poster.pdf ACM Los Angeles, USA ACM SIGCOMM 2017 Poster 21.8.2017 - 25.8.2017 en 978-1-4503-5057-0/17/08 10.1145/3123878.3131977 1 FelixRath JohannesKrude JanRüth DanielSchemmel OliverHohlfeld Jó AgilaBitsch Link KlausWehrle inproceedings 2017-henze-trustcom-dcam 2017 8 1 185-192 sscilops, ipacs https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-henze-trustcom-dcam.pdf Online IEEE Proceedings of the 16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom), Sydney, NSW, Australia en 978-1-5090-4905-9 2324-9013 10.1109/Trustcom/BigDataSE/ICESS.2017.236 1 MartinHenze BenediktWolters RomanMatzutt TorstenZimmermann KlausWehrle article 2017-ziegeldorf-bmcmedgenomics-bloom BMC Medical Genomics 2017 7 26 10 Suppl 2 29-42 Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical research but also causes unprecedented privacy risks for the many. Handling storage and processing of large genome datasets through cloud services greatly aggravates these concerns. Current research efforts thus investigate the use of strong cryptographic methods and protocols to implement privacy-preserving genomic computations. We propose FHE-Bloom and PHE-Bloom, two efficient approaches for genetic disease testing using homomorphically encrypted Bloom filters. Both approaches allow the data owner to securely outsource storage and computation to an untrusted cloud. FHE-Bloom is fully secure in the semi-honest model while PHE-Bloom slightly relaxes security guarantees in a trade-off for highly improved performance. We implement and evaluate both approaches on a large dataset of up to 50 patient genomes each with up to 1000000 variations (single nucleotide polymorphisms). For both implementations, overheads scale linearly in the number of patients and variations, while PHE-Bloom is faster by at least three orders of magnitude. For example, testing disease susceptibility of 50 patients with 100000 variations requires only a total of 308.31 s (σ=8.73 s) with our first approach and a mere 0.07 s (σ=0.00 s) with the second. We additionally discuss security guarantees of both approaches and their limitations as well as possible extensions towards more complex query types, e.g., fuzzy or range queries. Both approaches handle practical problem sizes efficiently and are easily parallelized to scale with the elastic resources available in the cloud. The fully homomorphic scheme, FHE-Bloom, realizes a comprehensive outsourcing to the cloud, while the partially homomorphic scheme, PHE-Bloom, trades a slight relaxation of security guarantees against performance improvements by at least three orders of magnitude. Proceedings of the 5th iDASH Privacy and Security Workshop 2016 Secure outsourcing; Homomorphic encryption; Bloom filters sscilops; mynedata; rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-ziegeldorf-bmcmedgenomics-bloom.pdf Online BioMed Central Chicago, IL, USA November 11, 2016 en 1755-8794 10.1186/s12920-017-0277-y 1 Jan HenrikZiegeldorf JanPennekamp DavidHellmanns FelixSchwinger IkeKunze MartinHenze JensHiller RomanMatzutt KlausWehrle inproceedings 2017-zimmermann-secon 2017 6 12 maki IEEE 14th IEEE International Conference on Sensing, Communication, and Networking (SECON 2017), San Diego, USA San Diego, USA 14th IEEE International Conference on Sensing, Communication, and Networking (SECON 2017) 12.06.2017 - 14.06.2017 en 978-1-5090-6599-8 10.1109/SAHCN.2017.7964939 1 TorstenZimmermann HannoWirtz Jan HenrikZiegeldorf ChristianSteinhaus KlausWehrle inproceedings 2017-serror-pads-cows 2017 5 24 memosim,symbiosys https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-serror-pads-cows.pdf ACM online Proceedings of the 5th ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’17), Singapore, Singapore Singapore, Singapore 5th ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’17) May 24-26, 2017 978-1-4503-4489-0 10.1145/3064911.3064913 1 MartinSerror Jörg ChristianKirchhof MirkoStoffers KlausWehrle JamesGross inproceedings 2017-henze-ic2e-prada 2017 4 4 252-258 ssiclops, ipacs https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-henze-ic2e-prada.pdf Online IEEE Proceedings of the 2017 IEEE International Conference on Cloud Engineering (IC2E 2017), Vancouver, BC, Canada en 978-1-5090-5817-4 10.1109/IC2E.2017.32 1 MartinHenze RomanMatzutt JensHiller ErikMühmer Jan HenrikZiegeldorf Johannesvan der Giet KlausWehrle inproceedings 2017-ziegeldorf-codaspy-priward 2017 3 22 83-94 mynedata https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-ziegeldorf-codaspy-priward.pdf Online ACM Proceedings of the 7th ACM Conference on Data and Application Security and Privacy (CODASPY 2017), Scottsdale, AZ, USA en 978-1-4503-4523-1 10.1145/3029806.3029816 1 Jan HenrikZiegeldorf JanMetzke JanRüth MartinHenze KlausWehrle proceedings 2017-serror-netsys-industrial 2017 3 16 koi https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/Ansari_et_al_Wireless_Industrial_Automation_Demo_NetSys_2017.pdf IEEE Göttingen, Germany International Conference on Networked Systems (NetSys 2017) 10.1109/NetSys.2017.7931496 1 JunaidAnsari IsmetAktas ChristianBrecher ChristophPallasch NicolaiHoffmann MarkusObdenbusch MartinSerror KlausWehrle JamesGross inproceedings 2017-wirtz-zimmermann-percom-etc 2017 3 13 https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-wirtz-zimmermann-percom-etc.pdf Online IEEE Proceedings of the 2017 IEEE International Conference on Pervasive Computing and Communications (PerCom), Kona, Big Island, HI, USA en 978-1-5090-4328-6 10.1109/PERCOM.2017.7917877 1 HannoWirtz TorstenZimmermann MatteoCeriotti KlausWehrle inproceedings 2017-ziegeldorf-wons-tracemixer 2017 2 21 17-24 mynedata https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-ziegeldorf-wons-tracemixer.pdf Online IEEE Proceedings of the 2017 13th Annual Conference on Wireless On-demand Network Systems and Services (WONS), Jackson Hole, WY, USA en 978-3-901882-88-3 10.1109/WONS.2017.7888771 1 Jan HenrikZiegeldorf MartinHenze JensBavendiek KlausWehrle incollection 2016-iiot-rueth-comm 2017 317-346 Online Jeschke, Sabina and Brecher, Christian and Song, Houbing and Rawat, Danda B. Springer Industrial Internet of Things en 978-3-319-42558-0 10.1007/978-3-319-42559-7_12 1 JanRüth FlorianSchmidt MartinSerror KlausWehrle TorstenZimmermann inproceedings 2017-matzutt-mynedata 2017 1073-1084 Personal user data is collected and processed at large scale by a handful of big providers of Internet services. This is detrimental to users, who often do not understand the privacy implications of this data collection, as well as to small parties interested in gaining insights from this data pool, e.g., research groups or small and middle-sized enterprises. To remedy this situation, we propose a transparent and user-controlled data market in which users can directly and consensually share their personal data with interested parties for monetary compensation. We define a simple model for such an ecosystem and identify pressing challenges arising within this model with respect to the user and data processor demands, legal obligations, and technological limits. We propose myneData as a conceptual architecture for a trusted online platform to overcome these challenges. Our work provides an initial investigation of the resulting myneData ecosystem as a foundation to subsequently realize our envisioned data market via the myneData platform. Presentation slides are in German Personal User Data, Personal Information Management, Data Protection Laws, Privacy Enhancing Technologies, Platform Design, Profiling mynedata_show https://www.comsys.rwth-aachen.de/fileadmin/papers/2017/2017-matzutt-informatik-mynedata.pdf https://www.comsys.rwth-aachen.de/fileadmin/misc/mynedata/talks/2017-matzutt-informatik-mynedata-presentation.pdf Presentation slides Eibl, Maximilian and Gaedke, Martin Gesellschaft für Informatik, Bonn INFORMATIK 2017 Chemnitz INFORMATIK 2017 2017-09-28 English 978-3-88579-669-5 1617-5468 10.18420/in2017_109 1 RomanMatzutt DirkMüllmann Eva-MariaZeissig ChristianeHorst KaiKasugai SeanLidynia SimonWieninger Jan HenrikZiegeldorf GerhardGudergan IndraSpiecker gen. Döhmann KlausWehrle MartinaZiefle inproceedings 2016-henze-cloudcom-trinics 2016 12 12 366-370 trinics https://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-henze-cloudcom-trinics.pdf Online IEEE Proceedings of the 2016 IEEE International Conference on Cloud Computing Technology and Science (CloudCom), Luxembourg, Luxembourg en 978-1-5090-1445-3 10.1109/CloudCom.2016.0064 1 MartinHenze DanielKerpen JensHiller MichaelEggert DavidHellmanns ErikMühmer OussamaRenuli HenningMaier ChristianStüble RogerHäußling KlausWehrle inproceedings 2016-henze-wpes-cppl 2016 10 24 99-110 ssiclops https://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-henze-wpes-cppl.pdf Online ACM Proceedings of the 15th Workshop on Privacy in the Electronic Society (WPES), co-located with the 23rd ACM Conference on Computer and Communications Security (CCS), Vienna, Austria en 978-1-4503-4569-9 10.1145/2994620.2994627 1 MartinHenze JensHiller SaschaSchmerling Jan HenrikZiegeldorf KlausWehrle inproceedings 2016-mitseva-ccs-fingerprinting 2016 10 24 1766-1768 https://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-mitseva-ccs-fingerprinting.pdf Online ACM Proceedings of the 23rd ACM Conference on Computer and Communications Security (CCS), Vienna, Austria en 978-1-4503-4139-4 10.1145/2976749.2989054 1 AsyaMitseva AndriyPanchenko FabianLanze MartinHenze KlausWehrle ThomasEngel inproceedings 2016-matzutt-ccs-bitcoin 2016 10 24 1769-1771 mynedata /fileadmin/papers/2016/2016-matzutt-ccs-blockchaincontent.pdf Online ACM Proceedings of the 23rd ACM Conference on Computer and Communications Security (CCS), Vienna, Austria en 978-1-4503-4139-4 10.1145/2976749.2989059 1 RomanMatzutt OliverHohlfeld MartinHenze RobinRawiel Jan HenrikZiegeldorf KlausWehrle inproceedings 2016-ackermann-healthcom-eeg-emotion 2016 9 14 159--164 Automatic emotion recognition is an interdisciplinary research field which deals with the algorithmic detection of human affect, e.g. anger or sadness, from a variety of sources, such as speech or facial gestures. Apart from the obvious usage for industry applications in human-robot interaction, acquiring the emotional state of a person automatically also is of great potential for the health domain, especially in psychology and psychiatry. Here, evaluation of human emotion is often done using oral feedback or questionnaires during doctor-patient sessions. However, this can be perceived as intrusive by the patient. Furthermore, the evaluation can only be done in a non-continuous manner, e.g. once a week during therapy sessions. In contrast, using automatic emotion detection, the affect state of a person can be evaluated in a continuous non-intrusive manner, for example to detect early on-sets of depression. An additional benefit of automatic emotion recognition is the objectivity of such an approach, which is not influenced by the perception of the patient and the doctor. To reach the goal of objectivity, it is important, that the source of the emotion is not easily manipulable, e.g. as in the speech modality. To circumvent this caveat, novel approaches in emotion detection research the potential of using physiological measures, such as galvanic skin sensors or pulse meters. In this paper we outline a way of detecting emotion from brain waves, i.e., EEG data. While EEG allows for a continuous, real-time automatic emotion recognition, it furthermore has the charm of measuring the affect close to the point of emergence: the brain. Using EEG data for emotion detection is nevertheless a challenging task: Which features, EEG channel locations and frequency bands are best suited for is an issue of ongoing research. In this paper we evaluate the use of state of the art feature extraction, feature selection and classification algorithms for EEG emotion classification using data from the de facto standard dataset, DEAP. Moreover, we present results that help choose methods to enhance classification performance while simultaneously reducing computational complexity. /fileadmin/papers/2016/2016-ackermann-healthcom-emorec.pdf http://ieeehealthcom2016.com/ Online IEEE 2016 IEEE 18th International Conference on e-Health Networking, Applications and Services (Healthcom) Munich, Germany 2016 IEEE 18th International Conference on e-Health Networking, Applications and Services (Healthcom) September 14-17, 2016 en 978-1-5090-3370-6 1 PascalAckermann ChristianKohlschein Jó AgilaBitsch Link KlausWehrle SabinaJeschke article 2015-cheng-piap-jmu JMIR Mhealth Uhealth 2016 7 20 4 3 e88 piap http://mhealth.jmir.org/2016/3/e88/ http://www.ncbi.nlm.nih.gov/pubmed/27439444 Online en 2291-5222 10.2196/mhealth.5284 1 Paula Glenda FerrerCheng Roann MunozRamos Jó AgilaBitsch Link Stephan MichaelJonas TimIx Portia Lynn QuetulioSee KlausWehrle techreport 2016-henze-aib-sensorcloud 2016 7 11 AIB-2016-06 arXiv:1607.03239 [cs.NI] 1--24 sensorcloud fileadmin/papers/2016/2016-henze-aib-sensorcloud.pdf Online Department of Computer Science, RWTH Aachen University

Ahornstr. 55, 52074 Aachen, Germany

Department of Computer Science, RWTH Aachen University Technical Report en 0935-3232 MartinHenze RenéHummen RomanMatzutt KlausWehrle inproceedings 2016-serror-wowmom-arq 2016 6 21 koi IEEE online 17th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE WoWMoM 2016), Coimbra, Portugal Coimbra, Portugal en 10.1109/WoWMoM.2016.7523534 1 MartinSerror YulinHu ChristianDombrowski KlausWehrle JamesGross inproceedings 2016-werner-networking-stean 2016 5 17 maki IEEE Proceedings of the 15th International IFIP Networking Conference (NETWORKING'16), Vienna, Austira Vienna, Austria IFIP Networking 2016 17.-19.5.2016 978-3-9018-8283-8 10.1109/IFIPNetworking.2016.7497203 1 MarcWerner JohannesSchwandtke MatthiasHollick OliverHohlfeld TorstenZimmermann KlausWehrle inproceedings 2016-stoffers-pads-memo 2016 5 15 221-232 Best Paper Award Automatic Memoization; Accelerating Parameter Studies; Impure Languages memosim,symbiosys http://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-stoffers-pads-memoization.pdf Online ACM

New York, NY

Proceedings of the 4th ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’16), Banff, AB, Canada Banff, AB, Canada en 10.1145/2901378.2901386 1 MirkoStoffers DanielSchemmel OscarSoria Dustmann KlausWehrle inproceedings 2016-zimmermann-remp 2016 5 IEEE Proceedings of the IEEE International Conference on Communications (ICC 2016), Kuala Lumpur, Malaysia Kuala Lumpur, Malaysia ICC 2016 23.-27.5.2016 978-1-4799-6664-6 1938-1883 10.1109/ICC.2016.7510787 1 AlexanderFrömmgen TobiasErbshäuser TorstenZimmermann KlausWehrle AlejandroBuchmann inproceedings 2016-henze-claw-dpc 2016 4 8 130-135 ssiclops /fileadmin/papers/2016/2016-henze-claw-dpc.pdf Online IEEE Proceedings of the Second International Workshop on Legal and Technical Issues in Cloud Computing and Cloud-Supported Internet of Things (CLaw 2016), co-located with the 2016 IEEE International Conference on Cloud Engineering (IC2E 2016), Berlin, Germany en 978-1-5090-3684-4 10.1109/IC2EW.2016.24 1 MartinHenze JensHiller OliverHohlfeld KlausWehrle article 2016-fgcs-henze-iotprivacy Future Generation Computer Systems 2016 3 56 701-718 ipacs https://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-henze-fgcs-iotprivacy.pdf Online Elsevier en 0167-739X 10.1016/j.future.2015.09.016 1 MartinHenze LarsHermerschmidt DanielKerpen RogerHäußling BernhardRumpe KlausWehrle inproceedings 2016-panchenko-ndss-fingerprinting 2016 2 21 The website fingerprinting attack aims to identify the content (i.e., a webpage accessed by a client) of encrypted and anonymized connections by observing patterns of data flows such as packet size and direction. This attack can be performed by a local passive eavesdropper – one of the weakest adversaries in the attacker model of anonymization networks such as Tor. In this paper, we present a novel website fingerprinting attack. Based on a simple and comprehensible idea, our approach outperforms all state-of-the-art methods in terms of classification accuracy while being computationally dramatically more efficient. In order to evaluate the severity of the website fingerprinting attack in reality, we collected the most representative dataset that has ever been built, where we avoid simplified assumptions made in the related work regarding selection and type of webpages and the size of the universe. Using this data, we explore the practical limits of website fingerprinting at Internet scale. Although our novel approach is by orders of magnitude computationally more efficient and superior in terms of detection accuracy, for the first time we show that no existing method – including our own – scales when applied in realistic settings. With our analysis, we explore neglected aspects of the attack and investigate the realistic probability of success for different strategies a real-world adversary may follow. https://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-panchenko-ndss-fingerprinting.pdf https://www.informatik.tu-cottbus.de/~andriy/zwiebelfreunde/ Internet Society Proceedings of the 23rd Annual Network and Distributed System Security Symposium (NDSS '16), February 21-24, 2016, San Diego, CA, USA San Diego, CA, USA February 21-24, 2016 978-1-891562-41-9 10.14722/ndss.2016.23477 1 AndriyPanchenko FabianLanze AndreasZinnen MartinHenze JanPennekamp KlausWehrle ThomasEngel article 2016-kunz-tomacs-horizon ACM Transactions on Modeling and Computer Simulation (TOMACS) 2016 1 26 2 12:1--12:26 The technical evolution of wireless communication technology and the need for accurately modeling these increasingly complex systems causes a steady growth in the complexity of simulation models. At the same time, multi-core systems have become the de facto standard hardware platform. Unfortunately, wireless systems pose a particular challenge for parallel execution due to a tight coupling of network entities in space and time. Moreover, model developers are often domain experts with no in-depth understanding of parallel and distributed simulation. In combination, both aspects severely limit the performance and the efficiency of existing parallelization techniques. We address these challenges by presenting parallel expanded event simulation, a novel modeling paradigm that extends discrete events with durations which span a period in simulated time. The resulting expanded events form the basis for a conservative synchronization scheme that considers overlapping expanded events eligible for parallel processing. We furthermore put these concepts into practice by implementing Horizon, a parallel expanded event simulation framework specifically tailored to the characteristics of multi-core systems. Our evaluation shows that Horizon achieves considerable speedups in synthetic as well as real-world simulation models and considerably outperforms the current state-of-the-art in distributed simulation. Parallel discrete event simulation, Multi-core Systems, Wireless Systems, Simulation Modeling Paradigm, Conservative Synchronization horizon ACM en 10.1145/2832909 1 GeorgKunz MirkoStoffers OlafLandsiedel KlausWehrle JamesGross inproceedings 2016-zimmermann-wons-mirco 2016 1 25-32 maki http://www.comsys.rwth-aachen.de/fileadmin/papers/2016/2016-zimmermann-wons-mirco.pdf IEEE 12th International Conference on Wireless On-demand Network Systems and Services (WONS), Cortina d'Ampezzo, Italy Cortina d'Ampezzo, Italy 12th International Conference on Wireless On-demand Network Systems and Services (WONS) January 20 - 22 2016 en 978-3-901882-80-7 1 TorstenZimmermann JanRüth HannoWirtz KlausWehrle inproceedings 2015-ziegeldorf-cans-boma 2015 12 8 9476 197-213 /fileadmin/papers/2015/2015-ziegeldorf-cans-boma.pdf Online Springer Lecture Notes in Computer Science 14th International Conference on Cryptology and Network Security (CANS 2015), Marrakesh, Morocco en 978-3-319-26822-4 10.1007/978-3-319-26823-1_14 1 Jan HenrikZiegeldorf JensHiller MartinHenze HannoWirtz KlausWehrle inproceedings 2015-zimmermann-remp 2015 12 1 ACM Proceedings of the 2015 CoNEXT on Student Workshop, CoNEXT Student Workshop, Heidelberg, Germany Heidelberg, Germany CoNEXT 2015 1.-4.12.2015 1 AlexanderFrömmgen TobiasErbshäuser TorstenZimmermann KlausWehrle AlejandroBuchmann inproceedings 2015-serror-channel-coding 2015 12 koi file:1704 IEEE online IEEE GC 2015 Workshop on Ultra-Low Latency and Ultra-High Reliability in Wireless Communications (GC'15 - ULTRA2), San Diego, USA San Diego, USA IEEE GC 2015 Workshop on Ultra-Low Latency and Ultra-High Reliability in Wireless Communications December 6-10 2015 10.1109/GLOCOMW.2015.7414150 1 MartinSerror ChristianDombrowski KlausWehrle JamesGross inproceedings 2015-stoffers-mswim-data-deps 2015 11 2 291-300 Simulation of wireless systems is highly complex and can only be efficient if the simulation is executed in parallel. To this end, independent events have to be identified to enable their simultaneous execution. Hence, the number of events identified as independent needs to be maximized in order to increase the level of parallelism. Traditionally, dependencies are determined only by time and location of events: If two events take place on the same simulation entity, they must be simulated in timestamp order. Our approach to overcome this limitation is to also investigate data-dependencies between events. This enables event reordering and parallelization even for events at the same simulation entity. To this end, we design the simulation language PSimLa, which aids this process. In this paper, we discuss the PSimLa design and compiler as well as our data-dependency analysis approach in detail and present case studies of wireless network models, speeded up by a factor of 10 on 12 cores where time-based parallelization only achieves a 1.6x speedup. Best Paper Award Parallel simulation; Static code analysis; Data dependencies horizon http://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-stoffers-mswim-data-deps.pdf Online ACM

New York, NY

Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Cancún, Mexico (MSWiM'15) Cancún, Mexico en 10.1145/2811587.2811593 1 MirkoStoffers TorstenSehy JamesGross KlausWehrle inproceedings 2015-wirtz-wifi-sharing 2015 10 19-27 http://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-wirtz-lcn-cows.pdf Online IEEE 40th IEEE Conference on Local Computer Networks (LCN), Clearwater Beach, USA Clearwater Beach, Florida, USA 40th IEEE Conference on Local Computer Networks (LCN) October 26-29 2015 en 10.1109/LCN.2015.7366279 1 HannoWirtz TorstenZimmermann MartinSerror KlausWehrle poster serror-zdn-2015 2015 9 25 cps,koi,hodrian https://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-serror-zdn-cooperation.pdf http://kn.inf.uni-tuebingen.de/itg-zdn-2015-poster-session VDE online ITG-Fachtagung "Zukunft der Netze 2015" – Poster Session, Tübingen, Germany Tübingen, Germany MartinSerror ChristianDombrowski KlausWehrle JamesGross inproceedings 2015-ziegeldorf-dpm-comparison 2015 9 22 9481 226-234 fileadmin/papers/2015/2015-ziegeldorf-dpm-cbp.pdf Online Springer Lecture Notes in Computer Science The 10th DPM International Workshop on Data Privacy Management, Vienna, Austria en 978-3-319-29882-5 10.1007/978-3-319-29883-2_15 1 Jan HenrikZiegeldorf MartinHenze RenéHummen KlausWehrle inproceedings 2015-schmidt-santa 2015 8 19 ssiclops https://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-schmidt-sigcomm-santa.pdf Online ACM Proceedings of the 43rd ACM SIGCOMM Conference (SIGCOMM '15), London, United Kingdom London, United Kingdom 43rd ACM SIGCOMM Conference (SIGCOMM '15) 17–21 August, 2015 en 10.1145/2785956.2790014 1 FlorianSchmidt OliverHohlfeld RenéGlebke KlausWehrle inproceedings 2015-ahfe-kowalewski-facebook Procedia Manufacturing 2015 7 3 815--822 Elsevier The 6th International Conference on Applied Humand Factors and Ergonomics (AHFE 2015), Las Vegas, NV, USA en 2351-9789 10.1016/j.promfg.2015.07.336 1 SylviaKowalewski MartinaZiefle Jan HenrikZiegeldorf KlausWehrle inproceedings 2015-wirtz-secon 2015 6 24 256-264 maki https://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-wirtz-secon-stif.pdf http://www.comsys.rwth-aachen.de/short/secon15-stif Online IEEE 12th IEEE International Conference on Sensing, Communication, and Networking (SECON 2015), Seattle, USA Seattle, USA 12th IEEE International Conference on Sensing, Communication, and Networking (SECON 2015) 22.06.2015 - 25.06.2015 en 10.1109/SAHCN.2015.7338324 1 HannoWirtz JanRüth MartinSerror TorstenZimmermann KlausWehrle inproceedings 2015-stoffers-pads-data-deps 2015 6 10 73-74 horizon http://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-stoffers-pads-data-deps.pdf Online ACM

New York, NY

Proceedings of the 3rd ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS’15), London, United Kingdom London, United Kingdom en 10.1145/2769458.2769487 1 MirkoStoffers TorstenSehy JamesGross KlausWehrle inproceedings 2015-bitsch-phealth-piap 2015 6 2 211 153 --159 Depression is the most prevalent clinical disorder and one of the main causes of disability. This makes early detection of depressive symptoms critical in its prevention and management. This paper presents and discusses the development of Psychologist in a Pocket (PiaP), a mental mHealth application for Android which screens and monitors for these symptoms, and–given the explicit permission of the user–alerts a trusted contact such as the mental health professional or a close friend, if it detects symptoms. All text inputted electronically–such as short message services, emails, social network posts–is analyzed based on keywords related to depression based on DSM-5 and ICD criteria as well as Beck's Cognitive Theory of Depression and the Self-Focus Model. Data evaluation and collection happen in the background, on- device, without requiring any user involvement. Currently, the application is in an early prototype phase entering initial clinical validation. fileadmin/papers/2015/2015-bitsch-phealth-piap.pdf Print Blobel, Bernd and Lindén, Maria and Ahmed, Mobyen Uddin IOS Press

Amsterdam

Studies in Health Technology and Informatics Proceedings of the 12th International Conference on Wearable Micro and Nano Technologies for Personalized Health Västerås, Sweden 12th International Conference on Wearable Micro and Nano Technologies for Personalized Health June 2-4, 2015 en 978-1-61499-515-9 0926-9630 10.3233/978-1-61499-516-6-153 1 Jó AgilaBitsch Link RoannRamos TimIx Paula GlendaFerrer Cheng KlausWehrle inproceedings 2015-bitsch-phealth-brain 2015 6 2 211 185 -- 190 Bringing brain research tools like EEG devices out of the lab into the pockets of practitioners and researchers may fundamentally change the way we perform diagnostics and research. While most of the current techniques are limited to research clinics and require excessive set-up, new consumer EEG devices connected to standard, off-the-shelf mobile devices allow us to lift these limitations. This allows neuropsychological assessment and research in mobile settings, possibly even in remote areas with limited accessibility and infrastructure, thus bringing the equip- ment to the patient, instead of bringing the patient to the equipment. We are developing an Android based mobile framework to perform EEG studies. By connecting a mobile consumer EEG headset directly to an unmodified mobile device, presenting auditory and visual stimuli, as well as user interaction, we create a self-contained experimental plat- form. We complement this platform by a toolkit for immediate evalua- tion of the recorded data directly on the device, even without internet connectivity. Initial results from the replication of two Event Related Potentials studies indicate the feasibility of the approach. fileadmin/papers/2015/2015-bitsch-phealth-brain.pdf Print Blobel, Bernd and Lindén, Maria and Ahmed, Mobyen Uddin IOS Press

Amsterdam

Studies in Health Technology and Informatics Proceedings of the 12th International Conference on Wearable Micro and Nano Technologies for Personalized Health Västerås, Sweden 12th International Conference on Wearable Micro and Nano Technologies for Personalized Health June 2-4, 2015 en 978-1-61499-515-9 0926-9630 10.3233/978-1-61499-516-6-185 1 Jó AgilaBitsch Link RoannRamos CassandraSeverijns KlausWehrle inproceedings 2015-ziegeldorf-iwpe-comparison 2015 5 21 198-205 https://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-ziegeldorf-iwpe-choose.pdf Online IEEE 2015 International Workshop on Privacy Engineering (IWPE'15), part of 2015 IEEE Security and Privacy Workshops (SPW 2015), San Jose, CA, USA en 10.1109/SPW.2015.9 1 Jan HenrikZiegeldorf JanMetzke MartinHenze KlausWehrle proceedings 2015-sdnflex-heuschkel-dyns 2015 3 9 IEEE Cottbus SDNFlex Workshop (NetSys 2015) March 2015, 9-12 en 10.1109/NetSys.2015.7089055 1 JensHeuschkel ImmanuelSchweizer TorstenZimmermann KlausWehrle MaxMühlhäuser inproceedings 2014-ziegeldorf-codaspy-coinparty 2015 3 2 rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-ziegeldorf-codaspy-coinparty.pdf Online ACM The Fifth ACM Conference on Data and Application Security and Privacy (CODASPY 2015), San Antonio, TX, USA San Antonio, TX, USA The Fifth ACM Conference on Data and Application Security and Privacy (CODASPY 2015) en 978-1-4503-3191-3 10.1145/2699026.2699100 1 Jan HenrikZiegeldorf FredGrossmann MartinHenze NicolasInden KlausWehrle inproceedings 2015-ewsn-schmidt-canttaketheheat 2015 2 10 https://www.comsys.rwth-aachen.de/fileadmin/papers/2015/2015-schmidt-ewsn-canttaketheheat.pdf Online Springer Proceedings of the 12th European Conference on Wireless Sensor Networks (EWSN 2015), Porto, Portugal Porto, Portugal 12th European Conference on Wireless Sensor Networks (EWSN 2015) 9-11 February, 2015 en 978-3-319-15581-4 10.1007/978-3-319-15582-1_19 1 FlorianSchmidt MatteoCeriotti NiklasHauser KlausWehrle incollection 2014-tcc-henze-trustpoint 2014 12 14 77-106 sensorcloud Online Krcmar, Helmut and Reussner, Ralf and Rumpe, Bernhard Springer Trusted Cloud Computing 978-3-319-12717-0 10.1007/978-3-319-12718-7_6 1 MartinHenze RenéHummen RomanMatzutt KlausWehrle incollection 2013-wtc-eggert-sensorcloud 2014 12 14 203-218 sensorcloud fileadmin/papers/2013/2013-wtc-eggert-sensorcloud.pdf Online Krcmar, Helmut and Reussner, Ralf and Rumpe, Bernhard Springer Trusted Cloud Computing en 978-3-319-12717-0 10.1007/978-3-319-12718-7_13 1 MichaelEggert RogerHäußling MartinHenze LarsHermerschmidt RenéHummen DanielKerpen AntonioNavarro Pérez BernhardRumpe DirkThißen KlausWehrle techreport 2015-aib-schmidt-hotbox 2014 12 4 AIB-2014-14 arXiv:1412.2257 [cs.NI] 1--17 senserr fileadmin/papers/2014/2014-schmidt-aib-hotbox.pdf Online Department of Computer Science, RWTH Aachen

Ahornstr. 55, 52074 Aachen, Germany

Department of Computer Science, RWTH Aachen Technical Report en 0935-3232 FlorianSchmidt MatteoCeriotti NiklasHauser KlausWehrle inproceedings 2014-wirtz-mum-dcmv 2014 11 27 fileadmin/papers/2014/2014-wirtz-mum-mcv.pdf Online ACM The 13th International Conference on Mobile and Ubiquitous Multimedia (MUM 2014), Melbourne, Australia Melbourne, Australia The 13th International Conference on Mobile and Ubiquitous Multimedia (MUM 2014) en 978-1-4503-3304-7 10.1145/2677972.2677974 1 HannoWirtz JanRüth KlausWehrle inproceedings 2014-mass-wirtz-mafi 2014 10 fileadmin/papers/2014/2014-wirtz-mass-mafi.pdf Online IEEE Computer Society Proceedings of The 11th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2014), Philadelphia, PA, USA Philadelphia, USA 11th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2014) 27 - 30 October 2014 en 978-1-4799-6035-4 10.1109/MASS.2014.21 1 HannoWirtz GeorgKunz JohannesLaudenberg RobertBackhaus KlausWehrle proceedings 2014-kuvs-zimmermann-mindgap 2014 9 29 Stuttgart 1st KuVS Workshop on Anticipatory Networks September 29-30, 2014 1 MarcWerner TobiasLange MatthiasHollick TorstenZimmermann KlausWehrle inproceedings 2014-aasnet-henze-scslib 2014 9 24 37 370-375 sensorcloud /fileadmin/papers/2014/2014-henze-aasnet-scslib.pdf Online Elsevier Procedia Computer Science The 6th International Symposium on Applications of Ad hoc and Sensor Networks (AASNET'14), Halifax, NS, Canada Halifax, NS, Canada The 6th International Symposium on Applications of Ad hoc and Sensor Networks (AASNET'14) en 10.1016/j.procs.2014.08.055 1 MartinHenze SebastianBereda RenéHummen KlausWehrle inproceedings 2014-aktas-wintech-a-framework-for-remote-automation-configuration-and-monitoring 2014 9 7 1--8 crawler fileadmin/papers/2014/2014-aktas-wintech-remote-cross-layer.pdf Online ACM Proceedings of the 9th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2014), Hawaii, USA Hawaii, USA 9th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2014) 7 September 2014 en 978-1-4503-3072-5 10.1145/2643230.2643236 1 IsmetAktas OscarPuñal FlorianSchmidt TobiasDrüner KlausWehrle inproceedings 2014-chants-wirtz-disco 2014 9 7 1-8 fileadmin/papers/2014/2014-wirtz-chants-challenged_iot.pdf online ACM Proceedings of the 9th ACM MobiCom Workshop on Challenged Networks (CHANTS 2014), Maui, USA Maui, Hawaii, USA Proceedings of the 9th ACM MobiCom Workshop on Challenged Networks (CHANTS 2014) 7 September 2014 en 978-1-4503-3071-8 10.1145/2645672.2645679 1 HannoWirtz JanRüth MartinSerror Jó AgilaBitsch Link KlausWehrle inproceedings 2014-stoffers-omnet-parallel-inet 2014 9 3 http://arxiv.org/pdf/1409.0994 arXiv:1409.0994 Online Cornell University

Ithaca, New York, United States

Proceedings of the 1st OMNeT++ Community Summit, Hamburg, Germany Hamburg, Germany en MirkoStoffers RalfBettermann JamesGross KlausWehrle inproceedings 2014-ficloud-henze-upecsi 2014 8 27 191-196 ipacs /fileadmin/papers/2014/2014-ficloud-henze-upecsi.pdf Online IEEE 2014 International Conference on Future Internet of Things and Cloud (FiCloud 2014), Barcelona, Spain Barcelona, Spain 2014 International Conference on Future Internet of Things and Cloud (FiCloud 2014) en 978-1-4799-4357-9 10.1109/FiCloud.2014.38 1 MartinHenze LarsHermerschmidt DanielKerpen RogerHäußling BernhardRumpe KlausWehrle inproceedings 2014-bitsch-extremecom-demo 2014 8 14 1--2 The majority of research using brain imaging and EEG techniques is currently limited to clinical environments, restricting experiments to synthetic tasks in controlled conditions. Lifting these limitations brought about by this artificial set-up would allow us to perform neuropsychological assessments and research in mobile settings or at locations easier accessible to patients, possibly even in remote, hard to access areas. We developed a tablet based mobile framework to present auditory and visual stimuli, capture wireless commercial EEG and screen interaction data, and analyze the recorded data for immediate evaluation, as well as share the data over internet or local opportunistic links. To demonstrate the feasibility of our approach, we successfully replicated the experimental set-up and evaluation pipeline of two existing EEG studies on event-related potentials. This work therefore lays the foundation to further truly mobile brain research and health-care applications. fileadmin/papers/2014/2014-bitsch-extremcom-mobile-eeg-demo.pdf Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 6th Extreme Conference on Communication Galapagos Islands, Ecuador 6th Extreme Conference on Communication August 11-15, 2014 en 978-1-4503-2929-3 1 Jó AgilaBitsch Link RoannRamos DavidOrlea KlausWehrle inproceedings 2014-bitsch-extremecom-liquid-democracy 2014 8 14 1--4 Work in Progress Paper fileadmin/papers/2014/2014-bitsch-extremecom-liquid-democracy.pdf Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 6th Extreme Conference on Communication Galapagos Islands, Ecuador 6th Extreme Conference on Communication August 11-15, 2014 en 978-1-4503-2929-3 1 Jó AgilaBitsch Link AngelTchorbadjiiski KlausWehrle poster 2014-wisec-ziegeldorf-ipin 2014 7 23 rfc https://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-ziegeldorf-poster-wisec.pdf 7th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec '14) (Poster) en 10.13140/2.1.2847.4886 1 Jan HenrikZiegeldorf NicolaiViol MartinHenze KlausWehrle inproceedings 2014-hummen-delegation 2014 6 30 284-292 iotsec; sensorcloud http://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-hummen-secon-delegation.pdf Online IEEE 11th IEEE International Conference on Sensing, Communication, and Networking (SECON 2014) Singapore 11th IEEE International Conference on Sensor, Communication, and Networking (SECON 2014) 30.06. - 03.07.2014 en 10.1109/SAHCN.2014.6990364 1 RenéHummen HosseinShafagh ShahidRaza ThiemoVoigt KlausWehrle inproceedings 2014-schmidt-piccett 2014 6 24 refector https://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-schmidt-iscc-piccett.pdf IEEE Proceedings of the 18th IEEE Symposium on Computers and Communications (ISCC), Madeira, Portugal en 10.1109/ISCC.2014.6912582 1 FlorianSchmidt MartinHenze KlausWehrle inproceedings 2014-wowmom-wirtz-sofi 2014 6 18 fileadmin/papers/2014/2014-wirtz-wowmom-sofi.pdf online IEEE 15th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM'14), Sydney, Australia Sydney, Australia WoWMoM June, 2014 en 10.1109/WoWMoM.2014.6918968 1 HannoWirtz MatteoCeriotti BenjaminGrap KlausWehrle inproceedings 2014-wowmom-wirtz-cafi 2014 6 17 fileadmin/papers/2014/2014-wirtz-wowmom-cafi.pdf online IEEE 15th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM'14), Sydney, Australia en 10.1109/WoWMoM.2014.6918950 1 HannoWirtz TorstenZimmermann MatteoCeriotti KlausWehrle inproceedings 2014-aktas-punal-wowmom-machine-learning-based-jamming-detection-for-80211-conference Proceedings of the 15th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'14), Sydney, Australia 2014 6 16 1--10 crawler fileadmin/papers/2014/2014-aktas-wowmom-jammingdetection.pdf Online IEEE Proceedings of the 15th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'14), Sydney, Australia Sydney 15th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'14) 16-19 June, 2014 en 1 OscarPuñal IsmetAktas Caj-JulianSchnelke GloriaAbidin JamesGross KlausWehrle inproceedings 2014-mobisys-rueth-uiso 2014 6 355-356 https://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-rueth-mobisys-uiso.pdf http://www.comsys.rwth-aachen.de/short/mobisys14-demo Online ACM Proceedings of the 12th Annual International Conference on Mobile Systems, Applications, and Services (MobiSys '14), Bretton Woods, New Hampshire, USA Bretton Woods 12th Annual International Conference on Mobile Systems, Applications, and Services 16-19 June 2014 en 978-1-4503-2793-0 10.1145/2594368.2601477 1 JanRüth HannoWirtz KlausWehrle inproceedings 2014-smartcity-zimmermann-pubtrans 2014 3 30 fileadmin/papers/2014/2014-zimmermann-smartcity-pubtrans.pdf Online IEEE Proceedings of the 1st International IEEE Workshop on Architectures and Technologies for Smart Cities (SmartCitiy'14), Dubai, UAE Dubai, UAE 1st International IEEE Workshop on Architectures and Technologies for Smart Cities (SmartCitiy'14) 30 March - 2 April 2014 en 10.1109/NTMS.2014.6814007 1 TorstenZimmermann HannoWirtz OscarPuñal KlausWehrle inproceedings 2014-stoffers-simutools-distributed-horizon 2014 3 17 31-40 horizon http://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-stoffers-simutools-distributed-horizon.pdf Online ICST

Brussels, Belgium

Proceedings of the 7th International ICST Conference on Simulation Tools and Techniques (SIMUTools'14), Lisbon, Portugal Lisbon, Portugal en 978-1-63190-007-5 10.4108/icst.simutools.2014.254622 1 MirkoStoffers SaschaSchmerling GeorgKunz JamesGross KlausWehrle inproceedings 2014-mmsys-wirtz-ubifi 2014 3 https://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-wirtz-mmsys-ubifi.pdf Online ACM Proceedings of the 5th ACM Multimedia Systems Conference (MMSys 2014), Special Session on Mobile Multimedia Sensing, Singapore Singapore 5th ACM Multimedia Systems Conference 19-21 March 2014 en 978-1-4503-2705-3 10.1145/2557642.2578224 1 HannoWirtz JanRüth TorstenZimmermann MatteoCeriotti KlausWehrle inproceedings 2014-comsnets-aktas-graph-based-redundancy-removal 2014 1 7 1-8 crawler http://www.comsys.rwth-aachen.de/fileadmin/papers/2014/2014-aktas-comsnets-redundancy.pdf Online IEEE Proceedings of the 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), Bangalore, India Bangalore, India 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS) 7-10 January, 2014 en 978-1-4799-3635-9 10.1109/COMSNETS.2014.6734899 1 IsmetAktas MartinHenze Muhammad HamadAlizai KevinMöllering KlausWehrle article 2014-alizai-pad-jnca Elsevier Journal of Network and Computer Applications (JNCA) 2014 unpublished en 1 Muhammad HamadAlizai KlausWehrle techreport 2013-schmidt-rtp-extended 2013 12 20 AIB-2013-19 arXiv:1312.5892 [cs.NI] 1--24 refector fileadmin/papers/2013/2013-schmidt-aib-rtp.pdf Online Department of Computer Science, RWTH Aachen

Ahornstr. 55, 52074 Aachen, Germany

Department of Computer Science, RWTH Aachen Technical Report en 0935-3232 FlorianSchmidt DavidOrlea KlausWehrle inproceedings 2013-cloudcom-henze-cloud-data-handling 2013 12 2 266-269 ipacs fileadmin/papers/2013/2013-cloudcom-henze-cloud-data-handling.pdf Online IEEE Proceedings of the 2013 IEEE International Conference on Cloud Computing Technology and Science (CloudCom), Bristol, UK Bristol, UK 2013 IEEE International Conference on Cloud Computing Technology and Science (CloudCom 2013) en 978-0-7695-5095-4 10.1109/CloudCom.2013.145 1 MartinHenze MarcelGroßfengels MaikKoprowski KlausWehrle article 2013-ijghpc-henze-sensorcloud International Journal of Grid and High Performance Computing (IJGHPC) 2013 12 5 4 97-112 sensorcloud fileadmin/papers/2013/2013-ijghpc-henze-sensorcloud.pdf Online IGI Global en 1938-0259 10.4018/ijghpc.2013100107 1 MartinHenze RenéHummen RomanMatzutt DanielCatrein KlausWehrle inproceedings 2013-hummen-standards 2013 10 7 1-3 iotsec https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-hummen-standards.pdf Online IEEE 21st IEEE International Conference on Network Protocols (ICNP 2013 PhD Forum), Göttingen, Germany Göttingen, Germany PhD Forum of 21st IEEE International Conference on Network Protocols (ICNP 2013 PhD Forum) 7 Oct. 2013 en 978-1-4799-1270-4 10.1109/ICNP.2013.6733648 1 RenéHummen KlausWehrle inproceedings 2013-hummen-slimfit 2013 10 7 259-266 iotsec https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-hummen-slimfit.pdf Online IEEE Wireless and Mobile Computing, Networking and Communications (WiMob), 2013 IEEE 9th International Conference on Lyon, France IEEE WiMob 2013 Workshop on the Internet of Things Communications and Technologies (IoT 2013) en 978-1-4577-2014-7 2160-4886 10.1109/WiMOB.2013.6673370 1 RenéHummen JensHiller MartinHenze KlausWehrle inproceedings 2013-icnp-hummen-tailoring 2013 10 7 1-10 iotsec https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-hummen-tailoring.pdf Online IEEE In Proceedings of the 21st IEEE International Conference on Network Protocols (ICNP 2013), Göttingen, Germany Göttingen, Germany 21st IEEE International Conference on Network Protocols (ICNP 2013) 7-10 Oct. 2013 en 978-1-4799-1270-4 10.1109/ICNP.2013.6733571 1 RenéHummen HannoWirtz Jan HenrikZiegeldorf JensHiller KlausWehrle article 2013-elsevir-aktas-harnessing-cross-layer-design Elsevir Ad-hoc Networks 2013 10 1 crawler 1 IsmetAktas Muhammad HamadAlizai FlorianSchmidt HannoWirtz KlausWehrle inproceedings 2013-wintech-schmidt-senserr 2013 9 30 49--56 https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-schmidt-wintech-errors.pdf Online ACM Proceedings of the 8th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2013), Miami, USA Miami, USA 8th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2013) 30 September 2013 en 10.1145/2505469.2505475 1 FlorianSchmidt MatteoCeriotti KlausWehrle inproceedings 2013-chants-wirtz-heaven 2013 9 30 1--8 https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-CHANTS-heaven-wirtz.pdf Online ACM Proceedings of the 8th ACM MobiCom Workshop on Challenged Networks (CHANTS 2013), Miami, USA Miami, USA Proceedings of the 8th ACM MobiCom Workshop on Challenged Networks (CHANTS 2013) 30 September 2013 en 978-1-4503-2363-5 10.1145/2505494.2505504 1 HannoWirtz JanRüth TorstenZimmermann KlausWehrle inproceedings 2013-wintech-bosling-models 2013 9 30 65--72 https://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-bosling-wintech-fingerprint.pdf Online ACM Proceedings of the 8th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2013), Miami, USA Miami, USA 8th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH 2013) 30 September 2013 en 10.1145/2505469.2505477 1 MarcelBosling MatteoCeriotti TorstenZimmermann Jó AgilaBitsch Link KlausWehrle techreport 2013-ceriotti-fgsn-appcentric 2013 9 13 SEEMOO-TR-2013-0 12. GI/ITG KuVS Fachgespräch "Drahtlose Sensornetze" TU Cottbus Technical Report MatteoCeriotti AlexandrKrylovskiy KlausWehrle inproceedings 2013-smith-extremecom-demo 2013 8 24 1--2 won "coolest demo award" fileadmin/papers/2013/2013-smith-extremecom-opportunistic-deployment-support.pdf Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 5th Extreme Conference on Communication Thorsmork, Iceland 5th Extreme Conference on Communication August 24-30, 2013 en 978-1-4503-2171-6 1 PaulSmith Jó AgilaBitsch Link KlausWehrle inproceedings 2013-bitsch-extremecom-oneway 2013 8 24 1--6 fileadmin/papers/2013/2013-bitsch-extremecom-oneway.pdf Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 5th Extreme Conference on Communication Thorsmork, Iceland 5th Extreme Conference on Communication August 24-30, 2013 en 978-1-4503-2171-6 1 Jó AgilaBitsch Link AlaaAlhamoud KlausWehrle inproceedings 2013-wirtz-iot-nc-loops 2013 6 24 /fileadmin/papers/2013/2013-wirtz-control_loops.pdf IEEE Proceedings of the IEEE International Workshop on Internet-of-Things Networking and Control 2013 (IoT-NC'13) New Orleans, USA IEEE International Workshop on Internet-of-Things Networking and Control 2013 (in conjunction with IEEE SECON'13) 2013-06-24 en 978-1-4673-3122-7 10.1109/SAHCN.2013.6644955 1 HannoWirtz KlausWehrle article 2013-scn-ziegeldorf-iot-privacy Security and Communication Networks - Special Issue on 'Security in a Completely Interconnected World' 2013 6 10 http://www.comsys.rwth-aachen.de/fileadmin/papers/2013/2013-ziegeldorf-scn-privacy-in-the-iot.pdf Online Wiley en 10.1002/sec.795 1 Jan HenrikZiegeldorf OscarGarcia-Morchon KlausWehrle inproceedings 2013-sec-routing-switching-maki 2013 6 4 Proceedings of the 4th IEEE International Workshop on Data Security and Privacy in Wireless Networks (D-SPAN 2013) accepted 1 MarcWerner JörgKaiser MatthiasHollick EliasWeingaertner KlausWehrle inproceedings 2013-duma-henze-cloud-annotations 2013 5 23 18-22 sensorcloud fileadmin/papers/2013/2013-duma-henze-cloudannotations.pdf Online IEEE Proceedings of the 4th International Workshop on Data Usage Management (DUMA 2013), part of 2013 IEEE Security and Privacy Workshops (SPW), San Francisco, CA, USA en 978-1-4799-0458-7 10.1109/SPW.2013.31 1 MartinHenze RenéHummen KlausWehrle inproceedings 2013-hummen-towards 2013 4 19 iotsec fileadmin/papers/2013/2013-hummen-towards.pdf ACM Proceedings of the 2nd ACM Workshop on Hot Topics on Wireless Network Security and Privacy (HotWiSec '13) Budapest, Hungary 2nd ACM Workshop on Hot Topics on Wireless Network Security and Privacy en 978-1-4503-2003-0 10.1145/2463183.2463193 1 RenéHummen Jan HenrikZiegeldorf HosseinShafagh ShahidRaza KlausWehrle inproceedings 2013-hummen-6lowpan 2013 4 17 iotsec; sensorcloud fileadmin/papers/2013/2013-hummen-6lowpan.pdf ACM Proceedings of the 6th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec '13) Budapest, Hungary 6th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec '13) en 978-1-4503-1998-0 10.1145/2462096.2462107 1 RenéHummen JensHiller HannoWirtz MartinHenze HosseinShafagh KlausWehrle poster 2013-fkie-aktas-poster-cross-layer-koordination-jamming 2013 4 F&T Tag, Wachtenberg crawler Fraunhofer Institute FKIE F&T Tag 1 IsmetAktas KlausWehrle inproceedings 2013-schmidt-wons-rtp 2013 3 19 186--190 refector fileadmin/papers/2013/2013-schmidt-wons-rtp-refector.pdf Online IEEE Proceedings of the 10th International Conference on Wireless On-demand Network Systems and Services (WONS'13), Banff, Canada Banff, Canada 10th International Conference on Wireless On-demand Network Systems and Services (WONS'13) 17-20 March 2013 en 978-1-4799-0747-2 10.1109/WONS.2013.6578345 1 FlorianSchmidt DavidOrlea KlausWehrle article 2013-fernandez-ceriotti-bitsch-and-then-the-weekend-jsan Journal of Sensor and Actuator Networks 2013 3 11 2 1 156--171 Wireless Sensor Networks (WSNs) are versatile monitoring systems that can provide a large amount of real-time data in scenarios where wired infrastructures are inapplicable or expensive. This technology is expected to be handled by domain experts, who perceive a WSN as a (promised to be) easy to deploy black box. This work presents the deployment experience of a WSN, as conducted by domain experts, in a ground improvement area. Building upon off-the-shelf solutions, a fuel cell powered gateway and 21 sensor devices measuring acceleration, inclination, temperature and barometric pressure were installed to monitor ground subsidence. We report about how poor GSM service, malfunctioning hardware, unknown communication patterns and obscure proprietary software required in-field ad-hoc solutions. Through the lessons learned, we look forward to investigating how to make the deployment of these systems an easier task. sensor network deployment; experiences; in-field debugging http://www.mdpi.com/2224-2708/2/1/156 Online en 2224-2708 10.3390/jsan2010156 1 TomásFernández-Steeger MatteoCeriotti Jó AgilaBitsch Link MatthiasMay KlausHentschel KlausWehrle inproceedings 2013-wons-wirtz-fuzzy 2013 3 Online IEEE Proceedings of the 10th International Conference on Wireless On-demand Network Systems and Services (WONS '13), Banff, Canada Banff, Canada en 978-1-4799-0747-2 10.1109/WONS.2013.6578338 1 HannoWirtz Muhammad HamadAlizai KlausWehrle inproceedings 2013-ccnc-lora-gossipmule 2013 1 11 Proceedings of the 1st Workshop on People Centric Sensing and Communications accepted 1 Mónica AlejandraLora Girón AlexanderPaulus KlausWehrle inproceedings 2013-ccncdemo-lora-gossipmule 2013 1 Proceedings of the 10th IEEE Consumer Communications & Networking Conference, CCNC Las Vegas, Nevada, USA CCNC 2013 Demonstration Track accepted Mónica AlejandraLora Girón AlexanderPaulus KlausWehrle article 2013-wirtz-alizai-tinywifi-jnca Journal of Network and Computer Applications (JNCA) 2013 Co-primary authorship Alizai, Wirtz fileadmin/papers/2013/2013-wirtz-alizai-tinywifi-jnca.pdf http://www.sciencedirect.com/science/article/pii/S108480451300060X en 1084-8045 10.1016/j.jnca.2013.02.022 1 HannoWirtz Muhammad HamadAlizai BernhardKirchen KlausWehrle inproceedings 2012-hummen-cloud 2012 12 3 232-240 sensorcloud fileadmin/papers/2012/2012-hummen-cloud.pdf IEEE Proceedings of the 2012 IEEE 4th International Conference on Cloud Computing Technology and Science (CloudCom), Taipei, Taiwan Taipei, Taiwan Fourth IEEE International Conference on Cloud Computing Technology and Science en 978-1-4673-4511-8 10.1109/CloudCom.2012.6427523 1 RenéHummen MartinHenze DanielCatrein KlausWehrle inproceedings 2012-IPIN-Peter-Versatile-Maps 2012 11 13 1--4 fileadmin/papers/2012/2012-bitsch-IPIN-vegemite.pdf http://www.surveying.unsw.edu.au/ipin2012/proceedings/session.php?code=6C&name=SLAM Online Li, Binghao Li and Gallagher, Thomas School of Surveying and Geospatial Engineering, University of New South Wales, Sydney, Australia Proceedings of the 2012 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Sydney, Australia Sydney, Australia 2012 International Conference on Indoor Positioning and Indoor Navigation November 13--15, 2012 en 978-0-646-57851-4 1 MichaelPeter DieterFritsch BernhardtSchäfer AlfredKleusberg Jó AgilaBitsch Link KlausWehrle inproceedings 2012-IPIN-Viol-HMM 2012 11 13 1--10 fileadmin/papers/2012/2012-11-viol-ipin.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6418873&tag=1 Online Proceedings of the 2012 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Sydney, Australia Sydney, Australia 2012 International Conference on Indoor Positioning and Indoor Navigation November 13--15, 2012 en 978-1-4673-1955-3 10.1109/IPIN.2012.6418873 1 NicolaiViol Jó AgilaBitsch Link HannoWirtz DirkRothe KlausWehrle inproceedings 2012-IPIN-Bitsch-FlowPath 2012 11 13 10 S. fileadmin/papers/2012/2012-bitsch-IPIN-navigation-on-wheels.pdf http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6418931 Print

Piscataway, NJ, USA

Proceedings of the 2012 International Conference on Indoor Positioning and Indoor Navigation (IPIN), 11-13 November 2012 Sydney, Australia IEEE Sydney, Australia 2012 International Conference on Indoor Positioning and Indoor Navigation November 13--15, 2012 en 978-1-4673-1955-3 10.1109/IPIN.2012.6418931 1 Jó AgilaBitsch Link FelixGerdsmeier PaulSmith KlausWehrle 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-wripe-sasnauskas-symnet 2012 10 6 S. kleenet fileadmin/papers/2012/2012-09-wripe-sasnauskas-SymNet.pdf Print Online

Piscataway, NJ, USA

The 2nd International Workshop on Rigorous Protocol Engineering (WRiPE 2012), 30 October - 02 November 2012, Austin, TX, USA IEEE Austin, TX, USA The 2nd International Workshop on Rigorous Protocol Engineering (WRiPE 2012) October 30 - November 02 2012 en 978-1-4673-2445-8 10.1109/ICNP.2012.6459940 1 RaimondasSasnauskas PhilippKaiser Russ LucasJukić KlausWehrle techreport 2012-weingaertner-fgsn-sim-iot 2012 9 26 SEEMOO-TR-2012-0 11. GI/ITG KuVS Fachgespräch "Drahtlose Sensornetze" TU Darmstadt Sammelband der Beiträge zum 11. GI/ITG KuVS Fachgespräch "Drahtlose Sensornetze" (Technical Report) EliasWeingaertner MatteoCeriotti KlausWehrle inproceedings 2012-pimrc-schmidt-ofra 2012 9 10 1--7 Classical 802.11 rate adaptation algorithms rely on feedback from the receiver to correctly choose a sending rate, typically in the form of acknowledgments (ACKs). In the absence of such frames, novel techniques are required for rate selection. We present OFRA, a receiver-based rate adaptation algorithm that works with ACK-less traffic. Feedback information is sent on-demand using a control frame to explicitly inform the transmitter about which bit rate to use on subsequent data frames. This approach guarantees standard conformity and exhibits fast and accurate bit rate adaptation at the cost of a modest overhead increase. We evaluate the performance of OFRA against various state-of-the-art rate adaptation schemes by means of simulations. If ACK frames are to be transmitted, OFRA performs better than related work in most considered scenarios, and on par in the others. In the absence of ACKs, OFRA provides large goodput gains under good channel conditions and comparable goodput in other situations. OFRA refector fileadmin/papers/2012/2012-schmidt-pimrc-ofra.pdf Online IEEE Proceedings of the 23rd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'12), Sydney, Australia Sydney, Australia 23rd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'12) 9-12 September 2012 en 978-1-4673-2566-0 2166-9570 10.1109/PIMRC.2012.6362818 1 FlorianSchmidt AnwarHithnawi OscarPuñal JamesGross KlausWehrle inproceedings 2012-aktas-new2an-AnAdaptiveCodecSwitchingSchemeforSIPbasedVoIP-conference Proceedings of the 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012) 2012 8 27 1-12 Contemporary Voice-Over-IP (VoIP) systems typically ne- gotiate only one codec for the entire VoIP session life time. However, as different codecs perform differently well under certain network conditions like delay, jitter or packet loss, this can lead to a reduction of quality if those conditions change during the call. This paper makes two core contributions: First, we compare the speech quality of a set of stan- dard VoIP codecs given different network conditions. Second, we propose an adaptive end-to-end based codec switching scheme that fully conforms to the SIP standard. Our evaluation with a real-world prototype based on Linphone shows that our codec switching scheme adapts well to changing network conditions, improving overall speech quality. crawler fileadmin/papers/2012/2012-aktas-new2an-codecswitching.pdf Online LNCS Proceedings of the 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012), St. Pettersburg, Russia. St. Pettersburg, Russia 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012) 27-29 August, 2012 en 978-3-642-32685-1 10.1007/978-3-642-32686-8_32 1 IsmetAktas FlorianSchmidt EliasWeingaertner Caj-JulianSchnelke KlausWehrle inproceedings 2012-mobicom-wirtz-sofi 2012 8 451-454 Online ACM

New York, NY, USA

Proceedings of the 18th ACM Annual International Conference on Mobile Computing and Networking (MobiCom'12), Istanbul, Turkey Istanbul, Turkey 18th ACM Annual International Conference on Mobile Computing and Networking 22-26 August 2012 en 978-1-4503-1159-5 10.1145/2348543.2348608 1 HannoWirtz DavidMartin BenjaminGrap KlausWehrle inproceedings 2012-kunz-pads-gpu 2012 7 20 23--32 horizon https://www.comsys.rwth-aachen.de/fileadmin/papers/2012/2012-kunz-pads-gpu.pdf Print IEEE Proceedings of the 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS'12), Zhangjiajie, China en 978-0-7695-4714-5 1087-4097 10.1109/PADS.2012.27 1 GeorgKunz DanielSchemmel JamesGross KlausWehrle article 2012-JLBS-Bitsch-FootPath Journal of Location Based Services 2012 7 11 7 1 23-43 We present FootPath, a self-contained, map-based indoor navigation system. Using only the accelerometer and the compass readily available in modern smartphones, we accurately localise a user on her route and provide her with turn-by-turn instructions to her destination. To compensate for inaccuracies in step detection and heading estimation, we match the detected steps onto the expected route using sequence alignment algorithms from the field of bioinformatics. As our solution integrates well with OpenStreetMap, it allows painless and cost-efficient collaborative deployment, without the need for additional infrastructure. http://www.tandfonline.com/doi/abs/10.1080/17489725.2012.692620 Online Taylor & Francis

Bristol, PA, USA

en 1748-9733 10.1080/17489725.2012.692620 1 Jó AgilaBitsch Link PaulSmith NicolaiViol KlausWehrle inproceedings 2012-aktas-wowmom-CRAWLER:AnExperimentationPlatformforSystemMonitoringandCross-Layer-Coordination-conference Proceedings of the 13th International Symposium on a World of Wireless, Mobile and MultimediaNetworks (WoWMoM'12), San Francisco, USA 2012 6 25 1--9 crawler fileadmin/papers/2012/2012-aktas-wowmom-crawler.pdf Online IEEE Proceedings of the 13th International Symposium on a World of Wireless, Mobile and MultimediaNetworks (WoWMoM'12), San Francisco, USA San Francisco 13th International Symposium on a World of Wireless, Mobile and MultimediaNetworks (WoWMoM'12) 25-28 June, 2012 en 978-1-4673-1238-7 10.1109/WoWMoM.2012.6263686 1 IsmetAktas FlorianSchmidt Muhammad HamadAlizai TobiasDrüner 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 article 2012-4-alizai-wild-ijdsn International Journal of Distributed Sensor Networks (IJDSN) 2012 4 2 wld fileadmin/papers/2012/2012-ijdsn-wld-alizai.pdf unpublished en 1550-1329 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle inproceedings 2012-taicpart-dustmann-symbolic-time 2012 4 We propose an extension of symbolic execution of distributed systems to test software parts related to timing. Currently, the execution model is limited to symbolic input for individual nodes, not capturing the important class of timing errors resulting from varying network conditions. In this paper, we introduce symbolic system time in order to systematically find timing-related bugs in distributed systems. Instead of executing time events at a concrete time, we execute them at a set of times and analyse possible event interleavings on demand. We detail on the resulting problem space, discuss possible algorithmic optimisations, and highlight our future research directions. kleenet fileadmin/papers/2012/2012-04-taicpart-soriadustmann-symtime.pdf TAICPART'2012 en 1 OscarSoria Dustmann RaimondasSasnauskas KlausWehrle conference 2012-wns3-weingaertner-glebke-vodsim 2012 3 26 373-344 Over the past decade BitTorrent has established itself as the virtual standard for P2P file sharing in the Internet. However, it is currently not possible to investigate BitTorrent with ns-3 due to the unavailability of an according application model. In this paper we eliminate this burden. We present a highly modular BitTorrent model which allows for the easy simulation of different BitTorrent systems such as file sharing as well as present and future BitTorrent-based Video-on-Demand systems. Best Paper Award, Best Student Paper Award http://dl.acm.org/citation.cfm?id=2263019.2263073 ICST

Brussels, Belgium

Proceedings of the 2012 workshop on ns-3 (WNS3 2012), 26 March 2012, Desenzano del Garda, Italy Desenzano del Garda, Italy Proceedings of the 2012 workshop on ns-3 (WNS3 2012) 978-1-4503-1510-4 1 EliasWeingaertner RenéGlebke MartinLang KlausWehrle poster 2012-kunz-omnetpp-sequencechart 2012 3 23 5th International Workshop on OMNeT++ (OMNeT++'12), Desenzano del Garda, Italy horizon https://www.comsys.rwth-aachen.de/fileadmin/papers/2012/2012-kunz-omnetpp-sequencechart.pdf Online ICST 5th International Workshop on OMNeT++ (OMNeT++'12), Desezano del Garda, Italy en 1 GeorgKunz SimonTenbusch JamesGross KlausWehrle inproceedings 2012-kunz-simutools-probabilistic-sync 2012 3 20 119-128 horizon https://www.comsys.rwth-aachen.de/fileadmin/papers/2012/2012-kunz-simutools-prob-synch.pdf Online ICST

Brussels, Belgium

Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques (SIMUTools'12), Desenzano del Garda, Italy Desenzano, Italy en 978-1-4503-1510-4 10.4108/icst.simutools.2012.247716 1 GeorgKunz MirkoStoffers JamesGross KlausWehrle miscellaneous 2012-hummen-iot-trust 2012 3 20 iotsec fileadmin/papers/2012/2012-hummen-iot-trust.pdf Online Workshop on Smart Object Security en 1 RenéHummen ChristianRöller KlausWehrle inproceedings 2012-aktas-simutools-FANTASY:FullyAutomaticNetworkEmulationArchitecturewithCross-LayerSupport-conference 2012 3 19 57-64 crawler, fantasy fileadmin/papers/2012/2012-aktas-simutools-fantasy.pdf http://dl.acm.org/citation.cfm?id=2263019&CFID=88550183&CFTOKEN=31687193 Online ICST

Brussels, Belgium

Proceedings of the 5th ACM International ICST Conference on Simulation Tools and Techniques (SIMUTools '12), Desenzano del Garda, Italy Desenzano, Italy 5th ACM International ICST Conference on Simulation Tools and Techniques (SIMUTools '12) 19-23 March, 2012 en 978-1-4503-1510-4 10.4108/icst.simutools.2012.247759 1 IsmetAktas Hendrikvom Lehn ChristophHabets FlorianSchmidt KlausWehrle inproceedings 2012-lora-mobiopp-Gossipmule:ScanningandDisseminatingInformationBetweenStationsinCooperativeWLANs 2012 3 15 87-88 In Cooperative WLAN scenarios, the lack of a centralized management, the existence of many administrative domains and the current association process in wireless networks make it difficult to guarantee the quality that users expect from services and networks. We present Gossipmule, an agent for wireless nodes that enhances the QoE perceived by users in Cooperative WLANs. Gossipmule uses mobile Crowdsensing between the wireless nodes to collect and disseminate information regarding the network. This information is used by the agent to have a more assertive association when making decisions regarding the user-AP association. (Poster) /fileadmin/papers/2012/2012-lora-MobiOpp12-Gossipmule.pdf http://dl.acm.org/citation.cfm?id=2159576&CFID=88550183&CFTOKEN=31687193 Online ACM

New York, NY, USA

Proceedings of the Workshop on Mobile Opportunistic Networking ACM/SIGMOBILE MobiOpp 2012, Zurich, Switzerland Zurich, Switzerland Proceedings of the Workshop on Mobile Opportunistic Networking ACM/SIGMOBILE MobiOpp 2012 2012-03-15 en 978-1-4503-1208-0 10.1145/2159576.2159598 1 Mónica AlejandraLora Girón AlexanderPaulus Jó AgilaBitsch Link KlausWehrle inproceedings 2012-extremecom-goliath-adama 2012 3 10 1--2 In this demo we present our architecture for delivering ap- plication services via Disruption or Delay Tolerant Networks (DTNs). The search for a killer application is still ongoing. Our architecture enables the community to quickly proto- type new services and test them in the real world, outside of simulators. Common tasks such as data transportation through the network is handled by the framework but can still be in uenced by the service, if required. A robust plu- gin architecture allows to deploy new applications and rout- ing schemes without aecting stable-running services on the same network, even if the source of the new plugin is un- trusted. Demo Abstract http://extremecom2012.ee.ethz.ch/papers/7-extremecom2012-Goliath.pdf Online Hui, Pan and Lindgren, Anders ETH Zurich

Zurich, Switzerland

Proceedings of the 4th Extreme Conference on Communication Zurich Switzerland 4th Extreme Conference on Communication March 10-14, 2012 en 1 AndréGoliath Jó AgilaBitsch Link KlausWehrle miscellaneous flowpath-patent-pending 2012 2 24 Amtliches Aktenzeichen 10 2012 101 513.9 beim Deutschen Patent- und Markenamt, Anmeldetag: 24.2.2012 footpath Patent pending de Jó AgilaBitsch Link PaulSmith KlausWehrle inproceedings 2012-wons-bosling-redmann-weingaertner 2012 1 9 131-134 https://www.comsys.rwth-aachen.de/fileadmin/papers/2012/2012-students-6lowpan-wons2012.pdf http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6138950# Online IEEE

Piscataway, NJ, USA

Proceedings of the 9th International Conference on Wireless On-demand Network Systems and Services (WONS '12), Courmayeur, Italy Courmayeur, Italy en 978-1-4577-1722-2 10.1109/WONS.2012.6152218 1 MarcelBosling TorstenRedmann JeanTekam EliasWeingaertner KlausWehrle 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 2011-12-conext-schmidt-refector 2011 12 6 1--12 refector fileadmin/papers/2011/2011-schmidt-refector-conext.pdf Online ACM

New York, NY, USA

Proceedings of the 7th International Conference on emerging Networking EXperiments and Technologies (CoNEXT), Tokyo, Japan Tokyo, Japan 7th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) 6-9 December, 2011 en 978-1-4503-1041-3 10.1145/2079296.2079318 1 FlorianSchmidt Muhammad HamadAlizai IsmetAktas KlausWehrle inproceedings 2011-globecom-bitsch-geodtn 2011 12 5 1 -- 5 In this paper we present a disruption tolerant routing algorithm based on geographic location information, which improves upon the hop count compared to the current state of the art by up to a factor of three in large scale human networks. Leveraging only the history of geographic movement patterns in the two-hop neighborhood, our algorithm is able to perform well in the absence of knowledge of social interaction between nodes and without detailed future schedule information. Representing previously visited locations as probability distributions encoded in an efficient vector, we formalize a heuristic for efficiently forwarding messages in disruption tolerant networks, implement a framework for comparing our approach with the state of the art, and evaluate key metrics, such as hop count and delivery rate, as well as energy consumption and battery depletion fairness on real world data. We are able to outperform the state of the art in human mobility based networks considerably in terms of energy usage per node, thereby extending data network availability further into areas devoid of otherwise necessary communication infrastructure. fileadmin/papers/2011/2011-GlobeCom-bitsch-geoDTN.pdf Online

Piscataway, NJ, USA

IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN), Houston, Texas, USA IEEE Houston, Texas, USA IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN) 5-9 December 2011 en 978-1-4244-9268-8 1930-529X 1 Jó AgilaBitsch Link DanielSchmitz KlausWehrle 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-extremecom-bitsch-neighbordiscovery 2011 9 26 1--6 We present an energy efficient neighbor discovery framework that enables Linux and TinyOS based systems to discover and connect to neighbors via IEEE 802.11 and IEEE 802.15.4, which are only available sporadically. Using quorum schemes, we schedule on and off times of the wireless transmitters, to guarantee mutual discovery with minimum power given a specific latency requirement. Neighbor discovery is fundamental to intermittently connected networks, such as disruption and delay tolerant networks and optimizing it, can lead to significant overall energy savings. Using perfect difference sets, our results indicate that we reduce the latency by up to 10 times at a duty cycle of 2% compared to the state of the art. We further define and characterize our neighbor discovery scheme with respect to fairness for asymmetric energy scenarios. Using these results, we allow energy-harvesting applications to adjust neighbor discovery based on their current energy requirements as a well defined trade-off. Neighbor Discovery; Sporadic Connectivity; Wireless Networks fileadmin/papers/2011/2011-ExtremeCom-bitsch-NeighborDiscovery.pdf http://www.cl.cam.ac.uk/~fb375/extremecom/2011/program.html http://dl.acm.org/citation.cfm?id=2414398&CFID=194814085&CFTOKEN=73001357 Online Hui, Pan and Lindgren, Anders ACM Proceedings of the 3rd Extreme Conference of Communication (ExtremeCom 2011), Manaus, Brazil Manaus, Brazil ExtremeCom 2011 26-30 September 2011 en 978-1-4503-1079-6 1 Jó AgilaBitsch Link ChristophWollgarten StefanSchupp 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-ipin-bitsch-footpath-long 2011 9 21 1--8 We present FootPath, a self-contained, map-based indoor navigation system. Using only the accelerometer and the compass readily available in modern smartphones we accurately localize a user on her route, and provide her with turn-by-turn instructions to her destination. To compensate for inaccuracies in step detection and heading estimation, we match the detected steps onto the expected route using sequence alignment algorithms from the field of bioinformatics. As our solution integrates well with OpenStreetMap, it allows painless and cost-efficient collaborative deployment, without the need for additional infrastructure. footpath fileadmin/papers/2011/2011-IPIN-bitsch-footpath-long.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6071934&tag=1 Online IEEE Proceedings of the 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Guimaraes, Portugal Guimarães, Portugal 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN) 21-23 September 2011 en 978-1-4577-1803-8 http://dx.doi.org/10.1109/IPIN.2011.6071934 1 Jó AgilaBitsch Link PaulSmith NicolaiViol KlausWehrle inproceedings 2011-ipin-bitsch-footpath 2011 9 21 1--4 We present FootPath, a self-contained, map-based indoor navigation system. Using only the accelerometer and the compass readily available in modern smartphones we accurately localize a user on her route, and provide her with turn-by-turn instructions to her destination. To compensate for inaccuracies in step detection and heading estimation, we match the de- tected steps onto the expected route using sequence alignment algorithms from the field of bioinformatics. As our solution integrates well with OpenStreetMap, it allows painless and cost-efficient collaborative deployment, without the need for additional infrastructure. short paper (long paper is also available) footpath fileadmin/papers/2011/2011-IPIN-bitsch-footpath.pdf http://ipin2011.dsi.uminho.pt/PDFs/Shortpaper/17_Short_Paper.pdf fileadmin/papers/2011/2011-IPIN-bitsch-footpath-slides.pdf Online IEEE Proceedings of the 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Guimaraes, Portugal Guimarães, Portugal 2011 International Conference on Indoor Positioning and Indoor Navigation (IPIN) 21-23 September 2011 en 978-972-8692-63-6 1 Jó AgilaBitsch Link PaulSmith KlausWehrle inproceedings 2011-wintech-wirtz 2011 9 19 89-90 Mobile Ad-Hoc Networks (MANETs) rely on the 802.11 ad- hoc mode to establish communication with nearby peers. In practice, this makes MANETs hard to realize. While 802.11-compliant mobile devices implement the ad-hoc mode on the hardware layer, the software layer typically does not implement support for ad-hoc networking in terms of ad-hoc routing and name resolution protocols. Modern mobile operating systems, such as Android and iOS, even hide the inherent ad-hoc functionality of the wireless card through restrictions in the OS. In contrast to this, support for the 802.11 infrastructure mode is a commodity. We propose establishing ad-hoc networks using the 802.11 infrastructure mode. In MA-Fi (Mobile Ad-Hoc Wi-Fi), a small core of mobile router nodes (RONs) provides infrastruc-ture mode network access to mobile station nodes (STANs). As RONs also act as a station in infrastructure networks of other RONs, MA-Fi achieves multi-hop communication between RON and STAN devices in the overall network. We show the creation and operation of mobile ad-hoc networks using MA-Fi. We focus on mobility of RONs and STANs as well as topology control in the overall network. fileadmin/papers/2011/2011-wirtz-wintech.pdf Online ACM

New York, NY, USA

Proceedings of the Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization (WiNTECH 2011), Las Vegas, NV, USA Las Vegas, Nevada, USA The Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization 2011-09-19 en 978-1-4503-0867-0 10.1145/2030718.2030737 1 HannoWirtz RobertBackhaus RenéHummen KlausWehrle inproceedings VaegsABW2011 2011 9 16 77-80 A tremendous amount of energy is wasted today, because computing devices are left running all the time even though they are needed only sporadically. Especially in office environments many devices (e.g., printers) are very rarely turned off, because they need to be available from time to time and because it is inconvenient having to switch them on and off manually. Existing solutions, such as Wake-on-LAN (WoL), provide support for managing the power consumption of the network devices remotely using an always-on data channel. However, these solutions are inefficient, because power to the network interface has to be maintained even when the host system is asleep just to ensure remote accessibility. We propose a Wireless Sensor Network (WSN) based out-of-band signaling architecture for network interfaces which minimizes the systems’ power consumption during the large idle periods when nobody is using them. This is done by separating the data and control channels on the Internet-enabled devices using a low-power out-of-band signaling channel based on battery driven, energy scavenging devices. Unlike existing solutions, which only allow parts of the system to go in sleep modes, our architecture allows the whole system, including the main power supply, to be shut down. Our initial investigation indicates a significant reduction in energy consumption of devices during idle times compared to the existing in-band signaling mechanisms such as WoL. Energy Saving, Wireless Sensor Network, Out-of-Band Signalling https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-vaegs-fgsn-ecocom.pdf Online Proceedings of the 10th GI/ITG KuVS Fachgespräch Drahtlose Sensornetze (FGSN), Paderborn, Germany RWTH Aachen University Paderborn, Germany 10th GI/ITG KuVS Fachgespräch Drahtlose Sensornetze (FGSN11) September 15-16, 2011 en 1 TobiasVaegs Muhammad HamadAlizai Jó AgilaBitsch Link KlausWehrle inproceedings 2011-wintech-alizai-tinywifi 2011 9 19-27 tinywifi fileadmin/papers/2011/2010-09-tinywifi-alizai-wintech.pdf Online ACM

New York, NY, USA

Proceedings of the Sixth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization (WiNTECH ), Las Vegas, NV, USA Las Vegas, NV, USA The 17th Annual International Conference on Mobile Computing and Networking September 2011 en 978-1-4503-0867-0 10.1145/2030718.2030725 1 Muhammad HamadAlizai HannoWirtz BernhardKirchen TobiasVaegs OmprakashGnawali KlausWehrle inproceedings 2011-kunz-mascots-performance-prediction 2011 7 25 359 - 368 horizon fileadmin/papers/2011/2011-kunz-performance-prediction-mascots.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 19th Annual Meeting of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'11), Singapore Singapore 19th Annual Meeting of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems July 25-17, 2011 en 978-1-4577-0468-0 1526-7539 10.1109/MASCOTS.2011.15 1 GeorgKunz SimonTenbusch JamesGross 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-icdcs-sasnauskas-sde 2011 6 333-342 Recent advances in symbolic execution have proposed a number of promising solutions to automatically achieve high-coverage and explore non-determinism during testing. This attractive testing technique of unmodified software assists developers with concrete inputs and deterministic schedules to analyze erroneous program paths. Being able to handle complex systems' software, these tools only consider single software instances and not their distributed execution which forms the core of distributed systems. The step to symbolic distributed execution is however steep, posing two core challenges: (1) additional state growth and (2) the state intra-dependencies resulting from communication. In this paper, we present SDE—a novel approach enabling scalable symbolic execution of distributed systems. The key contribution of our work is two-fold. First, we generalize the problem space of SDE and develop an algorithm significantly eliminating redundant states during testing. The key idea is to benefit from the nodes' local communication minimizing the number of states representing the distributed execution. Second, we demonstrate the practical applicability of SDE in testing with three sensornet scenarios running Contiki OS. kleenet fileadmin/papers/2011/2011-06-icdcs-sasnauskas-sde.pdf Druck IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 31st IEEE International Conference on Distributed Computing Systems (ICDCS 2011), June 2011, Minneapolis, MN, USA en 978-0-7695-4364-2 1063-6927 10.1109/ICDCS.2011.28 1 RaimondasSasnauskas OscarSoria Dustmann Benjamin LucienKaminski CarstenWeise StefanKowalewski KlausWehrle inproceedings 2011-iscc-alizai-ble 2011 6 fileadmin/papers/2011/2011-alizai-iscc-ble.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

16th IEEE Symposium on Computers and Communications (ISCC), Kerkyra, Greece Kerkyra, Greece en 978-1-4577-0678-3 10.1109/ISCC.2011.5983839 1 Muhammad HamadAlizai HannoWirtz GeorgKunz BenjaminGrap KlausWehrle inproceedings 2011-ipsn-alizai-pad 2011 4 fileadmin/papers/2011/2011-ipsn-alizai-pad.pdf Online ACM

New York, NY, USA

Proceedings of the 10th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2011), Chicago, IL, USA Chicago, IL, USA en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel StefanGötz Jó AgilaBitsch Link 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 inproceedings 2011-kunz-omnetpp-horizon 2011 3 21 359-366 Developing an efficient parallel simulation framework for multiprocessor systems is hard. A primary concern is the considerable amount of parallelization overhead imposed on the event handling routines of the simulation framework. Besides more complex event scheduling algorithms, the main sources of overhead are thread synchronization and locking of shared data structures. As a result, the overhead of parallelization may easily outweigh the benefits of parallelization in comparison to classic sequential simulation. We introduce two efficient event handling schemes based on our parallel-simulation extension Horizon for the OMNeT++ simulator.First, we present a \emph{push-based event handling scheme} to minimize the overhead of thread synchronization and locking. Second, we complement this scheme with a novel \emph{event scheduling algorithm} that significantly reduces the overhead of parallel event scheduling. Lastly, we prove the correctness of our scheduling algorithm. Our evaluation reveals a total reduction in the event handling overhead of up to 16x when combining both schemes. horizon fileadmin/papers/2011/2011-kunz-horizon-omnetworkshop.pdf Online ICST

Brussels, Belgium

Proceedings of the 4th International Workshop on OMNeT++ (OMNeT++'11), Barcelona, Spain Barcelona, Spain 4th International Workshop on OMNeT++ (OMNeT++'11) March 21, 2011 en 978-1-936968-00-8 10.4108/icst.simutools.2011.245504 1 GeorgKunz MirkoStoffers JamesGross KlausWehrle inproceedings 2011-weingaertner-device-driver-enabled 2011 3 https://www.comsys.rwth-aachen.de/fileadmin/papers/2011/2011-weingaertner-simutools-wifi-emu_camera-ready.pdf Online ICST

Brussels, Belgium

Proceedings ot the4th International ICST Conference on Simulation Tools and Techniques (SIMUTools 2011) Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques (SIMUTools 2011), Barcelona, Spain Barcelona, Spain accepted en 978-1-936968-00-8 1 EliasWeingaertner Hendrikvom Lehn KlausWehrle poster 2011-03-vomLehn-NSDI-PrivacyOnWeb 2011 3 poster and abstract fileadmin/papers/2011/2011-03-vomLehn-NSDI-PrivacyOnWeb.pdf Online 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11), Boston, MA, USA Usenix Boston, MA, USA NSDI March 30 – April 1, 2011 accepted en 1 Hendrikvom Lehn Jó AgilaBitsch Link KlausWehrle techreport 2011-heer-draft-middle-auth 2011 draft-heer-hip-middle-auth-04 The Host Identity Protocol [RFC5201] is a signaling protocol for secure communication, mobility, and multihoming that introduces a cryptographic namespace. This document specifies an extension for HIP that enables middleboxes to unambiguously verify the identities of hosts that communicate across them. This extension allows middleboxes to verify the liveness and freshness of a HIP association and, thus, to secure access control in middleboxes. Work in progress ietf, mobile_access http://tools.ietf.org/html/draft-heer-hip-middle-auth-04 Online Internet Engineering Task Force Internet-Draft en TobiasHeer MiikaKomu RenéHummen KlausWehrle inproceedings 2010-sensys-alizai-tinywifi 2010 11 429-430 We present TinyWifi, a nesC code base extending TinyOS to support Linux powered network nodes. It enables developers to build arbitrary TinyOS applications and protocols and execute them directly on Linux by compiling for the new TinyWifi platform. Using TinyWifi as a TinyOS platform, we expand the applicability and means of evaluation of wireless protocols originally designed for sensornets towards inherently similar Linux driven ad hoc and mesh networks. Received Best Poster Award fileadmin/papers/2010/2010-11-alizai-tinywifi-sensys.pdf http://portal.acm.org/citation.cfm?id=1870058&preflayout=flat Print ACM

New York, NY, USA

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland en 978-1-4503-0344-6 10.1145/1869983.1870058 1 Muhammad HamadAlizai BernhardKirchen Jó AgilaBitsch Link HannoWirtz KlausWehrle inproceedings 2010-sensys-sasnauskas-coojakleenet 2010 11 383--384 High-coverage testing of sensornet applications is vital for pre-deployment bug cleansing, but has previously been difficult due to the limited set of available tools. We integrate the KleeNet symbolic execution engine with the COOJA network simulator to allow for straight-forward and intuitive high-coverage testing initiated from a simulation environment. A tight coupling of simulation and testing helps detect, narrow down, and fix complex interaction bugs in an early development phase. We demonstrate the seamless transition between COOJA simulation and KleeNet symbolic execution. Our framework enables future research in how high-coverage testing tools could be used in cooperation with simulation tools. kleenet fileadmin/papers/2010/2010-osterlind_sasnauskas-sensys-coojakleenet.pdf Print ACM

New York, NY, USA

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems (SenSys 2010), Zurich, Switzerland en 978-1-4503-0344-6 http://doi.acm.org/10.1145/1869983.1870034 1 FredrikÖsterlind RaimondasSasnauskas AdamDunkels OscarSoria Dustmann 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 2010softcomweingaertnerprotocolanalysis 2010 9 23 225 - 229 available in IEEE Xplore https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-weingaertner-softcom-analysis.pdf Online FESB

Split, Croatia

Proceedings of the 18th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2010) Hvar, Croatia en 978-1-4244-8663-2 1 EliasWeingaertner MarkoRitter RaimondasSasnauskas KlausWehrle inproceedings 2010-kunz-mascots-horizon 2010 8 18 172-181 The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks. horizon fileadmin/papers/2010/2010-kunz-mascots-horizon.pdf Online IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10), Miami, FL, USA Miami, FL, USA 18th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'10) August 17-19, 2010 en 978-0-7695-4197-6 1526-7539 10.1109/MASCOTS.2010.26 1 GeorgKunz OlafLandsiedel JamesGross StefanGötz FarshadNaghibi 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 icc2010vpsim 2010 5 23 1-6 Nowadays, the development of embedded system hardware and related system software is mostly carried out using virtual platform environments. The high level of modeling detail (hardware elements are partially modeled in a cycle-accurate fashion) is required for many core design tasks. At the same time, the high computational complexity of virtual platforms caused by the detailed level of simulation hinders their application for modeling large networks of embedded systems. In this paper, we propose the integration of virtual platforms with network simulations, combining the accuracy of virtual platforms with the versatility and scalability of network simulation tools. Forming such a hybrid toolchain facilitates the detailed analysis of embedded network systems and related important design aspects, such as resource effectiveness, prior to their actual deployment. https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-schuermans-weingaertner-network_centric.pdf Online IEEE Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa, May 23-27 en 978-1-4244-6402-9 1550-3607 10.1109/ICC.2010.5502185 1 StefanSchürmanns EliasWeingaertner TorstenKempf GerdAscheid KlausWehrle RainerLeupers inproceedings 201004vaegsieeestudentpad 2010 5 20 5-8 The lack of permanent network infrastructure and often unplanned deployments in many multihop wireless communication scenarios restrict nodes to determine their own addresses based on the underlying connectivity in the network. However, due to unreliable connectivity and rapidly changing link qualities in wireless networks, establishing uniform addressing and stable point-to-point routing is challenging. In this paper, we present Statistical Vector Routing (SVR), a virtual coordinates based addressing and routing mechanism that efficiently deals with dynamic communication links in wireless networks. It assigns stable probabilistic addresses to nodes without the need to pessimistically estimate links over longer periods of time. The routing metric predicts the current location of a node in its address distribution. Our prototype implementation over real testbeds indicates that SVR, when compared to current approaches, achieves 3 times more stable addressing, reduces the magnitude of change in addresses by 2-10 times, and minimizes the hop distance and transmissions in the network by 10-15%. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-vaegs-wehrle-probabilistic_addressing.pdf Print Hamburg University of Technology

Hamburg, Germany

Proceedings of the 2nd IEEE Student Conference, Hamburg University of Technology, Hamburg, Germany Hamburg, Germany 2nd IEEE Student Conference, Hamburg University of Technology May 20-21, 2010 en TobiasVaegs Muhammad HamadAlizai KlausWehrle inproceedings 2010-ipsn-sasnauskas-kleenet 2010 4 12 186--196 Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs that occur due to non-deterministic events, such as node reboots or packet duplicates. Often, these events have the potential to drive a sensor network and its applications into corner-case situations, exhibiting bugs that are hard to detect using existing testing and debugging techniques. In this paper, we present KleeNet, a debugging environment that effectively discovers such bugs before deployment. KleeNet executes unmodified sensor network applications on symbolic input and automatically injects non-deterministic failures. As a result, KleeNet generates distributed execution paths at high-coverage, including low-probability corner-case situations. As a case study, we integrated KleeNet into the Contiki OS and show its effectiveness by detecting four insidious bugs in the uIP TCP/IP protocol stack. One of these bugs is critical and lead to refusal of further connections. automated protocol testing, experimentation, failure detection, wireless sensor networks kleenet fileadmin/papers/2010/2010-04-ipsn-sasnauskas-KleeNet.pdf Print ACM

New York, NY, USA

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden en 978-1-60558-988-6 http://doi.acm.org/10.1145/1791212.1791235 1 RaimondasSasnauskas OlafLandsiedel Muhammad HamadAlizai CarstenWeise StefanKowalewski KlausWehrle inproceedings 201004IPSNbitschratmote 2010 4 12 432--433 In this work, we present RatMote, a new wireless sensor node for subterranean animal habitat monitoring. RatMote has been developed for project RatPack, which aims at creating a new method for behavioral research on rats in their natural environment using wireless sensor nodes. Recent development in microcontroller architecture allowed us to design a sensor node which calculates up to 22 times more operations per mAh than the widely used TelosB node. This significant performance and efficiency increase allows us to perform computationally demanding algorithms inside the node, needed for vocalization analysis, localization, and mapping. Demo Abstract RatPack fileadmin/papers/2010/2010-04-IPSN-bitsch-ratmote.pdf http://doi.acm.org/10.1145/1791212.1791291 Online ACM

New York City, NY, USA

IPSN '10 Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden ACM Stockholm, Sweden 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010) April 12-16, 2010 en 978-1-60558-988-6 http://doi.acm.org/10.1145/1791212.1791291 1 Jó AgilaBitsch Link ThomasBretgeld AndréGoliath KlausWehrle inproceedings 20104-IPSN-alizai-svr 2010 4 12 366-367 We present Statistical Vector Routing (SVR), a protocol that efficiently deals with communication link dynamics in wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR. wld https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf http://portal.acm.org/citation.cfm?id=1791257 Print ACM

New York, NY, USA

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010), Stockholm, Sweden Stockholm, Sweden 9th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2010) April 12-16, 2010 en 978-1-60558-988-6 1 Muhammad HamadAlizai TobiasVaegs OlafLandsiedel RaimondasSasnauskas KlausWehrle inproceedings 201004vaegsjscsvr 2010 4 7 279-280 We present Statistical Vector Routing (SVR), a protocol that efficiently deals with the dynamics shown by communication links of wireless networks. It assigns virtual coordinates to nodes based on the statistical distribution of their distance from a small set of beacons. The distance metric predicts the current location of a node in its address distribution. Our initial results from a prototype implementation over real testbeds demonstrate the feasibility of SVR. https://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-alizai-ipsn-pad.pdf Poster Print Hans K. Kaiser and Raimund Kirner Vienna University of Technology

Karlsplatz 13, 1040 Vienna, Austria

Proceedings of the Junior Scientist Conference 2010, Vienna, Austria Vienna, Austria The Junior Scientist Conference April 7-9, 2010 en 978-3-200-01797-9 TobiasVaegs 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 2010-bitsch-link-iq2s-burrowview 2010 3 29 56 -- 61 For a long time, life sciences were restricted to look at animal habitats only post-factum. Pervasive computing puts us in the novel position to gain live views. In this paper we present BurrowView, an application that tracks the movement of rats in their natural habitat and reconstructs the underground tunnel system. To make reliable statements, special consideration has been taken with regard to the information quality. Our system is able to reconstruct paths up to a resolution of 20 cm, the length of a rat without its tail. RatPack fileadmin/papers/2010/2010-03-IQ2S-link-burrowview.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5470603 Online IEEE

New York City, NY, USA

Proceedings of the Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010), Mannheim, Germany IEEE Mannheim, Germany Second IEEE International Workshop on Information Quality and Quality of Service for Pervasive Computing (IQ2S 2010) March 29 to April 2, 2010 en 978-1-4244-6605-4 10.1109/PERCOMW.2010.5470603 1 Jó AgilaBitsch Link GregorFabritius Muhammad HamadAlizai KlausWehrle inproceedings inproceedingsreference201001221179332027 2010 3 15 1-5 In wireless and mobile networking, volatile environ- mental conditions are a permanent challenge, resulting in a demand for cross-layer optimizations. To further increase flexibility, we believe cross-layer architectures should adapt themselves to these changing conditions, just as they adapt the network stack, devices, and applications. In this paper, we propose CRAWLER, a novel cross-layer architecture that combines three core properties: signaling between all layers and system components; extensibility and adaptability at runtime; and high usability for cross-layer developers. CRAWLER increases flexibility, as well as expediting and simplifying cross- layer development. Work in Progress session crawler fileadmin/papers/2010/2010-03-infocom-aktas-crawler.pdf Print IEEE Proceedings of the 2010 INFOCOM IEEE Conference on Computer Communications Workshops, San Diego, CA, USA en 978-1-4244-6739-6 1 IsmetAktas JensOtten FlorianSchmidt KlausWehrle inbook 201001ThieleINTECHRatpack 2010 1 629--644 RatPack http://www.comsys.rwth-aachen.de/fileadmin/papers/2010/2010-01-Thiele-INTECH-Ratpack.pdf http://sciyo.com/articles/show/title/dynamic-wireless-sensor-networks-for-animal-behavior-research http://www.intechopen.com/articles/show/title/dynamic-wireless-sensor-networks-for-animal-behavior-research Online Domenico Campolo InTech

Vienna, Austria

32 Recent Advances in Biomedical Engineering en 978-953-7619-57-2 1 JohannesThiele Jó AgilaBitsch Link OkuaryOsechas HanspeterMallot KlausWehrle inproceedings 20105munawardynamictinyos 2010 1-6 Long-term deployments of sensor networks in physically inaccessible environments make remote re-programmability of sensor nodes a necessity. Ranging from full image replacement to virtual machines, a variety of mechanisms exist today to deploy new software or to fix bugs in deployed systems. However, TinyOS - the current state of the art sensor node operating system - is still limited to full image replacement as nodes execute a statically-linked system-image generated at compilation time. In this paper we introduce Dynamic TinyOS to enable the dynamic exchange of software components and thus incrementally update the operating system and its applications. The core idea is to preserve the modularity of TinyOS, i.e. its componentization, which is lost during the normal compilation process, and enable runtime composition of TinyOS components on the sensor node. The proposed solution integrates seamlessly into the system architecture of TinyOS: It does not require any changes to the programming model of TinyOS and existing components can be reused transparently. Our evaluation shows that Dynamic TinyOS incurs a low performance overhead while keeping a smaller - upto one third - memory footprint than other comparable solutions. fileadmin/papers/2010/2010-05-icc-munawar-DynamicTinyOS.pdf Online IEEE Proceedings of the IEEE International Conference on Communications (ICC), Cape Town, South Africa en 978-1-4244-6402-9 1550-3607 1 WaqaasMunawar Muhammad HamadAlizai OlafLandsiedel KlausWehrle inproceedings 2010-ARCS-alizai-promotingpower 2010 387-392 Accurate prediction of energy consumption early in the design process is essential to efficiently optimize algorithms and protocols. However, despite energy efficiency gathering significant attention in networking research, limited effort has been invested in providing requisite evaluation tools and models. Hence, developers demand powerful evaluation tools to assist them in comparing new communication paradigms in terms of energy efficiency, and minimizing the energy requirements of algorithms. In this paper, we argue for promoting energy to a first class metric in network simulations. We explore the challenges involved in modelling energy in network simulations and present a detailed analysis of different modelling techniques. Finally, we discuss their applicability in high-level network simulations. fileadmin/papers/2010/2010-2-ARCS-alizai-promoting-power.pdf Print VDE-VERLAG

Berlin, Germany

Proceedings of the Workshop on Energy Aware Systems and Methods, in conjunction with GI/ITG ARCS 2010 Hannover, Feb. 21-23 en 978-3-8007-3222-7 1 Muhammad HamadAlizai GeorgKunz OlafLandsiedel KlausWehrle inproceedings 201003GarciaEffContAwareAccControlPMS 2010 Proceedings of the First IEEE PerCom Workshop on Pervasive Healthcare OscarGarcia-Morchon KlausWehrle inproceedings 201006GarciaIFIPTM 2010 ManyapplicationsrunningontheInternetoperateinfullyor semi-distributed fashion including P2P networks or social networks. Dis- tributed applications exhibit many advantages over classical client-server models regarding scalability, fault tolerance, and cost. Unfortunately, the distributed system operation also brings many security threats along that challenge their performance and reliability. In particular, faulty or mis- behaving nodes cannot collude to subvert the system operation. This paper addresses the above threats by applying cooperative security techniques to relevant distributed systems in the Internet. Our goal is to present methods that allow the peers to bootstrap basic trust relation- ships at the time of joining a distributed network and remove the peers if trust is lost. We consider the specific security caveats of the analyzed sys- tems, investigate the applicability of existing cooperative security-based protocols, and propose general design guidelines for cooperative-security protocol in described distributed systems. Print Springer

Berlin

Proceedings of IFIPTM 2010 - 4th International Conference on Trust Management Morioka, Japan 4th International Conference on Trust Management en 978-3-642-13445-6 1 DmitriyKuptsov OscarGarcia-Morchon KlausWehrle AndreiGurtov inproceedings 201006GarciaSacmat 2010 Medical sensor networks allow for pervasive health monitoring of users in hospitals, at home, or on the way. The privacy and confidentiality of medical data need to be guaranteed at any moment to make sure that unauthorized parties cannot retrieve confidential information. This is a great challenge due to two main reasons. First, wireless sensors are resource-constrained devices that limit the applicability of traditional solutions. Second, the access control system must be context-aware and adapt its security settings to ensure the users' safety during, e.g., medical emergencies. To solve these issues, this paper presents a modular context-aware access control system tailored to pervasive medical sensor networks in which the access control decisions and the response delay depend upon the health acuteness of a user. Our system extends traditional role-based access control systems by allowing for context-awareness in critical, emergency, and normal access control situations. We further present a lightweight encoding for our modular access control policies as well as an access control engine efficiently running on resource-constrained sensor nodes. Finally, we analyze how the proposed access control system suits existing security architectures for medical sensor networks.

Pittsburgh, USA

Proceedings of ACM Symposium on Access Control Models and Technologies (SACMAT'10) ACM 978-1-4503-0049-0 10.1145/1809842.1809864 1 OscarGarcia-Morchon KlausWehrle 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 inproceedings 2009-kunz-mascots-horizon 2009 9 21 575-577 This paper presents Horizon, an extension to network simulation that enables the efficient and detailed simulation of wireless networks. Our contributions are two-fold as Horizon provides i) an API for accurately modeling processing time of discrete event simulation models by augmenting events with time spans and ii) a lightweight parallelization scheme that utilizes timing information to guide the parallel execution of simulations on multi-core computers. In this paper we primarily focus on the latter. horizon fileadmin/papers/2009/2009-kunz-mascots-horizon.pdf Poster Online IEEE Computer Society

Los Alamitos, CA, USA

Proceedings of the 17th Annual Meeting of the IEEE International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'09), London, UK London, Great Britain 17th Annual Meeting of the IEEE International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'09) September 21-32, 2009 en 978-1-4244-4926-2 1526-7539 10.1109/MASCOT.2009.5366710 1 GeorgKunz OlafLandsiedel KlausWehrle techreport 200908munawarfgsndynamictinyos 2009 9 9-12 fileadmin/papers/2009/2009-08-munawar-fgsn-dynamic-tinyos.pdf http://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 Technical University Hamburg en WaqaasMunawar OlafLandsiedel Muhammad HamadAlizai 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 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 200803WeingaertnerPromox Electronic Communications of the EASST 2009 3 17 2009 1-10 In this paper, we present a preliminary glance on our framework for protocol stack monitoring using Xen (ProMoX). ProMoX uses the Xen hypervisor to virtualize entire instances of operating systems which may execute any arbitrary protocol implementation. By utilizing system virtualization for external monitoring, ProMoX can transparently inspect any protocol state and performance metrics of protocol implementations carried by a guest operating system. This way, ProMoX supports both the indentification of faults within early prototypes as well as the evaluation of new protocol designs. Accepted for publication online EASST

Kassel, Germany

Proceedings of the GI/ITG KIVS Workshop on Overlay and Network Virtualization 2009 en 1863-2122 1 EliasWeingaertner ChristophTerwelp KlausWehrle article 2009AlizaiPIKtimingenergy PIK Journal, Special Issue on Energy Aware Systems 2009 2 32 2 127-132 fileadmin/papers/2009/2009-2-alizai-modeling-energy.pdf Print en 0930-5157 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle 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 proceedings 2009-Weingaertner-ICC-NetworkSimulator-Comparison 2009 A widespread methodology for performance analysis in the field of communication systems engineering is network simulation. While ns-2 has established itself as virtually the standard network simulation tool, other network simulators have gained more and more attention during the last years. In this paper, we briefly survey new developments in the field of network simulation and conduct a performance comparison study by implementing an identical simulation set-up in five simulators, namely ns-2, OMNet++, ns-3, SimPy and JiST/SWANS. Our results reveal large differences according to both run-time performance and memory usage. http://www.comsys.rwth-aachen.de/fileadmin/papers/2009/2009-weingaertner-simulator_comparison.pdf Print IEEE Proceedings of the IEEE International Conference on Communications 2009 (ICC 2009) Dresden, Germany en 1 EliasWeingaertner Hendrikvom Lehn 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 techreport 2009-heer-draft-midauth 2009 draft-heer-hip-midauth-02 The Host Identity Protocol is a signaling protocol for secure communication, mobility, and multihoming. It achieves these properties by introducing a new cryptographic namespace. This document specifies an extension for HIP that enables middleboxes to unambiguously verify the identities of hosts that communicate across them. This extension enables middleboxes to verify the liveness and freshness of a HIP association and, thus, enables reliable and secure access control in middleboxes. Work in progress Internet Engineering Task Force Internet-Draft TobiasHeer MiikaKomu 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 inproceedings 2008-sensys-sasnauskas-kleenet 2008 11 425--426 We present KleeNet, a Klee based bug hunting tool for sensor network applications before deployment. KleeNet automatically tests code for all possible inputs, ensures memory safety, and integrates well into TinyOS based application development life cycle, making it easy for developers to test their applications. bug finding, memory safety, tinyos, type safety kleenet fileadmin/papers/2008/2008-11-Sasnauskas-SenSys08-KleeNet.pdf Print ACM

New York, NY, USA

Proceedings of the 6th ACM conference on Embedded network sensor systems (SenSys'08), Raleigh, NC, USA en 978-1-59593-990-6 http://doi.acm.org/10.1145/1460412.1460485 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle inproceedings 200810ThieleSensors08RatPack 2008 10 26 709 -- 711 Working towards the observation of rats (and other small rodents) in the wild we have developed tools that will enable us to study their behavior using a wireless network of wearable sensor nodes. The space and weight constraints resulting from the size of the animals have led to simple but functional approaches for vocalization classification and position estimation. For the resulting data we have developed novel, delay-tolerant routing and collection strategies. These are expected to be used in a sparse, dynamic network resulting from various rats being tagged with our nodes and running around freely - an area that will eventually be too big to be covered solely by stationary data sinks. Furthermore, the system is designed to extract information on the social interactions between animals from the routing data. It currently works in an indoor environment and we are preparing it for tests in a controlled outdoor setup. RatPack fileadmin/papers/2008/2008-10-Thiele-Sensors08-RatPack.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4716540 Online IEEE

New York City, NY, USA

Proceedings of IEEE Sensors 2008, Lecce, Italy IEEE Lecce, Italy IEEE Sensors 2008 26-29 Oct. 2008 en 978-1-4244-2580-8 1930-0395 10.1109/ICSENS.2008.4716540 1 JohannesThiele OkuaryOsechas Jó AgilaBitsch Link KlausWehrle conference 200810riechelcncerco 2008 10 14 28-35 Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, are used more and more for file-sharing and content distribution applications. However, a major weakness of traditional DHTs is the search for stored content, as data is assigned to nodes based on hash functions, and the very nature of hash tables allows only exact pattern matches. We present Cerco, a solution for the problem of range queries by using the principles of order-preserving DHTs and a hierarchically structured P2P approach. To guarantee an efficient routing and load balancing, Cerco uses a dynamic hierarchy of DHTs by creating subrings on demand and two explicit load balancing strategies. Our evaluation shows that Cerco is able to achieve the goals of supporting range queries, logarithmic-hop routing, and efficient load balancing. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4664131&arnumber=4664148&count=180&index=16 http://web.informatik.uni-bonn.de/IV/Mitarbeiter/matthew/Mirror_LCN2008_Website/www.ieeelcn.org/ Print IEEE Press Proceedings of 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008) IEEE Montreal, Canada 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008) 14-17 Oct. 2008 en 978-1-4244-2412-2 10.1109/LCN.2008.4664148 1 SimonRieche Bui TheVinh KlausWehrle techreport 2008-fgsn-sasnauskas-kleenet 2008 9 Testing sensor network applications is an essential and a difficult task. Due to their distributed and faulty nature, severe resource constraints, unobservable interactions, and limited human interaction, sensor networks, make monitoring and debugging of applications strenuous and more challenging. In this paper we present KleeNet - a Klee based platform independent bug hunting tool for sensor network applications before deployment - which can automatically test applications for all possible inputs, and hence, ensures memory safety for TinyOS based applications. Upon finding a bug, KleeNet generates a concrete test case with real input values identifying a specific error path in a program. Additionally, we show that KleeNet integrates well into TinyOS application development life cycle with minimum manual effort, making it easy for developers to test their applications. kleenet fileadmin/papers/2008/2008-09-Sasnauskas-FGSN08-BugHunting.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Freie Universität Berlin, Institute of Computer Science

Berlin, Germany

Proceedings of the 7th GI/ITG Fachgespraech Wireless Sensor Networks, Berlin, Germany Chair of Communication and Distributed Systems (ComSys) en 1 RaimondasSasnauskas Jó AgilaBitsch Link Muhammad HamadAlizai KlausWehrle inproceedings 200808OsechasEMBC08RatPack 2008 8 20 538--541 The goal of our project is to describe the behavior of rats. For this purpose we are using wireless sensor networks, monitoring various quantities that yield important information to complement current knowledge on the behavioral repertoire of rats. So far, on the sensing and processing side we have developed innovative, minimalist approaches pointing in two directions: vocalization analysis and movement tracking. On the data collection and routing side we have adapted to the known burrowing habits of rats by developing new methods for synchronization and data aggregation under the paradigm of sporadic connectivity in a sparse, dynamic network. Animals;Behavior, Animal;Clothing;Equipment Design;Equipment Failure Analysis;Miniaturization;Monitoring, Ambulatory;Rats;Reproducibility of Results;Sensitivity and Specificity;Transducers; ratpack fileadmin/papers/2008/2008-08-Osechas-EMBC08-RatPack.pdf http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4649209 Online The Printing House

Stoughton, WI, USA

Proceedings of the 30th Annual International IEEE Engineering in Medicine and Biology Conference, Vancouver, BC, Canada IEEE EMBS Vancouver, BC, Canada Engineering in Medicine and Biology Society, 2008. EMBS 2008. 30th Annual International Conference of the IEEE 20-25 Aug. 2008 en 978-1-4244-1814-5 1557-170X 10.1109/IEMBS.2008.4649209 1 OkuaryOsechas JohannesThiele Jó AgilaBitsch Link KlausWehrle inproceedings 200808BitschSIGCOMM08RatPack 2008 8 17 467--468 The goal of this pro ject is to investigate the behavior of wild living rats using sensor networks. The main challenge with respect to communication is the sparse and very dynamic network determined by the burrow dwelling behavior of rats, which makes delay tolerant data transmission schemes a necessity. The physical and computional restrictions in embedded devices make routing an interesting challenge for which we are currently developing new strategies. ratpack fileadmin/papers/2008/2008-08-Bitsch-SIGCOMM08-RatPack.pdf http://conferences.sigcomm.org/sigcomm/2008/posters.php http://www.worldcat.org/title/sigcomm-08-proceedings-of-the-2008-sigcomm-conference-and-co-located-workshops-nsdr08-wosn08-mobiarch08-netecon08-presto08-seattle-wa-usa-august-17-22-2008/oclc/300481768 Online ACM

New York City, NY, USA

ACM SIGCOMM 2008 Poster Proceedings, Seattle, WA, USA ACM Seattle, WA, USA ACM SIGCOMM 2008 August 17-22, 2008 en 978-1-60558-175-0 1 Jó AgilaBitsch Link KlausWehrle OkuaryOsechas JohannesThiele techreport 2008-fgsn-alizai-stle 2008 7 27-30 wld fileadmin/papers/2008/2008-08-alizai-fgsn-stle.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Fachbereich Mathematik und Informatik

Berlin, Germany

Proceedings of the 7th GI/ITG Workshop on Wireless Sensor Networks FGSN 08 September 2010 en 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle AlexanderBecher 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 inproceedings 2008-becher-hotemnets-linkestimation 2008 6 3 1--5 Commonly, routing in sensor networks is limited to longterm stable links. Unstable links, although often promising to be of large routing progress, are not considered for packet forwarding as link estimators typically cannot handle their dynamics. In this paper we introduce short-term link estimation to capture link dynamics at a high resolution in time and to identify when these render a link temporarily reliable or unreliable. We identify such dynamics based on packet overhearing, predict short-term availability and unavailability, and adapt neighbor tables, thereby enlarging the set of links useable by any routing algorithm. Additionally, we show that short-term link estimation integrates seamlessly into today's sensor network link estimators and routing protocols. wld fileadmin/papers/2008/2008-becher-hotemnets-linkestimation.pdf Online ACM Press

New York, NY, USA

Proceedings of Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08), Charlottesville, VA, USA Chalottesville, USA Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08) June 2-3, 2008 en 978-1-60558-209-2 1 AlexanderBecher OlafLandsiedel GeorgKunz KlausWehrle conference 200803riechemmvecluster 2008 3 18 9-13 Massively Multiplayer Online Games (MMOGs) have become increasingly popular in the last years. So far the distribution of load, caused by the players in these games, is not distributed dynamically. After the launch of a new game, the introduction of new content, during special ingame events, or also during normal operations, players tend to concentrate in certain regions of the game worlds and cause overload conditions. Therefore we propose the use of structured P2P technology for the server infrastructure of the MMOGs to improve the reliability and scalability. Previous work segmented the game work into rectangular areas; however this approach often split a group of players to different servers, causing additional overhead. This work presents a cluster-based Peer-to-Peer approach, which can be used for load balancing in MMOGs or in other virtual worlds. The system is able to dynamically adapt to the current state of the game and handle uneven distributions of the players in the game world. We show through simulation, also with traces from real online games, that the cluster-based approach performs better than the previous P2P-based systems, which split the world in rectangular areas. RWTH Aachen University - Distributed Systems Group http://www.pap.vs.uni-due.de/MMVE08/papers/proceedings.pdf http://www.pap.vs.uni-due.de/MMVE08/ Online Gregor Schiele, Daniel Weiskopf, Ben Leong, Shun-Yun Hu Proceedings of 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008) Reno, Nevada, USA 1st International Workshop on Massively Multiuser Virtual Environments at IEEE Virtual Reality 2008 (MMVE 2008) March 8th, 2008 en 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer TimoTeifel GeorgCarle 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 article 200812riecheIJAMCcluster International Journal of Advanced Media and Communication (IJAMC) 2008 2 4 351-363 In current Massively Multiplayer Online Games (MMOGs) the distribution of load is not distributed dynamically. But players tend to concentrate in certain regions of the game world and cause overload conditions. Therefore we propose the use of structured Peer-to-Peer technology for the server infrastructure of the MMOGs to improve the reliability and scalability. Previous work segmented the game work into rectangular areas but often split a group of players to different servers. This work presents a cluster-based P2P approach, which is able to dynamically adapt to the current state of the game and handle uneven distributions of players.Weshow through simulation, also with traces from real online games, that the cluster-based approach performs better than the previous P2P-based system. RWTH Aachen University - Distributed Systems Group http://www.inderscience.com/browse/index.php?journalID=67 print en 1462-4613 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer TimoTeifel GeorgCarle inproceedings 200804landsiedelIPSN08TimingMatters 2008 344-354 The rising complexity of data processing algorithms in sensor networks combined with their severely limited computing power necessitates an in-depth understanding of their temporal behavior. However, today only cycle accurate emulation and test-beds provide a detailed and accurate insight into the temporal behavior of sensor networks. In this paper we introduce fine grained, automated instrumentation of simulation models with cycle counts derived from sensor nodes and application binaries to provide detailed timing information. The presented approach bridges the gap between scalable but abstracting simulation and cycle accurate emulation for sensor network evaluation. By mapping device-specific code with simulation models, we can derive the time and duration a certain code line takes to get executed on a sensor node. Hence, eliminating the need to use expensive instruction-level emulators with limited speed and restricted scalability. Furthermore, the proposed design is not bound to a specific hardware platform, a major advantage compared to existing emulators. Our evaluation shows that the proposed technique achieves a timing accuracy of 99% compared to emulation while adding only a small overhead. Concluding, it combines essential properties like accuracy, speed and scalability on a single simulation platform. fileadmin/papers/2008/2008-04-IPSN-2008-landsiedel-Timing-Matters.pdf Print IEEE Computer Society

Washington, DC, USA

Proceedings of the 7th ACM International Conference on Information Processing in Sensor Networks (IPSN 2008), St. Louis, MO, USA en 978-0-7695-3157-1 1 OlafLandsiedel Muhammad HamadAlizai KlausWehrle techreport 200807VOMLEHNAIB200816NetworkSimulatorComparison Aachener Informatik Berichte 2008 2008-16 AIB 2008-16 1-28 Ranging from the development of new protocols to validating analytical performance metrics, network simulation is the most prevalent methodology in the field of computer network research. While the well known ns-2 toolkit has established itself as the quasi standard for network simulation, the successors are on their way. In this paper, we first survey recent contributions in the field of network simulation tools as well as related aspects such as parallel network simulation. Moreover, we present preliminary results which compare the resource demands for ns-3, JiST, SimPy and OMNeT++ by implementing the identical simulation scenario in all these network simulation tools. https://www.comsys.rwth-aachen.de/fileadmin/papers/2008/AIB-2008-16.pdf Online

Ahornstr. 55, Aachen, Germany

RWTH Aachen University Technical Report 0935-3232 Hendrikvom Lehn EliasWeingaertner KlausWehrle techreport 2008-heer-draft-midauth 2008 draft-heer-hip-midauth-01 The Host Identity Protocol is a signaling protocol for secure communication, mobility, and multihoming. It achieves these properties by introducing a new cryptographic namespace. This document specifies an extension for HIP that enables middleboxes to unambiguously verify the identities of hosts that communicate across them. This extension enables middleboxes to verify the liveness and freshness of a HIP association and, thus, enables reliable and secure access control in middleboxes. Work in progress Internet Engineering Task Force Internet-Draft TobiasHeer MiikaKomu KlausWehrle 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 inproceedings 200707BitschSNFGRatPack 2007 7 16 2007-11 95 -- 97 The goal of this project is to describe the behaviour of rats. To study this behaviour, we will resort to the use of wireless sensor networks, monitoring various quantities that yield important information to complement current knowledge on the behavioural repertoire of rats. The challenges we face include data acquisition and processing on the one hand, as rat-borne sensor nodes will need to be small enough not to interfere with the rats' own activities, thus limiting the available memory and processing capabilities. Additionally, rats spend a significant amount of time underground, making data transmission and routing a very interesting challenge, for which we are currently developing novel strategies. RatPack fileadmin/papers/2007/2007-07-Bitsch-SNFG-RatPack.pdf Print Klaus Wehrle RWTH Aachen University

Aachen, Germany

AIB 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Aachen, Germany GI/ITG Fachgruppe "Kommunikation und Verteilte Systeme" Aachen, Germany 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks" July 16-17, 2007 en 0935-3232 1 Jó AgilaBitsch Link KlausWehrle OkuaryOsechas JohannesThiele HanspeterMallot techreport 2007-fgsn-alizai-timetossim 2007 7 fileadmin/papers/2008/2007-07-fgsn-alizai-accurate-timing.pdf https://www.ds-group.info/events/fgsn07/fgsn07proc.pdf Print RWTH Aachen

Aachen, Germany

Proceedings of the 6th GI/ITG KuVS Workshop on Wireless Sensor Networks (FGSN 07) RWTH Aachen Aachen, Germany FGSN 07 July 2007 en Muhammad HamadAlizai OlafLandsiedel KlausWehrle conference 200701riecheccncmmog 2007 1 11 763-767 Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive betatesting suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4199088&arnumber=4199243&count=254&index=154 http://www.ieee-ccnc.org/2007/ Print IEEE Press Proceedings of 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007) IEEE Las Vegas, Nevada, USA 4th Annual IEEE Consumer Communications and Networking Conference (CCNC 2007) 11-13 January 2007 en 1-4244-0667-6 10.1109/CCNC.2007.155 1 SimonRieche KlausWehrle MarcFouquet HeikoNiedermayer LeoPetrak GeorgCarle article 200707ITp2p Special Issue on Peer-to-Peer of the it - Information Technology Journal 2007 49 ISSN 0935-3232 http://it-Information-Technology.de RalfSteinmetz KlausWehrle NicolasLiebau 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 conference 200711Globecom2007Landsiedelmultipathonionrouting 2007 Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing a static tunnel through an overlay network is build via layered encryption. All traffic exchanged by its end points is relayed through this tunnel.In contrast, this paper introduces dynamic multipath Onion Routing to extend the static Onion Routing paradigm. This approach allows each packet exchanged between two end points to travel along a different path. To provide anonymity the first half of this path is selected by the sender and the second half by the receiver of the packet. The results are manifold: First, dynamic multipath Onion Routing increases the resilience against threats, especially pattern and timing based analysis attacks. Second, the dynamic paths reduce the impact of misbehaving and overloaded relays. Finally, inspired by Internet routing, the forwarding nodes do not need to maintain any state about ongoing flows and so reduce the complexity of the router. In this paper, we describe the design of our dynamic Multipath Onion Router (MORE) for peer-to-peer overlay networks, and evaluate its performance. Furthermore, we integrate address virtualization to abstract from Internet addresses and provide transparent support for IP applications. Thus, no application-level gateways, proxies or modifications of applications are required to sanitize protocols from network level information. Acting as an IP-datagram service, our scheme provides a substrate for anonymous communication to a wide range of applications using TCP and UDP. IEEE Global Communication Conference (GlobeCom), Washington D.C. OlafLandsiedel AlexisPimenidis KlausWehrle HeikoNiedermayer GeorgCarle inproceedings 200706juriFGSN07platform 2007

Aachen, Germany

Proceedings of 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks" JuriSaragazki OlafLandsiedel KlausWehrle inproceedings 200707SchmidtFGSN07composition 2007

Aachen, Germany

Proceedings of 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Aachen StefanSchmitz OlafLandsiedel 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 techreport 200707SNFGProceedings 2007 AIB 2007-11

Aachen, Germany

Distributed Systems Group, RWTH Aachen University Proceedings of Workshop KlausWehrle conference rieche2006cerco 2006 11 14 509-510 Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) is partitioned and each partition with its keys and values is assigned to a node in the DHT. For data retrieval however, the very nature of hash tables allows only exact pattern matches. We propose Cerco, a simple solution for the problem of range queries by employing a hierarchically structured P2P approach based on the principles of Distributed Hash Tables. We show that a dynamic hierarchy of DHTs with on-demand classification of items can positively influence the response time of queries while maintaining lookup correctness. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4116490&arnumber=4116594&count=192&index=90 http://web.archive.org/web/20061008091738/http://www.ieeelcn.org/ Print IEEE Press Proceedings of 31st IEEE Conference on Local Computer Networks (LCN 2006) IEEE Tampa, Florida, USA 31st IEEE Conference on Local Computer Networks (LCN 2006) 14-16 November 2006 en 1-4244-0418-5 10.1109/LCN.2006.322147 1 SimonRieche KlausWehrle LeoPetrak ClemensWrzodek techreport 200608riechetrmmog 2006 8 WSI-2006-04 Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive beta-testing suffer from downtimes because of hard- and software problems. Our approach is to use structured P2P technology for the server infrastructure of MMOGs to improve their reliability and scalability. Such P2P networks are also able to adapt to the current state of the game and handle uneven distributions of the players in the game world. Another feature of our approach is being able to add supplementary servers at runtime. Our system allows using off-the-shelf PCs as infrastructure peers for participation in different game worlds as needed. Due to the nature of the Economy of Scale the same number of hosts will provide a better service than dedicated servers for each game world. RWTH Aachen University - Distributed Systems Group http://www.rieche.net/pdf/wsi-2006-04.pdf Online

Tübingen, Germany

Wilhelm-Schickard-Institute for Computer Science, University of Tübingen Technical Report en SimonRieche MarcFouquet HeikoNiedermayer LeoPetrak KlausWehrle GeorgCarle inproceedings 200606LandsiedelRatWatch 2006 6 19 1 1--2 In an attempt to employ sensor network technology for animal observation, in particular of wild rats, we identified several restrictive shortcomings in existing sensor network research, which we discuss in this paper. (Poster and Abstract) RatPack fileadmin/papers/2006/2006-06-Landsiedel-RatWatch.pdf http://www.sics.se/realwsn06/program.html Online Pedro José Marron and Thiemo Voigt SICS

Uppsala, Sweden

ACM Workshop on Real-World Wireless Sensor Networks (RealWSN) in conjunction with ACM MobiSys, Uppsala, Sweden ACM Uppsala, Sweden ACM Workshop on Real-World Wireless Sensor Networks, REALWSN'06 June 19, 2006 en 1 OlafLandsiedel Jó AgilaBitsch Link KlausWehrle JohannesThiele HanspeterMallot 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 poster rieche2006poster 2006 3 Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive beta-testing suffer from downtimes because of hard- and software problems and lags on overloaded servers. Our approach is to use structured P2P technology for the server infrastructure of massively multiplayer online games to improve reliability and scalability of these applications. Structured P2P networks are able to adapt to the current state of the game world and handle uneven distributions of the players. For load balancing, we propose algorithms based on the virtual server concept. RWTH Aachen University - Distributed Systems Group http://www.dagstuhl.de/de/programm/kalender/semhp/?semnr=06131 Print Dagstuhl Seminar 06131 "Peer-to-Peer Systems and Applications" Dagstuhl Dagstuhl Seminar 06131 en SimonRieche KlausWehrle inproceedings 200602LandsiedelEWSNModularSN 2006 2 13 507 22 -- 23 In this paper we present our ongoing work on modular communication protocols for sensor networks. Their modularity allows recomposing a protocol dynamically at runtime and adapting it to the changing needs of a sensor network. Compared to existing work, our componentization is fine grained and protocol independent, enabling a high degree of component reusability. (Poster and Abstract) fileadmin/papers/2006/2006-02-Landsiedel-EWSN-ModularSN.pdf ftp://ftp.inf.ethz.ch/pub/publications/tech-reports/5xx/507.pdf Technical Report Online Kay Römer and Holger Karl and Friedemann Matterns Department of Computer Science, ETH Zurich

Zurich, Switzerland

Technical Report ETH Zurich / Dept. of Computer Science European Workshop on Wireless Sensor Networks (EWSN 2006), Zurich Switzerland EWSN Zurich, Switzerland 3rd European Workshop on Wireless Sensor Networks (EWSN 2006) February 13-15, 2006 en 1 OlafLandsiedel Jó AgilaBitsch Link KatharinaDenkinger KlausWehrle conference 200607landsiedelfgsnmodular 2006 In an attempt to employ sensor network technology for animal observation, in particular of wild rats, we identified several restrictive shortcomings in existing sensor network research. In this paper, we present modular and flexible communication protocols as an efficient substrate to address these shortcomings. Their modularity allows recomposing a protocol dynamically at runtime and adapting it to the changing needs of a deployed sensor network. 5th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Stuttgart, Germany OlafLandsiedel KlausWehrle conference 200607landsiedelngimodels 2006 In this talk we discuss the increasing need for flexible and modular simulation models and our ongoing work in this area. Although a huge number of simulation models are available today, these models do not interoperate and cannot be easily combined to form a full protocol simulation stack. Visions of Future Generation Networks, Würzburg, Germany OlafLandsiedel LeoPetrak KlausWehrle inproceedings 200605NSDIOCALA 2006 In order for overlays and new network architectures to gain real user acceptance, users should be able to leverage overlay functionality without any modifications to their applications and operating systems. We present our design, implementation, and experience with OCALA, an overlay convergence architecture that achieves this goal. OCALA interposes an overlay convergence layer below the transport layer. This layer is composed of an overlay independent sub-layer that interfaces with legacy applications, and an overlay dependent sub-layer that delivers packets to the overlay. Unlike previous efforts, OCALA enables: (a) simultaneous access to multiple overlays (b) communication between hosts in different overlays (c) communication between overlay hosts and legacy hosts (d) extensibility, allowing researchers to incorporate their overlays into OCALA. We currently support five overlays, i3 [32], RON [1], HIP [19], DOA [39] and OverDoSe [31] on Linux, Windows XP/2000 and Mac OS X. We (and a few other research groups and end-users) have used OCALA for over a year with many legacy applications ranging from web browsers to remote desktop applications. San Jose, California USENIX / ACM Proceedings of 3rd ACM Sigcomm/ACM Sigops Symposium on Networked Systems Design and Implementation (NSDI 2006) ACM Dilip AJoseph KarthikLakshminarayanan IonStoica KlausWehrle inproceedings 200608landsiedelp2p06scalablemobility 2006 203-209 For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, we explore how DHTs and mobile ad-hoc networks (MANETs) fit together. We argue that both 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 argue that with little global knowledge, such as a map of the city or whatever area the nodes move in, one can even further improve the scalability and reduce DHT maintenance overhead significantly, allowing MHT to scale up to several ten thousands of nodes. https://www.comsys.rwth-aachen.de/fileadmin/papers/2006/2006-landsiedel-p2p-mobility.pdf print IEEE

Washington, DC, USA

print Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), Cambridge, UK IEEE Cambridge, UK Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06) 2006-09-06 en 0-7695-2679-9 10.1109/P2P.2006.46 1 OlafLandsiedel StefanGötz KlausWehrle inproceedings landsiedel2005anonymous 2005 3 Although research provides anonymous Internet communication schemes, anonymous IP-services received only limited attention. In this paper we present SARA (Anonymous Overlay Routing Providing Sender And Receiver Anonymity), which enables sender, receiver and relationship anonymity using layered encryption and distributed traffic mixes, similar to a Chaumian Mix. Via IP-datagram service and address virtualization it is fully transparent to applications. Organized as structured Peer-To-Peer system, SARA is highly scalable and fault tolerant. In SARA each communication partner randomly selects a number of nodes from the overlay and concatenates them to an anonymous communication path. The sender selects the head of the path, the receiver builds the tail and publishes this information in the overlay network using an anonymous ID. Via this ID the sender retrieves the tail nodes of the path and concatenates both path section. Layered encryption hides the identities of the sender, receiver and the intermediate nodes. 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" Würzburg, Germany 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" March 2005 OlafLandsiedel SimonRieche HeikoNiedermayer KlausWehrle GeorgCarle inproceedings petrak2005dienstguete 2005 3 Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005 Kaiserslautern, Germany Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005 March 2005 LeoPetrak SimonRieche KlausWehrle inproceedings niedermayer2005distribution 2005 3 Proceedings of Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005 Kaiserslautern, Germany Workshop Peer-to-Peer-Systems and -Applications, KiVS 2005 March 2005 HeikoNiedermayer SimonRieche KlausWehrle GeorgCarle inproceedings 200507riecheipgames 2005 3 Massively multiplayer games are becoming increasingly popular today. However, even high-budget titles suffer from downtimes because of hard- and software problems. Our approach is to use structured Peer-to-Peer technology for the server infrastructure of massively multiplayer online games, which improves reliability and scalability of these applications. 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" Würzburg, Germany 5. Würzburger "Workshop IP Netzmanagement, IP Netzplanung und Optimierung" March 2005 SimonRieche MarcFouquet HeikoNiedermayer KlausWehrle GeorgCarle inproceedings 200503goetzp2psawindowsfilesharing 2005 2 28 61 143-146 Although File and printer sharing services have been deployed almost ubiquitously for a long time as part of Microsoft Windows, only recent peer-to-peer applications popularized file-sharing on a global scale. As the Windows CIFS protocol was designed for local area networks, its use has been con?ned to relatively small environments. We propose a mechanism to set up spontaneous virtual groups that allow to use legacy Windows file and printer sharing globally in virtual LANs. https://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2005-goetz-kivs-spontaneous-file-sharing.pdf print Paul Müller, Reinhard Gotzhein, Jens B. Schmitt Gesellschaft für Informatik (GI)

Bonn, Germany

print LNI Proceedings of Workshop on Peer-to-Peer-Systems and -Applications Gesellschaft für Informatik (GI) Kaiserslautern, Germany Kommunikation in Verteilten Systemen (KiVS), Kaiserslautern, Germany 2005-02-28 en 3-88579-390-3 1 StefanGötz KlausWehrle article 200504landsiedelpikenergy Special Issue on Sensor Networks, PIK Journal 2005 28 2 Simulation is the de-facto standard tool for the evaluation of distributed and communication systems like sensor networks. Most simulation efforts focus on protocol- and algorithm-level issues, thus depending on the right choice and configuration of models. However, as such models commonly neglect time dependent issues, many research challenges, like energy consumption and radio channel utilization still remain. In this article we present two new tools to model and analyze sensor networks: Avrora, a fast and accurate sensor network simulator, and AEON, a novel tool built on top of Avrora, to evaluate the energy consumption and to accurately predict the lifetime of sensor networks. Avrora is a highly scalable instruction-level simulator for sensor network programs. It simulates the execution of the program down to the level of individual clock cycles, a time quantum of about 135 ns. By incorporating state of the art simulation techniques, including an efficiently maintained event queue, fast-forward through sleep-time, and parallel simulation, it can simulate entire networks of nodes in real time. AEON's energy model is based on Avrora and makes use of the cycle accurate execution of sensor node applications for precise energy measurements. Due to limited energy resources, power consumption is a crucial characteristic of sensor networks. AEON uses accurate measurements of node current draw and the execution of real code to enable accurate prediction of the actual power consumption of sensor nodes. Consequently, it prevents erroneous assumptions on node and network lifetime. Moreover, our detailed energy model allows to compare different low power and energy aware approaches in terms of energy efficiency. Thus, it enables a highly precise estimation of the overall lifetime of a sensor network. OlafLandsiedel KlausWehrle Ben LTitzer JensPalsberg inbook 200502IThandbook 2005 33 pages Richard Zurawski CRC Press xx The Industrial Information Technology Handbook KlausWehrle inbook 200509riechep2pbookreliability 2005 119-135 Ralf Steinmetz, Klaus Wehrle Springer

Heidelberg, Germany

Lecture Notes in Computer Science, LNCS 9 Peer-to-Peer Systems and Applications SimonRieche HeikoNiedermayer StefanGötz KlausWehrle inbook 200509goetzp2pbookdhtalgorithms 2005 95-117 Ralf Steinmetz, Klaus Wehrle Springer

Heidelberg, Germany

Lecture Notes in Computer Science, LNCS 8 Peer-to-Peer Systems and Applications StefanGötz SimonRieche KlausWehrle inbook 200509wehrlep2pbookdhts 2005 79-93 Ralf Steinmetz, Klaus Wehrle Springer

Heidelberg, Germany

Lecture Notes in Computer Science, LNCS 7 Peer-to-Peer Systems and Applications KlausWehrle StefanGötz SimonRieche conference 200509petraksoftcommobility 2005 Proceedings of the 2005 Conference on Software for Communication Systems and Computer Networks LeoPetrak OlafLandsiedel KlausWehrle conference 200509landsiedelp2ptdht 2005 In this paper, we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the presence of voids in the network. Using a virtual coordinate system, we construct a distributed hash table which is strongly oriented to the underlying network topology. Thus, adjacent areas in the hash table commonly have a direct link in the network. Routing in the T-DHT guarantees reachability and introduces low hop-overhead compared with the shortest path. Proceedings of Fifth International IEEE Conference on Peer-to-Peer-Computing, Konstanz, Germany OlafLandsiedel KatharinaLehmann KlausWehrle inproceedings 200503landsiedelfgsnaeon 2005 481 72-76 Power consumption is a crucial characteristic of sensor networks and their applications, as sensor nodes are commonly battery driven. Although recent research focuses strongly on energy aware applications and operating systems, power consumption is still a limiting factor. Once sensor nodes are deployed, it is challenging and sometimes even impossible to change batteries. As a result, erroneous lifetime prediction causes high costs and may render a sensor network useless, before its purpose is fulfilled. In this paper we present AEON, a novel evaluation tool to quantitatively predict power consumption of sensor nodes and whole sensor networks. Our energy model, based on measurements of node current draw and the execution of real code, enables accurate prediction of the actual power consumption of sensor nodes. Consequently, preventing erroneous assumptions on node and network lifetime. Moreover, our detailed energy model allows to compare different low power and energy aware approaches in terms of energy efficiency.

Zürich, CH

Proceedings of the 4th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Techical Report No. 481 OlafLandsiedel KlausWehrle SimonRieche StefanGötz LeoPetrak inproceedings 200511goetzmmsctransparent 2005 31-36 Mobile devices have become a popular medium for delivering multimedia services to end users. A large variety of solutions have been proposed to flexibly compose such services and to provide quality-of-service guarantees for the resulting contents. However, low-level mobility artifacts resulting from network transitions (disconnected operation, reconfiguration, etc.) still prevent a seamless user experience of these technologies. This paper presents an architecture for supporting legacy applications with such solutions in mobile scenarios. Through network virtualization, it hides mobility artifacts and ensures connectivity at the network and transport level. Its adoption for multimedia applications poses unique challenges and advantages, which are discussed herein. https://www.comsys.rwth-aachen.de/fileadmin/papers/2005/2005-goetz-mmc-transparent-service-composition.pdf print Wolf-Tilo Balke and Klara Nahrstedt ACM

New York, NY, USA

print Proceedings of the First ACM International Workshop on Multimedia Service Composition at International Multimedia Conference ACM Singapore First ACM International Workshop on Multimedia Service Composition at International Multimedia Conference, Singapore 2005-08-01 en 1-59593-245-3 10.1145/1099423.1099430 1 StefanGötz KlausWehrle techreport 200605OCALATechReportUCB 2005 UCB/CSD-005/1397 The ever increasing demand of new applications coupled with the increasing rigidity of the Internet has led researchers to propose overlay networks as a means of introducing new functionality in the Internet. However, despite sustained efforts, few overlays are used widely. Providing support for legacy Internet applications to access such overlays would significantly expand the user base of the overlays, as the users can instantly benefit from the overlay functionality. We present the design and implementation of OCALA, an Overlay Convergence Architecture for Legacy Applications. Unlike previous efforts, OCALA allows users to access different overlays simultaneously, as well as hosts in different overlays to communicate with each other. In addition, OCALA reduces the implementation burden on the overlay developers, by factoring out the functions commonly required to support legacy applications, such as tapping legacy traffic, authentication and encryption. Our implementation of OCALA as a proxy requires no changes to the applications or operating systems. We currently support two overlays, i3 and RON, on Linux and Windows XP/2000 platforms. We (and a few other research groups and end-users) have used the proxy over a eleven-month period with many legacy applications ranging from web browsers to remote desktop applications. http://ocala.cs.berkeley.edu

UCB, Berkeley, USA

University of California at Berkeley DilipJoseph JayanthkumarKannan AyumuKubota IonStoica KlausWehrle conference rieche2004thermaldissipation 2004 11 15-23 A major objective of peer-to-peer (P2P) systems is the management of large amounts of data distributed across many systems. Distributed hash tables (DHT) are designed for highly scalable, self-organizing, and efficient distribution and lookup of data, whereby data is stored globally persistent. The range of values of the corresponding hash function is partitioned and each interval is assigned to a node of the DHT. Because the assignment of data to nodes is based on hash functions, one assumes that the respective data load is distributed evenly across all participating nodes. However most DHT show difficulties with load balancing as we demonstrate in this paper. As a solution for this problem, we present a new and very simple approach for balancing stored data between peers in a fashion analogous to the dissipation of heat energy in materials. We compare this algorithm with other approaches for load balancing and present results based on simulations and a prototype implementation. This new algorithm improves the distribution of load in DHT without requiring major changes of the DHT themselves. In addition, we show that the fault tolerance of peer-to-peer systems is increased by the proposed algorithm. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=29935&arnumber=1367197&count=128&index=2 Print IEEE Press Proceedings of LCN 2004 – 29th IEEE Conference on Local Computer Networks IEEE Tampa, Florida, USA LCN 2004 – 29th IEEE Conference on Local Computer Networks November 2004 en 0-7695-2260-2 10.1109/LCN.2004.10 SimonRieche LeoPetrak KlausWehrle inproceedings 200410riechehotp2preliability 2004 10 108-113 Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose Distributed Hash Tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P-Systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into the design of DHT lookup services, these systems aim to provide a stable global addressing structure. But to storage data reliable in a DHT only few techniques were already developed. However since data has to be stored persistent in the network, it should be retrieved anytime, even if nodes fail. In this work we discuss possibilities to store data fault tolerant in a structured Peer-to-Peer system. Print Proceedings of HOT-P2P '04: Hot Topics in Peer-to-Peer Computing at 12th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Volendam, Netherlands HOT-P2P '04: Hot Topics in Peer-to-Peer Computing at 12th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer Oct. 2004 en 1 SimonRieche KlausWehrle OlafLandsiedel StefanGötz LeoPetrak inproceedings rieche2004comparison 2004 9 51 Print GI. LNI

Bonn, Germany

LNI Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004 Ulm, Germany GI-Jahrestagung Informatik 2004 en 1 SimonRieche LeoPetrak KlausWehrle 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 article 2004steinmetzwehrleP2PNetworking Informatik-Spektrum 2004 27 1 51-54 RalfSteinmetz KlausWehrle inproceedings 200410wehrlefgpcintegriertekonstruktionsmethode 2004

Stuttgart, Germany

Proceedings of the GI/ITG KuVS Fachgespräch Systemsoftware für Pervasive Computing KlausWehrle OlafLandsiedel SimonRieche StefanGötz LeoPetrak inproceedings 200407wehrlesmsoipncontentoriented 2004 04411 Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany Dagstuhl Seminar Proceedings Service Management and Self-Organization in IP-based Networks KlausWehrle StefanGötz inproceedings 200410acmmultimediai3composition 2004 http://i3.cs.berkeley.edu

New York, USA

Proceedings of ACM Multimedia 2004 ACM KarthikLakshminarayanan IonStoica KlausWehrle techreport 200606i3proxytechreport 2004 UCB/CSD-04-1342 Providing support for legacy applications is a crucial component of many overlay networks, as it allows end-users to instantly benefit from the functionality introduced by these overlays. This paper presents the design and implementation of a proxy-based solution to support legacy applications in the context of the i3 overlay [24]. The proxy design relies on an address virtualization technique which allows the proxy to tunnel the legacy traffic over the overlay transparently. Our solution can preserve IP packet headers on an end-to-end basis, even when end-host IP addresses change, or when endhosts live in different address spaces (e.g., behind NATs). In addition, our solution allows the use of human-readable names to refer to hosts or services, and requires no changes to applications or operating systems. To illustrate how the proxy enables legacy applications to take advantage of the overlay (i.e., i3) functionality, we present four examples: enabling access to machines behind NAT boxes, secure Intranet access, routing legacy traffic through Bro, an intrusion detection system, and anonymous web download. We have implemented the proxy on Linux andWindows XP/2000 platforms, and used it over the i3 service on PlanetLab over a three month period with a variety of legacy applications ranging from web browsers to operating system-specific file sharing. http://i3.cs.berkeley.edu

UCB, Berkeley, USA

University of California at Berkeley Technical Report JayanthkumarKannan AyumuKubota KarthikLakshminarayanan IonStoica KlausWehrle