Sciweavers

36 search results - page 3 / 8
» On the Hardness of Approximating the Network Coding Capacity
Sort
View
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
SIGMETRICS
2008
ACM
14 years 9 months ago
Traffic capacity of multi-cell WLANS
Performance of WLANs has been extensively studied during the past few years. While the focus has mostly been on isolated cells, the coverage of WLANs is in practice most often rea...
Thomas Bonald, Ali Ibrahim, James Roberts
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 4 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...
TIT
2008
112views more  TIT 2008»
14 years 9 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar
ICC
2008
IEEE
163views Communications» more  ICC 2008»
15 years 3 months ago
Network Coding Aware Dynamic Subcarrier Assignment in OFDMA Wireless Networks
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
Xinyu Zhang, Baochun Li