Sciweavers

373 search results - page 65 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
TPDS
2010
99views more  TPDS 2010»
13 years 6 months ago
Snoogle: A Search Engine for Pervasive Environments
—Embedding small devices into everyday objects like toasters and coffee mugs creates a wireless network of objects. These embedded devices can contain a description of the underl...
Haodong Wang, Chiu Chiang Tan, Qun Li
MOBISYS
2008
ACM
14 years 7 months ago
Micro-Blog: sharing and querying content through mobile phones and social participation
Recent years have witnessed the impacts of distributed content sharing (Wikipedia, Blogger), social networks (Facebook, MySpace), sensor networks, and pervasive computing. We beli...
Al Schmidt, Jack Li, Landon P. Cox, Romit Roy Chou...
FOCS
2008
IEEE
14 years 2 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
SENSYS
2003
ACM
14 years 1 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song