Sciweavers

226 search results - page 20 / 46
» On Connected Multiple Point Coverage in Wireless Sensor Netw...
Sort
View
IPPS
2005
IEEE
14 years 2 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 8 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
MOBIHOC
2009
ACM
14 years 3 months ago
Low-connectivity and full-coverage three dimensional wireless sensor networks
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 disjoint ...
Xiaole Bai, Chuanlin Zhang, Dong Xuan, Jin Teng, W...
WINET
2010
133views more  WINET 2010»
13 years 7 months ago
Connectivity of ad hoc wireless networks: an alternative to graph-theoretic approaches
Connectivity in wireless ad hoc and sensor networks is typically analyzed using a graph-theoretic approach. In this paper, we investigate an alternative communication-theoretic app...
Sooksan Panichpapiboon, Gian Luigi Ferrari, Ozan K...
ICDCS
2008
IEEE
14 years 3 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...