• Deutsch
Login

OPUS

  • Home
  • Search
  • Browse
  • Publish
  • FAQ

Refine

Author

  • Furbach, Ulrich (9)
  • Staab, Steffen (8)
  • Maron, Markus (7)
  • Lautenbach, Kurt (5)
  • Baumgartner, Peter (4)
  • Read, Kevin (4)
  • Mohammed, Ammar (3)
  • Pelzer, Björn (3)
  • Scherp, Ansgar (3)
  • Bender, Markus (2)
  • Franz, Thomas (2)
  • Magnus, Sebastian (2)
  • Obermaier, Claudia (2)
  • Parreiras, Fernando Silva (2)
  • Ringelstein, Christoph (2)
  • Stolzenburg, Frieder (2)
  • Susewind, Kerstin (2)
  • Wernhard, Christoph (2)
  • Abbasi, Rabeeh (1)
  • Abert, Oliver (1)
  • Aksu, Hakan (1)
  • AlGhalibi, Maha (1)
  • Arndt, Richard (1)
  • Beuster, Gerd (1)
  • Bohdanowicz, Frank (1)
  • Bohnen, Matthias (1)
  • Brack, Marco (1)
  • Brühl, Lina (1)
  • Bzdak, Sebastian (1)
  • Dickel, Harald (1)
  • Ebert, Jürgen (1)
  • Effert, Carsten (1)
  • Falkowski, Kerstin (1)
  • Faßbender, Dennis (1)
  • Freidank, Martin (1)
  • Grewe, Dennis (1)
  • Groß-Hardt, Margret (1)
  • Groß-­Hardt, Margret (1)
  • Großmann, Eckhard (1)
  • Görlitz, Olaf (1)
  • Habelitz, Thorsten (1)
  • Hardman, Lynda (1)
  • Hartenfels, Carsten (1)
  • Heinz, Marcel (1)
  • Held, Andreas (1)
  • Hopfgartner, Frank (1)
  • Häselich, Marcel (1)
  • Kasten, Andreas (1)
  • Klasen, Volker (1)
  • Klebanov, Vladimir (1)
  • Kleemann, Thomas (1)
  • Koch, Andreas (1)
  • Lochmann, Gerrit (1)
  • Mann, David (1)
  • Monreal, Michael (1)
  • Murray, Jan (1)
  • Naveed, Nasir (1)
  • Neumann, Florentin (1)
  • Pek, Ekaterina (1)
  • Pinl, Alexander (1)
  • Probst, Alexander (1)
  • Röttger, Diana (1)
  • Rüther, Frederik (1)
  • Saathoff, Carsten (1)
  • Schenk, Simon (1)
  • Scherer, Sabrina (1)
  • Schmidsberger, Falk (1)
  • Schmidt, Kevin (1)
  • Schmorleiz, Thomas (1)
  • Schon, Claudia (1)
  • Schon, Claudia  (1)
  • Schulze, Michael (1)
  • Schüler, Bernhard (1)
  • Sdorra, Bastian (1)
  • Sennikova, Tatiana (1)
  • Sinner, Alex (1)
  • Sizov, Sergej (1)
  • Starek, Jürgen (1)
  • Steigner, Christoph (1)
  • Strauch, Maximilian (1)
  • Surberg, Freya (1)
  • Tinelli, Cesare (1)
  • Tonkova, Vyara (1)
  • Troncy, Raphael (1)
  • Varanovich, Andrei (1)
  • Wagner, Marco Andreas (1)
  • Walber, Tina (1)
  • Walter, Tobias (1)
  • Winter, Andreas (1)
  • Zaggl, Michael (1)
- less

Year of publication

  • 2007 (14)
  • 2010 (10)
  • 2008 (7)
  • 2015 (7)
  • 2011 (6)
  • 2016 (6)
  • 2009 (5)
  • 2012 (4)
  • 2014 (4)
  • 2004 (3)
+ more

Document Type

  • Part of Periodical (36)
  • Doctoral Thesis (24)
  • Master's Thesis (8)
  • Diploma Thesis (4)
  • Study Thesis (4)
  • Bachelor Thesis (2)

Language

  • English (78) (remove)

Keywords

  • Bluetooth (4)
  • Software Engineering (4)
  • Knowledge Compilation (3)
  • Semantic Web (3)
  • Campus Information System (2)
  • E-KRHyper (2)
  • Equality (2)
  • Modellgetriebene Entwicklung (2)
  • Ontology (2)
  • Petri-Netze (2)
  • Theorem Proving (2)
  • University (2)
  • constraint logic programming (2)
  • hybrid automata (2)
  • probability propagation nets (2)
  • API (1)
  • API analysis (1)
  • API-Analyse (1)
  • AUTOSAR (1)
  • Abduktion <Logik> (1)
  • Ad-hoc-Netz (1)
  • Adaptation (1)
  • Algorithm Engineering (1)
  • Algorithmische Geometrie (1)
  • Anpassung (1)
  • Architektur <Informatik> (1)
  • Auditing (1)
  • Augmented Reality (1)
  • Automated Theorem Proving (1)
  • Automated Theorem Proving Systems (1)
  • Automotive Systems (1)
  • Bayes Procedures (1)
  • Beaconless (1)
  • Befahrbarkeit (1)
  • Border Gateway Protocol (1)
  • Border Gateway Protocol 4 (1)
  • Calculus (1)
  • Communication Networks (1)
  • Computer Security (1)
  • Computersicherheit (1)
  • Computersimulation (1)
  • Conference (1)
  • Connected Vehicles (1)
  • Context-aware processes (1)
  • DPLL procedure (1)
  • Data Mining (1)
  • Deduktion (1)
  • Description Logics (1)
  • Destiny (1)
  • Developer profiling (1)
  • Dijkstras Algorithmus (1)
  • Dimension 3 (1)
  • Diskrete Simulation (1)
  • Distributed Algorithm (1)
  • Distributed Environments (1)
  • Distributed process execution (1)
  • Drahtloses Sensorsystem (1)
  • Drahtloses vermachtes Netz (1)
  • Driver Assistance Systems (1)
  • E-Participation (1)
  • Ebener Graph  (1)
  • Empirical Studies (1)
  • Emulation (1)
  • Enhanced Reality (1)
  • Enterprise Architecture Framework (1)
  • Entwickler Profil (1)
  • Fahrzeug (1)
  • Formal Methods (1)
  • Formale Methoden (1)
  • Formale Ontologie (1)
  • Fragebeantwortung (1)
  • Gelände (1)
  • Geographic routing (1)
  • Geometric spanner (1)
  • Graph (1)
  • Grounded Theory (1)
  • Hindernis (1)
  • Horn Clauses (1)
  • Human-Computer Interaction (1)
  • Hyper Tableau Calculus (1)
  • IASON (1)
  • IT Guru (1)
  • IT-Security (1)
  • Information Centric Networking (1)
  • Information Retrieval (1)
  • Intelligent Information Network (1)
  • Interactive Video Retrieval (1)
  • JML (1)
  • Java (1)
  • Java Modeling Language (1)
  • Java. Programmiersprache (1)
  • KRHyper (1)
  • Klassifikation (1)
  • Knowledge (1)
  • Knowledge Engineering (1)
  • Komplexität / Algorithmus (1)
  • Laser (1)
  • Local algorithm (1)
  • Logischer Schluss (1)
  • MIA (1)
  • MPEG-7 (1)
  • MSR (1)
  • Mensch-Maschine-Interaktion (1)
  • Metamodel (1)
  • Mining (1)
  • Mining Software Repositories (1)
  • Mobile Information Systems (1)
  • Multi-robot System (1)
  • Multiagent System (1)
  • Multiagentensysteme (1)
  • Nachbarschaftsgraph  (1)
  • Named Function Networking (1)
  • Netzwerk (1)
  • Netzwerkanalyse (1)
  • Netzwerktopologie (1)
  • Neuronales Netz (1)
  • OPNET (1)
  • OWL <Informatik> (1)
  • Ontologie <Wissensverarbeitung> (1)
  • Oracle Generation (1)
  • Oraklegenerierung (1)
  • Personalised Information Systems (1)
  • Petri Nets (1)
  • Petri net (1)
  • Petrinetz (1)
  • Placement Strategies (1)
  • Planar graphs (1)
  • Policy Language (1)
  • Proactive Caching (1)
  • Probability (1)
  • Probability propagation nets (1)
  • Process (1)
  • Process tracing (1)
  • Propagation (1)
  • Provenance (1)
  • Prädikatenlogik (1)
  • Quasi unit disk graph (1)
  • Query Expansion (1)
  • RDF Graphs (1)
  • RDF modeling (1)
  • Reactive algorithm (1)
  • Reference Model (1)
  • Relevance Feedback (1)
  • Resource Description Framework (RDF) (1)
  • Robocup 2008 (1)
  • Roboter (1)
  • Routing (1)
  • Routing Information Protocol (RIP) (1)
  • Routing Loops (1)
  • Routing with Metric based Topology Investigation (RMTI) (1)
  • SOA (1)
  • SPARQL (1)
  • Schlussfolgern (1)
  • Security Requirements (1)
  • Semantic Web Data (1)
  • Semantics (1)
  • Serviceorientierte Architektur (1)
  • Software Language (1)
  • Software Repositories (1)
  • Software Technology (1)
  • Softwarearchitektur (1)
  • Softwaretest (1)
  • Softwaretesting (1)
  • Specification (1)
  • Spezifikation (1)
  • Stochastic Logic (1)
  • Straßenzustand (1)
  • TAP (1)
  • TRECVID (1)
  • Tableau Calculus (1)
  • Technologischer Raum (1)
  • Test Generation (1)
  • Testgenerierung (1)
  • Theorem prover (1)
  • Theorembeweiser (1)
  • Tokens (1)
  • UML (1)
  • Unified Modeling Language (UML ) (1)
  • Unit disk graph (1)
  • Vegetation distribution (1)
  • Verifikation (1)
  • Verteilter Algorithmus (1)
  • Wahrscheinlichkeitsrechnung (1)
  • Web Ontology Language (OWL) (1)
  • Werbung (1)
  • Wireless sensor network (1)
  • Wissensmanagement (1)
  • World Wide Web 2.0 (1)
  • XML (1)
  • Zusammenhängender Graph (1)
  • automated theorem prover (1)
  • backpropagation (1)
  • bias (1)
  • classification (1)
  • concurrency (1)
  • data mining (1)
  • deductive (1)
  • description logic (1)
  • e-learning (1)
  • event model (1)
  • event-based systems (1)
  • first-order logic (1)
  • folksonomies (1)
  • gaze information (1)
  • grassland (1)
  • hybrid systems (1)
  • hybride Automaten (1)
  • iCity project (1)
  • image semantics (1)
  • information retrieval (1)
  • knowledge management system (1)
  • landmarks (1)
  • living book (1)
  • model generation (1)
  • multi-agent systems (1)
  • multiagent systems (1)
  • networks (1)
  • neural (1)
  • ontology (1)
  • personal information management (1)
  • persönliches Informationsmanagement (1)
  • privacy protection (1)
  • public key infrastructure (1)
  • question answering (1)
  • reasoning (1)
  • recurrent (1)
  • semantic desktop (1)
  • semantics (1)
  • semantischer Desktop (1)
  • sequent calculi (1)
  • simulation (1)
  • summative evaluation (1)
  • tag recommendation (1)
  • tagging (1)
  • vegetation modeling (1)
  • verification (1)
  • web 2.0 (1)
