On greedy construction of connected dominating sets in wireless networks

Yingshu Li; My T. Thai; Feng Wang; Chih Wei Yi; Peng Jun Wan; Ding Zhu Du

doi:10.1002/wcm.356

On greedy construction of connected dominating sets in wireless networks

Yingshu Li, My T. Thai, Feng Wang, Chih Wei Yi, Peng Jun Wan, Ding Zhu Du

Research output: Contribution to journal › Review article › peer-review

166 Scopus citations

Abstract

Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8 + ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same.

Original language	English (US)
Pages (from-to)	927-932
Number of pages	6
Journal	Wireless Communications and Mobile Computing
Volume	5
Issue number	8
DOIs	https://doi.org/10.1002/wcm.356
State	Published - Dec 2005
Externally published	Yes

Keywords

Connected dominating set
Greedy algorithm
Maximal independent set
Wireless network

ASJC Scopus subject areas

Information Systems
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1002/wcm.356

Cite this

@article{44f6daf918fb402d9b164764e910c365,

title = "On greedy construction of connected dominating sets in wireless networks",

abstract = "Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8 + ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same.",

keywords = "Connected dominating set, Greedy algorithm, Maximal independent set, Wireless network",

author = "Yingshu Li and Thai, {My T.} and Feng Wang and Yi, {Chih Wei} and Wan, {Peng Jun} and Du, {Ding Zhu}",

year = "2005",

month = dec,

doi = "10.1002/wcm.356",

language = "English (US)",

volume = "5",

pages = "927--932",

journal = "Wireless Communications and Mobile Computing",

issn = "1530-8669",

publisher = "John Wiley and Sons Ltd",

number = "8",

}

TY - JOUR

T1 - On greedy construction of connected dominating sets in wireless networks

AU - Li, Yingshu

AU - Thai, My T.

AU - Wang, Feng

AU - Yi, Chih Wei

AU - Wan, Peng Jun

AU - Du, Ding Zhu

PY - 2005/12

Y1 - 2005/12

N2 - Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8 + ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same.

AB - Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8 + ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same.

KW - Connected dominating set

KW - Greedy algorithm

KW - Maximal independent set

KW - Wireless network

UR - http://www.scopus.com/inward/record.url?scp=29144524581&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29144524581&partnerID=8YFLogxK

U2 - 10.1002/wcm.356

DO - 10.1002/wcm.356

M3 - Review article

AN - SCOPUS:29144524581

SN - 1530-8669

VL - 5

SP - 927

EP - 932

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

IS - 8

ER -

On greedy construction of connected dominating sets in wireless networks

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this