Title of article
Network-assisted diversity for random access wireless networks
Author/Authors
Tsatsanis، نويسنده , , M.K.، نويسنده , , Ruifeng Zhang، نويسنده , , Banerjee، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
10
From page
702
To page
711
Abstract
A novel viewpoint to the collision resolution problem is introduced 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 k users collide in a given time slot, they repeat their transmission for a total of k times so that k copies of the collided packets are received. Then, the receiver has to resolve a k×k source mixing problem and separate each individual user. The proposed method does not introduce throughput penalties since it requires only k slots to transmit k colliding packets. Performance issues that are related to the implementation of the collision detection algorithm are studied. The protocolʹs parameters are optimized to maximize the system throughput
Keywords
Collision resolution , Markov chain , Diversity , M/G/1 queue , Multiple access , Random access , signal separation.
Journal title
IEEE TRANSACTIONS ON SIGNAL PROCESSING
Serial Year
2000
Journal title
IEEE TRANSACTIONS ON SIGNAL PROCESSING
Record number
403177
Link To Document