Applications of connected certified domination in wireless sensor networks

Wireless Sensor Networks (WSNs) are an amazing combination of cutting-edge technology and effective data collecting. WSN technology is more efficient and low power consuming networking technology in the present world. These networks are used for a variety of purposes, including environmental monitoring, automation in factories, healthcare, and smart cities. The fundamental aim of this article is to study the applications of connected certified dominating sets (CCDS) in WSNs. To construct a minimal CCDS, we apply the greedy technique to develop a centralized algorithm GR_CCDS in just one phase, with a time complexity of O((Δ2 + logn)n). Subsequently, another method called P_CCDS is designed with a time complexity of O(n2) to prune unnecessary nodes in the MCCDS generated by GR_CCDS.

Authors

Publication Details

Journal
Journal of Information and Optimization Sciences
Published
2025-01-01
DOI
https://doi.org/10.47974/jios-1790
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Applications of connected certified domination in wireless sensor networks

Naveen Mani, Azham Ilyass, Narayan Prasad
Journal of Information and Optimization Sciences
Energy Efficient Wireless Sensor Networks
article

Applications of connected certified domination in wireless sensor networks

Naveen Mani, Azham Ilyass, Narayan Prasad
article en

Abstract

Wireless Sensor Networks (WSNs) are an amazing combination of cutting-edge technology and effective data collecting. WSN technology is more efficient and low power consuming networking technology in the present world. These networks are used for a variety of purposes, including environmental monitoring, automation in factories, healthcare, and smart cities. The fundamental aim of this article is to study the applications of connected certified dominating sets (CCDS) in WSNs. To construct a minimal CCDS, we apply the greedy technique to develop a centralized algorithm GR_CCDS in just one phase, with a time complexity of O((Δ2 + logn)n). Subsequently, another method called P_CCDS is designed with a time complexity of O(n2) to prune unnecessary nodes in the MCCDS generated by GR_CCDS.

Journal of Information and Optimization SciencesVol. 46(3)
Openalex Percentile: Top 94%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.