Sciweavers

345 search results - page 63 / 69
» Probabilistic Coverage in Wireless Sensor Networks
Sort
View
IWNAS
2006
IEEE
14 years 2 months ago
Hint-based Routing in WSNs using Scope Decay Bloom Filters
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
Xiuqi Li, Jie Wu, Jun (Jim) Xu
CCS
2006
ACM
14 years 9 days ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 15 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
TWC
2010
13 years 3 months ago
Bandwidth exchange: an energy conserving incentive mechanism for cooperation
Cooperative forwarding in wireless networks has shown to yield rate and diversity gains, but it incurs energy costs borne by the cooperating nodes. In this paper we consider an inc...
Dan Zhang, Ryoichi Shinkuma, Narayan B. Mandayam
ICDE
2008
IEEE
100views Database» more  ICDE 2008»
14 years 10 months ago
Mobile Filter: Exploring Migration of Filters for Error-Bounded Data Collection in Sensor Networks
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. All p...
Dan Wang, Jianliang Xu, Jiangchuan Liu, Feng Wang