A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network

International Journal of Distributed Sensor Networks - United States
doi 10.1177/155014771703201
Full Text
Abstract

Available in full text

Date
Authors
Publisher

SAGE Publications

Related search

A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks

2014English

Constructing Minimum Connected Dominating Set: Algorithmic Approach

International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks
2010English

Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset

Journal of Communications
2016English

Distributed Construction of Minimum Connected Dominating Set in Wireless Sensor Network Using Two-Hop Information

Computer Networks
Computer NetworksCommunications
2017English

Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems

Mathematics
Mathematics
2019English

A Virtual Backbone Construction Algorithm Based on Connected Dominating Set in Wireless Sensor Networks

2014English

A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

Journal of Optimization
2017English

An Efficient Connected Dominating Set Algorithm in WSNs Based on the Induced Tree of the Crossed Cube

International Journal of Applied Mathematics and Computer Science
2015English

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy