Power assignment for \(k\)-connectivity in wireless ad hoc networks

DOI10.1007/S10878-005-6858-2zbMath1079.90512DBLPjournals/jco/JiaKMWY05OpenAlexW2129893614WikidataQ60402909 ScholiaQ60402909MaRDI QIDQ1781807

Chih-Wei Yi, Sam Makki, Peng-Jun Wan, Dongsoo S. Kim, Xiao-Hua 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

zbMATH Keywords

power assignmentwireless ad hoc sensor networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (10)

Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks ⋮ Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks ⋮ On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity ⋮ Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks ⋮ Approximating minimum-power degree and connectivity problems ⋮ On minimum power connectivity problems ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ Improved approximation algorithms for minimum power covering problems ⋮ Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks ⋮ Approximating minimum-power edge-covers and 2,3-connectivity

Cites Work

• An application of submodular flows
• On \(k\)-con-critically \(n\)-connected graphs
• Three tree-paths
• Approximation algorithms for minimum-cost k-vertex connected subgraphs
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
• A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Power assignment for \(k\)-connectivity in wireless ad hoc networks