VBS: maximum lifetime sleep scheduling for wireless sensor networks using virtual backbones
INFOCOM'10 Proceedings of the 29th conference on Information communications
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
Dynamic topology construction of wireless sensor network using computational geometric approach
International Journal of Sensor Networks
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
Domatic partition in homogeneous wireless sensor networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Wireless ad hoc and sensor networks (WSNs) often require a connected dominating set (CDS) as the underlying virtual backbone for efficient routing. Nodes in a CDS have extra computation and communication load for their role as dominator, subjecting them to an early exhaustion of their battery. A simple mechanism to address this problem is to switch from one CDS to another fresh CDS, rotating the active CDS through a disjoint set of CDSs. This gives rise to the connected domatic partition (CDP) problem, which essentially involves partitioning the nodes V(G) of a graph G into node disjoint CDSs. We have developed a distributed algorithm for constructing the CDP using our maximal independent set (MIS)-based proximity heuristics, which depends only on connectivity information and does not rely on geographic or geometric information. We show that the size of a CDP that is identified by our algorithm is at least \lfloor{\frac{\delta+1}{\beta(c+1)}}\rfloor-f, where \delta is the minimum node degree of G, \beta\leq 2, c\leq 11 is a constant for a unit disk graph (UDG), and the expected value of f is \epsilon\delta|V|, where \epsilon \ll 1 is a positive constant, and \delta \geq 48. Results of varied testing of our algorithm are positive even for a network of a large number of sensor nodes. Our scheme also performs better than other related techniques such as the ID-based scheme.