Wang, Guangyuan and Wang, Hua and Tao, Xiaohui ORCID: https://orcid.org/000000020020077X and Zhang, Ji (2013) A selfstabilizing protocol for minimal weighted dominating sets in arbitrary networks. In: IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2013), 2729 Jun 2013, Whistler, BC. Canada.

Text (Documentation)
CSCWD2013.pdf Download (270kB)  Preview 
Abstract
A lot of selfstabilizing algorithms for computing dominating sets problem have been proposed in the literature due to many reallife 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 nonuniform weighted dominating sets (WDS) problem, there is no selfstabilizing algorithm for the WDS. Furthermore, how to find the minimal weighted dominating set is a challenge. In this paper, we propose a selfstabilizing 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.
Statistics for this ePrint Item 
Item Type:  Conference or Workshop Item (Commonwealth Reporting Category E) (Paper) 

Refereed:  Yes 
Item Status:  Live Archive 
Additional Information:  © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. 
Faculty/School / Institute/Centre:  Historic  Faculty of Sciences  Department of Maths and Computing (Up to 30 Jun 2013) 
Faculty/School / Institute/Centre:  Historic  Faculty of Sciences  Department of Maths and Computing (Up to 30 Jun 2013) 
Date Deposited:  01 Oct 2013 02:20 
Last Modified:  15 Sep 2014 01:41 
Uncontrolled Keywords:  central daemon; graph algorithm; minimal weighted dominating set; selfstabilizing algorithm 
Fields of Research (2008):  10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks 01 Mathematical Sciences > 0101 Pure Mathematics > 010107 Mathematical Logic, Set Theory, Lattices and Universal Algebra 01 Mathematical Sciences > 0101 Pure Mathematics > 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) 
Fields of Research (2020):  40 ENGINEERING > 4006 Communications engineering > 400604 Network engineering 49 MATHEMATICAL SCIENCES > 4904 Pure mathematics > 490407 Mathematical logic, set theory, lattices and universal algebra 49 MATHEMATICAL SCIENCES > 4904 Pure mathematics > 490404 Combinatorics and discrete mathematics (excl. physical combinatorics) 
SocioEconomic Objectives (2008):  E Expanding Knowledge > 97 Expanding Knowledge > 970101 Expanding Knowledge in the Mathematical Sciences 
Identification Number or DOI:  https://doi.org/10.1109/CSCWD.2013.6581012 
URI:  http://eprints.usq.edu.au/id/eprint/24098 
Actions (login required)
Archive Repository Staff Only 