z-logo
open-access-imgOpen Access
A Multi-Start Local Search Algorithm Finding Minimum Connected Dominating Set in Wireless Sensor Networks
Author(s) -
SeungHo Kang,
Min-A Jeong,
Seong Ro Lee
Publication year - 2015
Publication title -
the journal of korean institute of communications and information sciences
Language(s) - English
Resource type - Journals
eISSN - 2287-3880
pISSN - 1226-4717
DOI - 10.7840/kics.2015.40.6.1142
Subject(s) - connected dominating set , construct (python library) , wireless sensor network , computer science , scalability , set (abstract data type) , wireless network , cover (algebra) , wireless , computer network , dominating set , set cover problem , local search (optimization) , algorithm , distributed computing , theoretical computer science , engineering , telecommunications , mechanical engineering , database , minimum spanning tree , programming language , graph , vertex (graph theory)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom