Sciweavers

2149 search results - page 330 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
LCN
1999
IEEE
15 years 5 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
DCOSS
2008
Springer
15 years 3 months ago
FIT: A Flexible, LIght-Weight, and Real-Time Scheduling System for Wireless Sensor Platforms
Abstract. We propose FIT, a flexible, light-weight and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hiera...
Wei Dong, Chun Chen, Xue Liu, Kougen Zheng, Rui Ch...
HPDC
2007
IEEE
15 years 7 months ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...
CN
2004
109views more  CN 2004»
15 years 1 months ago
Architectures and protocols for mobile computing applications: a reconfigurable approach
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs...
Carla-Fabiana Chiasserini, Francesca Cuomo, Leonar...
PIMRC
2010
IEEE
14 years 11 months ago
Contact surround in opportunistic networks
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...