Self-Stabilizing Distributed Formation of Minimal k-Dominating Sets in Mobile Ad Hoc Networks

Dominating set in a mobile ad-hoc network (MANET) is a collection of devices acting as servers that store, forward, or backup data for other devices not in the set. To fulfill the service requirement, every device is either a dominator or adjacent to some dominator. Devices of the latter case are dominatees. To provide a more robust service, we can extend the definition of dominating set to k-dominating set, where each dominatee must be adjacent to at least k dominators (k is a constant). This paper proposes a self-stabilizing protocol that identifies a k-dominating set in a MANET. The identified set is guaranteed minimal in the sense that it contains no proper subset that is also a k-dominating set. We prove correctness and analyze stability property of this protocol. Simulation results indicate that the proposed protocol finds k-dominating sets of smaller size when compared with existing approaches.

[1]  Ajay D. Kshemkalyani,et al.  Distributed Computing: Principles, Algorithms, and Systems , 2008 .

[2]  Sayaka Kamei,et al.  A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[3]  Volker Turau,et al.  Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler , 2007, Inf. Process. Lett..

[4]  Hirotsugu Kakugawa,et al.  A self-stabilizing minimal dominating set algorithm with safe convergence , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[5]  Amitava Datta,et al.  Minimum Dominating Sets for Solving the Coverage Problem in Wireless Sensor Networks , 2006, UCS.

[6]  Chih-Yuan Chen,et al.  A Linear-Time Self-Stabilizing Algorithm for the Minimal 2-Dominating Set Problem in General Networks , 2008, J. Inf. Sci. Eng..

[7]  Pradip K. Srimani,et al.  Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets , 2003 .

[8]  Ajay D. Kshemkalyani,et al.  Distributed Computing: Index , 2008 .

[9]  Wayne Goddard,et al.  Self-Stabilizing Graph Protocols , 2008, Parallel Process. Lett..

[10]  Roger Wattenhofer,et al.  Maximizing the lifetime of dominating sets , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[11]  Wayne Goddard,et al.  A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph , 2003, IWDC.

[12]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Chih-Yuan Chen,et al.  A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model , 2007, Comput. Math. Appl..

[14]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[15]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[16]  Li-Hsing Yen,et al.  Game-Theoretic Approach to Self-Stabilizing Distributed Formation of Minimal Multi-Dominating Sets , 2014, IEEE Transactions on Parallel and Distributed Systems.