Sciweavers

176 search results - page 28 / 36
» Task distribution with a random overlay network
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
TPDS
2008
157views more  TPDS 2008»
13 years 7 months ago
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
Bin Xiao, Hekang Chen, Shuigeng Zhou
JGAA
2006
120views more  JGAA 2006»
13 years 7 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
IPPS
2008
IEEE
14 years 2 months ago
ContinuStreaming: Achieving high playback continuity of Gossip-based Peer-to-Peer streaming
Gossip-based Peer-to-Peer(P2P) streaming has been proved to be an effective and resilient method to stream qualified media contents in dynamic and heterogeneous network environme...
Zhenhua Li, Jiannong Cao, Guihai Chen
GLOBECOM
2009
IEEE
13 years 5 months ago
Time-Critical Data Dissemination in Cooperative Peer-to-Peer Systems
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
Chi-Jen Wu, Cheng-Ying Li, Kai-Hsiang Yang, Jan-Mi...