A Self-Stabilizing Protocol for Minimal Weighted Dominating Sets in Arbitrary Networks
Paper
Paper/Presentation Title | A Self-Stabilizing Protocol for Minimal Weighted Dominating Sets in Arbitrary Networks |
---|---|
Presentation Type | Paper |
Authors | Wang, Guangyuan (Author), Wang, Hua (Author), Tao, Xiaohui (Author) and Zhang, Ji (Author) |
Editors | Shen, Weiming, Li, Weidong, Barthes, Jean-Paul, Luo, Junzhou, Zhu, Haibin, Yong, Jianming and Li, Xiaoping |
Journal or Proceedings Title | Proceedings of the 17th IEEE International Conference on Computer Supported Cooperative Work in Design (CSCWD 2013) |
Number of Pages | 6 |
Year | 2013 |
Place of Publication | United States |
ISBN | 9781467360852 |
Digital Object Identifier (DOI) | https://doi.org/10.1109/CSCWD.2013.6581012 |
Web Address (URL) of Paper | https://ieeexplore.ieee.org/document/6581012 |
Conference/Event | IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2013) |
Event Details | Rank B B B B B B B B B |
Event Details | IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2013) Event Date 27 to end of 29 Jun 2013 Event Location Whistler, Canada |
Abstract | A lot of self-stabilizing algorithms for computing dominating sets problem have been proposed in the literature due to many real-life applications. Most of the proposed algorithms either work for dominating sets with a uniform weight or find approximation solutions to weighted dominating sets. However, for non-uniform weighted dominating sets (WDS) problem, there is no self-stabilizing algorithm for the WDS. Furthermore, how to find the minimal weighted dominating set is a challenge. In this paper, we propose a self-stabilizing algorithm for the minimal weighted dominating set (MWDS) under a central daemon model when operating in any general network. We further prove that the worst case convergence time of the algorithm from any arbitrary initial state is O(n 2) steps where n is the number of nodes in the network. |
Keywords | central daemon; graph algorithm; minimal weighted dominating set; self-stabilizing algorithm |
ANZSRC Field of Research 2020 | 400604. Network engineering |
490407. Mathematical logic, set theory, lattices and universal algebra | |
490404. Combinatorics and discrete mathematics (excl. physical combinatorics) | |
Public Notes | Files associated with this item cannot be displayed due to copyright restrictions. |
Byline Affiliations | Department of Mathematics and Computing |
Institution of Origin | University of Southern Queensland |
https://research.usq.edu.au/item/q2150/a-self-stabilizing-protocol-for-minimal-weighted-dominating-sets-in-arbitrary-networks
Download files
1938
total views409
total downloads0
views this month0
downloads this month