Title :
Distributed code assignments for CDMA packet radio networks
Author_Institution :
California Univ., Berkeley, CA, USA
Abstract :
Two-phase algorithms are devised to assign and reassign spread-spectrum codes to transmitters, to receivers, and to pairs of stations in a large dynamic packet radio network (PRN) using code-division multiple access (CDMA). The algorithms minimize the time complexity in the first phase and minimize the number of control packets needed to be exchanged in the second phase. A new pairwise code-assignment scheme is proposed to assign codes to edges. Simulations based on well-controlled topologies (sparse topologies) show that the proposed scheme requires much fewer codes than transmitter-based code assignment, while maintaining throughput performance
Keywords :
code division multiple access; digital radio systems; graph colouring; network topology; packet switching; radio networks; spread spectrum communication; CDMA; code-division multiple access; distributed code assignments; graph colouring; packet radio network; pairwise code-assignment scheme; sparse topologies; spread-spectrum codes; Access protocols; Frequency division multiaccess; Interference; Multiaccess communication; Network topology; Packet radio networks; Spread spectrum communication; Switches; Throughput; Time division multiple access;
Conference_Titel :
INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE
Conference_Location :
Bal Harbour, FL
Print_ISBN :
0-87942-694-2
DOI :
10.1109/INFCOM.1991.147683