The following pages link to Algorithms for Sensor Systems (Q2794529):
Displaying 42 items.
- On the complexity of connectivity in cognitive radio networks through spectrum assignment (Q2253963) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line (Q2794532) (← links)
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots (Q5056045) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Barrier Coverage with Uniform Radii in 2D (Q5056051) (← links)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Energy-Optimal Broadcast in a Tree with Mobile Agents (Q5056056) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Improved Leader Election for Self-organizing Programmable Matter (Q5056058) (← links)
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3 (Q5056059) (← links)
- Uniform Dispersal of Robots with Minimum Visibility Range (Q5056060) (← links)
- Gathering Anonymous, Oblivious Robots on a Grid (Q5056061) (← links)
- A Continuous Strategy for Collisionless Gathering (Q5056062) (← links)
- Maximizing Barrier Coverage Lifetime with Static Sensors (Q5056063) (← links)
- Independent Sets in Restricted Line of Sight Networks (Q5056064) (← links)
- Braid Chain Radio Communication (Q5056066) (← links)
- Packing Resizable Items with Application to Video Delivery over Wireless Networks (Q5507390) (← links)
- Symmetric Connectivity with Directional Antennas (Q5507391) (← links)
- Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors (Q5507392) (← links)
- A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks (Q5507394) (← links)
- Mapping a Polygon with Holes Using a Compass (Q5507395) (← links)
- On Some Bounds on the Optimum Schedule Length in the SINR Model (Q5507397) (← links)
- Deterministic Rendezvous with Detection Using Beeps (Q5890529) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5915599) (← links)
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots (Q5915600) (← links)
- The wake up dominating set problem (Q5916281) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5916282) (← links)
- Minimizing total interference in asymmetric sensor networks (Q5918318) (← links)
- Distributed localization of wireless sensor network using communication wheel (Q5918319) (← links)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918320) (← links)
- On efficient connectivity-preserving transformations in a grid (Q5918321) (← links)
- Distributed transformations of Hamiltonian shapes based on line moves (Q5918708) (← links)
- Stand up indulgent gathering (Q5918709) (← links)
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach (Q5918710) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Beep-and-sleep: message and energy efficient set cover (Q5918712) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5918713) (← links)
- Overflow management with self-eliminations (Q5918714) (← links)
