Sciweavers

2190 search results - page 61 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
13 years 7 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
EWSN
2006
Springer
14 years 7 months ago
Distributed Dynamic Shared Tree for Minimum Energy Data Aggregation of Multiple Mobile Sinks in Wireless Sensor Networks
Abstract. Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, thr...
Kwang-il Hwang, Jeongsik In, Doo Seop Eom
GD
2004
Springer
14 years 1 months ago
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
Craig Gotsman, Yehuda Koren
ICAI
2008
13 years 9 months ago
Mapping of Activity Recognition as a Distributed Inference Problem in Sensor Network
- This paper presents a distributed model for detecting Activities of Daily Living (ADLs) in a home setting. We consider an environment where household devices and utensils are aug...
Md. Kamrul Hasan, Husne Ara Rubaiyeat, Young-Koo L...
UIC
2007
Springer
14 years 1 months ago
A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
Ming Liu, Yuan Zheng, Jiannong Cao, Wei Lou, Guiha...