Sciweavers

9 search results - page 1 / 2
» Querying Dynamic Wireless Sensor Networks with Non-revisitin...
Sort
View
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
CCR
2008
112views more  CCR 2008»
13 years 4 months ago
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most o...
Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash S...
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
DCOSS
2005
Springer
13 years 6 months ago
An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
Pierre Leone, Sotiris E. Nikoletseas, José ...
INFOCOM
2009
IEEE
13 years 11 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu