A new efficient selective repeat protocol for point-to-multipoint communication

Jolfaei, M. Aghadavoodi; Martín, Sebastián; Mattfeldt, J.

doi:10.1109/icc.1993.397450

Cited by 37 publications

(19 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These overheard packets become side information that can be exploited later. The basic scheme, initially proposed by [10] for unicast setting, and then by [11] for multicasting setting, in the two-receiver case, works as follows. The transmitter sends packets intended for each receiver separately.…”

Section: Connections With the Packet Erasure Broadcast Channelmentioning

confidence: 99%

Completely stale transmitter channel state information is still very useful

Maddah-Ali

Tse

2010

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

236

792

View full text Add to dashboard Cite

Transmitter channel state information (CSIT) is crucial for the multiplexing gains offered by advanced interference management techniques such as multiuser MIMO and interference alignment. Such CSIT is usually obtained by feedback from the receivers, but the feedback is subject to delays. The usual approach is to use the fed back information to predict the current channel state and then apply a scheme designed assuming perfect CSIT. When the feedback delay is large compared to the channel coherence time, such a prediction approach completely fails to achieve any multiplexing gain. In this paper, we show that even in this case, the completely stale CSI is still very useful. More concretely, we show that in a MIMO broadcast channel with K transmit antennas and K receivers each with 1 receive antenna,degrees of freedom is achievable even when the fed back channel state is completely independent of the current channel state. Moreover, we establish that if all receivers have independent and identically distributed channels, then this is the optimal number of degrees of freedom achievable. In the optimal scheme, the transmitter uses the fed back CSI to learn the side information that the receivers receive from previous transmissions rather than to predict the current channel state. Our result can be viewed as the first example of feedback providing a degree-of-freedom gain in memoryless channels.

show abstract

Section: Connections With the Packet Erasure Broadcast Channelmentioning

confidence: 99%

Completely stale transmitter channel state information is still very useful

Maddah-Ali

Tse

2010

2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

236

792

View full text Add to dashboard Cite

show abstract

“…This abstraction is depicted in Fig. 1(b) and is closely related to Erasure Interference Channel (IC) model [5], [6] which in turn is a generalization of Erasure Broadcast Channel (BC) model [7]- [12] to capture interference. In this work, we assume wireless nodes learn the binary quadruple α(t) = {α 11 (t), α 12 (t), α 21 (t), α 22 (t)}…”

Section: Introductionmentioning

confidence: 99%

“…As mentioned above, there is a large body of work on wireless networks with delayed knowledge of the interference pattern or the channel state information. This delayed knowledge was used in [7] to create transmitted signals that are simultaneously useful for multiple users in a broadcast channel. These ideas were then extended to different wireless networks, including erasure broadcast channels [9], [11] leading to determination of the Degrees of Freedom (DoF) region of multiple-input single-output (MISO) Gaussian BCs [13].…”

Section: Introductionmentioning

confidence: 99%

Throughput Region of Spatially Correlated Interference Packet Networks

Vahid

Calderbank

2019

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for packet retransmission. Conventional random access protocols interrupt communication to resolve contention which reduces network throughput and increases latency and power consumption. In this work we take a different approach and we develop opportunistic random access protocols rather than pursuing conventional methods. We allow wireless nodes to communicate without interruption and to observe the interference pattern. We then use this interference pattern knowledge and channel statistics to counter the negative impact of interference. We prove the optimality of our protocols using an extremal rankratio inequality. An important part of our contributions is the integration of spatial correlation in our assumptions and results. We identify spatial correlation regimes in which inherently outdated feedback becomes as good as idealized instantaneous feedback, and correlation regimes in which feedback does not provide any throughput gain. To better illustrate the results, and as an intermediate step, we characterize the capacity region of finite-field spatially correlated interference channels with delayed channel state information at the transmitters.

show abstract

“…Researchers have considered wireless networks in which transmitters have access to delayed knowledge of the channel state information (CSI). In particular, the delayed knowledge was used in [1] to create transmitted signals that are simultaneously useful for multiple users in a broadcast channel. These ideas were then extended to different wireless networks, including the erasure broadcast channels [2], leading to determination of the DoF region of broadcast channels [3], and the DoF region of multi-antenna multi-user Gaussian ICs and X channels [4]- [7].…”

Section: Introductionmentioning

confidence: 99%

When does spatial correlation add value to delayed channel state information?

Vahid

Calderbank

2016

2016 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Abstract-Fast fading wireless networks with delayed knowledge of the channel state information have received significant attention in recent years. An exception is networks where channels are spatially correlated. This paper characterizes the capacity region of two-user erasure interference channels with delayed knowledge of the channel state information and spatially correlated channels. There are instances where spatial correlation eliminates any potential gain from delayed channel state information and instances where it enables the same performance that is possible with instantaneous knowledge of channel state. The key is an extremal entropy inequality for spatially correlated channels that separates the two types of instances. It is also shown that to achieve the capacity region, each transmitter only needs to rely on the delayed knowledge of the channels to which it is connected.

show abstract

A new efficient selective repeat protocol for point-to-multipoint communication

Cited by 37 publications

References 10 publications

Completely stale transmitter channel state information is still very useful

Completely stale transmitter channel state information is still very useful

Throughput Region of Spatially Correlated Interference Packet Networks

When does spatial correlation add value to delayed channel state information?

Contact Info

Product

Resources

About