An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube

DOI10.1515/amcs-2015-0023zbMath1322.94131OpenAlexW1209850189MaRDI QIDQ747485

Jing Zhang, Wei Wu, Xiucai Ye, Shuming Zhou, Li Xu

Publication date: 16 October 2015

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2015-0023

zbMATH Keywords

approximation algorithmconnected dominating setwireless sensor networksinduced treecrossed cube

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
• Optimization, simulation, and control.
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
• Tighter approximation bounds for minimum CDS in unit disk graphs
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Wireless networking, dominating and packing
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph

This page was built for publication: An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube