Strong minimum energy hierarchical topology in wireless sensor networks
From MaRDI portal
(Redirected from Publication:328707)
Recommendations
- Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks
- Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks
Cites work
- scientific article; zbMATH DE number 2088546 (Why is no real title available?)
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Handbook of Approximation Algorithms and Metaheuristics
- On the complexity of minimizing interference in ad-hoc and sensor networks
- Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks
Cited in
(5)- Approximation algorithm for receiver interference problem in dual power wireless sensor networks
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks
- Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks
- The minimum \(k\)-storage problem on directed graphs
- Construction of minimum power 3-connected subgraph with \(k\) backbone nodes in wireless sensor networks
This page was built for publication: Strong minimum energy hierarchical topology in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328707)