170 search results - page 4 / 34 » On Wireless Scheduling Algorithms for Minimizing the Queue-O... |
165
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...
129
click to vote
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
135
click to vote
TPDS
2010
15 years 1 months ago
2010
—We propose FIT, a flexible, lightweight, and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hierarchical...
193
click to vote
TMC
2012
13 years 5 months ago
2012
—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...
166
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...