An Algorithmic View on OVSF Code Assignment

Orthogonal Variable Spreading Factor (OVSF) codes are used in UMTS to share the radio spectrum among several connections of possibly different bandwidth requirements. The combinatorial core of the OVSF code assignment problem is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. A connection that uses a 2-d fraction of the total bandwidth requires some code at depth d in the tree, but this code assignment is allowed to change over time. Requests for connections that would exceed the total available bandwidth are rejected. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu propose the so-called DCA algorithm to solve the problem optimally. In contrast, we show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial-time greedy algorithm that achieves approximation ratio Θ(h). A more practically relevant version is the online code assignment problem, where future requests are not known in advance. Our objective is to minimize the overall number of code reassignments. We present a Θ(h)-competitive online algorithm, and show that no deterministic online algorithm can achieve a competitive ratio better than 1.5. We show that the greedy strategy (minimizing the number of reassignments in every step) is not better than Ω(h) competitive. We give a 2-resource augmented online algorithm that achieves an amortized constant number of (re-)assignments. Finally, we show that the problem is fixed-parameter tractabl

Real-time communication platfrom for wireless cyber-physical applications

A Cyber-Physical System (CPS) is a physical system whose operations are monitored, coordinated, and controlled by computation and communication processes. Applying wireless technologies to cyber-physical systems can significantly enhance the system mobility and reduce the deployment and maintenance cost. Existing wireless technologies, however either cannot provide real-time or probabilistic guarantee on packet delivery or are not fast enough to support desired application requirements. Nondeterministic packet transmission and insufficiently high sampling rate will severely hurt application performance. To address this problem, we propose a real-time wireless communication platform called RT-WiFi. In this dissertation, we present our design and implementation of the data link layer and network management framework of RT-WiFi platform that provides predictable packet delivery and high sampling rate. The RT-WiFi communication platform is designed to support configurable components for adjusting design trade-offs including sampling rate, latency variance, reliability and thus can serve as a suitable communication platform for supporting a wide range of wireless CPS applications. Based on the RT-WiFi management platform, we further propose advanced network management techniques to provide jitter-free scheduling algorithm for improving system performance and to support reliable data transmission in noisy environments. To evaluate the effectiveness of our proposed algorithms and to verify the efficiency of our network management platform, we conduct a series of experiments and a case study that integrate the RT-WiFi communication platform with a health care CPS application to investigate the application performance in the real world.Computer Science

Optimization of Access to CDMA Networks

Cílem dizertační práce je optimalizace přístupu do sítí CDMA (Code Division Multiple Access). Práce se konkrétně zabývá algoritmy pro řízení přístupu do sítě pro systém UMTS (Universal Mobile Telecommunication System). V úvodní části je pozornost zaměřena na popis dosavadního vývoje dané problematiky a následně je provedena analýza řízení přístupu do sítě UMTS. V programu MATLAB byl vytvořen vlastní model systému UMTS, který umožňuje implementovat vybrané algoritmy přístupu do sítě. Pozornost byla zaměřena na algoritmy, které využívají činitel zatížení, fuzzy logiku a genetické algoritmy. Všechny algoritmy byly s pomocí vytvořeného simulačního programu vzájemně porovnány. Cílem práce je vytvořit vhodný simulační program, prozkoumat vlastnosti jednotlivých algoritmů a případně provést jejich optimalizaci.The aim of this dissertation thesis is an optimization of access to CDMA networks. To be more specific, this thesis deals with an optimization of admission control in UMTS network. The first part of the thesis deals with the present progress of the particular topic. Thereinafter there is an analysis of admission control in UMTS system. An own UMTS simulation program was created in MATLAB. This program enables implementation and simulation of the selected admission control algorithms. The thesis is focused on load factor based, fuzzy logic based and genetic algorithms. The created UMTS simulator was used for the mutual comparison of all algorithms. The aims of this thesis are the suitable UMTS model design, evaluation and possible optimization of selected algorithms.

An algorithmic view on OVSF code assignment

Abstract. The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact n O(h) -time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results

An algorithmic view on OVSF code assignment ∗

Orthogonal Variable Spreading Factor (OVSF) codes can be used to share the radio spectrum among several connections of possibly different bandwidth, which is used for example in UMTS. The combinatorial core of the OVSF code assignment problem is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. A connection that uses 2 −d of the total bandwidth requires some code at depth d in the tree, but this code assignment is allowed to change over time. Requests for connections that would exceed the total available bandwidth are rejected. We consider the one-step code assignment problem: Given an assignment, reassign a minimum number of codes to serve a new request. Minn and Siu propose the so-called DCA algorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact n O(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). We also consider the online code assignment problem, wher

An algorithmic view on OVSF code assignment

ISSN:0178-4617ISSN:1432-054