Sciweavers

370 search results - page 10 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
Improving Connectivity via Relays Deployment in Wireless Sensor Networks
Abstract— Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivit...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
INFOCOM
2012
IEEE
11 years 9 months ago
A robust boundary detection algorithm based on connectivity only for 3D wireless sensor networks
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
Hongyu Zhou, Hongyi Wu, Miao Jin
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
MOBIHOC
2008
ACM
14 years 7 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
JCO
2006
153views more  JCO 2006»
13 years 7 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong