Sciweavers

468 search results - page 79 / 94
» Bandwidth-constrained queries in sensor networks
Sort
View
ICIP
2002
IEEE
15 years 11 months ago
SPIN-IT: a data centric routing protocol for image retrieval in wireless networks
In this paper, we propose and analyze a routing protocol for mobile ad hoc networks that supports efficient image retrieval based on metadata queries. In digital photography, meta...
Edward Woodrow, Wendi Rabiner Heinzelman
EWSN
2004
Springer
15 years 9 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
SUTC
2006
IEEE
15 years 3 months ago
Transitive Nearest Neighbor Search in Mobile Environments
Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) ∈ S × R...
Baihua Zheng, Ken C. K. Lee, Wang-Chien Lee
IWNAS
2006
IEEE
15 years 3 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
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
15 years 10 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...