In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
An important objective of wireless sensor networks (WSNs) is to reliably sense data about the environment in which they are deployed. Reliability in WSNs has been widely studied in...
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...