Strong minimum energy hierarchical topology in wireless sensor networks

DOI10.1007/s10878-015-9869-7zbMath1354.90157OpenAlexW2093549895MaRDI QIDQ328707

B. S. Panda, D. Pushparaj Shetty

Publication date: 20 October 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-015-9869-7

zbMATH Keywords

graph algorithmsNP-completeapproximation algorithmssensor networkstopology control problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks, Approximation algorithm for receiver interference problem in dual power wireless sensor networks

Cites Work

• Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks
• On the complexity of minimizing interference in ad-hoc and sensor networks
• Construction of strongly connected dominating sets in asymmetric multihop wireless networks
• Handbook of Approximation Algorithms and Metaheuristics
• Unnamed Item
• Unnamed Item