Sciweavers

18 search results - page 3 / 4
» A learning automata based scheduling solution to the dynamic...
Sort
View
AINA
2007
IEEE
13 years 11 months ago
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
Antoine Gallais, Jean Carle
TON
2010
173views more  TON 2010»
13 years 3 months ago
Minimizing delay and maximizing lifetime for wireless sensor networks with anycast
—In this paper, we are interested in minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks, for which events occur infrequently. In such syste...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...
EWSN
2009
Springer
14 years 5 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
EWSN
2008
Springer
14 years 4 months ago
Tracking Dynamic Boundary Fronts Using Range Sensors
Abstract. We examine the problem of tracking dynamic boundaries occurring in natural phenomena using range sensors. Two main challenges of the boundary tracking problem are energy-...
Subhasri Duttagupta, Krithi Ramamritham, Purushott...
COMCOM
2010
276views more  COMCOM 2010»
13 years 5 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu