Sciweavers

441 search results - page 48 / 89
» Approximate Coverage in Wireless Sensor Networks
Sort
View
114
Voted
ADHOCNOW
2004
Springer
15 years 8 months ago
Range-Free Ranking in Sensors Networks and Its Applications to Localization
We address the question of finding sensors’ coordinates, or at least an approximation of them, when the sensors’ abilities are very weak. In a d dimensional space, we define ...
Zvi Lotker, Marc Martinez de Albeniz, Stephane Per...
TMC
2010
210views more  TMC 2010»
15 years 1 months ago
Exploiting Reactive Mobility for Collaborative Target Detection in Wireless Sensor Networks
—Recent years have witnessed the deployments of wireless sensor networks in a class of mission-critical applications such as object detection and tracking. These applications oft...
Rui Tan, Guoliang Xing, Jianping Wang, Hing-Cheung...
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
15 years 9 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...

Presentation
945views
13 years 9 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
ICDCSW
2005
IEEE
15 years 8 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt