FG Verteilte Systeme und Betriebssysteme
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.
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.
Experiments with wireless sensor networks have shown that links are often asymmetric or unidirectional. This represents a serious problem for many routing protocols, which often depend on bidirectional links. Routing protocols that can use unidirectional links often induce a high overhead. To overcome this problem we introduced Unidirectional Link Triangle Routing, a routing protocol, which uses neighborhood information, gathered actively or passively, to route around unidirectional links. In this paper, we describe Unidirectional Link Triangle Routing in further detail and present additional evaluation results from different application scenarios.
Experiments with wireless sensor networks have shown that asymmetric and unidirectional links do not only exist, but are indeed quite common. Still, many people argue that the gain in connectivity is not worth the effort of making them usable for routing protocols. In this paper, we follow the opposite approach and introduce Unidirectional Link Triangle Routing, which reduces the overhead and, therefore, makes unidirectional links usable on the routing layer.
Experiments have shown that the number of asym- metric 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. In this paper, we present 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.