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

DOI10.1515/AMCS-2015-0023MaRDI QIDQ747485zbMATH OpenOpenAlexFDO

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

Publication date 16 October 2015

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

approximation algorithminduced treewireless sensor networkscrossed cubeconnected dominating set

Mathematics Subject Classification ID

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

Recommendations

• Efficient algorithm for finding minimum connected dominating set in wireless sensor networks
• Algorithms for minimum connected capacitated dominating set problem
• Algorithms for Minimum m-Connected k-Dominating Set Problem
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

Cites work

• A PTAS for weak minimum routing cost connected dominating set of unit disk graph
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
• An equivalent definition of the crossed cube
• Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
• 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
• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
• Optimization, simulation, and control.
• Tighter approximation bounds for minimum CDS in unit disk graphs
• Wireless networking, dominating and packing

Cited in

(1)

• Efficient algorithm for finding minimum connected dominating set in wireless sensor networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747485)