scispace - formally typeset
Search or ask a question
Author

Hannes Hartenstein

Bio: Hannes Hartenstein is an academic researcher from Karlsruhe Institute of Technology. The author has contributed to research in topics: Vehicular ad hoc network & Wireless ad hoc network. The author has an hindex of 55, co-authored 234 publications receiving 14515 citations. Previous affiliations of Hannes Hartenstein include University of Mannheim & University of Freiburg.


Papers
More filters
TL;DR: Content .................................................................................................................................................
Abstract: Content ................................................................................................................................................. I
Proceedings ArticleDOI
15 Feb 2014
TL;DR: MentaLink builds on the idea of typed links, allowing authors to explicitly specify how the publications relate to each other, e.g., whether they share the problem statement, whether one publication is built on another or whether they contain contradictory results.
Abstract: In this paper we propose MentaLink, a tool for preserving and sharing mental links in science. MentaLink is intended as a public knowledge base of links between scientific publications. Contributors can collaboratively define and edit links between entire articles or specific text passages. MentaLink builds on the idea of typed links, allowing authors to explicitly specify how the publications relate to each other, e.g., whether they share the problem statement, whether one publication is built on another or whether they contain contradictory results.
01 Jan 2010
TL;DR: This paper presents a treatment of Scalar Quantization For Relative Error using an SAT-Based Scheme to Determine Optimal Fix-free Codes.
Abstract: 2011: John Z. Sun, Massachusetts Institute of Technology, "Scalar Quantization For Relative Error" (coauthored with Vivek Goyal). 2010: Navid Abedini, Texas A&M University, "A SAT-Based Scheme to Determine Optimal Fix-free Codes" (coauthored with Sunil Khatri and Serap Savari). 2009: Pavol Hanus, Technische Universitat Munchen, "Source Coding Scheme for Multiple Sequence Alignments" (coauthored with Janis Dingel, Georg Chalkidis, Joachim Hagenauer).
Journal ArticleDOI
TL;DR: This work explores the feasibility and implications of decentralizing an independent review of software attribute claims, and presents ETHDPR, a proof of concept implementation based on Ethereum and IPFS.
Abstract: Software can be described, like human users and other objects, through attributes. For this work, we define software attributes as humanly verifiable, falsifiable, or judgeable statements regarding characteristics of said software. Much like attributes in general, software attributes require robust identities for their source but also for their target, meaning a software in general or a binary in particular. As software can be of critical importance, performing an independent review of attribute claims appears beneficial. We posit that decentralized platforms that were developed and refined over the past decade can bridge the gap between existing tools and methods for software review and their open, transparent, and accountable use for the benefit of users. In this work, we explore the feasibility and implications of decentralizing an independent review of software attribute claims. We envision the decentralization of a review process from initialization and execution to the persistent recording of results. We sketch the available design space by decomposing the overall process into a modular design and describe how each component covers overarching objectives. To illustrate practical implications and tradeoffs, we present ETHDPR, a proof of concept implementation based on Ethereum and IPFS. Through a quantitative and qualitative evaluation, we show that a decentralized software review is practically feasible. We illustrate the flexibility of the proposed approach using a toy example of a software component in automotive systems. Lastly, we provide a discussion on fundamental limits and open issues of facilitating independent reviews via technological means.
Patent
05 Jul 2002
TL;DR: In this paper, a node is suitable for forwarding to the next node to the destination node if it can receive data from the sender, and all suitable nodes can receive the data and each node can decide based on at least one parameter whether to forward to another node or to a destination node or the sender can select a node for forwarding by exchanging messages.
Abstract: The method involves forwarding data via different nodes (1-4,6) to the destination node (Z). A node is suitable for forwarding to the next node to the destination node if it can receive data from the sender. All suitable nodes can receive the data and each node can decide based on at least one parameter whether to forward to the next node or to the destination node or the sender (S) can select a node for forwarding by exchanging messages.

Cited by
More filters
Proceedings ArticleDOI
22 Jan 2006
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

7,116 citations

Proceedings ArticleDOI
22 Aug 2005
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Abstract: Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. Furthermore, proposed efforts to significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice.

2,712 citations

Journal ArticleDOI
John Kenney1
16 Jun 2011
TL;DR: The content and status of the DSRC standards being developed for deployment in the United States are explained, including insights into why specific technical solutions are being adopted, and key challenges remaining for successful DSRC deployment.
Abstract: Wireless vehicular communication has the potential to enable a host of new applications, the most important of which are a class of safety applications that can prevent collisions and save thousands of lives. The automotive industry is working to develop the dedicated short-range communication (DSRC) technology, for use in vehicle-to-vehicle and vehicle-to-roadside communication. The effectiveness of this technology is highly dependent on cooperative standards for interoperability. This paper explains the content and status of the DSRC standards being developed for deployment in the United States. Included in the discussion are the IEEE 802.11p amendment for wireless access in vehicular environments (WAVE), the IEEE 1609.2, 1609.3, and 1609.4 standards for Security, Network Services and Multi-Channel Operation, the SAE J2735 Message Set Dictionary, and the emerging SAE J2945.1 Communication Minimum Performance Requirements standard. The paper shows how these standards fit together to provide a comprehensive solution for DSRC. Most of the key standards are either recently published or expected to be completed in the coming year. A reader will gain a thorough understanding of DSRC technology for vehicular communication, including insights into why specific technical solutions are being adopted, and key challenges remaining for successful DSRC deployment. The U.S. Department of Transportation is planning to decide in 2013 whether to require DSRC equipment in new vehicles.

1,866 citations

Posted Content
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

1,783 citations

Journal ArticleDOI
01 Jan 2007
TL;DR: This paper provides a set of security protocols, it is shown that they protect privacy and it is analyzed their robustness and efficiency, and describes some major design decisions still to be made.
Abstract: Vehicular networks are very likely to be deployed in the coming years and thus become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some major design decisions still to be made, which in some cases have more than mere technical implications. We provide a set of security protocols, we show that they protect privacy and we analyze their robustness and efficiency.

1,550 citations