Title
Two Connected Dominating Set Algorithms For Wireless Sensor Networks
Abstract
In this work, we present the design of two novel algorithms for constructing connected dominating set (CDS) in wireless sensor networks (WSNs). Both algorithms are intended to minimize CDS size. The first algorithm has a performance factor of 5 from the optimal solution, which outperforms the best-published results (5.8+ ln 4) in [1]. The second algorithm is an improved version of the first one. We included the theoretical analysis and simulation results showing the effectiveness of both algorithms.
Year
DOI
Venue
2012
10.1007/978-3-642-31869-6_62
WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2012
Keywords
Field
DocType
Connected Dominating Set, Wireless Sensor Networks, Maximal Independent Set, Unit Disk Graph, Approximation Algorithm
Key distribution in wireless sensor networks,Computer science,Algorithm,Computer network,Connected dominating set,Wireless sensor network,Distributed computing
Conference
Volume
Issue
ISSN
7405
1
0302-9743
Citations 
PageRank 
References 
1
0.36
7
Authors
4
Name
Order
Citations
PageRank
Najla Al-Nabhan1196.49
Bowu Zhang2836.83
Mznah Al-Rodhaan330622.90
Abdullah Al-Dhelaan452339.77