Sciweavers

225 search results - page 30 / 45
» Capacity Bounds for Sticky Channels
Sort
View
ADHOC
2007
102views more  ADHOC 2007»
13 years 8 months ago
On the capacity of the single source multiple relay single destination mesh network
In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among...
Lawrence Ong, Mehul Motani
CORR
2007
Springer
90views Education» more  CORR 2007»
13 years 8 months ago
Rateless coding with partial state information at the decoder
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
Anand D. Sarwate, Michael Gastpar
DAM
2006
113views more  DAM 2006»
13 years 8 months ago
On the complexity of suboptimal decoding for list and decision feedback schemes
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
Jürgen Freudenberger, Victor V. Zyablov
MOBIHOC
2008
ACM
14 years 8 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
ICALP
2009
Springer
14 years 8 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...