Open Access
Connected Dominating Sets
Yiwei Wu and Yingshu Li
- 11 Aug 2009
69
TL;DR: This chapter surveys some existing cluster-based algorithms and focuses on connected dominating set algorithms, including both centralized and distributed, for how to construct CDS, and some algorithms for kmCDS are described in detail.
read more
Abstract: Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are now widely used in many applications, including environment and habitat monitoring, traffic control, and etc. Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networks or cellular networks. Hierarchical or cluster-based methods, originally proposed in wireline networks, are well-known techniques with special advantages related to scalability and efficient communication. As such, the concept of hierarchical routing is also utilized to perform energy-efficient routing in WSNs. Using a virtual backbone infrastructure which is one kind of hierarchical methods has received more attention. Thus, a Connected Dominating Set (CDS) has been recommended to serve as a virtual backbone for a WSN to reduce routing overhead. Having such a CDS simplifies routing by restricting the main routing tasks to the dominators only. Fault tolerance and routing flexibility are necessary for routing since nodes in WSNs are prone to failures and nodes may have mobility and turn on and off frequently. Thus, it is important to maintain a certain degree of redundancy in a CDS. Unfortunately, a CDS only preserves 1-connectivity and it is therefore very vulnerable. Therefore, the concept of k-connected m-dominating sets (kmCDS) are used to provide these redundancy. In this chapter, we first survey some existing cluster-based algorithms. After that, we focus on connected dominating set algorithms, including both centralized and distributed, for how to construct CDS. Theoretical analysis are also presented. Furthermore, some algorithms for kmCDS are described in detail.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
Stefan Funke,Alexander Kesselmann,Ulrich Meyer,Michael Segal +3 more
- 01 Jan 2005
TL;DR: This paper presents a very simple distributed algorithm for computing a small CDS, improving upon the previous best known approximation factor of 8 and implying improved approximation factors for many existing algorithm.
159
On the construction of 2-connected virtual backbone in wireless networks
Feng Wang,My T. Thai,Ding-Zhu Du +2 more
TL;DR: This paper proposes a new algorithm called Connecting Dominating Set Augmentation (CDSA) to construct a 2-connected virtual backbone which can resist the failure of one wireless node, and shows that CDSA has guaranteed quality by proving that the size of the CDSA constructed 2- connected backbone is within a constant factor of the optimal 2- Connected virtual backbone size.
134
DisC diversity: result diversification based on dissimilarity and coverage
Marina Drosou,Evaggelia Pitoura +1 more
- 01 Nov 2012
TL;DR: In this article, the authors propose a new, intuitive definition of diversity called DisC diversity, which is defined as a subset of a query result such that each object in the result is represented by a similar object in a diverse subset and the objects in the diverse subset are dissimilar to each other.
98
An energy efficient MCDS construction algorithm for wireless sensor networks
TL;DR: An efficient approximation MCDS construction algorithm E-MCDS (energy efficient MCDSConstruction algorithm) is proposed which explicitly takes energy consumption into account and performs well both in terms of the size of CDS constructed and the energy efficiency.
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
TL;DR: This paper presents a polynomial-time (3H(n-1)-1)-approximation algorithm for Minimum SCDS, where H is the harmonic function and the approximation ratio is within a factor of 3 from the best possible approximation ratio achievable by any polynometric-time algorithm.
52
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
An application-specific protocol architecture for wireless microsensor networks
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
- 01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.