Graph model for optimal OVSF code placement strategies

Authors:
Wen Ouyang;Chang Wu Yu;Meng-Ti Liu;Yu-Wei Chang
Affiliations:
Department of Computer Science and Information Engineering, Chung Hua University, 707, Sec. 2, WuFu Rd., Hsinchu 30012, Taiwan;Department of Computer Science and Information Engineering, Chung Hua University, 707, Sec. 2, WuFu Rd., Hsinchu 30012, Taiwan;Department of Computer Science and Information Engineering, Chung Hua University, 707, Sec. 2, WuFu Rd., Hsinchu 30012, Taiwan;Department of Computer Science and Information Engineering, Chung Hua University, 707, Sec. 2, WuFu Rd., Hsinchu 30012, Taiwan
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2012

Citing 10
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management

IEEE Transactions on Mobile Computing
Efficient OVSF Code Assignment and Reassignment Strategies in UMTS

IEEE Transactions on Mobile Computing
An Algorithmic View on OVSF Code Assignment

Algorithmica
OVSF code assignment strategies with minimal fragmentations for WCDMA systems

Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient integration OVSF code management strategies in UMTS

Computer Communications
Genetic approach for dynamic OVSF code allocation in 3G wireless networks

Applied Soft Computing
Wideband DS-CDMA for next-generation mobile communications systems

IEEE Communications Magazine
UMTS/IMT-2000 based on wideband CDMA

IEEE Communications Magazine
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The code utilisation of OVSF-CDMA systems are significantly impacted by the code placement and replacement schemes which have been studied by many researchers as independent problems. We formally define the placement optimality and present a novel graph model, CIDP, which is proved to be NP-complete for general graphs where the CIDP graphs reduced from the OVSF code placement problem are trivial perfect graphs. A unified algorithm UCMS-1, provided to firstly address both OVSF code placement and replacement jointly, achieves placement optimality in linear time complexity. It shows that OVSF code placement optimality problem is in P.