- Semantic Web and Ontologies
- Service-Oriented Architecture and Web Services
- Peer-to-Peer Network Technologies
- Caching and Content Delivery
- Advanced Database Systems and Queries
- Energy Efficient Wireless Sensor Networks
- Business Process Modeling and Analysis
- Data Management and Algorithms
- Distributed and Parallel Computing Systems
- Mobile Ad Hoc Networks
- IoT and Edge/Fog Computing
- Context-Aware Activity Recognition Systems
- Data Quality and Management
- Scientific Computing and Data Management
- Advanced Software Engineering Methodologies
- Access Control and Trust
- Opportunistic and Delay-Tolerant Networks
- Quantum Computing Algorithms and Architecture
- Web Data Mining and Analysis
- Mobile Agent-Based Network Management
- Distributed systems and fault tolerance
- Energy Harvesting in Wireless Networks
- Quantum Information and Cryptography
- Security in Wireless Sensor Networks
- Cloud Computing and Resource Management
Technische Universität Berlin
2015-2024
Fraunhofer Institute for Open Communication Systems
2014-2024
Weizenbaum Institute
2019-2023
Humboldt-Universität zu Berlin
2019-2021
Daimler Center for Automotive Information Technology Innovations
2020-2021
Detec (Norway)
2021
Hochschule für Telekommunikation Leipzig
2021
Ollscoil na Gaillimhe – University of Galway
2007-2017
National University of Ireland
2007-2014
Enterprise Ireland
2008-2014
The W3C Semantic Sensor Network Incubator group (the SSN-XG) produced an OWL 2 ontology to describe sensors and observations — the SSN ontology, available at http://purl.oclc.org/NET/ssnx/ssn. can in terms of capabilities, measurement processes, deployments. This article describes ontology. It further gives example use recent research projects.
With the price of wireless sensor technologies diminishing rapidly we can expect large numbers autonomous networks being deployed in near future. These will typically not remain isolated but need interconnecting them on network level to enable integrated data processing arise, thus realizing vision a global "sensor Internet." This requires flexible middleware layer which abstracts from underlying, heterogeneous and supports fast simple deployment addition new platforms, facilitates efficient...
The developed world is awash with sensors. However, they are typically locked into unimodal closed systems. To unleash their full potential, access to sensors should be opened such that data and services can integrated available in other information systems, facilitating novel applications based on the state of real world. We describe our vision architecture a Semantic Web Things: service infrastructure makes deployment use semantic involving Internet-connected almost as easy building,...
article Share on P-Grid: a self-organizing structured P2P system Authors: Karl Aberer Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) (EPFL)View Profile , Philippe Cudré-Mauroux Anwitaman Datta Zoran Despotovic Manfred Hauswirth Magdalena Punceva Roman Schmidt Authors Info & Claims ACM SIGMOD RecordVolume 32Issue 3September 2003 pp 29–33https://doi.org/10.1145/945721.945729Published:01 September 2003Publication History...
A key problem in current sensor network technology is the heterogeneity of available software and hardware platforms which makes deployment application development a tedious time consuming task. To minimize unnecessary repetitive implementation identical functionalities for different platforms, we present our Global Sensor Networks (GSN) middleware supports flexible integration discovery networks data, enables fast addition new provides distributed querying, filtering, combination dynamic...
The authors present Gridella, a Gnutella-compatible P2P system. Gridella is based on the Peer-Grid (P-Grid) approach, which draws research in distributed and cooperative information systems to provide decentralized, scalable data access structure. improves highly chaotic inefficient Gnutella infrastructure with directed search advanced concepts, thus enhancing efficiency providing model for further analysis research.
This paper studies the problem of updates in decentralised and self-organising P2P systems which peers have low online probabilities only local knowledge. The update strategy we propose for this environment is based on a hybrid push/pull rumor spreading algorithm provides fully decentralised, efficient robust communication scheme offers probabilistic guarantees rather than ensuring strict consistency. We describe generic analytical model to investigate utility our propagation from...
The W3C Semantic Sensor Network Incubator group (the SSN-XG) produced an OWL~2 ontology to describe sensors and observations --- the SSN ontology. can in terms of capabilities, measurement processes, deployments. This article describes It further gives example use recent research projects.
Renewable energy sources (RES) are an essential part of building a more sustainable future, with higher diversity clean energy, reduced emissions and less dependence on finite fossil fuels such as coal, oil natural gas. The advancements in the renewable domain bring hardware efficiency lower costs, which improves likelihood wider RES adoption. However, integrating renewables photovoltaic (PV) systems current grid is still major challenge. main reason volatile, intermittent nature RES,...
This paper describes a novel approach for obtaining semantic interoperability among data sources in bottom-up, semi-automatic manner without relying on pre-existing, global models. We assume that large amounts of exist have been organized and annotated according to local schemas. Seeing semantics as form agreement, our enables the participating incrementally develop agreement an evolutionary completely decentralized process solely relies pair-wise, interactions: Participants provide...
The use of RDF data published on the Web for applications is still a cumbersome and resource-intensive task due to limited software support lack standard programming paradigms deal with everyday problems such as combination from dierent sources, object identifier consolidation, ontology alignment mediation, or plain querying filtering tasks. In this paper we present framework, Semantic Pipes, that supports fast implementation mash-ups while preserving desirable properties abstraction,...
The success of the P2P idea has created a huge diversity approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide variety algorithms, data structures, architectures been proposed. terminologies abstractions used, however, become quite inconsistent since paradigm attracted people many different communities, e.g., networking, databases, distributed systems,...
Abstract The steadily growing research interest in quantum computing—together with the accompanying technological advances realization of hardware—fuels development meaningful real-world applications, as well implementations for well-known algorithms. One most prominent examples till today is Grover’s algorithm, which can be used efficient search unstructured databases. Quantum oracles that are frequently masked black boxes play an important role algorithm. Hence, automatic generation...
Quantum information processing architectures typically only allow for nearest-neighbor entanglement creation. In many cases, this prevents the direct generation of $\mathrm{GHZ}$ states, which are commonly used communication and computation tasks. Here, we show how to obtain states between nodes in a network that connected straight line, naturally allowing them initially share linear cluster states. We prove strict upper bound $\ensuremath{\lfloor}(n+3)/2\ensuremath{\rfloor}$ on size set...
Among the open problems in P2P systems, support for nontrivial search predicates, standardized query languages, distributed processing, load balancing, and quality of results have been identified as some most relevant issues. This paper describes how range queries an important predicate can be supported a structured overlay network that provides O(log n) complexity on top trie abstraction. We provide analytical show proposed approach is efficient, supports arbitrary granularity ranges,...