23 Result(s)
within
Conference Paper
Jaroslav Opatrny
-
Chapter and Conference Paper
Graph Exploration by Energy-Sharing Mobile Agents
We consider the problem of collective exploration of a known n-node edge-weighted graph by k mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbit...
-
Chapter and Conference Paper
The Bike Sharing Problem
Assume that \(m \ge 1\) m ≥
-
Chapter and Conference Paper
Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range
We consider the problem of evacuating \(k \ge 2\) mobile agents from a unit-sided equilateral triangle through an exit located at an unknown location on the perimeter of the triangle. The agents are initially loc...
-
Chapter and Conference Paper
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
-
Chapter and Conference Paper
Distributed Pattern Formation in a Ring
Motivated by concerns about diversity in social networks, we consider the following pattern formation problems in rings
-
Chapter and Conference Paper
Satisfying Neighbor Preferences on a Circle
We study the problem of satisfying seating preferences on a circle. We assume we are given a collection of n agents to be arranged on a circle. Each agent is colored either blue or red, and there are exactly b bl...
-
Chapter and Conference Paper
Priority Evacuation from a Disk Using Mobile Robots
We introduce and study a new search-type problem with ( \(n+1\) )-robots on a disk. The searchers (robots) al...
-
Chapter and Conference Paper
Linear Search with Terrain-Dependent Speeds
We revisit the linear search problem where a robot, initially placed at the origin on an infinite line, tries to locate a stationary target placed at an unknown position on the line. Unlike previous studies, in w...
-
Chapter and Conference Paper
Weak Coverage of a Rectangular Barrier
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a dir...
-
Chapter and Conference Paper
Distributed Barrier Coverage with Relocatable Sensors
A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set ...
-
Chapter and Conference Paper
Complexity of Barrier Coverage with Relocatable Sensors in the Plane
We consider several variations of the problems of covering a set of barriers (modeled as line segments) using sensors that can detect any intruder crossing any of the barriers. Sensors are initially located in...
-
Chapter and Conference Paper
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors
We consider the problem of monitoring the Euclidean plane using rotating sensors with detection sectors and beam sensors. We assume that intruders can appear anywhere at any time and move arbitrarily fast, and...
-
Chapter and Conference Paper
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensors in arbitrary initial positions...
-
Chapter and Conference Paper
Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations
Satellites collecting data store packets in queues and transmit these packets to ground stations within their view. In a given time step, a ground station may see several satellites, but can receive a packet f...
-
Chapter and Conference Paper
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
Given a set S of n sensors in the plane we consider the problem of establishing an ad hoc network from these sensors using directional antennae. We prove that for each given integer 1 ≤ k ≤ 5 there is a strongly ...
-
Chapter and Conference Paper
A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks
The dynamic nature of mobile ad hoc networks makes it difficult to consider a specific model for their topology which might change in a short period of time. Using the knowledge about the location of nodes, se...
-
Chapter and Conference Paper
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such that for some positive integers l,
-
Chapter and Conference Paper
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph
We give a new local test, called a Half-Space Proximal or HSP test, for extracting a sparse directed or undirected subgraph of a given unit disk graph. The HSP neighbors of each vertex are unique, given a fixed u...
-
Chapter and Conference Paper
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
We give an algorithm for constructing a connected spanning subgraphs(panner) of a wireless network modelled as a unit disk graph with nodes of irregular transmission ranges, whereby for some parameter 0 < r ≤ 1 t...
-
Chapter and Conference Paper
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks
An important technique for discovering routes between two nodes in an ad-hoc network involves applying the face routing algorithm on a planar spanner of the network. Face routing guarantees message delivery in...
