Self-stabilizing Wireless Connected Overlays

We propose the correctness proofs and the complexity analysis for the first self-stabilizing constructions of connected overlays for wireless networks (eg. MANETs, WSN) based on the computation of Connected Dominating Set (CDS). The basic idea is to construct an overlay that contains a small number of nodes, but still obtain full connectivity of the network while only relying on local exchanges of information and knowledge. We adopt two methodologies of construction: the first methodology consists of two parallel tasks, namely, computing a maximal independent set (MIS) and then adding bridge nodes between the MIS nodes. The second methodology computes a connected dominating set using the observation that a dominator is a bridge between nodes that do not share the same neighborhood. The proposed algorithms are fully decentralized and are designed in a self-stabilizing manner in order to cope with transient faults, mobility and nodes join/leave. In particular, they do not need to be (re)initialized after a fault or a physical topology change. That is, whatever the initial configuration is, the algorithms satisfy their specification after a stabilization period. The convergence time of our algorithms is linear in the size of the network and they use only one extra bit of memory. We also present an optimization of our algorithms that reduces the number of nodes in the cover. However, the optimization increases the convergence time with a constant factor.

[1]  Mohamed G. Gouda,et al.  Adaptive Programming , 1991, IEEE Trans. Software Eng..

[2]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[3]  Yi Pan,et al.  An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks , 2004, ISPA.

[4]  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).

[5]  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.

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

[7]  Peng-Jun Wan,et al.  Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

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

[9]  Ajoy Kumar Datta,et al.  Self-* distributed query region covering in sensor networks , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

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

[11]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

[12]  Roy Friedman,et al.  Locating cache proxies in manets , 2004, MobiHoc '04.

[13]  Sébastien Tixeuil,et al.  Self-stabilizing Vertex Coloring of Arbitrary Graphs , 2000 .

[14]  Hui Gao,et al.  Parallel and Distributed Processing and Applications , 2005 .

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

[16]  Jie Wu,et al.  Distributed dominant pruning in ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[17]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[18]  Ivan Stojmenovic,et al.  Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[19]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[20]  Fabrice Theoleyre,et al.  About the Self-stabilization of a Virtual Topology for Self-organization in Ad Hoc Networks , 2005, Self-Stabilizing Systems.

[21]  Himanshu Gupta,et al.  Fault tolerant connected sensor cover with variable sensing and transmission ranges , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

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

[23]  Ajoy Kumar Datta,et al.  Distributed self-* minimum connected covering of a query region in sensor networks , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).