Sciweavers

Share
38 search results - page 1 / 8
» Coverage-adaptive random sensor scheduling for application-a...
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
8 years 11 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
ADHOCNOW
2010
Springer
9 years 20 days ago
Coverage-Adaptive Random Walks for Fast Sensory Data Collection
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...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
ADHOC
2015
3 years 7 months ago
DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks
Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they...
Behnam Dezfouli, Marjan Radi, Kamin Whitehouse, Sh...
AINA
2006
IEEE
9 years 1 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
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...
Haibo Zhang, Hong Shen
TIP
2010
151views more  TIP 2010»
8 years 6 months ago
Camera Scheduling and Energy Allocation for Lifetime Maximization in User-Centric Visual Sensor Networks
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...
Chao Yu, Gaurav Sharma
books