Sciweavers

600 search results - page 80 / 120
» Validated cost models for sensor network queries
Sort
View
SIGMETRICS
1998
ACM
110views Hardware» more  SIGMETRICS 1998»
15 years 10 months ago
LoGPC: Modeling Network Contention in Message-Passing Programs
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
Csaba Andras Moritz, Matthew Frank
MIDDLEWARE
2005
Springer
15 years 11 months ago
Adaptive query processing in mobile environment
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
Hocine Grine, Thierry Delot, Sylvain Lecomte
GLOBECOM
2006
IEEE
16 years 2 days ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
INFOCOM
2007
IEEE
16 years 10 days ago
Border Games in Cellular Networks
— In each country today, cellular networks operate on carefully separated frequency bands. This careful separation is imposed by the regulators of the given country to avoid the ...
Márk Félegyházi, Mario Cagalj...
CCS
2006
ACM
15 years 9 months ago
Secure hierarchical in-network aggregation in sensor networks
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song