In this paper we present a new model able to combine quality of service and mobility aspects in wireless ATM networks. Namely, besides the hop count and load parameters of the basic ATM layouts, we introduce a new notion of distance, that estimates the time needed to reconstruct the virtual channel of a wireless user when it moves through the...
-
November 2002 (v1)ReportUploaded on: December 3, 2022
-
2017 (v1)Journal article
Consider a set of mobile robots placed on distinct nodes of a discrete, anonymous, and bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the size of the ring and which nodes are either occupied by robots or empty. Based on the observed configuration, it decides whether to move to one of its adjacent nodes...
Uploaded on: February 28, 2023 -
January 2014 (v1)Conference paper
Consider a set of mobile robots with minimal capabilities placed over distinct nodes of a discrete anonymous ring. Asynchronously, each robot takes a snapshot of the ring, determining which nodes are either occupied by robots or empty. Based on the observed configuration, it decides whether to move to one of its adjacent nodes or not. In the...
Uploaded on: December 3, 2022 -
2013 (v1)Report
Consider a set of mobile robots with minimal capabilities placed over distinct nodes of a discrete anonymous ring. They operate on the basis of the so called \emph{Look}-\emph{Compute}-\emph{Move} cycle. Asynchronously, each robot takes a snapshot of the ring, determining which nodes are either occupied by robots or empty. Based on the observed...
Uploaded on: December 4, 2022 -
January 2014 (v1)Conference paper
Consider a set of mobile robots with minimal capabilities placed over distinct nodes of a discrete anonymous ring. Asynchronously, each robot takes a snapshot of the ring, determining which nodes are either occupied by robots or empty. Based on the observed configuration, it decides whether to move to one of its adjacent nodes or not. In the...
Uploaded on: October 11, 2023 -
May 14, 2012 (v1)Report
A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as the \emph{gathering}. Robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to...
Uploaded on: December 3, 2022 -
June 26, 2011 (v1)Conference paper
The paper deals with a recent model of robot-based computing which makes use of identical, memoryless mobile robots placed on nodes of anonymous graphs. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of its...
Uploaded on: December 3, 2022 -
February 21, 2011 (v1)Conference paper
In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is...
Uploaded on: December 4, 2022 -
November 30, 2012 (v1)Book section
Recent and challenging models of robot-based computing systems consider identical, oblivious and mobile robots placed on the nodes of anonymous graphs. Robots operate asynchronously in order to reach a common node and remain with it. This task is known in the literature as the athering or rendezvous problem. The target node is neither chosen in...
Uploaded on: December 2, 2022 -
June 1, 2012 (v1)Journal article
We consider devices equipped with multiple wired or wireless interfaces. By switching of various interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost. In this paper, we consider two...
Uploaded on: December 3, 2022 -
October 15, 2012 (v1)Conference paper
A set of robots arbitrarily placed on different nodes of an anonymous ring have to meet at one common node and remain in there. This problem is known in the literature as the gathering. Anonymous and oblivious robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether...
Uploaded on: December 3, 2022 -
January 22, 2011 (v1)Conference paper
In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is...
Uploaded on: December 3, 2022 -
September 1, 2012 (v1)Journal article
In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one active interface. In this paper, we consider two...
Uploaded on: December 3, 2022 -
January 22, 2011 (v1)Conference paper
We consider devices equipped with multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation...
Uploaded on: December 3, 2022 -
2009 (v1)Journal article
International audience
Uploaded on: December 3, 2022 -
2008 (v1)Journal article
International audience
Uploaded on: December 4, 2022 -
March 1, 2011 (v1)Journal article
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea...
Uploaded on: December 3, 2022 -
June 30, 2012 (v1)Conference paper
The paper studies the gathering problem on grid networks. A team of robots placed at different nodes of a grid, have to meet at some node and remain there. Robots operate in Look-Compute-Move cycles; in one cycle, a robot perceives the current configuration in terms of occupied nodes (Look), decides whether to move towards one of its neighbors...
Uploaded on: December 3, 2022 -
2012 (v1)Report
A set of autonomous robots have to collaborate in order to accomplish a common task in a ring-topology where neither nodes nor edges are labeled. We present a unified approach to solve three important problems in the field: the exclusive perpetual exploration, the exclusive perpetual graph searching and the gathering problems. In the first...
Uploaded on: December 3, 2022 -
May 20, 2013 (v1)Conference paper
A set of autonomous robots have to collaborate in order to accomplish a common task in a ring-topology where neither nodes nor edges are labeled. We present a unified approach to solve three important problems: the exclusive perpetual exploration, the exclusive perpetual search and the gathering problems. In the first problem, each robot aims...
Uploaded on: December 3, 2022 -
2015 (v1)Journal article
A set of autonomous robots have to collaborate in order to accomplish a common task in a ring-topology where neither nodes nor edges are labeled (that is, the ring is anonymous). We present a unified approach to solve three important problems: the exclusive perpetual exploration, the exclusive perpetual clearing, and the gathering problems. In...
Uploaded on: March 25, 2023