184 search results - page 24 / 37 » Communication in Networks with Random Dependent Faults |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
ICPP
2002
IEEE
14 years 10 days ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
SIGMOD
2004
ACM
14 years 25 days ago
2004
ACM
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variabl...