Subscribe Now Subscribe Today
Science Alert
Curve Top
Information Technology Journal
  Year: 2010 | Volume: 9 | Issue: 6 | Page No.: 1081-1092
DOI: 10.3923/itj.2010.1081.1092
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

A Survey on Connected Dominating Set Construction Algorithm for Wireless Sensor Networks

Zhuo Liu, Bingwen Wang and Lejiang Guo

In Wireless Sensor Network (WSN), all nodes are energy constrained. Clustering is a kind of energy efficient algorithm, while using a virtual backbone to organize the nodes is a better way. Although, there is no physical backbone infrastructure, a virtual backbone can be formed by constructing a Connected Dominating Set (CDS). The CDS of a graph representing a network has a significant impact on an efficient design of routing algorithms in WSN. A good CDS should first and foremost be small, additionally, it should have other characteristics such as robustness to node failures and low stretch. In this paper, we present a taxonomy and general classification of CDS construction algorithms. We survey different CDS construction algorithms for WSNs.
PDF Fulltext XML References Citation Report Citation
  •    A Beacon-enabled Least-time and Energy Efficient With One-level Data Aggregation Routing Protocol for WSNs using IEEE 802.15.4
  •    A Distributed Energy-aware Clustering Algorithm for Life Time Enhancement of Wireless Sensor Network
  •    Research on Network Performance of Wireless Sensor Networks with Adaptive Sleeping MAC Protocol based on Different Kinds of Topology Structure
  •    Maximization of Wireless Sensor Network’s Lifetime using Losningen Cross-layer Approach
  •    An Efficient Index-based Data Storage Method for Wireless Sensor Networks
How to cite this article:

Zhuo Liu, Bingwen Wang and Lejiang Guo, 2010. A Survey on Connected Dominating Set Construction Algorithm for Wireless Sensor Networks. Information Technology Journal, 9: 1081-1092.

DOI: 10.3923/itj.2010.1081.1092






Curve Bottom