Sciweavers

1687 search results - page 65 / 338
» On the complexity of scheduling in wireless networks
Sort
View
ICC
2007
IEEE
138views Communications» more  ICC 2007»
16 years 14 days ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy
GLOBECOM
2010
IEEE
15 years 4 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
16 years 21 days ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
INFOCOM
2007
IEEE
16 years 14 days ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
OPODIS
2008
15 years 7 months ago
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
Due to the heterogenous power-saving requirement in wireless sensor networks, we propose the Cyclic Quorum System Pair (CQS-Pair) which can guarantee that two asynchronous nodes ad...
Shouwen Lai, Bo Zhang, Binoy Ravindran, Hyeonjoong...