Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/105969
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSun, Xuemeien
dc.contributor.authorYang, Yongxinen
dc.contributor.authorMa, Maodeen
dc.date.accessioned2019-06-18T05:33:23Zen
dc.date.accessioned2019-12-06T22:01:51Z-
dc.date.available2019-06-18T05:33:23Zen
dc.date.available2019-12-06T22:01:51Z-
dc.date.issued2019en
dc.identifier.citationSun, X., Yang, Y., & Ma, M. (2019). Minimum connected dominating set algorithms for ad hoc sensor networks. Sensors, 19(8), 1919-. doi:10.3390/s19081919en
dc.identifier.issn1424-8220en
dc.identifier.urihttps://hdl.handle.net/10356/105969-
dc.description.abstractTo achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice. Presently, many approximate algorithms have been proposed to construct MCDS, the best among which is adopting the two-stage idea, that is, to construct a maximum independent set (MIS) firstly and then realize the connectivity through the Steiner tree construction algorithm. For the first stage, this paper proposes an improved collaborative coverage algorithm for solving maximum independent set (IC-MIS), which expands the selection of the dominating point from two-hop neighbor to three-hop neighbor. The coverage efficiency has been improved under the condition of complete coverage. For the second stage, this paper respectively proposes an improved Kruskal–Steiner tree construction algorithm (IK–ST) and a maximum leaf nodes Steiner tree construction algorithm (ML-ST), both of which can make the result closer to the optimal solution. Finally, the simulation results show that the algorithm proposed in this paper is a great improvement over the previous algorithm in optimizing the scale of the connected dominating set (CDS).en
dc.format.extent15 p.en
dc.language.isoenen
dc.relation.ispartofseriesSensorsen
dc.rights© 2019 The Authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).en
dc.subjectAd Hoc Sensor Networksen
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.subjectMaximum Independent Seten
dc.titleMinimum connected dominating set algorithms for ad hoc sensor networksen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.3390/s19081919en
dc.description.versionPublished versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Journal Articles
Files in This Item:
File Description SizeFormat 
Minimum connected dominating set algorithms for ad hoc sensor networks.pdf3.32 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 50

1
Updated on Jul 16, 2020

PublonsTM
Citations 50

1
Updated on Mar 4, 2021

Page view(s)

159
Updated on May 28, 2022

Download(s) 50

23
Updated on May 28, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.