A self-stabilizing algorithm for finding a minimal K-dominating set in general networks

Wang, Guangyuan and Wang, Hua and Tao, Xiaohui and Zhang, Ji (2012) A self-stabilizing algorithm for finding a minimal K-dominating set in general networks. In: 3rd International Conference on Data and Knowledge Engineering (ICDKE 2012), 21-23 Nov 2012, Fujian, China.

Abstract

Since the publication of Dijkstra's pioneering paper, a lot of self-stabilizing algorithms for computing dominating sets have been proposed in the literature. However, there is no self-stabilizing algorithm for the minimal k-dominating set (MKDS) in arbitrary graphs that works under a distributed daemon. The proposed algorithms for the minimal k-dominating set (MKDS) either work for trees (Kamei and Kakugawa [16]) or find a minimal 2-dominating set (Huang et al. [14,15]). In this paper, we propose a self-stabilizing algorithm for the minimal k-dominating set (MKDS) 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(n2) steps where n is the number of nodes in the network.


Statistics for USQ ePrint 23342
Statistics for this ePrint Item
Item Type: Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)
Refereed: Yes
Item Status: Live Archive
Additional Information: Series: Lecture Notes in Computer Science, Vol. 7696 Permanent restricted access to published version due to publisher copyright policy.
Faculty / Department / School: Historic - Faculty of Sciences - Department of Maths and Computing
Date Deposited: 16 Apr 2013 06:35
Last Modified: 10 Apr 2017 01:18
Uncontrolled Keywords: self-stabilizing algorithm; minimal k-dominating set; central daemon model; general network; convergence
Fields of Research : 08 Information and Computing Sciences > 0805 Distributed Computing > 080503 Networking and Communications
08 Information and Computing Sciences > 0899 Other Information and Computing Sciences > 089999 Information and Computing Sciences not elsewhere classified
01 Mathematical Sciences > 0103 Numerical and Computational Mathematics > 010399 Numerical and Computational Mathematics not elsewhere classified
Socio-Economic Objective: E Expanding Knowledge > 97 Expanding Knowledge > 970108 Expanding Knowledge in the Information and Computing Sciences
Identification Number or DOI: 10.1007/978-3-642-34679-8_8
URI: http://eprints.usq.edu.au/id/eprint/23342

Actions (login required)

View Item Archive Repository Staff Only