Performance evaluation of the least conflict sharable spreading code assignment algorithm

Multihop CDMA wireless networks with a large number of stations would require a large number of spreading codes, even with code reuse beyond the interference range. In this paper, we propose the least conflict sharable code assignment algorithm to reduce the number of codes needed and at the same ti...

Full description

Saved in:
Bibliographic Details
Main Authors: Kwok-Wah Hung, Fun-Yu Wong
Format: Conference Proceeding
Language:English
Subjects:
Access protocols
Algorithm design and analysis
Bandwidth
Data mining
Interference
Multiaccess communication
Performance analysis
Signal design
Spread spectrum communication
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multihop CDMA wireless networks with a large number of stations would require a large number of spreading codes, even with code reuse beyond the interference range. In this paper, we propose the least conflict sharable code assignment algorithm to reduce the number of codes needed and at the same time avoid code collisions as far as possible. We also introduce the mean conflictness of a network as a performance index of code assignment algorithms. Numerical results show that this new algorithm can reduce nearly 20 percent of the mean conflictness when compared to randomly sharing the codes.
DOI:10.1109/PIMRC.1996.568475