Sciweavers

15 search results - page 1 / 3
» Improving partial cover of Random Walks in large-scale Wirel...
Sort
View
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
13 years 11 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
ADHOCNOW
2010
Springer
13 years 6 months 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...
GLOBECOM
2010
IEEE
13 years 2 months ago
Compressive Data Persistence in Large-Scale Wireless Sensor Networks
This paper considers a large-scale wireless sensor network where sensor readings are occasionally collected by a mobile sink, and sensor nodes are responsible for temporarily stori...
Mu Lin, Chong Luo, Feng Liu, Feng Wu
MSWIM
2006
ACM
13 years 10 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
EWSN
2010
Springer
14 years 1 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth