Network-assisted diversity for random access wireless networks

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 ext...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 48; no. 3; pp. 702 - 711
Main Authors: Tsatsanis, M.K., Ruifeng Zhang, Banerjee, S.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.03.2000
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
Bit rate
Data mining
Exact sciences and technology
Information, signal and communications theory
Multiaccess communication
Networks
Packet transmission
Random access
Receivers
Reproduction
Separation
Signal and communications theory
Signal processing
Signal resolution
Signal, noise
Source separation
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Throughput
Time division multiple access
Wireless networks
Wireless sensor networks
Waveform
Multiple access
Wireless telecommunication
Packet transmission
Optimal detection
Queueing network
Single server queue
Modeling
Markov chain
Separation method
Experimental result
Algorithm performance
Noisy channel
Collision frequency
Signal processing
Numerical simulation
Performance analysis
ISSN:1053-587X, 1941-0476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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/spl times/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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/78.824666