Title: Simple construction strategy for weakly connected dominating set in wireless networks
Abstract: This paper proposes a central construction algorithm of weakly connected dominating sets in wireless networks by constructing edge dominating sets,simultaneously gives two pruning strategies to reduce the size of the produced set.The time complexity of the algorithm is O(|N|+|E|).It proves the correctness of the algorithm and shows the effectiveness of the algorithm.Compared to existed results,the algorithm proposed produces weakly dominating sets with smaller size.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot