The least-conflict code grouping algorithm for CDMA wireless information networks

Author

Kwok-Wah Hung ; Lin Wang

Author_Institution

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

Volume

3

fYear

1993

fDate

19-21 Oct. 1993

Firstpage

154

Abstract

In code division multiple access (CDMA) wireless information networks, it is important to find an efficient algorithm for assigning as few codes to the stations as possible. We propose the least-conflict code grouping algorithm for selecting which stations should share the same code to reduce the number of codes needed. The simulation result shows that only a few codes are required to drive a throughput-delay performance, of the coded tone sense (CTS) protocol, very close to the case where each station has a unique code.<>

Keywords

code division multiple access; codes; delays; packet radio networks; protocols; radio stations; CDMA; code division multiple access; coded tone sense protocol; least-conflict code grouping algorithm; mobile radio systems; packet radio networks; simulation result; station; throughput-delay performance; wireless information networks; Access protocols; Bandwidth; Computer networks; Electronic mail; Mobile communication; Monitoring; Multiaccess communication; Packet radio networks; Signal design; Spread spectrum communication;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on

Conference_Location

Beijing, China

Print_ISBN

0-7803-1233-3

Type

conf

DOI

10.1109/TENCON.1993.327946

Filename

327946