Sciweavers

1318 search results - page 163 / 264
» Synchronous Elastic Networks
Sort
View
SPAA
2010
ACM
14 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
GLOBECOM
2010
IEEE
13 years 7 months ago
Differential Cooperative Communications with Space-Time Network Coding
Abstract--In multinode cooperative communications, simultaneous transmissions from two or more nodes are challenging due to its asynchronous nature. In addition, channel estimation...
Zhenzhen Gao, Hung-Quoc Lai, K. J. Ray Liu
IMCSIT
2010
13 years 7 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
TSP
2011
162views more  TSP 2011»
13 years 4 months ago
Space-Time Network Coding
Abstract—In multinode cooperative communications, simultaneous transmissions from two or more nodes are challenging due to its asynchronous nature. In addition, channel estimatio...
Hung-Quoc Lai, K. J. Ray Liu