OVSF-CDMA code assignment in wireless ad hoc networks

Authors:
Peng-Jun Wan;Xiang-Yang Li;Ophir Frieder
Affiliations:
Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL
Venue:
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Year:
2004

Citing 11
Cited 4

An introduction to chromatic sums

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Unit disk graphs

Discrete Mathematics - Topics on domination
Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks

IEEE/ACM Transactions on Networking (TON)
A new model for scheduling packet radio networks

Wireless Networks
On chromatic sums and distributed resource allocation

Information and Computation
Smallest-last ordering and clustering and graph coloring algorithms

Journal of the ACM (JACM)
Models and approximation algorithms for channel assignment in radio networks

Wireless Networks
Introduction to Algorithms

Introduction to Algorithms
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA

IEEE Journal on Selected Areas in Communications
Multiple access protocol for integration of variable bit rate multimedia traffic in UMTS/IMT-2000 based on wideband CDMA

IEEE Journal on Selected Areas in Communications

Online OVSF Code Assignment with Resource Augmentation

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
SIGACT news online algorithms column 14

ACM SIGACT News
A constant-competitive algorithm for online OVSF code assignment

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Orthogonal Variable Spreading Factor (OVSF) CDMA code provides a means of support of variable rate data service at low hardware cost. In contrast to the conventional orthogonal fixed-spreading-factor CDMA code, OVSF-CDMA code consists of an infinite number of codewords with variable rates but not every pair of 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 neither of them is within the transmission range of the other and no other node is located in the intersection of their transmission ranges. 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 heuristics for conflict-free code assignment in OVSF-CDMA wireless ad hoc networks. Each heuristic 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.