Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Self-stabilizing algorithm for energy saving in Wireless Sensor Networks
ISCC '11 Proceedings of the 2011 IEEE Symposium on Computers and Communications
| Hi-index | 0.00 |
Recently, virtual backbones have been extensively used in wireless ad-hoc networks for various applications such as routing, route maintenance, broadcasting or scheduling. In wireless ad-hoc and sensor networks, a Connected Dominating Set (CDS) is useful as a virtual backbone due to the absence of fixed infrastructure or centralized management. Most of CDS construction methods seek to minimize the size of the backbone. Nevertheless, other constraints than reducing the number of nodes can be considered. In that case, it is more interesting to consider nodes' weights (according to a specific purpose) and to reduce the total backbone's weight. This construction is called a Low Weight Connected Dominating Set (LWCDS). In this paper, we present a self-stabilizing distributed algorithm for the construction of a LWCDS. The self-stabilizing property confers to our algorithm the ability to recover in a finite time after a transient fault. Our algorithm is evaluated through extensive simulations that show the efficiency of our solution in different contexts and the large possible applications of our algorithm. We also introduce two new evaluation criteria to evaluate the algorithms of CDS construction in the specific context of mobility.