36 search results - page 1 / 8 » Coverage-adaptive random sensor scheduling for application-a... |
COMCOM
2006
13 years 4 months ago
2006
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 ...
ADHOCNOW
2010
Springer
13 years 5 months ago
2010
Springer
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
TIP
2010
12 years 11 months ago
2010
We explore camera scheduling and energy allocation strategies for lifetime optimization in image sensor networks. For the application scenarios that we consider, visual coverage ov...
INFOCOM
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
AINA
2006
IEEE
13 years 6 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...