An interest in developing the intelligent machine system that works in conjunction with human has been growing rapidly in recent years. A number of studies were conducted to shed light on how to design an interactive, adaptive and assistive machine system to serve a wide range of purposes including commonly seen ones like training, manufacturing and rehabilitation. In the year 2003, Human Adaptive Mechatronics (HAM) was proposed to resolve these issues. According to past research, the focus is predominantly on evaluation of human skill rather than human performance and that is the reason why intensive training and selection of suitable human subjects for those experiments were required. As a result, the pattern and state of control motion are of critical concern for these works. In this research, a focus on human skill is shifted to human performance instead due to its proneness to negligence and lack of reflection on actual work quality. Human performance or Human Performance Index (HPI) is defined to consist of speed and accuracy characteristics according to a well-renowned speed-accuracy trade-off or Fitts' Law. Speed and accuracy characteristics are collectively referred to as speed and accuracy criteria with corresponding contributors referred to as speed and accuracy variables respectively. This research aims at proving a validity of the HPI concept for the systems with different architecture or the one with and without hardware elements. A direct use of system output logged from the operating field is considered the main method of HPI computation, which is referred to as a non-model approach in this thesis. To ensure the validity of these results, they are compared against a model-based approach based on System Identification theory. Its name is due to being involved with a derivation of mathematical equation for human operator and extraction of performance variables. Certain steps are required to match the processing outlined in that of non-model approach. Some human operators with complicated output patterns are inaccurately derived and explained by the ARX models.

Due to its significant advantage in spectral efficiency, multiple-antenna communication technology will undoubtedly be a major component in future wireless system implementations. However, the full exploitation of this technology also requires perfect feedback of channel state information (CSI) to the transmitter-- something that is not practically feasible. This motivates the study of limited feedback systems, where CSI feedback is rate limited. This thesis focuses on the optimal design of limited feedback systems for three types of communication channels: the relay channel, the single-user point-to-point channel, and the multiuser broadcast channel. For the relay channel, we prove the efficiency of the Grassmannian codebooks as the source and relay beamforming codebooks, and propose a method for CSI exchange between the relay and the destination when global CSI is not available at destination. For the single-user point-to-point channel, we study the joint power control and beamforming problem and address the channel magnitude and direction quantization codebook design problem. It is shown that uniform quantization of the channel magnitude (in dB scale) is asymptotically optimal regardless of the channel distribution. The analysis further derives the optimal split of feedback bandwidth between the magnitude and direction quantization codebooks. For the multiuser broadcast channel, we first prove the sufficiency of a product magnitude-direction quantization codebook for managing the multiuser interference. We then derive the optimal split of feedback bandwidth across the users and their magnitude and direction codebooks. The optimization results reveal an inherent structural difference between the single-user and multiuser quantization codebooks: a multiuser codebook should have a finer direction quantization resolution as compared to a single-user codebook. It is further shown that the users expecting higher rates and requiring more reliable communication should provide a finer quantization of their CSI. Finally, we determine the minimum required total feedback rate based on users' quality-of-service constraints and derive the scaling of the system performance with the total feedback rate.

Due to its significant advantage in spectral efficiency, multiple-antenna communication technology will undoubtedly be a major component in future wireless system implementations. However, the full exploitation of this technology also requires perfect feedback of channel state information (CSI) to the transmitter-- something that is not practically feasible. This motivates the study of limited feedback systems, where CSI feedback is rate limited. This thesis focuses on the optimal design of limited feedback systems for three types of communication channels: the relay channel, the single-user point-to-point channel, and the multiuser broadcast channel. For the relay channel, we prove the efficiency of the Grassmannian codebooks as the source and relay beamforming codebooks, and propose a method for CSI exchange between the relay and the destination when global CSI is not available at destination. For the single-user point-to-point channel, we study the joint power control and beamforming problem and address the channel magnitude and direction quantization codebook design problem. It is shown that uniform quantization of the channel magnitude (in dB scale) is asymptotically optimal regardless of the channel distribution. The analysis further derives the optimal split of feedback bandwidth between the magnitude and direction quantization codebooks. For the multiuser broadcast channel, we first prove the sufficiency of a product magnitude-direction quantization codebook for managing the multiuser interference. We then derive the optimal split of feedback bandwidth across the users and their magnitude and direction codebooks. The optimization results reveal an inherent structural difference between the single-user and multiuser quantization codebooks: a multiuser codebook should have a finer direction quantization resolution as compared to a single-user codebook. It is further shown that the users expecting higher rates and requiring more reliable communication should provide a finer quantization of their CSI. Finally, we determine the minimum required total feedback rate based on users' quality-of-service constraints and derive the scaling of the system performance with the total feedback rate.

This dissertation applies theories and concepts of wireless communications and signal processing to the security domain to assess the security of a Wireless secret Key Generation (WKG) system against capable eavesdroppers, who employ all the feasible tools to compromise the system’s security. The security of WKG is evaluated via real wireless measurements, where adversary knows and applies appropriate signal processing tools in ordere to predict the generated key with the communicating pair. It is shown that in a broadband stationary wireless communication channel, (e.g. commercial off-the-shelf 802.11 WLAN devices), a capable eavesdropper can recover a large portion of the secret key bits. However, in an Ultra-wideband (UWB) communication, at the same stationary environment, secret key rates of 128 bits per channel probe are achievable. / Graduate

No description available.

This thesis discuss about the problem with mobility of stations in IP networks, concretely protocol Mobile IP and about the problems with this protocol in MANET networks, with the scope on Motorola MESH. First part is about design integration of protocol Mobile IP in this networks with usage Tropos 5210 MetroMesh routers and Cisco components (router, switch) to design and configure wireless MESH network, than connect this network with Cisco components and try to implement Mobile IP into this network. Second part is about design and configure wireless network from Cisco Wireless Access Points and about succesfully implementation of Mobile IP protocol into this network. In the last part is some tests of the function and quality of this topology.

