Power assignment for k-connectivity in wireless ad hoc networks
DOI10.1007/S10878-005-6858-2zbMATH Open1079.90512DBLPjournals/jco/JiaKMWY05OpenAlexW2129893614WikidataQ60402909 ScholiaQ60402909MaRDI QIDQ1781807FDOQ1781807
Chih-Wei Yi, Sam Makki, Peng-Jun Wan, Dong-Soo Kim, X.-H. Jia
Publication date: 8 June 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-6858-2
Recommendations
- Network lifetime and power assignment in ad hoc wireless networks
- Bounded-hops power assignment in ad hoc wireless networks
- Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
- Approximating minimum-power degree and connectivity problems
- On Minimum Power Connectivity Problems
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Cites Work
- An application of submodular flows
- Title not available (Why is that?)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Title not available (Why is that?)
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- Approximation algorithms for minimum-cost k-vertex connected subgraphs
- On \(k\)-con-critically \(n\)-connected graphs
Cited In (17)
- Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks
- Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks
- Minimum power assignment in wireless ad hoc networks with spanner property
- Network lifetime and power assignment in ad hoc wireless networks
- Bounded-hops power assignment in ad hoc wireless networks
- Handling asymmetry in power heterogeneous ad hoc networks
- Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks
- Structural Information and Communication Complexity
- Approximating minimum-power degree and connectivity problems
- Improved approximation algorithms for minimum power covering problems
- Title not available (Why is that?)
- Approximating minimum-power edge-covers and 2,3-connectivity
- On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
- On dual power assignment optimization for biconnectivity
This page was built for publication: Power assignment for \(k\)-connectivity in wireless ad hoc networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781807)
