Power assignment for k-connectivity in wireless ad hoc networks

DOI10.1007/S10878-005-6858-2MaRDI QIDQ1781807zbMATHOpenAlexDBLPWikidataFDO

Authors Sam Makki, Peng-Jun Wan, Chih-Wei Yi, X.-H. Jia, Dong-Soo Kim

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)

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

Cites work

• scientific article; zbMATH DE number 1670542 (Why is no real title available?)
• scientific article; zbMATH DE number 437545 (Why is no real title available?)
• 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
• An application of submodular flows
• Approximation algorithms for minimum-cost k-vertex connected subgraphs
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• On \(k\)-con-critically \(n\)-connected graphs
• Three tree-paths

Cited in

(19)

• Construction of minimum power 3-connected subgraph with \(k\) backbone nodes in wireless sensor networks
• Handling asymmetry in power heterogeneous ad hoc networks
• Approximating minimum-power degree and connectivity problems
• scientific article; zbMATH DE number 1500550 (Why is no real title available?)
• Approximating minimum-power edge-covers and 2,3-connectivity
• Algorithms for \(k\)-fault tolerant power assignments in wireless sensor 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
• On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
• Minimum power assignment in wireless ad hoc networks with spanner property
• Improved approximation algorithms for minimum power covering problems
• Complexity of increasing the secure connectivity in wireless ad hoc networks
• Network lifetime and power assignment in ad hoc wireless networks
• On minimum power connectivity problems
• Structural Information and Communication Complexity
• Approximating minimum power covers of intersecting families and directed edge-connectivity problems
• Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks
• Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks
• 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)