OVSF-CDMA code assignment in wireless ad hoc networks

DOI10.1007/S00453-007-9094-6MaRDI QIDQ2471712zbMATH OpenOpenAlexFDO

Authors Peng-Jun Wan, Xiangyang Li, Ophir Frieder

Publication date 18 February 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.1660

zbMATH Keywords

Code assignmentOVSF-CDMAProximation algorithmsWireless ad hoc networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Recommendations

• Computing and Combinatorics
• Online OVSF Code Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• An algorithmic view on OVSF code assignment
• A constant-competitive algorithm for online OVSF code assignment

Cites work

• Introduction to algorithms
• Models and approximation algorithms for channel assignment in radio networks
• On chromatic sums and distributed resource allocation
• Rude-CSMA: A Multihop Channel Access Protocol
• Smallest-last ordering and clustering and graph coloring algorithms
• Unit disk graphs

Cited in

(9)

• \( L ( 2 , 1 )\)-labeling of disk intersection graphs
• Optimum OVSF code reassignment in wideband CDMA forward radio link
• Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks
• Online Tree Node Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Computing and Combinatorics
• Online tree node assignment with resource augmentation
• A constant-competitive algorithm for online OVSF code assignment
• OVSF code assignment strategies with minimal fragmentations for WCDMA systems

This page was built for publication: OVSF-CDMA code assignment in wireless ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471712)