Constructing weakly connected dominating set for secure clustering in distributed sensor network

DOI10.1007/s10878-010-9358-yzbMath1242.90192OpenAlexW2115010428MaRDI QIDQ421263

Hongjie Du, Donghyun Kim, Weili Wu, Shan Shan, Won Jun Lee

Publication date: 23 May 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9358-y

zbMATH Keywords

securitymaximal independent setunit disk graphDSNweakly connected dominating set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

Maximum lifetime connected coverage with two active-phase sensors ⋮ Efficient accuracy evaluation for multi-modal sensed data ⋮ On the complexity of connectivity in cognitive radio networks through spectrum assignment ⋮ Sensor Cover and Double Partition ⋮ Tractable connected domination for restricted bipartite graphs

Cites Work

• Unnamed Item
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• On weakly connected domination in graphs
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

This page was built for publication: Constructing weakly connected dominating set for secure clustering in distributed sensor network