Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks

DOI10.1007/S10878-013-9683-ZzbMath1355.90087OpenAlexW2154284201MaRDI QIDQ887852

B. S. Panda, D. Pushparaj Shetty

Publication date: 3 November 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9683-z

zbMATH Keywords

graph algorithmapproximation algorithmNP-hardwireless sensor networkAPX-hardtopology control problemtransmission power assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Strong minimum energy hierarchical topology in wireless sensor networks

Cites Work

• Unnamed Item
• On the complexity of minimizing interference in ad-hoc and sensor networks
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• Approximating \(k\)-hop minimum-spanning trees
• On the Hardness of Range Assignment Problems

This page was built for publication: Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks