Abstract
In this paper, we analyse the throughput of a multihop network, where nodes use slotted ALOHA as medium access protocol (MAC) and are able to receive simultaneously several packets in a slot. We provide a closed-form formula for the throughput in the generic case as a function of the probability, rn,k, for a receiver to decode k packets given that n have been sent in its neighborhood. We then consider several simple models for the computation of the rn,k, when spread slotted ALOHA is used. In particular, we compare the performances of a matched filter (MF) receiver with those of a linear minimum meansquare error (MMSE) multi-user detector (MUD). Capacity results show the great advantage of multi-packet reception and highlight the near-far resistance of the MUD scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 301-314 |
| Number of pages | 14 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2928 |
| Publication status | Published - 1 Jan 2003 |
| Externally published | Yes |