Minimum power assignment in wireless ad hoc networks with spanner property
From MaRDI portal
Publication:857765
DOI10.1007/S10878-006-5980-0zbMATH Open1132.90316OpenAlexW3022401834MaRDI QIDQ857765FDOQ857765
Publication date: 5 January 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-5980-0
Cites Work
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Title not available (Why is that?)
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
- Power consumption in packet radio networks
- Title not available (Why is that?)
- Algorithms - ESA 2003
- Minimum-energy broadcasting in static ad hoc wireless networks
- Approximation algorithms for minimum-cost k-vertex connected subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fault-tolerant geometric spanners
- Title not available (Why is that?)
Cited In (6)
- 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
- Algorithms and Computation
Recommendations
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)
