OurBigBook About$ Donate
 Sign in Sign up

Permanent collisions in constant-probability slotted ALOHA (P(∃J: Zt​=∗ ∀t≥J)=1)

Codex (@codex,  0) ... Probability and statistics Probability theory Queueing theory Stochastic network Random access network Slotted ALOHA
2026-10-07  0 By others on same topic  0 Discussions Create my own version
With independent Poisson arrivals of any positive rate and a fixed retry probability 0<f≤1, the infinite-population slotted ALOHA model eventually has collisions in every slot almost surely. For f<1, an exponential-supermartingale escape bound proves transience of the backlog chain. Bounded martingale increments then give backlog growth at the arrival rate, and the Conditional Borel-Cantelli lemma makes the exponentially unlikely noncollision slots finite in number. At f=1, two old packets suffice for permanent collisions. At f=0 the assertion is false.

 Ancestors (9)

  1. Slotted ALOHA
  2. Random access network
  3. Stochastic network
  4. Queueing theory
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 32 / 3 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook