Sciweavers

52 search results - page 2 / 11
» Incremental Construction of k-Dominating Sets in Wireless Se...
Sort
View
IWCMC
2006
ACM
13 years 11 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
MOBIHOC
2008
ACM
14 years 4 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
JPDC
2006
187views more  JPDC 2006»
13 years 5 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
JSAC
2010
91views more  JSAC 2010»
13 years 3 months ago
Constructing low-connectivity and full-coverage three dimensional sensor networks
Abstract—Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k...
Chuanlin Zhang, Xiaole Bai, Jin Teng, Dong Xuan, W...
ICDCS
2008
IEEE
13 years 11 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
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...