Sciweavers

270 search results - page 27 / 54
» Robust Planarization of Unlocalized Wireless Sensor Networks
Sort
View
SECON
2007
IEEE
14 years 2 months ago
OPERA: An Optimal Progressive Error Recovery Algorithm for Wireless Sensor Networks
—Wireless Sensor Networks (WSNs) require robustness against channel induced errors while retransmission based schemes prove too costly for energy constrained sensor nodes. Channe...
Saad B. Qaisar, Hayder Radha
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 2 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
CACM
2008
84views more  CACM 2008»
13 years 7 months ago
The emergence of a networking primitive in wireless sensor networks
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
Philip Levis, Eric A. Brewer, David E. Culler, Dav...
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
14 years 2 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