| 1. |
- Flärdh, Oscar, 1980-
(författare)
-
Modelling, analysis and experimentation of a simple feedback scheme for error correction control
- 2007
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Data networks are an important part in an increasing number of applications with real-time and reliability requirements. To meet these demands a variety of approaches have been proposed. Forward error correction, which adds redundancy to the communicated data, is one of them. However, the redundancy occupies communication bandwidth, so it is desirable to control the amount of redundancy in order to achieve high reliability without adding excessive communication delay. The main contribution of the thesis is to formulate the problem of adjusting the redundancy in a control framework, which enables the dynamic properties of error correction control to be analyzed using control theory. The trade-off between application quality and resource usage is captured by introducing an optimal control problem. Its dependence on the knowledge of the network state at the transmission side is discussed. An error correction controller that optimizes the amount of redundancy without relying on network state information is presented. This is achieved by utilizing an extremum seeking control algorithm to optimize the cost function. Models with varying complexity of the resulting feedback system are presented and analyzed. Conditions for convergence are given. Multiple-input describing function analysis is used to examine periodic solutions. The results are illustrated through computer simulations and experiments on a wireless sensor network.
|
|
| 2. |
- Johansson, Björn, 1978-
(författare)
-
Distributed resource allocation in networked systems using decomposition techniques
- 2006
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The Internet and power distribution grids are examples of ubiquitous systems that are composed of subsystems that cooperate using a communication network. We loosely define such systems as networked systems. These systems are usually designed by using trial and error. With this thesis, we aim to fill some of the many gaps in the diverse theory of networked systems. Therefore, we cast resource allocation in networked systems as optimization problems, and we investigate a versatile class of optimization problems. We then use decomposition methods to devise decentralized algorithms that solve these optimization problems. The thesis consists of four main contributions: First, we review decomposition methods that can be used to devise decentralized algorithms for solving the posed optimization problems. Second, we consider cross-layer optimization of communication networks. Network performance can be increased if the traditionally separated network layers are jointly optimized. We investigate the interplay between the data sending rates and the allocation of resources for the communication links. The communication networks we consider have links where the data transferring capacity can be controlled. Decomposition methods are applied to the design of fully distributed protocols for two wireless network technologies: networks with orthogonal channels and network-wide resource constraints, as well as wireless networks using spatial-reuse time division multiple access. Third, we consider the problem of designing a distributed control strategy such that a linear combination of the states of a number of vehicles coincide at a given time. The vehicles are described by linear difference equations and are subject to convex input constraints. It is demonstrated how primal decomposition techniques and incremental subgradient methods allow us to find a solution in which each vehicle performs individual planning of its trajectory and exchanges critical information with neighbors only. We explore various communication, computation, and control structures. Fourth, we investigate the resource allocation problem for large-scale server clusters with quality-of-service objectives, in which key functions are decentralized. Specifically, the problem of selecting which services the servers should provide is posed as a discrete utility maximization problem. We develop an efficient centralized algorithm that solves this problem, and we propose three suboptimal schemes that operate with local information.
|
|
| 3. |
- Antonsson, Stefan, 1979-
(författare)
-
The Use of Lignin Derivatives to Improve Selected Paper Properties
- 2007
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Ved består huvudsakligen av tre typer av polymerer, cellulosa, hemicellulosa och lignin. Lignin bildas i naturen genom enzymatiskt initierad oxidativ koppling av tre olika typer av fenylpropan-enheter. Dessa bygger genom olika kol-kol- och kol-syre-bindningar upp en amorf tredimensionell polymer. När kemisk massa tillverkas bryts lignin ner och löses ut i kokluten. Luten innehåller de förbrukade kokkemikalierna och bränns generellt i en sodapanna för att regenerera kemikalierna och producera ånga. Sodapannan är emellertid dyr. Därför har den blivit produktionsbegränsande på många massabruk. Att avlägsna en del av ligninet från avluten vore därför önskvärt och att finna ekonomiskt intressanta produkter baserade på lignin från svartlut är därför ett viktigt forskningsområde . Ett lämpligt område för ligninprodukter vore som tillsatts i oblekt massa. Oblekt massa används till stor del för tillverkning av kraftliner, topp- och bottenskikten på wellpapp. När lådor av wellpapp lagras i containrar som färdas över haven, förändras den relativa luftfuktigheten. Detta gör att lådorna kollapsar lättare än om de skulle ha lagrats vid konstant luftfuktighet, även en hög sådan. Detta är på grund av det så kallade mekanosorptiva- eller accelererade krypfenomenet. Genom tillsatts av våtstyrkemedel till kraftliner eller behandla den med hydrofoba ämnen, finns indikatoner på att mekanosorptiva effekten skulle kunna minska. För att försöka minska den effekten har ett lågmolekylärt kraftlignin, som utvunnits med hjälp av tvärsflödesfiltrering av svartlut och svavelsyrafällning, använts. Genom derivatisering av detta lignin med linolja erhölls ett hydrofobt ligninderivat som uppvisar strukturella likheter med biopolymeren suberin. När detta suberinlika ligninderivat tillsätts till massa verkar det mekanosorptiva krypet minska. När lågmolekylärt lignin används tillsammans med ligninradikalinitiatorerna lackas eller mangan(III) i kraftlinermassa erhålls dessutom en våtstyrka på ca 5% av torrstyrkan. Efter aminering av detta lignin gav en tillsatts till kraftlinermassan en våtstyrka på upp till 10% av torrstyrkan. Det finns indikationer på att det mekanosorptiva krypet samtidigt minskar när dessa behandlingar görs som ger upphov till ökad våtstyrka.
|
|
| 4. |
- Bao, Lei, 1976-
(författare)
-
Source-channel coding for closed-loop control
- 2006
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Networked embedded control systems are present almost everywhere. A recent trend is to introduce wireless sensor networks in these systems, to take advantage of the added mobility and flexibility offered by wireless solutions. In such networks, the sensor observations are typically quantized and transmitted over noisy links. Concerning the problem of closed-loop control over such non-ideal communication channels, relatively few works have appeared so far. This thesis contributes to this field, by studying some fundamentally important problems in the design of joint source--channel coding and optimal control. The main part of the thesis is devoted to joint design of the coding and control for scalar linear plants, whose state feedbacks are transmitted over binary symmetric channels. The performance is measured by a finite-horizon linear quadratic cost function. The certainty equivalence property of the studied systems is utilized, since it simplifies the overall design by separating the estimation and the control problems. An iterative optimization algorithm for training the encoder--decoder pairs, taking channel errors into account in the quantizer design, is proposed. Monte Carlo simulations demonstrate promising improvements in performance compared to traditional approaches. Event-triggered control strategies are a promising solution to the problem of efficient utilization of communication resources. The basic idea is to let each control loop communicate only when necessary. Event-triggered and quantized control are combined for plants affected by rarely occurring disturbances. Numerical experiments show that it is possible to achieve good control performance with limited control actuation and sensor communication.
|
|
| 5. |
- Gunnar, Anders
(författare)
-
Towards robust traffic engineering in IP networks
- 2007
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- To deliver a reliable communication service it is essential for the network operator to manage how traffic flows in the network. The paths taken by the traffic is controlled by the routing function. Traditional ways of tuning routing in IP networks are designed to be simple to manage and are not designed to adapt to the traffic situation in the network. This can lead to congestion in parts of the network while other parts of the network are far from fully utilized. In this thesis we explore issues related to optimization of the routing function to balance load in the network. We investigate methods for efficient derivation of the traffic situation using link count measurements. The advantage of using link counts is that they are easily obtained and yield a very limited amount of data. We evaluate and show that estimation based on link counts give the operator a fast and accurate description of the traffic demands. For the evaluation we have access to a unique data set of complete traffic demands from an operational IP backbone. Furthermore, we evaluate performance of search heuristics to set weights in link-state routing protocols. For the evaluation we have access to complete traffic data from a Tier-1 IP network. Our findings confirm previous studies that use partial traffic data or synthetic traffic data. We find that optimization using estimated traffic demands has little significance to the performance of the load balancing. Finally, we device an algorithm that finds a routing setting that is robust to shifts in traffic patterns due to changes in the interdomain routing. A set of worst case scenarios caused by the interdomain routing changes is identified and used to solve a robust routing problem. The evaluation indicates that performance of the robust routing is close to optimal for a wide variety of traffic scenarios. The main contribution of this thesis is that we demonstrate that it is possible to estimate the traffic matrix with good accuracy and to develop methods that optimize the routing settings to give strong and robust network performance. Only minor changes might be necessary in order to implement our algorithms in existing networks.
|
|
| 6. |
- Soldati, Pablo
(författare)
-
Cross-layer optimization of wireless multi-hop networks
- 2007
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The interest in wireless communications has grown constantly for the past decades, leading to an enormous number of applications and services embraced by billions of users. In order to meet the increasing demand for mobile Internet access, several high data-rate radio networking technologies have been proposed to offer wide area high-speed wireless communications, eventually replacing fixed (wired) networks for many applications.This thesis considers cross-layer optimization of multi-hop radio networks where the system performance can be improved if the traditionally separated network layers are jointly optimized. The networks we consider have links with variable transmission rates, influenced by the allocation of transmission opportunities and channels, modulation and coding schemes and transmit powers. First, we formulate the optimal network operation as the solution to a network utility maximization problem and review decomposition methods from mathematical programming that allow translating a centralized network optimization problem into distributed mechanisms and protocols. Second, particular focus is given to networks employing spatial-reuse TDMA, where we develop detailed distributed solutions for joint end-to-end communication rate selection, multiple time-slot transmission scheduling and power allocation which achieve the optimal network utility. In the process, we introduce a novel decomposition method for convex optimization, establish its convergence and demonstrate how it suggests a distributed solution based on flow control optimization and incremental updates of the transmission schedule. We develop a two-step procedure for distributed maximization of computing the schedule updates (maximizing congestion-weighted throughput) and suggest two schemes for distributed channel reservation and power control under realistic interference models. Third, investigate the advantages of employing multi-user detectors within a CDMA/TDMA framework. We demonstrate how column generation techniques can be combined with resource allocation schemes for the multi-access channel into a very efficient computational method. Fourth, we investigate the benefits and challenges of using the emerging OFDMA modulation scheme within our framework. Specifically, we consider the problem of assigning sub-carriers to wireless links in multi-hop mesh networks. Since the underlying mathematical programming problem is computationally hard, we develop a specialized algorithm that computes optimal near-optimal solutions in a reasonable time and suggest a heuristic for improving computation at the price of relatively modest performance losses.
|
|
