Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
From MaRDI portal
(Redirected from Publication:393036)
Recommendations
- Load-balanced virtual backbone construction for wireless sensor networks
- Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks
- Algorithms for Minimum m-Connected k-Dominating Set Problem
- A distributed approximation algorithm for the bottleneck connected dominating set problem
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A linearization framework for unconstrained quadratic (0-1) problems
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- Approximation algorithms for connected dominating sets
- Load-balanced virtual backbone construction for wireless sensor networks
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- The broadcast storm problem in a mobile ad hoc network
- Tighter approximation bounds for minimum CDS in wireless ad hoc networks
Cited in
(4)- Load-balanced virtual backbone construction for wireless sensor networks
- An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube
- Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks
- A robust and energy-efficient weighted clustering algorithm on mobile ad hoc sensor networks
This page was built for publication: Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393036)