Constructing a self-stabilizing CDS with bounded diameter in wireless networks under SINR

As a virtual backbone structure, connected dominating sets (CDSs) play an important role in topology control for wireless networks. In this paper, we develop a distributed self-stabilizing CDS construction algorithm under the SINR model (also known as the physical interference model), a more practical yet more challenging interference model for distributed algorithm design. Specifically, we propose a randomized distributed algorithm that can construct a CDS in O (log n) timeslots with a high probability, where n is the total number of nodes in the network. The constructed CDS achieves constant approximation in both density and diameter. To the best of our knowledge, this is the first known asymptotically optimal self-stabilizing result in terms of both density and diameter for distributed CDS construction under the practical SINR model.

[1]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[2]  Jiguo Yu,et al.  A Self-Stabilizing Algorithm for CDS Construction with Constant Approximation in Wireless Networks under SINR Model , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[3]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[4]  Dongxiao Yu,et al.  Leveraging multiple channels in ad hoc networks , 2018, Distributed Computing.

[5]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[6]  Christian Scheideler,et al.  An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model , 2008, MobiHoc '08.

[7]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[8]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[9]  Xiaohua Jia,et al.  Energy efficient distributed connected dominating sets construction in wireless sensor networks , 2006, IWCMC '06.

[10]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

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

[12]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Xiaohua Jia,et al.  Virtual backbone construction in multihop ad hoc wireless networks , 2006, Wirel. Commun. Mob. Comput..

[14]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[15]  Sayaka Kamei,et al.  A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks , 2003, Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[16]  Erik D. Demaine,et al.  Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.

[17]  Oliver Schaudt,et al.  On dominating sets whose induced subgraphs have a bounded diameter , 2013, Discret. Appl. Math..

[18]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[19]  Minming Li,et al.  Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs , 2011, Algorithmica.

[20]  Dariusz R. Kowalski,et al.  Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks , 2012, DISC.

[21]  Sergiy Butenko,et al.  On connected dominating sets of restricted diameter , 2014, Eur. J. Oper. Res..

[22]  Arobinda Gupta,et al.  A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[23]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[24]  Christian Scheideler,et al.  Constant density spanners for wireless ad-hoc networks , 2005, SPAA '05.

[25]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[26]  F. Frances Yao,et al.  Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges , 2013, IEEE Trans. Mob. Comput..

[27]  Ding-Zhu Du,et al.  On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..

[28]  Sayaka Kamei,et al.  A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set , 2010, Int. J. Found. Comput. Sci..

[29]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..