Sciweavers

776 search results - page 115 / 156
» Network Applications of Graph Bisimulation
Sort
View
DCOSS
2008
Springer
13 years 11 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
INFOCOM
2010
IEEE
13 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
APPT
2007
Springer
14 years 4 months ago
Replication-Based Partial Dynamic Scheduling on Heterogeneous Network Processors
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on...
Zhiyong Yu, Zhiyi Yang, Fan Zhang, Zhiwen Yu, Tuan...
ECUMN
2007
Springer
14 years 4 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
SIGCOMM
2004
ACM
14 years 3 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra