University of Kaiserslautern

Displaying 1-20 of 20 results

  • White Papers // Apr 2012

    Achieving High Lifetime and Low Delay in Very Large Sensors Networks Using Mobile Sinks

    For smaller scale Wireless Sensor Networks (WSN) it has been clearly shown that a single mobile sink can be very beneficial with respect to the network lifetime. Yet, how to plan the trajectories of many mobile sinks in very large WSNs in order to simultaneously achieve lifetime and delay goals...

    Provided By University of Kaiserslautern

  • White Papers // Mar 2012

    Practical Message Manipulation Attacks in IEEE 802.15.4 Wireless Networks

    The authors assess the ability of adversaries to modify the content of messages on the physical layer of wireless networks. In contrast to related work, they consider signal overshadowing to achieve such manipulations during transmission. They present preliminary experimental results, which suggest that their approach enables deterministic message manipulations, even...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2012

    Usage of Analytic Hierarchy Process for Communication Service Selection

    Several current (e.g. TCP/IP, UDP/IP, SCTP/IP) and future (SONATE, NENA) service providers offer similar communication functionality but differ in quality on a variety of important criteria. As the number of service providers increases, the need to select the best service based on criteria for certain application requirements is increasing. However,...

    Provided By University of Kaiserslautern

  • White Papers // Sep 2011

    Verification of Actor Systems Needs Specification Techniques for Strong Causality and Hierarchical Reasoning

    Actor languages become increasingly popular for modeling and programming concurrent and distributed system. Although several foundational proof systems are available for actor systems, the authors claim that there is a need for higher-level specification and verification techniques. To clarify and substantiate this position, they introduce a simple actor language together...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2011

    Network Functional Composition: State of the Art

    Network Functional Composition is an approach for a flexible Internet architecture which decomposes the layered network stack in functional building blocks which can be loosely coupled. Functional Composition therefore enables a customized composition of functionality at the edges and in the network in respect to application specific requirements. Functional Composition...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2011

    GAPI: A G-Lab Application-to-Network Interface

    Future Internet research yields an increasing number of frameworks for new protocol stacks. Each of them defines its own API in order to reduce the networking know-how an application needs for communicating with others. Thus, networking functionality, today done by the applications themselves, is pushed down below the API. This...

    Provided By University of Kaiserslautern

  • White Papers // May 2011

    A Building Block Interaction Model for Flexible Future Internet Architectures

    Today's Internet has a static architecture that makes introducing new functionality a complex and costly task, so the Internet can not keep pace with rising demands and new network capabilities. Therefore, evolvability and flexibility are the keys to a future Internet architecture. In this paper, the authors propose a building...

    Provided By University of Kaiserslautern

  • White Papers // Apr 2011

    Planning the Trajectories of Multiple Mobile Sinks in Large-Scale, Time-Sensitive WSNs

    Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of Wireless Sensor Networks (WSNs) by avoiding the typical hot-spot problem near the sink. Besides striving for elongated lifetimes, many applications of WSNs are time-sensitive, i.e., they strongly benefit from bounds on the message transfer delay. Further,...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Self-Organizing Communication Services in Future Network Architectures

    Adding new functionality into the current Internet architecture is difficult because of the tight-coupling in network protocol stacks. One method of creating loosely-coupled network stacks is to split the functionality of the entire stack into a set of services. Each service provides a specific function known as a capability. Creating...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Functional Composition and Its Challenges

    Functional composition is an approach for a flexible network architecture which enables a customized combination of functionality with respect to application requirements. Functional composition overcomes the inflexibility of the current Internet architecture and facilitates the management of functionality within the network. Several projects have addressed this topic with different aspects,...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Self-Organizing Future Network Architectures

    The Internet has aged and outgrown its original purpose, today it has a lot of problems. In theory, most of these problems could be solved by modifying existing protocols, introducing new protocols or changing protocol interaction. The real problem of the current Internet architecture is that it offers no practical...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Tracking of Vector Field Singularities in Unstructured 3D Time-Dependent Datasets

    In this paper, the authors present an approach for monitoring the positions of vector field singularities in time-dependent datasets. The concept of singularity index is discussed and extended from the well-understood planar case to the more intricate three-dimensional setting. Assuming a tetrahedral grid with linear interpolation in space and time,...

    Provided By University of Kaiserslautern

  • White Papers // Nov 2010

    Describing and Selecting Communication Services in a Service Oriented Network Architecture

    Today networks offer communication services ranging from a rather simple and unsecure one to secure and reliable data transmission for communicating on the network. In the future, it is expected that networks will offer a large number of different communication services. With so many services available, determining which service to...

    Provided By University of Kaiserslautern

  • White Papers // Aug 2010

    Statistical Response Time Bounds in Randomly Deployed Wireless Sensor Networks

    Response time bounds are important for many application scenarios of Wireless Sensor Networks (WSN). Often, during the planning phase of a WSN its topology is not known. It rather results from a deployment process. This makes the provision of deterministic response time bounds difficult. In this paper, the authors strive...

    Provided By University of Kaiserslautern

  • White Papers // Jul 2010

    Experimental Design and Analysis of Transmission Properties in an Indoor Wireless Sensor Network

    In this paper, the authors systematically investigate different factors and their effects on the wireless transmission properties using a full-factorial experimental design of a wireless sensor network in a real-world indoor environment. They quantify the impact of primary factors such as the wireless channel, physical position, transmission power, and their...

    Provided By University of Kaiserslautern

  • White Papers // Apr 2010

    On The Development Of New Modeling Concepts For Product Lifecycle Management In Engineering Enterprises

    Fast changes in today globalized business contexts, stricter becoming product and environmental legislations, and increasing complexity of products and related nowadays flexible engineering processes are some of the drivers for a further consideration of today applied concepts of multidisciplinary Product Lifecycle Management (PLM) which leverages engineering discipline specific Product Data...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2010

    On the Way to a Wireless Network Calculus - The Single Node Case With Retransmissions

    During the last two decades, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical basis of quality of service proposals such as the...

    Provided By University of Kaiserslautern

  • White Papers // Dec 2009

    Searching for Tight Performance Bounds in Feed-Forward Networks

    Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently it was even shown to be NP-hard. The authors now address this problem in a heuristic fashion, building on a procedure for computing provably tight bounds...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2009

    A Proposal for a Notion of Timeliness in Wireless Sensor Networks

    The intrinsic properties of Wireless Sensor Networks (WSN) such as their ad-hoc infrastructure, energy constraints, and limited availability of resources, constitute an unfavorable environment for end-to-end timeliness guarantees. Many existing solutions are based on a timeliness notion borrowed from real-time systems, which can only express strict end-to-end deadlines for individual...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2009

    Self-Organized Sink Placement in Large-Scale Wireless Sensor Networks

    The deficient energy supplies of Wireless Sensor Networks (WSNs) drives network designers to optimize energy consumption in various ways. Not only with regard to the energy issue, but also with respect to system performance, the authors design a local search technique for sink placement in WSNs that tries to minimize...

    Provided By University of Kaiserslautern

  • White Papers // Aug 2010

    Statistical Response Time Bounds in Randomly Deployed Wireless Sensor Networks

    Response time bounds are important for many application scenarios of Wireless Sensor Networks (WSN). Often, during the planning phase of a WSN its topology is not known. It rather results from a deployment process. This makes the provision of deterministic response time bounds difficult. In this paper, the authors strive...

    Provided By University of Kaiserslautern

  • White Papers // Dec 2009

    Searching for Tight Performance Bounds in Feed-Forward Networks

    Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently it was even shown to be NP-hard. The authors now address this problem in a heuristic fashion, building on a procedure for computing provably tight bounds...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2010

    On the Way to a Wireless Network Calculus - The Single Node Case With Retransmissions

    During the last two decades, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical basis of quality of service proposals such as the...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2009

    Self-Organized Sink Placement in Large-Scale Wireless Sensor Networks

    The deficient energy supplies of Wireless Sensor Networks (WSNs) drives network designers to optimize energy consumption in various ways. Not only with regard to the energy issue, but also with respect to system performance, the authors design a local search technique for sink placement in WSNs that tries to minimize...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2011

    GAPI: A G-Lab Application-to-Network Interface

    Future Internet research yields an increasing number of frameworks for new protocol stacks. Each of them defines its own API in order to reduce the networking know-how an application needs for communicating with others. Thus, networking functionality, today done by the applications themselves, is pushed down below the API. This...

    Provided By University of Kaiserslautern

  • White Papers // May 2011

    A Building Block Interaction Model for Flexible Future Internet Architectures

    Today's Internet has a static architecture that makes introducing new functionality a complex and costly task, so the Internet can not keep pace with rising demands and new network capabilities. Therefore, evolvability and flexibility are the keys to a future Internet architecture. In this paper, the authors propose a building...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Functional Composition and Its Challenges

    Functional composition is an approach for a flexible network architecture which enables a customized combination of functionality with respect to application requirements. Functional composition overcomes the inflexibility of the current Internet architecture and facilitates the management of functionality within the network. Several projects have addressed this topic with different aspects,...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Self-Organizing Future Network Architectures

    The Internet has aged and outgrown its original purpose, today it has a lot of problems. In theory, most of these problems could be solved by modifying existing protocols, introducing new protocols or changing protocol interaction. The real problem of the current Internet architecture is that it offers no practical...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Self-Organizing Communication Services in Future Network Architectures

    Adding new functionality into the current Internet architecture is difficult because of the tight-coupling in network protocol stacks. One method of creating loosely-coupled network stacks is to split the functionality of the entire stack into a set of services. Each service provides a specific function known as a capability. Creating...

    Provided By University of Kaiserslautern

  • White Papers // Nov 2010

    Describing and Selecting Communication Services in a Service Oriented Network Architecture

    Today networks offer communication services ranging from a rather simple and unsecure one to secure and reliable data transmission for communicating on the network. In the future, it is expected that networks will offer a large number of different communication services. With so many services available, determining which service to...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2011

    Network Functional Composition: State of the Art

    Network Functional Composition is an approach for a flexible Internet architecture which decomposes the layered network stack in functional building blocks which can be loosely coupled. Functional Composition therefore enables a customized composition of functionality at the edges and in the network in respect to application specific requirements. Functional Composition...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2012

    Usage of Analytic Hierarchy Process for Communication Service Selection

    Several current (e.g. TCP/IP, UDP/IP, SCTP/IP) and future (SONATE, NENA) service providers offer similar communication functionality but differ in quality on a variety of important criteria. As the number of service providers increases, the need to select the best service based on criteria for certain application requirements is increasing. However,...

    Provided By University of Kaiserslautern

  • White Papers // Jun 2009

    A Proposal for a Notion of Timeliness in Wireless Sensor Networks

    The intrinsic properties of Wireless Sensor Networks (WSN) such as their ad-hoc infrastructure, energy constraints, and limited availability of resources, constitute an unfavorable environment for end-to-end timeliness guarantees. Many existing solutions are based on a timeliness notion borrowed from real-time systems, which can only express strict end-to-end deadlines for individual...

    Provided By University of Kaiserslautern

  • White Papers // Apr 2010

    On The Development Of New Modeling Concepts For Product Lifecycle Management In Engineering Enterprises

    Fast changes in today globalized business contexts, stricter becoming product and environmental legislations, and increasing complexity of products and related nowadays flexible engineering processes are some of the drivers for a further consideration of today applied concepts of multidisciplinary Product Lifecycle Management (PLM) which leverages engineering discipline specific Product Data...

    Provided By University of Kaiserslautern

  • White Papers // Jan 2011

    Tracking of Vector Field Singularities in Unstructured 3D Time-Dependent Datasets

    In this paper, the authors present an approach for monitoring the positions of vector field singularities in time-dependent datasets. The concept of singularity index is discussed and extended from the well-understood planar case to the more intricate three-dimensional setting. Assuming a tetrahedral grid with linear interpolation in space and time,...

    Provided By University of Kaiserslautern

  • White Papers // Jul 2010

    Experimental Design and Analysis of Transmission Properties in an Indoor Wireless Sensor Network

    In this paper, the authors systematically investigate different factors and their effects on the wireless transmission properties using a full-factorial experimental design of a wireless sensor network in a real-world indoor environment. They quantify the impact of primary factors such as the wireless channel, physical position, transmission power, and their...

    Provided By University of Kaiserslautern

  • White Papers // Sep 2011

    Verification of Actor Systems Needs Specification Techniques for Strong Causality and Hierarchical Reasoning

    Actor languages become increasingly popular for modeling and programming concurrent and distributed system. Although several foundational proof systems are available for actor systems, the authors claim that there is a need for higher-level specification and verification techniques. To clarify and substantiate this position, they introduce a simple actor language together...

    Provided By University of Kaiserslautern

  • White Papers // Apr 2012

    Achieving High Lifetime and Low Delay in Very Large Sensors Networks Using Mobile Sinks

    For smaller scale Wireless Sensor Networks (WSN) it has been clearly shown that a single mobile sink can be very beneficial with respect to the network lifetime. Yet, how to plan the trajectories of many mobile sinks in very large WSNs in order to simultaneously achieve lifetime and delay goals...

    Provided By University of Kaiserslautern

  • White Papers // Mar 2012

    Practical Message Manipulation Attacks in IEEE 802.15.4 Wireless Networks

    The authors assess the ability of adversaries to modify the content of messages on the physical layer of wireless networks. In contrast to related work, they consider signal overshadowing to achieve such manipulations during transmission. They present preliminary experimental results, which suggest that their approach enables deterministic message manipulations, even...

    Provided By University of Kaiserslautern

  • White Papers // Apr 2011

    Planning the Trajectories of Multiple Mobile Sinks in Large-Scale, Time-Sensitive WSNs

    Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of Wireless Sensor Networks (WSNs) by avoiding the typical hot-spot problem near the sink. Besides striving for elongated lifetimes, many applications of WSNs are time-sensitive, i.e., they strongly benefit from bounds on the message transfer delay. Further,...

    Provided By University of Kaiserslautern