Sciweavers

461 search results - page 56 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
EWSN
2009
Springer
16 years 2 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, ...
INFOCOM
2010
IEEE
15 years 12 days ago
Energy-Conserving Scheduling in Multi-hop Wireless Networks with Time-Varying Channels
Abstract— MaxWeight algorithm, a.k.a., back-pressure algorithm, has received much attention as a viable solution for dynamic link scheduling in multi-hop wireless networks. The b...
Yang Song, Chi Zhang, Yuguang Fang, Zhisheng Niu
COMCOM
2006
150views more  COMCOM 2006»
15 years 2 months ago
Adaptive ad hoc self-organizing scheduling for quasi-periodic sensor network lifetime
Wireless sensor networks are poised to revolutionize our abilities in sensing and controlling our environment. Power conservation is a primary research concern for these networks....
Sharat C. Visweswara, Rudra Dutta, Mihail L. Sichi...
ICN
2005
Springer
15 years 7 months ago
Application-Driven Node Management in Multihop Wireless Sensor Networks
A strategy for energy saving in wireless sensor networks is to manage the duty cycle of sensors, by dynamically selecting a different set of nodes to be active in every moment. We ...
Flávia Coimbra Delicato, Fábio Prott...
SAC
2010
ACM
15 years 8 months ago
Coverage-hole trap model in target tracking using distributed relay-robot network
Target tracking is an important issue in wireless sensor network applications. In this paper, we design a Coverage-Hole Trap Model (CTM) based on a system that contains one moving...
Huawei Miao, Chia-Ching Ooi, Xiaowen Wu, Christian...