Collision resolution techniques for wireless random access networks without throughput penalities

Author

Tsatsanis, Michail K. ; Zhang, Ruifeng ; Banerjee, Subrata

Author_Institution

Dept. of Electr. & Comput. Eng., Stevens Inst. of Technol., Hoboken, NJ, USA

Volume

2

fYear

1998

fDate

5-9 Oct 1998

Firstpage

1325

Abstract

A novel viewpoint for 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 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 are studied in the paper, related to the implementation of the collision detection algorithm

Keywords

access protocols; cellular radio; packet radio networks; telecommunication congestion control; collision detection algorithm; collision resolution techniques; performance; received collided packets; receiver; signal separation principles; slotted random access networks; source mixing problem; throughput penalities; wireless random access networks; Base stations; Bit rate; Computer networks; Data mining; Diversity methods; Diversity reception; Signal processing; Throughput; Time division multiple access; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Universal Personal Communications, 1998. ICUPC '98. IEEE 1998 International Conference on

Conference_Location

Florence

ISSN

1091-8442

Print_ISBN

0-7803-5106-1

Type

conf

DOI

10.1109/ICUPC.1998.733708

Filename

733708