Sciweavers

1162 search results - page 219 / 233
» Requirements for Routing in the Application Layer
Sort
View
IPSN
2007
Springer
14 years 2 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
IEEEPACT
2006
IEEE
14 years 2 months ago
Two-level mapping based cache index selection for packet forwarding engines
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the ...
Kaushik Rajan, Ramaswamy Govindarajan
CLUSTER
2005
IEEE
14 years 2 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
FOCS
1995
IEEE
13 years 12 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
PEWASUN
2007
ACM
13 years 9 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi