A Communication Protocol for Clouds of Mobile Robots
01 Jun 1998-pp 310-318
TL;DR: A new communication protocol is presented that solves data transfer problems, like packet routing, in an ad-hoc network used to control a cloud of robots and results to be efficient in a situation where a dedicated node controls the activity of all the robots, therefore being one of the end-points of any data interchange.
Abstract: Mobile robots usually employ dedicated networks to share data and control in an open environment. These networks, called adhoc networks, are multi-hop wireless networks where the mobile devices communicate using a shared, low power, low bandwidth channel. Since the classical routing algorithms of the wired networks cannot be used, new communication and routing protocols are being developed. In this paper we present a new communication protocol that solves data transfer problems, like packet routing, in an ad-hoc network used to control a cloud of robots. This protocol results to be efficient in a situation where a dedicated node, called the coordinator, controls the activity of all the robots, therefore being one of the end-points of any data interchange.
Citations
More filters
TL;DR: The simulator is written in Java and is based on the SimJava tool and allows to be adapted to various routing protocols and also allows considering other relevant aspects to ad hoc networks, like mobility patterns and traffic generation patterns.
182 citations
Cites background or methods from "A Communication Protocol for Clouds..."
...As Section 3 illustrates, ANEJOS is based on a few basic classes which models the communication medium, the mobile devices and the interchanged messages....
[...]
...ANEJOS shared our models with other researchers through the internet, we can use Java applets inside HTML pages containing the whole simulator....
[...]
01 Jan 2001
TL;DR: The simulator is written in Java and is based on the SimJava tool and allows to be adapted to various routing protocols and also allows considering other relevant aspects to ad hoc networks, like mobility patterns and traffic generation patterns.
Abstract: Ad hoc networks are multi-hop wireless networks where mobile devices communicate using a shared, low power, low bandwidth channel without any wired infrastructure: each node acts also as a router of its neighbors. Ad hoc networks protocol design is still a new and growing research area; there currently is an IETF Working Group working on the definition of a standard for such networks. Various proposals are being evaluated and the need for a common comparison framework arises. This paper presents a simulator called ANEJOS (ad hoc networks Java simulator). The simulator is written in Java and is based on the SimJava tool and allows to be adapted to various routing protocols. It also allows considering other relevant aspects to ad hoc networks, like mobility patterns and traffic generation patterns. ANEJOS shared our models with other researchers through the internet, we can use Java applets inside HTML pages containing the whole simulator. © 2001 Elsevier Science B.V. All rights reserved.
7 citations
References
More filters
09 Apr 1997
TL;DR: The proposed protocol is a new distributed routing protocol for mobile, multihop, wireless networks that is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
Abstract: We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA).
2,211 citations
"A Communication Protocol for Clouds..." refers background in this paper
...Other extends the source-routing mechanism in the path- finding task like in [3] and [ 9 ]....
[...]
[...]
01 Oct 1996
TL;DR: This document specifies protocol enhancements that allow transparent routing of IP datagrams to mobile nodes in the Internet.
Abstract: This document specifies protocol enhancements that allow transparent routing of IP datagrams to mobile nodes in the Internet. Each mobile node is always identified by its home address, regardless of its current point of attachment to the Internet. While situated away from its home, a mobile node is also associated with a care-of address, which provides information about its current point of attachment to the Internet. The protocol provides for registering the care-of address with a home agent. The home agent sends datagrams destined for the mobile node through a tunnel to the care- of address. After arriving at the end of the tunnel, each datagram is then delivered to the mobile node.
2,094 citations
"A Communication Protocol for Clouds..." refers background in this paper
...The mobile-IP (see [1]) standard of the Internet Engineering Task Force (IETF), is an example of a protocol that solves the mobility aspects in a trans-...
[...]
TL;DR: WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.
Abstract: We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.
1,452 citations
Additional excerpts
...and [8])....
[...]
TL;DR: A loop-free, distributed routing protocol for mobile packet radio networks intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow to make one of the existing protocols for a nearly-static topology applicable.
Abstract: We present a loop-free, distributed routing protocol for mobile packet radio networks. The protocol is intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow as to make one of the existing protocols for a nearly-static topology applicable. The routing algorithm adapts asynchronously in a distributed fashion to arbitrary changes in topology in the absence of global topological knowledge. The protocol's uniqueness stems from its ability to maintain source-initiated, loop-free multipath routing only to desired destinations with minimal overhead in a randomly varying topology. The protocol's performance, measured in terms of end-to-end packet delay and throughput, is compared with that of pure flooding and an alternative algorithm which is well-suited to the high-rate topological change environment envisioned here. For each protocol, emphasis is placed on examining how these performance measures vary as a function of the rate of topological changes, network topology, and message traffic level. The results indicate the new protocol generally outperforms the alternative protocol at all rates of change for heavy traffic conditions, whereas the opposite is true for light traffic. Both protocols significantly outperform flooding for all rates of change except at ultra-high rates where all algorithms collapse. The network topology, whether dense or sparsely connected, is not seen to be a major factor in the relative performance of the algorithms.
438 citations
"A Communication Protocol for Clouds..." refers methods in this paper
...Some of them use a modified version of the Bellman-Ford distributed distance-vector algorithm (see [7, 2])....
[...]
TL;DR: It is argued that flooding schemes have significant drawbacks for such networks, and a general class of distributed algorithms for establishing new loop-free routes to the station for any node left without a route due to changes in the network topology is proposed.
Abstract: We consider the problem of maintaining communication between the nodes of a data network and a central station in the presence of frequent topological changes as, for example, in mobile packet radio networks. We argue that flooding schemes have significant drawbacks for such networks, and propose a general class of distributed algorithms for establishing new loop-free routes to the station for any node left without a route due to changes in the network topology. By virtue of built-in redundancy, the algorithms are typically activated very infrequently and, even when they are, they do not involve any communication within the portion of the network that has not been materially affected by a topological change.
386 citations
"A Communication Protocol for Clouds..." refers background in this paper
...Other extends the source-routing mechanism in the path- finding task like in [3] and [9]....
[...]