In this thesis, we study the tradeoff of average delay with average service cost and average utility for both continuous time and discrete time single server queueing models without and with admission control. The continuous time and discrete time queueing models that we consider are motivated by cross-layer models for point-to-point links with random packet arrivals and fading at slow and fast time scales. Our studies are motivated by the need to optimally tradeoff the average delay of the packets (a network layer performance measure) with the average service cost of transmitting the packets, e.g. the average power required for transmission (a physical layer performance measure) under a lower bound constraint on the average throughput, in various point-to-point communication scenarios. The tradeoff problems are studied for a class of monotone and stationary scheduling policies and under the assumption that the service cost rate and utility rate are respectively convex and concave functions of the service rate and arrival rate. We also consider the problem of optimally trading off the average delay and average error rate of randomly arriving message symbols which are transmitted over a noisy point-to-point link, in which case the service cost function is non-convex. The solutions to the tradeoff problems that we address in the thesis are asymptotic in nature, and are similar in spirit to the Berry-Gallager asymptotic bounds. It is intuitive that to keep a queue stable under a lower bound constraint on the average utility a minimum number of customers have to be served per unit time. This in turn implies that queue stability requires a minimum average service cost expenditure. In the thesis we obtain an asymptotic characterization of the minimum average delay for monotone stationary policies subject to an upper bound constraint on the average service cost and a lower bound constraint on the average utility, in the asymptotic regime where the average service cost constraint is made arbitrarily close to the above minimum average service cost. In the thesis, we obtain asymptotic lower bounds on the minimum average delay for the cases for which lower bounds were previously not known. The asymptotic characterization of the minimum average delay for monotone stationary policies, for both continuous time and discrete time models, is obtained via geometric bounds on the stationary probability of the queue length, in the above asymptotic regime. The restriction to monotone stationary policies enables us to obtain an intuitive explanation for the behaviour of the asymptotic lower bounds using the above geometric bounds on the stationary probability distribution of the queue length. The geometric bounds on the stationary probability of the queue length also lead to a partial asymptotic characterization of the structure of any optimal monotone stationary policy, in the above asymptotic regime, which was not available in previous work. Furthermore, the geometric bounds on the stationary probability can be extended to analyse the tradeoff problem in other scenarios, such as for other continuous time queueing models, multiple user communication models, queueing models with service time control, and queueing models with general holding costs. Usually, queueing models with integer valued queue evolution, are approximated by queueing models with real valued queue evolution and strictly convex service cost functions for analytical tractability. Using the asymptotic bounds, we show that for some cases the average delay does not grow to infinity in the asymptotic regime, although the approximate model suggests that the average delay does grow to infinity. In other cases where the average delay does grow to infinity in the asymptotic regime, our results illustrate that the tradeoff behaviour of the approximate model is different from that of the original integer valued queueing model unless the service cost function is modelled as the piecewise linear lower convex envelope of the service cost function for the original model.

För sammankoppling av multi-terminala HVDC-system med punkt-till-punkt kopplingar ärDC-DC-omvandlaren den enda möjliga sammankopplingen. Därför genomgår problemenmed spänningsmatchning och likspänningsströmbegränsning i högspännings DC-systemomfattande forskning samt ligger i fokus för denna avhandling. Först analyseras toppmodernatopologier för högspännings DC-DC-omvandlare som används för samtrafik av flera terminalaHVDC-system. De analyserade topologierna jämförs sedan baserat på dess olika funktioner.Topologin för en konventionell icke-isolerad DC-DC-omvandlare analyseras när det gäller design,kostnad, storlek, förlust och effektstyrningskapacitet. Först skapas en matematisk modell ochsedan utförs en numerisk analys för olika arbetsområden. Därefter görs en jämförelse av entvåfas-icke-isolerad DC-omvandlare baserad på energilagring, maximal likströmsöverföring ochtotala förluster. Simulering utförs av en tvåfas och en trefas icke-isolerad DC-omvandlare iPSCAD med olika typer av styrenheter. Dessutom tas en isolerad omvandlartopologi och analyserasi detalj från matematisk modellering till validering med hjälp av simuleringsresultat.Olika typer av felanalyser för både isolerad och icke-isolerad omvandlartopologi görs. Slutligenutförs även analyser av DC-felet i olika möjliga anslutningar av omvandlaren i Multi-TerminalGrid, dvs Monopole, Bipole med både symmetriska och asymmetriska konfigurationer. / For interconnection of multi-terminal HVDC systems involving point-to-point links, aDC-DC converter is the only possible way to interconnect. Therefore, the issues of voltagematching and DC fault current limiting in high voltage DC systems are undergoing extensiveresearch and are the focus of this thesis. Starting with analyzing the state of the art highvoltage DC-DC converter topologies for interconnection of multi-terminal HVDC systems andbenchmarking each converter topology based on different functionalities. A basic non-isolatedDC-DC converter topology is analyzed in terms of design, cost, sizing, losses and power controlcapability. First, starting with the mathematical modeling and then the numerical analysis isdone for different operating regions. Next, it is compared with the two-phase non-isolated DCconverter based on energy storage, maximum DC power transfer, and total losses. Simulation oftwo-phase and three-phase non-isolated DC converter is done in PSCAD incorporating differenttypes of controllers. Then, an isolated converter topology is taken and analyzed in detail startingfrom mathematical modeling to validation using simulation results. Different types of faultsanalysis for both isolated and non-isolated converter topology is done. Finally, analyzing the DCfault in different possible connection of the converter in the multi-terminal grid, i.e. monopole,bipole in both symmetric and asymmetric configurations.