Please use this identifier to cite or link to this item:
Title: Distributed Detection of Critical Nodes in Wireless Sensor Networks Using Connected Dominating Set
Authors: Dağdeviren, Orhan
Akram, Vahid Khalilpour
Tavlı, Bülent
Yıldız, Hüseyin Uğur
Atılgan, Can
Keywords: Wireless sensor networks
critical node detection
connected dominating set
Issue Date: 2016
Publisher: IEEE
Source: Dagdeviren, O., Akram, V. K., Tavli, B., Yildiz, H. U., and Atilgan, C. (2016, October). Distributed detection of critical nodes in wireless sensor networks using connected dominating set. In 2016 IEEE SENSORS (pp. 1-3). IEEE.
Abstract: A critical node (cut vertex) in a wireless sensor network (WSN) is a node which its failure divides the network to disconnected parts. Identification of such nodes is the first step in countering against the threats on WSN reliability. In this paper, we propose the Connected Dominating Set based CUT vertex detection (CDSCUT) approach. We define 5 new rules for deciding about the statuses of nodes. The proposed algorithm has O(Delta(2)) local computation complexity and O(log(2)n) bit complexity per node where n is the node count and Delta is the maximum node degree. The simulation results show that our proposed approach achieves up to 30% improvement in percentage of status detection compared to the previous CDS based approach while consuming similar time and energy.
ISBN: 978-1-4799-8287-5
ISSN: 1930-0395
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender


checked on Sep 23, 2022

Page view(s)

checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.