Pith. sign in

REVIEW

Packet Throughput Analysis of Static and Dynamic TDD in Small Cell Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1704.01305 v1 pith:QPTG4XUR submitted 2017-04-05 cs.IT math.IT

Packet Throughput Analysis of Static and Dynamic TDD in Small Cell Networks

classification cs.IT math.IT
keywords celld-tddpackets-tddthroughputanalysisasymmetricdynamic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We develop an analytical framework for the perfor- mance comparison of small cell networks operating under static time division duplexing (S-TDD) and dynamic TDD (D-TDD). While in S-TDD downlink/uplink (DL/UL) cell transmissions are synchronized, in D-TDD each cell dynamically allocates resources to the most demanding direction. By leveraging stochastic geom- etry and queuing theory, we derive closed-form expressions for the UL and DL packet throughput, also capturing the impact of random traffic arrivals and packet retransmissions. Through our analysis, which is validated via simulations, we confirm that D-TDD outperforms S-TDD in DL, with the vice versa occurring in UL, since asymmetric transmissions reduce DL interference at the expense of an increased UL interference. We also find that in asymmetric scenarios, where most of the traffic is in DL, D-TDD provides a DL packet throughput gain by better controlling the queuing delay, and that such gain vanishes in the light-traffic regime.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.