Sciweavers

687 search results - page 15 / 138
» Connectivity and coverage maintenance in wireless sensor net...
Sort
View
129
Voted
MOBIHOC
2009
ACM
15 years 8 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...
ICDCS
2008
IEEE
15 years 8 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...
117
Voted
IEEECIT
2010
IEEE
15 years 12 days ago
Tessellating Cell Shapes for Geographical Clustering
This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more n...
Jakob Salzmann, Ralf Behnke, Dirk Timmermann
JOIN
2007
133views more  JOIN 2007»
15 years 1 months ago
The Coverage Problem in Three-Dimensional Wireless Sensor Networks
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo
WSNA
2003
ACM
15 years 7 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng