Skip to main content

16 Result(s)

within Jaroslav Opatrny Remove this filter Computer Communication Networks Remove this filter

and

  1. No Access

    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...

    Jurek Czyzowicz, Stefan Dobrev, Ryan Killick… in Structural Information and Communication C… (2021)

  2. No Access

    Article

    Search on a line with faulty robots

    We consider the problem of searching on a line using n mobile robots, of which at most f are faulty, and the remaining are reliable. The robots start at the same location and move in parallel along the line with ...

    Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan… in Distributed Computing (2019)

  3. No Access

    Article

    Distributed algorithms for barrier coverage using relocatable sensors

    We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the ...

    Mohsen Eftekhari, Evangelos Kranakis, Danny Krizanc… in Distributed Computing (2016)

  4. No Access

    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 ...

    Mohsen Eftekhari, Paola Flocchini… in Structural Information and Communication C… (2014)

  5. No Access

    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...

    Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari… in Algorithms and Complexity (2013)

  6. No Access

    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...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny in Fun with Algorithms (2012)

  7. No Access

    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...

    Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc… in Ad-Hoc, Mobile and Wireless Networks (2010)

  8. No Access

    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...

    Evangelos Kranakis, Danny Krizanc… in Combinatorial Optimization and Applications (2010)

  9. No Access

    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 ...

    Stefan Dobrev, Evangelos Kranakis… in Combinatorial Optimization and Applications (2010)

  10. No Access

    Book and Conference Proceedings

    Ad-Hoc, Mobile, and Wireless Networks

    6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceeedings

    Evangelos Kranakis, Jaroslav Opatrny in Lecture Notes in Computer Science (2007)

  11. No Access

    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,

    Jurek Czyzowicz, Stefan Dobrev… in Structural Information and Communication C… (2007)

  12. No Access

    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...

    Edgar Chavez, Stefan Dobrev, Evangelos Kranakis… in Principles of Distributed Systems (2006)

  13. No Access

    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...

    Paul Boone, Edgar Chavez, Lev Gleitzky… in Structural Information and Communication C… (2004)

  14. No Access

    Chapter and Conference Paper

    Two-Hop Virtual Path Layout in Tori

    We consider the problem of D-hop virtual path layout in ATM (Asynchronous Transfer Mode) networks. Given a physical network and an all-to-all traffic pattern, the problem consists of designing a virtual network w...

    Sébastien Choplin, Lata Narayanan… in Structural Information and Communication C… (2004)

  15. No Access

    Chapter and Conference Paper

    Uniform Multi-hop All-to-All Optical Routings in Rings

    We consider all-to-all routing problem in an optical ring network that uses the wavelength-division multiplexing (WDM). Since one-hop, all-to-all optical routing in a WDM optical ring of n nodes needs ...

    Jaroslav Opatrny in LATIN 2000: Theoretical Informatics (2000)

  16. No Access

    Chapter and Conference Paper

    Optical Routing of Uniform Instances in Tori

    We consider the problem of routing uniform communication instances in switched optical tori that use the wavelength division multplexing (or WDM) approach. A communication instance is called uniform if it consist...

    Francesc Comellas, Margarida Mitjana… in Mathematical Foundations of Computer Scien… (2000)