Spreading code assignment in an ad hoc DS-CDMA wireless network

In this paper, we examine the problem of optimal spreading code assignment in an ad hoc DS-CDMA wireless network. The problem is formulated in two ways, with the optimization criteria being minimizing the congestion measure, and minimizing the total consumed power, respectively. Either formulation is converted to an optimization of the weighted total squared cross-correlation (WTSC), after some mathematical simplification. We then devise algorithms to reach some local minima of the optimization. Simulation results show significant reduction in the network congestion measure and power consumption, compared with random code allocation.

[1]  N. Bambos,et al.  Toward power-sensitive network architectures in wireless communications: concepts, issues, and design aspects , 1998, IEEE Wirel. Commun..

[2]  Stephen V. Hanly,et al.  Congestion measures in DS-CDMA networks , 1999, IEEE Trans. Commun..

[3]  Venkat Anantharam,et al.  Optimal sequences and sum capacity of synchronous CDMA systems , 1999, IEEE Trans. Inf. Theory.

[4]  James L. Massey,et al.  Optimum sequence multisets for synchronous code-division multiple-access channels , 1994, IEEE Trans. Inf. Theory.

[5]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[6]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[7]  Roy D. Yates,et al.  Iterative construction of optimum signature sequence sets in synchronous CDMA systems , 2001, IEEE Trans. Inf. Theory.

[8]  Limin Hu,et al.  Distributed code assignments for CDMA packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[9]  David Tse,et al.  Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers , 1999, IEEE Trans. Inf. Theory.

[10]  J. Massey,et al.  Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems , 1993 .

[11]  Paul D. Alexander,et al.  Random Sequence Multisets for Synchronous Code-Division Multiple-Access Channels , 1998, IEEE Trans. Inf. Theory.