Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks

DOI10.1142/S1793830920500123MaRDI QIDQ5216451zbMATH OpenOpenAlexFDO

Authors D. Pushparaj Shetty, M. Prasanna Lakshmi

Publication date 18 February 2020

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830920500123

zbMATH Keywords

approximation algorithmsgraph algorithmswireless sensor networkstopology control problemrange assignment

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Recommendations

• Construction of minimum power 3-connected subgraph with \(k\) backbone nodes in wireless sensor networks
• Power assignment for k-connectivity in wireless ad hoc networks
• Dual power assignment optimization and fault tolerance in WSNs
• Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks
• Approximating minimum-power degree and connectivity problems

Cites work

• scientific article; zbMATH DE number 1670548 (Why is no real title available?)
• Approximating minimum-power degree and connectivity problems
• On minimum power connectivity problems
• On the hardness of range assignment problems
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• Survivable network activation problems
• Survivable network design problems in wireless networks

Cited in

(9)

• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
• Construction of minimum power 3-connected subgraph with \(k\) backbone nodes in wireless sensor networks
• Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
• Dual power assignment optimization and fault tolerance in WSNs
• Algorithms for \(k\)-fault tolerant power assignments in wireless sensor networks
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks
• Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks
• Strong minimum energy hierarchical topology in wireless sensor networks

This page was built for publication: Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216451)