DMCA
Network-assisted diversity for random access wireless networks (2000)
| Venue: | IEEE Trans. on Signal Processing |
| Citations: | 74 - 0 self |
BibTeX
@ARTICLE{Tsatsanis00network-assisteddiversity,
author = {Michail K. Tsatsanis and Ruifeng Zhang and Student Member and Subrata Banerjee},
title = {Network-assisted diversity for random access wireless networks},
journal = {IEEE Trans. on Signal Processing},
year = {2000},
pages = {702--711}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—A novel viewpoint to the collision resolution problem is introduced in this paper for wireless slotted random access networks. This viewpoint is based on signal separation principles borrowed from signal processing problems. The received collided packets are not discarded in this approach but are exploited to extract each individual user packet information. In particular, if users collide in a given time slot, they repeat their transmission for a total of times so that copies of the collided packets are received. Then, the receiver has to resolve a source mixing problem and separate each individual user. The proposed method does not introduce throughput penalties since it requires only slots to transmit colliding packets. Performance issues that are related to the implementation of the collision detection algorithm are studied in the paper. The protocol’s parameters are optimized to maximize the system throughput. Index Terms—Collision resolution, diversity, Markov chain, M/G/1 queue, multiple access, random access, signal separation.
Keyphrases
network-assisted diversity random access wireless network collided packet throughput penalty collision resolution problem protocol parameter novel viewpoint index term collision resolution source mixing problem system throughput markov chain signal separation principle individual user packet information signal separation time slot individual user random access performance issue collision detection algorithm random access network multiple access signal processing problem
