49 search results - page 6 / 10 » A tight lower bound for parity in noisy communication networ... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...