Sciweavers

229 search results - page 7 / 46
» A Distributed Greedy Algorithm for Connected Sensor Cover in...
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
CODES
2010
IEEE
13 years 5 months ago
A greedy buffer allocation algorithm for power-aware communication in body sensor networks
Monitoring human movements using wireless sensory devices promises to revolutionize the delivery of healthcare services. In spite of their potentials for many application domains,...
Hassan Ghasemzadeh, Roozbeh Jafari
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
13 years 7 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
SECON
2008
IEEE
14 years 1 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...