Minimum power assignment in wireless ad hoc networks with spanner property
From MaRDI portal
(Redirected from Publication:857765)
Recommendations
Cites work
- scientific article; zbMATH DE number 1617269 (Why is no real title available?)
- scientific article; zbMATH DE number 1670654 (Why is no real title available?)
- scientific article; zbMATH DE number 1688358 (Why is no real title available?)
- scientific article; zbMATH DE number 1263225 (Why is no real title available?)
- scientific article; zbMATH DE number 1500550 (Why is no real title available?)
- Approximation algorithms for minimum-cost k-vertex connected subgraphs
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
- Fault-tolerant geometric spanners
- Minimum-energy broadcasting in static ad hoc wireless networks
- Network lifetime and power assignment in ad hoc wireless networks
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Power consumption in packet radio networks
Cited in
(7)- Vertex fault-tolerant spanners for weighted points in polygonal domains
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
- Min-energy broadcast in mobile ad hoc networks with restricted motion
- On the expected maximum degree of Gabriel and Yao graphs
- Probabilistic analysis of power assignments
- Algorithms and Computation
This page was built for publication: Minimum power assignment in wireless ad hoc networks with spanner property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857765)