Power consumption in packet radio networks
From MaRDI portal
Publication:1575645
DOI10.1016/S0304-3975(98)00223-0zbMath0944.68001MaRDI QIDQ1575645
Danny Krizanc, Evangelos Kranakis, Lefteris M. Kirousis, Andrzej Pelc
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (50)
Range assignment for energy efficient broadcasting in linear radio networks ⋮ The minimum broadcast range assignment problem on linear multi-hop wireless networks. ⋮ IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS ⋮ Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Using VNS for the optimal synthesis of the communication tree in wireless sensor networks ⋮ Minimum power assignment in wireless ad hoc networks with spanner property ⋮ Variable neighborhood search variants for min-power symmetric connectivity problem ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ Symmetric connectivity with directional antennas ⋮ Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ Power optimization for connectivity problems ⋮ Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas ⋮ Dual power assignment via second Hamiltonian cycle ⋮ Improved algorithms in directional wireless sensor networks ⋮ The online broadcast range-assignment problem ⋮ Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas ⋮ T-joins in strongly connected hypergraphs ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The MST of symmetric disk graphs is light ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ The minimum-area spanning tree problem ⋮ On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity ⋮ Multiobjective optimization for a wireless ad hoc sensor distribution on shaped-bounded areas ⋮ Connectivity guarantees for wireless networks with directional antennas ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ Minimum-energy broadcast and disk cover in grid wireless networks ⋮ Theoretical Aspects of Graph Models for MANETs ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ An iterative exact solution for the dual power management problem in wireless sensor network ⋮ On the hardness of range assignment problems ⋮ On the complexity of minimizing interference in ad-hoc and sensor networks ⋮ Bounded-angle spanning tree: modeling networks with angular constraints ⋮ Improved approximation results for the minimum energy broadcasting problem ⋮ The Online Broadcast Range-Assignment Problem ⋮ Weighted broadcast in linear radio networks ⋮ On dual power assignment optimization for biconnectivity ⋮ On minimum power connectivity problems ⋮ Bounded-hops power assignment in ad hoc wireless networks ⋮ Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach ⋮ A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem ⋮ The complexity of symmetric connectivity in directional wireless sensor networks ⋮ Set function optimization ⋮ Bounded-angle minimum spanning trees ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem ⋮ Power consumption in packet radio networks ⋮ Integer programming formulations for the shared multicast tree problem ⋮ On the approximability of the range assignment problem on radio networks in presence of selfish agents ⋮ Dual power assignment optimization and fault tolerance in WSNs
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Broadcasting on \([0,L\)]
- Power consumption in packet radio networks
- Some complexity results about packet radio networks (Corresp.)
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Universality considerations in VLSI circuits
- Single round simulation on radio networks
This page was built for publication: Power consumption in packet radio networks
