2019
DOI: 10.1109/tit.2018.2860041
|View full text |Cite
|
Sign up to set email alerts
|

Throughput Region of Spatially Correlated Interference Packet Networks

Abstract: 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 proto… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 64 publications
0
2
0
Order By: Relevance
“…Remark 1. The capacity region of the two-user erasure interference channel with delayed CSIT is known only under certain conditions [12], [20], [21], and remains unsolved for the general case. Our results for the X-Channel rely on the achievability strategy of other well-known problems, including the two-user erasure interference channel with delayed CSIT.…”
Section: A Statement Of the Main Resultsmentioning
confidence: 99%
“…Remark 1. The capacity region of the two-user erasure interference channel with delayed CSIT is known only under certain conditions [12], [20], [21], and remains unsolved for the general case. Our results for the X-Channel rely on the achievability strategy of other well-known problems, including the two-user erasure interference channel with delayed CSIT.…”
Section: A Statement Of the Main Resultsmentioning
confidence: 99%
“…length of phase, number of bits received by each user, etc). A more precise statement would use a concentration theorem result such as the Bernstein inequality to show the omitted terms do not affect the overall result and the achievable rates as done in [29], [30].…”
Section: Achievability Proof For C Blind Dd In Case a Of Theoremmentioning
confidence: 99%