Sciweavers

618 search results - page 13 / 124
» Coverage with Connectivity in Wireless Sensor Networks
Sort
View
ICC
2007
IEEE
188views Communications» more  ICC 2007»
14 years 1 months ago
Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks
—In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asympt...
Yang Xiao, Ying Zhang, Xinyu Sun, Hui Chen
INFOCOM
2009
IEEE
14 years 2 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
IJSNET
2006
217views more  IJSNET 2006»
13 years 7 months ago
Optimal sleep scheduling with transmission range assignment in application-specific wireless sensor networks
: To extend the functional lifetime of battery-operated Wireless Sensor Networks (WSNs), stringent sleep scheduling strategies with communication duty cycles running at sub-1% rang...
Rick W. Ha, Pin-Han Ho, Xuemin Shen
ICDCS
2008
IEEE
14 years 2 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...