Pith. Sign in

RECORD

Poisson Hole Process: Theory and Applications to Wireless Networks

Information Theory · Submitted 6 Jan 2016

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Numerical comparisons reveal that the new bounds outperform all known bounds and approximations, and are remarkably tight in all operational regimes of interest.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1601.01090 (version 2)
Pith IDLCWQVEDS, Pith's permanent record of this paper and its review
CitationHarpreet S. Dhillon, Mehrnaz Afshang, Peter Han Joo Chong, Zeinab Yazdanshenasan. "Poisson Hole Process: Theory and Applications to Wireless Networks." arXiv:1601.01090 (2016). https://pith.science/paper/LCWQVEDS
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,491 input tokens.

What the abstract itself states, as probabilities: claims first 0.12 · states limitation 0.55 · human participants 0.02 · controlled comparison 0.16 · randomized assignment 0.01 · states quantitative result 0.45 · compares with prior results 0.95 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

Interference field in wireless networks is often modeled by a homogeneous Poisson Point Process (PPP). While it is realistic in modeling the inherent node irregularity and provides meaningful first-order results, it falls short in modeling the effect of interference management techniques, which typically introduce some form of spatial interaction among active transmitters. In some applications, such as cognitive radio and device-to-device networks, this interaction may result in the formation of holes in an otherwise homogeneous interference field. The resulting interference field can be accurately modeled as a Poisson Hole Process (PHP). Despite the importance of PHP in many applications, the exact characterization of interference experienced by a typical node in a PHP is not known. In this paper, we derive several tight upper and lower bounds on the Laplace transform of this interference. Numerical comparisons reveal that the new bounds outperform all known bounds and approximations, and are remarkably tight in all operational regimes of interest. The key in deriving these tight and yet simple bounds is to capture the local neighborhood around the typical point accurately while simplifying the far field to attain tractability. Ideas for tightening these bounds further by incorporating the effect of overlaps in the holes are also discussed. These results immediately lead to an accurate characterization of the coverage probability of the typical node in a PHP under Rayleigh fading.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Interference field in wireless networks is often modeled by a homogeneous Poisson Point Process (PPP). background 1.00 0.04 0.02 asserted 0.93
s1 While it is realistic in modeling the inherent node irregularity and provides meaningful first-order results, it falls short in modeling the effect of interference management techniques, which typically introduce some form of spatial interaction among active transmitters. background 0.81 0.11 0.02 asserted 1.00
s2 In some applications, such as cognitive radio and device-to-device networks, this interaction may result in the formation of holes in an otherwise homogeneous interference field. background 1.00 0.07 0.02 hedged possibility 1.00
s3 The resulting interference field can be accurately modeled as a Poisson Hole Process (PHP). background 0.94 0.08 0.06 asserted 0.98
s4 Despite the importance of PHP in many applications, the exact characterization of interference experienced by a typical node in a PHP is not known. gap 1.00 0.06 0.03 asserted 1.00
s5 In this paper, we derive several tight upper and lower bounds on the Laplace transform of this interference. contribution 0.97 0.97 0.38 asserted 1.00
s6 Numerical comparisons reveal that the new bounds outperform all known bounds and approximations, and are remarkably tight in all operational regimes of interest. result 0.95 0.94 0.40 asserted 1.00
s7 The key in deriving these tight and yet simple bounds is to capture the local neighborhood around the typical point accurately while simplifying the far field to attain tractability. method 0.98 0.91 0.08 asserted 1.00
s8 Ideas for tightening these bounds further by incorporating the effect of overlaps in the holes are also discussed. future work 0.99 0.68 0.03 hedged possibility 0.67
s9 These results immediately lead to an accurate characterization of the coverage probability of the typical node in a PHP under Rayleigh fading. result 0.68 0.91 0.27 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Interference field in wireless networks is often modeled by a homogeneous Poisson Point Process (PPP). While it is realistic in modeling the inherent node irregularity and provides meaningful first-order results, it falls short in modeling the effect of interference management techniques, which typically introduce some form of spatial interaction among active transmitters. In some applications, such as cognitive radio and device-to-device networks, this interaction may result in the formation of holes in an otherwise homogeneous interference field. The resulting interference field can be accurately modeled as a Poisson Hole Process (PHP). Despite the importance of PHP in many applications, the exact characterization of interference experienced by a typical node in a PHP is not known. In this paper, we derive several tight upper and lower bounds on the Laplace transform of this interference. Numerical comparisons reveal that the new bounds outperform all known bounds and approximations, and are remarkably tight in all operational regimes of interest. The key in deriving these tight and yet simple bounds is to capture the local neighborhood around the typical point accurately while simplifying the far field to attain tractability. Ideas for tightening these bounds further by incorporating the effect of overlaps in the holes are also discussed. These results immediately lead to an accurate characterization of the coverage probability of the typical node in a PHP under Rayleigh fading.

Human review
References
How the literature uses it

3 arXiv papers cite this in 10 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 4 sentences without a confident label

Uses its method or tool 2 papers
Cites it as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.