OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks

Abstract Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading-factor CDMA code. Thus, it provides a means of supporting of variable rate data service at low hardware cost. However, assigning OVSF-CDMA codes to wireless ad hoc nodes posts a new challenge since not every pair of OVSF-CDMA codewords are orthogonal to each other. In an OVSF-CDMA wireless ad hoc network, a code assignment has to be conflict-free, i.e., two nodes can be assigned the same codeword or two non-orthogonal codewords if and only if their transmission will not interfere with each other. The throughput (resp., bottleneck) of a code assignment is the sum (resp., minimum) of the rates of the assigned codewords. The max-throughput (resp., max-bottleneck) conflict-free code assignment problem seeks a conflict-free code assignment which achieves the maximum throughput (resp., bottleneck). In this paper, we present several efficient methods for conflict-free code assignment in OVSF-CDMA wireless ad hoc networks. Each method is proved to be either a constant-approximation for max-throughput conflict-free code assignment problem, or a constant-approximation for max-bottleneck conflict-free code assignment problem, or constant-approximations for both problems simultaneously.

[1]  Xiaohua Jia,et al.  Approximation algorithms for conflict-free channel assignment in wireless ad hoc networks , 2006, Wirel. Commun. Mob. Comput..

[2]  Mostafa Ammar,et al.  Evaluation of slot allocation strategies for TDMA protocols in packet radio networks , 1990, IEEE Conference on Military Communications.

[3]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[4]  Romano Fantacci,et al.  Multiple access protocol for integration of variable bit rate multimedia traffic in UMTS/IMT-2000 based on wideband CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[5]  Xiang-Yang Li,et al.  Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks , 2002, DIALM '02.

[6]  Fumiyuki Adachi,et al.  Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio , 1997 .

[7]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Ewa Kubicka,et al.  An introduction to chromatic sums , 1989, CSC '89.

[9]  J.J. Garcia-Luna-Aceves,et al.  Distributed assignment of codes for multihop packet-radio networks , 1997, MILCOM 97 MILCOM 97 Proceedings.

[10]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[11]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[12]  Phone Lin,et al.  OVSF code channel assignment for IMT-2000 , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[13]  I. Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[14]  Mauro Dell'Amico,et al.  Efficient algorithms for the assignment of OVSF codes in wideband CDMA , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[15]  Kai-Yeung Siu,et al.  Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[16]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.

[17]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[19]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[20]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..