IEEE Transactions on Software Engineering
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Locating cache proxies in manets
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A self-stabilizing minimal dominating set algorithm with safe convergence
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
About the self-stabilization of a virtual topology for self-organization in ad hoc networks
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Self* minimum connected covers of query regions in sensor networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Robust self-stabilizing construction of bounded size weight-based clusters
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Self-stabilization versus robust self-stabilization for clustering in ad-hoc network
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
From self- to self-stabilizing with service guarantee 1-hop weight-based clustering
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
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.