On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
From MaRDI portal
Publication:2507113
DOI10.1016/j.jpdc.2005.12.010zbMath1101.68003OpenAlexW2151141449MaRDI QIDQ2507113
Publication date: 10 October 2006
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.12.010
simulationconnected dominating set\(k\)-vertex connectivitylocalized algorithmswireless ad hoc and sensor networks
Related Items (25)
Independent domination in directed graphs ⋮ Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ On approximating (connected) 2-edge dominating set by a tree ⋮ Upper bounds for \(\alpha \)-domination parameters ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ A greedy algorithm for the fault-tolerant connected dominating set in a general graph ⋮ Efficient transformation of distance-2 self-stabilizing algorithms ⋮ Construction of minimum edge-fault tolerant connected dominating set in a general graph ⋮ 2-(edge-)connected edge domination number and matching number ⋮ Computing Minimum k-Connected m-Fold Dominating Set in General Graphs ⋮ Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set ⋮ Routing-efficient CDS construction in disk-containment graphs ⋮ A note on \(\alpha\)-total domination in cubic graphs ⋮ Approximation algorithms for highly connected multi-dominating sets in unit disk graphs ⋮ Energy conservation in wireless sensor networks and connectivity of graphs ⋮ On Approximating (Connected) 2-Edge Dominating Set by a Tree ⋮ A greedy algorithm for the fault-tolerant outer-connected dominating set problem ⋮ A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem ⋮ Independent strong domination in complementary prisms ⋮ Uncertain weighted dominating set: a prototype application on natural disaster relief management ⋮ An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube ⋮ On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs ⋮ Upper signed \(k\)-domination in a general graph ⋮ A matheuristic approach for solving the 2-connected dominating set problem ⋮ Independent strong weak domination: A mathematical programming approach
This page was built for publication: On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
