Sciweavers

528 search results - page 3 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
TMC
2012
11 years 8 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
SENSYS
2003
ACM
13 years 11 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
INFOCOM
2012
IEEE
11 years 8 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
ALGOSENSORS
2007
Springer
14 years 16 days ago
Local Approximation Algorithms for Scheduling Problems in Sensor Networks
Patrik Floréen, Petteri Kaski, Topi Musto, ...
ADHOCNOW
2009
Springer
13 years 7 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...