2013 Asilomar Conference on Signals, Systems and Computers 2013
DOI: 10.1109/acssc.2013.6810381
|View full text |Cite
|
Sign up to set email alerts
|

On decoding the kth strongest user in poisson networks with arbitrary fading distribution

Abstract: Consider a d-dimensional network whose transmitters form a non-uniform Poisson point process and whose links are subject to arbitrary fading. Assuming interference from the k − 1 strongest users is canceled, we derive the probability of decoding the k-th strongest user in closed-form. As a special case, when k = 1, this probability is the standard coverage probability.This analytical result has immediate applications in networks with successive interference cancellation (SIC) capability. We use it to find clos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
4
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 8 publications
1
4
0
Order By: Relevance
“…It is worthwhile to note that (5.17) is independent of µ j . This is in line with [129,130] where the authors prove that the probability to successfully cancel at least n interferers is scale invariant with respect to the density as long as the analysis is restricted to the power-law density case.…”
Section: Probability Generating Functional Approachsupporting
confidence: 87%
See 1 more Smart Citation
“…It is worthwhile to note that (5.17) is independent of µ j . This is in line with [129,130] where the authors prove that the probability to successfully cancel at least n interferers is scale invariant with respect to the density as long as the analysis is restricted to the power-law density case.…”
Section: Probability Generating Functional Approachsupporting
confidence: 87%
“…In [125], closed-form expressions are presented for the outage probability accounting for the order statistics, assuming that all interferers are at the same distance from the intended receiver, while [128] derives a lower bound of the outage probability based on the order statistics of the strongest uncanceled and partially canceled signals accounting for distance and fading. Very recently, some excellent contributions can be found that explicitly include both the topology and the fading effects in the description of sum of order statistics of the received signal power [129][130][131][132], yet, these models limit the analysis to single-tier networks.…”
Section: Introductionmentioning
confidence: 99%
“…Multi-user decoding increases the rate but comes at the cost of a higher decoding energy consumption due to the multiple decoding attempts. The performance of MD depends on the order statistics of the received signal power, which in turn is affected by the spatial distribution of the transmitting nodes and on the propagation channel conditions [55], [56]. Consistently with previous work [57]- [59], we consider perfect interference cancellation.…”
Section: A Performance Analysis Of Multi-user Decodingmentioning
confidence: 94%
“…The strategies proposed in literature to improve the SINR are broadly classified as network cooperation (NC) and interference cancelation (IC) (Akoum, 2010;Giovanidis, 2014;Zhang, 2013a;Zhang,2012;Zhang,2013b;Wildemeersch,2014).WithNCbasedstrategies,significant improvementinSINRisbeingachievedbycombiningsignalsof'n'strongesttransmitterstoserve singleuser (Akoum,2010;Giovanidis,2014;Zhang,2013a).ALaplacetechniquebasedmathematical modelforcoverageprobabilityanalysisunderstochasticgeometry-basedcooperationstrategiesis beingdevelopedin (Giovanidis&Baccelli,2014).WithICbasedstrategies,theservicingnodewith strongestreceivedsignalstrength,cancelsthe(n-1)subsequentstrongestinterferingsignals.With thesestrategies,significantimprovementincoverageprobabilityhasbeenregisteredinHetNet (Zhang, 2012;Zhang,2013b;Wildemeersch,2014).…”
Section: Introductionmentioning
confidence: 99%