A5052366414- Optimization and Search Problems
- Mobile Ad Hoc Networks
- Algorithms and Data Compression
- Distributed systems and fault tolerance
- Cooperative Communication and Network Coding
- Complexity and Algorithms in Graphs
- Opportunistic and Delay-Tolerant Networks
- Modular Robots and Swarm Intelligence
- DNA and Biological Computing
- semigroups and automata theory
- Network Packet Processing and Optimization
- Advanced Graph Theory Research
- Interconnection Networks and Systems
- Distributed Control Multi-Agent Systems
- Computational Geometry and Mesh Generation
- Mobile Agent-Based Network Management
- Robotic Path Planning Algorithms
- Energy Efficient Wireless Sensor Networks
- Machine Learning and Algorithms
- Cryptography and Data Security
- Computability, Logic, AI Algorithms
- Wireless Networks and Protocols
- Natural Language Processing Techniques
- Data Management and Algorithms
- Complex Network Analysis Techniques
University of Liverpool
2016-2025
University of Wrocław
2022
Augusta University
2020
Max Planck Society
1996-2016
Merseytravel
2016
Laboratoire d'Informatique Algorithmique: Fondements et Applications
2015
Institut national de recherche en informatique et en automatique
2015
University of California, Riverside
2002
University of Warmia and Mazury in Olsztyn
2002
Max Planck Institute for Informatics
1996-2002
Group testing refers to the situation in which one is given a set of objects ${\cal O}$, an unknown subset P}\subseteq {\cal and task determining P}$ by asking queries type "does intersect $\cal Q$?," where Q$ O}$. basic search paradigm that occurs variety situations such as quality control testing, searching storage systems, multiple access communications, data compression, among others. procedures have been recently applied computational molecular biology, they are used for screening...
Abstract An n ‐node tree has to be explored by k mobile agents (robots), starting at its root. Every edge of the must traversed least one robot, and exploration completed as fast possible. Even when is known in advance, scheduling optimal collective turns out NP‐hard. We investigate problem how communication among robots influences time for exploring unknown trees. To this end, we consider two scenarios. In first scenario, can communicate writing currently visited node previously acquired...
We establish an O(n log/sup 2/n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches known lower of /spl Omega/(n log n). The fastest previously algorithm this problem works O(n/sup 3/2/). Using our algorithm, we develop 3/2/log/sup gossiping same network model.
This paper studies the differences between two levels of synchronization in a distributed broadcast system (or multiple-access channel). In globally synchronous model, all processors have access to global clock. locally local clocks ticking at same rate, but each clock starts individually when processor wakes up. We consider fundamental problem waking up n completely connected system. Some wake spontaneously, while others be woken Only awake can send messages; sleeping is upon hearing...
This paper concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all in radio networks with known topology, i.e., where for each primitive schedule transmissions is precomputed based on full knowledge about size topology network.The first part examines two general graphs. In particular, it proposes a new (efficiently computable) deterministic that uses O(D+Δ log n) time units to complete task any network n, diameter D max-degree Δ. Our...
We investigate leader election problem via ranking within self-stabilising population protocols. In this scenario, the agent's state space comprises $n$ rank states and $x$ extra states. The initial configuration of agents consists arbitrary arrangements states, with objective self-ranking. Specifically, each agent is tasked stabilising in a unique silently, implying that after stabilisation, remains its designated indefinitely. paper, we present several new protocols, greatly enriching our...
We consider the task of network exploration by a mobile agent (robot) with small memory. The has to traverse all nodes and edges (represented as an undirected connected graph), return starting node. Nodes are unlabeled edge ports locally labeled at each no priori knowledge topology or its size, cannot mark in any way. Under such weak assumptions, cycles may prevent feasibility exploration, hence we restrict attention trees. present algorithm accomplish tree (with return) using O (log n )-bit...
The model of population protocols refers to a large collection simple indistinguishable entities, frequently called \em agents. agents communicate and perform computation through pairwise interactions. We study fast space efficient leader election in cardinality n governed by random scheduler, where during each time step the scheduler uniformly at selects for interaction exactly one pair present first $o(łog^2)$-time protocol. It operates expected parallel $\bigo(łog nłogłog n)$ which is...