FG Verteilte Systeme und Betriebssysteme
Refine
Year of publication
- 2015 (10) (remove)
Document Type
Language
- English (10) (remove)
Keywords
Institute
Today's applications and services become more dependent on fast wireless communication, for the upcoming years data-rate demands of 100Gbit/s can be easily expected. However, fulfilling that demand is a task which cannot simply be solved by upscaling existing technologies. While most of the research tackles the challenges regarding the transmission technology from the physical layer up to base-band processing, we focus on the challenges concerning the handling of that vast amount of data. The overall goal is to bring together the transmission technology with the operating system to create a suitable end-to-end communication solution.
In this paper we argue that communication can be understood as a soft-realtime problem and how that helps introducing parallelism into protocol-processing.
Experiments have shown that the number of asymmetric and unidirectional links often exceeds the number of bidirectional ones, especially in the transitional area of the communication range of wireless sensor nodes. Still, most of today’s routing protocols ignore their existence or try to remove their implications. Also, links are not stable over time, and routes become unusable often, resulting in a need for new routing protocols that can handle highly dynamic links and use unidirectional links to their advantage. At Sensorcomm 2014, we presented BuckshotDV, a routing protocol which is resilient against link fluctuations and uses the longer reach of unidirectional links to increase its performance. Furthermore, its distance vector nature makes it scalable for large sensor networks. This paper is an extended version which adds some implementation details and the evaluation of BuckshotDV in two more application scenarios.
Nodes within sensor networks often have tight bound goals for the lifetime while running from a non-renewable energy source. Variations within the hardware or induced by the software complicate the prediction of the energy consumption. Additionally, batteries are vulnerable to temperature and non-linear effects. To reach certain lifetime goals under these influences without sacrificing energy due to pessimistic estimations, online energy management is necessary. At Sensorcomm 2015 we presented policies to control the behavior of applications and devices using energy budgets. This paper is an extended version which adds further details and the evaluation of the proposed dynamic energy management in a real-world scenario.
In this paper, we present an approach to support
transaction-based spatial-temporal programming of mobile robot
swarms on a systemic level. We introduce a programming model
for swarms of mobile robots. Swarm applications consist of
concurrent, distributed and context-aware actions. We provide
distributed transactions in order to guarantee atomic execution of
a set of dependent actions. We distinguish between schedulability
and executability of a set of actions. In order to guarantee exe-
cutability of a distributed transaction of spatial-temporal actions,
we present the concept of path alternatives and a time-based two-
phase commit protocol in order to assure consistency. We show
the feasibility of our approach by a proof-of-concept.
Nodes within sensor networks often have tight bound goals for the lifetime while running from a non-renewable energy source. Variations within the hardware or induced by the software complicate the prediction of the energy consumption. Additionally, batteries are vulnerable to temperature and non-linear effects. To reach certain lifetime goals under these influences without sacrificing energy due to pessimistic estimations, online energy management is necessary. In this paper, we present policies to control the behavior of applications and devices using energy budgets. First experiments yield promising results, with nodes reaching their lifetime goals while maintaining a high application quality.