- less

Institute

  • Institut für Informatik (78) (remove)

78 search hits

  • 1 to 10
  • 10
  • 20
  • 50
  • 100

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Knowledge engineering for software languages and software technologies (2022)
Heinz, Marcel
For software engineers, conceptually understanding the tools they are using in the context of their projects is a daily challenge and a prerequisite for complex tasks. Textual explanations and code examples serve as knowledge resources for understanding software languages and software technologies. This thesis describes research on integrating and interconnecting existing knowledge resources, which can then be used to assist with understanding and comparing software languages and software technologies on a conceptual level. We consider the following broad research questions that we later refine: What knowledge resources can be systematically reused for recovering structured knowledge and how? What vocabulary already exists in literature that is used to express conceptual knowledge? How can we reuse the online encyclopedia Wikipedia? How can we detect and report on instances of technology usage? How can we assure reproducibility as the central quality factor of any construction process for knowledge artifacts? As qualitative research, we describe methodologies to recover knowledge resources by i.) systematically studying literature, ii.) mining Wikipedia, iii.) mining available textual explanations and code examples of technology usage. The theoretical findings are backed by case studies. As research contributions, we have recovered i.) a reference semantics of vocabulary for describing software technology usage with an emphasis on software languages, ii.) an annotated corpus of Wikipedia articles on software languages, iii.) insights into technology usage on GitHub with regard to a catalog of pattern and iv.) megamodels of technology usage that are interconnected with existing textual explanations and code examples.
Emotion and Sentiment Detection in Unstructured Social Data (2022)
AlGhalibi, Maha
Social media provides a powerful way for people to share opinions and sentiments about a specific topic, allowing others to benefit from these thoughts and feelings. This procedure generates a huge amount of unstructured data, such as texts, images, and references that are constantly increasing through daily comments to related discussions. However, the vast amount of unstructured data presents risks to the information-extraction process, and so decision making becomes highly challenging. This is because data overload may cause the loss of useful data due to its inappropriate presentation and its accumulation. To this extent, this thesis contributed to the field of analyzing and detecting feelings in images and texts. And that by extracting the feelings and opinions hidden in a huge collection of image data and texts on social networks After that, these feelings are classified into positive, negative, or neutral, according to the features of the classified data. The process of extracting these feelings greatly helps in decision-making processes on various topics as will be explained in the first chapter of the thesis. A system has been built that can classify the feelings inherent in the images and texts on social media sites, such as people’s opinions about products and companies, personal posts, and general messages. This thesis begins by introducing a new method of reducing the dimension of text data based on data-mining approaches and then examines the sentiment based on neural and deep neural network classification algorithms. Subsequently, in contrast to sentiment analysis research in text datasets, we examine sentiment expression and polarity classification within and across image datasets by building deep neural networks based on the attention mechanism.
Latency Reduction for Real-Time Rendering and its Application to VR Training Scenarios (2021)
Lochmann, Gerrit
Virtual reality is a growing field of interest as it provides a particular intuitive way of user-interaction. However, there are still open technical issues regarding latency — the delay between interaction and display reaction — and the trade-off between visual quality and frame-rate of real-time graphics, especially when taking visual effects like specular and semi-transparent surfaces and volumes into account. One solution, a distributed rendering setup, is presented in this thesis, in which the image synthesis is divided into an accurate but costly physically based rendering thread with a low refresh rate and a fast reprojection thread to remain a responsive interactivity with a high frame-rate. Two novel reprojection techniques are proposed that cover reflections and refractions produced by surface ray-tracing as well as volumetric light transport generated by volume ray-marching. The introduced setup can enhance the VR experience within several domains. In this thesis, three innovative training applications have been realized to investigate the added value of virtual reality to the three learning stages of observation, interaction and collaboration. For each stage an interdisciplinary curriculum, currently taught with traditional media, was transferred to a VR setting in order to investigate how virtual reality is capable of providing a natural, flexible and efficient learning environment
Proactive Content Placement in Information-Centric Connected Vehicle Environments (2021)
Grewe, Dennis
Connected vehicles will have a tremendous impact on tomorrow’s mobility solutions. Such systems will heavily rely on information delivery in time to ensure the functional reliability, security and safety. However, the host-centric communication model of today’s networks questions efficient data dissemination in a scale, especially in networks characterized by a high degree of mobility. The Information-Centric Networking (ICN) paradigm has evolved as a promising candidate for the next generation of network architectures. Based on a loosely coupled communication model, the in-network processing and caching capabilities of ICNs are promising to solve the challenges set by connected vehicular systems. In such networks, a special class of caching strategies which take action by placing a consumer’s anticipated content actively at the right network nodes in time are promising to reduce the data delivery time. This thesis contributes to the research in active placement strategies in information-centric and computation-centric vehicle networks for providing dynamic access to content and computation results. By analyzing different vehicular applications and their requirements, novel caching strategies are developed in order to reduce the time of content retrieval. The caching strategies are compared and evaluated against the state-of-the-art in both extensive simulations as well as real world deployments. The results are showing performance improvements by increasing the content retrieval (availability of specific data increased up to 35% compared to state-of-the-art caching strategies), and reducing the delivery times (roughly double the number of data retrieval from neighboring nodes). However, storing content actively in connected vehicle networks raises questions regarding security and privacy. In the second part of the thesis, an access control framework for information-centric connected vehicles is presented. Finally, open security issues and research directions in executing computations at the edge of connected vehicle networks are presented.
Nuclear Potential Clustering of Data (2020)
Tonkova, Vyara
Initial goal of the current dissertation was the determination of image-based biomarkers sensitive for neurodegenerative processes in the human brain. One such process is the demyelination of neural cells characteristic for Multiple sclerosis (MS) - the most common neurological disease in young adults for which there is no cure yet. Conventional MRI techniques are very effective in localizing areas of brain tissue damage and are thus a reliable tool for the initial MS diagnosis. However, a mismatch between the clinical fndings and the visualized areas of damage is observed, which renders the use of the standard MRI diffcult for the objective disease monitoring and therapy evaluation. To address this problem, a novel algorithm for the fast mapping of myelin water content using standard multiecho gradient echo acquisitions of the human brain is developed in the current work. The method extents a previously published approach for the simultaneous measurement of brain T1, T∗ 2 and total water content. Employing the multiexponential T∗ 2 decay signal of myelinated tissue, myelin water content is measured based on the quantifcation of two water pools (myelin water and rest) with different relaxation times. Whole brain in vivo myelin water content maps are acquired in 10 healthy controls and one subject with MS. The in vivo results obtained are consistent with previous reports. The acquired quantitative data have a high potential in the context of MS. However, the parameters estimated in a multiparametric acquisition are correlated and constitute therefore an ill-posed, nontrivial data analysis problem. Motivated by this specific problem, a new data clustering approach is developed called Nuclear Potential Clustering, NPC. It is suitable for the explorative analysis of arbitrary dimensional and possibly correlated data without a priori assumptions about its structure. The developed algorithm is based on a concept adapted from nuclear physics. To partition the data, the dynamic behavior of electrically even charged nucleons interacting in a d-dimensional feature space is modeled. An adaptive nuclear potential, comprised of a short-range attractive (Strong interaction) and a long-range repulsive term (Coulomb potential), is assigned to each data point. Thus, nucleons that are densely distributed in space fuse to build nuclei (clusters), whereas single point clusters are repelled (noise). The algorithm is optimized and tested in an extensive study with a series of synthetic datasets as well as the Iris data. The results show that it can robustly identify clusters even when complex configurations and noise are present. Finally, to address the initial goal, quantitative MRI data of 42 patients are analyzed employing NPC. A series of experiments with different sets of image-based features show a consistent grouping tendency: younger patients with low disease grade are recognized as cohesive clusters, while those of higher age and impairment are recognized as outliers. This allows for the definition of a reference region in a feature space associated with phenotypic data. Tracking of the individual's positions therein can disclose patients at risk and be employed for therapy evaluation.
Software chrestomathy as a knowledge-driven research infrastructure for software engineering (2018)
Varanovich, Andrei
The term “Software Chrestomaty” is defined as a collection of software systems meant to be useful in learning about or gaining insight into software languages, software technologies, software concepts, programming, and software engineering. 101companies software chrestomathy is a community project with the attributes of a Research 2.0 infrastructure for various stakeholders in software languages and technology communities. The core of 101companies combines a semantic wiki and confederated open source repositories. We designed and developed an integrated ontology-based knowledge base about software languages and technologies. The knowledge is created by the community of contributors and supported with a running example and structured documentation. The complete ecosystem is exposed by using Linked Data principles and equipped with the additional metadata about individual artifacts. Within the context of software chrestomathy we explored a new type of software architecture – linguistic architecture that is targeted on the language and technology relationships within a software product and based on the megamodels. Our approach to documentation of the software systems is highly structured and makes use of the concepts of the newly developed megamodeling language MegaL. We “connect” an emerging ontology with the megamodeling artifacts to raise the cognitive value of the linguistic architecture.
OSS vulnerabilities through islands of knowledge (2017)
Brack, Marco
This thesis proposes the use of MSR (Mining Software Repositories) techniques to identify software developers with exclusive expertise about specific APIs and programming domains in software repositories. A pilot Tool for finding such “Islands of Knowledge” in Node.js projects is presented and applied in a case study to the 180 most popular npm packages. It is found that on average each package has 2.3 Islands of Knowledge, which is possibly explained by the finding that npm packages tend to have only one main contributor. In a survey, the maintainers of 50 packages are contacted and asked for opinions on the results produced by the Tool. Together with their responses, this thesis reports on experiences made with the pilot Tool and how future iterations could produce even more accurate statements about programming expertise distribution in developer teams.
Semantics4J - Programming language integrated queries and types (2017)
Hartenfels, Carsten
Using semantic data from general-purpose programming languages does not provide the unified experience one would want for such an application. Static error checking is lacking, especially with regards to static typing of the data. Based on the previous work of λ-DL, which integrates semantic queries and concepts as types into a typed λ-calculus, this work takes its ideas a step further to meld them into a real-world programming language. This thesis explores how λ-DL's features can be extended and integrated into an existing language, researches an appropriate extension mechanism and produces Semantics4J, a JastAdd-based Java language semantic data extension for type-safe OWL programming, together with examples of its usage.
Techniques for optimized reasoning in description logic knowledge bases (2016)
Schon, Claudia
One of the main goals of the artificial intelligence community is to create machines able to reason with dynamically changing knowledge. To achieve this goal, a multitude of different problems have to be solved, of which many have been addressed in the various sub-disciplines of artificial intelligence, like automated reasoning and machine learning. The thesis at hand focuses on the automated reasoning aspects of these problems and address two of the problems which have to be overcome to reach the afore-mentioned goal, namely 1. the fact that reasoning in logical knowledge bases is intractable and 2. the fact that applying changes to formalized knowledge can easily introduce inconsistencies, which leads to unwanted results in most scenarios. To ease the intractability of logical reasoning, I suggest to adapt a technique called knowledge compilation, known from propositional logic, to description logic knowledge bases. The basic idea of this technique is to compile the given knowledge base into a normal form which allows to answer queries efficiently. This compilation step is very expensive but has to be performed only once and as soon as the result of this step is used to answer many queries, the expensive compilation step gets worthwhile. In the thesis at hand, I develop a normal form, called linkless normal form, suitable for knowledge compilation for description logic knowledge bases. From a computational point of view, the linkless normal form has very nice properties which are introduced in this thesis. For the second problem, I focus on changes occurring on the instance level of description logic knowledge bases. I introduce three change operators interesting for these knowledge bases, namely deletion and insertion of assertions as well as repair of inconsistent instance bases. These change operators are defined such that in all three cases, the resulting knowledge base is ensured to be consistent and changes performed to the knowledge base are minimal. This allows us to preserve as much of the original knowledge base as possible. Furthermore, I show how these changes can be applied by using a transformation of the knowledge base. For both issues I suggest to adapt techniques successfully used in other logics to get promising methods for description logic knowledge bases.
Silence is golden: reactive local topology control and geographic routing in wireless ad hoc and sensor networks (2016)
Neumann, Florentin
Reactive local algorithms are distributed algorithms which suit the needs of battery-powered, large-scale wireless ad hoc and sensor networks particularly well. By avoiding both unnecessary wireless transmissions and proactive maintenance of neighborhood tables (i.e., beaconing), such algorithms minimize communication load and overhead, and scale well with increasing network size. This way, resources such as bandwidth and energy are saved, and the probability of message collisions is reduced, which leads to an increase in the packet reception ratio and a decrease of latencies. Currently, the two main application areas of this algorithm type are geographic routing and topology control, in particular the construction of a node's adjacency in a connected, planar representation of the network graph. Geographic routing enables wireless multi-hop communication in the absence of any network infrastructure, based on geographic node positions. The construction of planar topologies is a requirement for efficient, local solutions for a variety of algorithmic problems. This thesis contributes to reactive algorithm research in two ways, on an abstract level, as well as by the introduction of novel algorithms: For the very first time, reactive algorithms are considered as a whole and as an individual research area. A comprehensive survey of the literature is given which lists and classifies known algorithms, techniques, and application domains. Moreover, the mathematical concept of O- and Omega-reactive local topology control is introduced. This concept unambiguously distinguishes reactive from conventional, beacon-based, topology control algorithms, serves as a taxonomy for existing and prospective algorithms of this kind, and facilitates in-depth investigations of the principal power of the reactive approach, beyond analysis of concrete algorithms. Novel reactive local topology control and geographic routing algorithms are introduced under both the unit disk and quasi unit disk graph model. These algorithms compute a node's local view on connected, planar, constant stretch Euclidean and topological spanners of the underlying network graph and route messages reactively on these spanners while guaranteeing the messages' delivery. All previously known algorithms are either not reactive, or do not provide constant Euclidean and topological stretch properties. A particularly important partial result of this work is that the partial Delaunay triangulation (PDT) is a constant stretch Euclidean spanner for the unit disk graph. To conclude, this thesis provides a basis for structured and substantial research in this field and shows the reactive approach to be a powerful tool for algorithm design in wireless ad hoc and sensor networking.
  • 1 to 10

OPUS4 Logo

  • Contact
  • Imprint
  • Sitelinks