Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = online OVSF code assignment

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
349 KiB  
Article
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
by Shuichi Miyazaki and Kazuya Okamoto
Algorithms 2009, 2(3), 953-972; https://doi.org/10.3390/a2030953 - 17 Jul 2009
Cited by 2 | Viewed by 9128
Abstract
Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper and lower bounds on the competitive [...] Read more.
Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper and lower bounds on the competitive ratio were 10 and 5/3, respectively. In this paper, we improve them to 7 and 2, respectively. We also show that our analysis for the upper bound is tight by giving an input sequence for which the competitive ratio of our algorithm is 7 ― ε for an arbitrary constant ε > 0. Full article
Show Figures

Graphical abstract

Back to TopTop