Connected dominating set algorithms for wireless sensor networks

被引：8

作者：

Al-Nabhan, Najla ^{[1
]}

Al-Rodhaan, Mznah ^{[1
]}

Al-Dhelaan, Abdullah ^{[1
]}

Cheng, Xiuzhen ^{[2
]}

机构：

[1] King Saud Univ, Dept Comp Sci, Riyadh, Saudi Arabia

[2] George Washington Univ, Dept Comp Sci, Washington, DC USA

来源：

INTERNATIONAL JOURNAL OF SENSOR NETWORKS | 2013年 / 13卷 / 02期

基金：

美国国家科学基金会;

关键词：

CDS; connected dominating set; wireless sensor networking; virtual backbone; maximal independent set; unit disk graph; approximation algorithm; VIRTUAL BACKBONE CONSTRUCTION; APPROXIMATION;

D O I：

10.1504/IJSNET.2013.053719

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Wireless Sensor Networks (WSNs) are gaining more interest in a variety of applications. Of their different characteristics and challenges, network management and lifetime elongation are the most considered issues in WSN based systems. Connected Dominating Set (CDS) is known to be an efficient strategy to control network topology, reduce overhead, and extend network lifetime. Designing a CDS algorithm for WSNs is very challenging. This paper provides a review on connected dominating set construction techniques for wireless sensor networks.

引用

页码：121 / 134

页数：14

共 63 条

[1]

Alzoubi K. M., 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences, P3849, DOI 10.1109/HICSS.2002.994519

[2]

[Anonymous], 10 IEEE SING INT C C

[3]

[Anonymous], NSF INT WORKSH THEOR

[4]

[Anonymous], 1990, CONGR NUMER CONF J N

[5]

[Anonymous], 1999, P 3 INT WORKSHOP DIS, DOI DOI 10.1145/313239.33261

[6]

[Anonymous], 3 INT C WIR ALG SYST

[7]

[Anonymous], DESIGN ANAL CONNECTE

[8]

[Anonymous], 7 ACM INT S MOB AD H

[9]

[Anonymous], P 3 ACM INT S MOB AD

[10]

[Anonymous], 2001, Introduction to Graph Theory

← 1 2 3 4 5 6 7 →