Performance evaluation of the least conflict sharable spreading code assignment algorithm

Author

Hung, Kwok-Wah ; Wong, Fun-Yu

Author_Institution

Dept. of Comput., Hong Kong Polytech., Kowloon, Hong Kong

Volume

3

fYear

1996

fDate

15-18 Oct 1996

Firstpage

1207

Abstract

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

Keywords

code division multiple access; packet radio networks; pseudonoise codes; spread spectrum communication; CDMA; code collisions avoidance; least conflict sharable spreading code assignment algorithm; mean conflictness; multihop wireless networks; numerical results; packet radio networks; performance evaluation; Access protocols; Algorithm design and analysis; Bandwidth; Data mining; Interference; Multiaccess communication; Performance analysis; Signal design; Spread spectrum communication; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 1996. PIMRC'96., Seventh IEEE International Symposium on

Conference_Location

Taipei

Print_ISBN

0-7803-3692-5

Type

conf

DOI

10.1109/PIMRC.1996.568475

Filename

568475