Power assignment in radio networks with two power levels

DOI10.1007/S00453-006-1230-1zbMath1108.90015OpenAlexW2112341077MaRDI QIDQ870460

Matthew J. Katz, Paz Carmi

Publication date: 12 March 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1027/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Approximation algorithms (68W25)

Related Items (10)

Using VNS for the optimal synthesis of the communication tree in wireless sensor networks ⋮ Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ Variable neighborhood search variants for min-power symmetric connectivity problem ⋮ Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ Dual power assignment via second Hamiltonian cycle ⋮ Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements ⋮ Approximation algorithm for receiver interference problem in dual power wireless sensor networks ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ Parameterized complexity of min-power asymmetric connectivity

This page was built for publication: Power assignment in radio networks with two power levels