User scheduling for low earth orbit multi-user multiple-input-multiple-output non-terrestrial network systems

In rural and isolated areas without cellular coverage, Satellite Communication (SatCom) is the best candidate to complement terrestrial coverage. However, the main challenge for future generations of wireless networks will be to meet the growing demand for new services while dealing with the scarcity of frequency spectrum. As a result, it is critical to investigate more efficient methods of utilizing the limited bandwidth; and resource sharing is likely the only choice. The research community’s focus has recently shifted towards the interference management and exploitation paradigm to meet the increasing data traffic demands. In the Downlink (DL) and Feedspace (FS), LEO satellites with an on-board antenna array can offer service to numerous User Terminals (UTs) (VSAT or Handhelds) on-ground in FFR schemes by using cutting-edge digital beamforming techniques. Considering this setup, the adoption of an effective user scheduling approach is a critical aspect given the unusually high density of User terminals on the ground as compared to the on-board available satellite antennas. In this context, one possibility is that of exploiting clustering algorithms for scheduling in LEO MU-MIMO systems in which several users within the same group are simultaneously served by the satellite via Space Division Multiplexing (SDM), and then these different user groups are served in different time slots via Time Division Multiplexing (TDM). This thesis addresses this problem by defining a user scheduling problem as an optimization problem and discusses several algorithms to solve it. In particular, focusing on the FS and user service link (i.e., DL) of a single MB-LEO satellite operating below 6 GHz, the user scheduling problem in the Frequency Division Duplex (FDD) mode is addressed. The proposed State-of-the-Art scheduling approaches are based on graph theory. The proposed solution offers high performance in terms of per-user capacity, Sum-rate capacity, SINR, and Spectral Efficiency.

Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e Computadores

A data forest: multi-dimensional visualization

As Terabyte datasets become the norm, the focus has shifted away from our ability to produce and store ever larger amounts of data, onto its utilization. It is becoming increasingly difficult to gain meaningful insights into the data produced. Also many forms of the data we are currently producing cannot easily fit into traditional visualization methods. This paper presents a new and novel visualization technique based on the concept of a Data Forest. Our Data Forest has been designed to be used with vir tual reality (VR) as its presentation method. VR is a natural medium for investigating large datasets. Our approach can easily be adapted to be used in a variety of different ways, from a stand alone single user environment to large multi-user collaborative environments. A test application is presented using multi-dimensional data to demonstrate the concepts involved.

Achievable performance gain of IEEE 802.11 multi-rate link adaptation algorithm with cross-layer design

Link quality-based rate adaptation has been widely used for IEEE 802.11 networks. However, network performance is affected by both link quality and random channel access. Selection of transmit modes for optimal link throughput can cause medium access control (MAC) throughput loss. In this paper, we investigate this issue and propose a generalised cross-layer rate adaptation algorithm. It considers jointly link quality and channel access to optimise network throughput. The objective is to examine the potential benefits by cross-layer design. An efficient analytic model is proposed to evaluate rate adaptation algorithms under dynamic channel and multi-user access environments. The proposed algorithm is compared to link throughput optimisation-based algorithm. It is found rate adaptation by optimising link layer throughput can result in large performance loss, which cannot be compensated by the means of optimising MAC access mechanism alone. Results show cross-layer design can achieve consistent and considerable performance gains of up to 20%. It deserves to be exploited in practical design for IEEE 802.11 networks.

Graph-based User Scheduling for MIMO LEO-based Satellite Communication Systems

The study of the user scheduling problem in a Low Earth Orbit (LEO) Multi-User MIMO system is the objective of this thesis. With the application of cutting-edge digital beamforming algorithms, a LEO satellite with an antenna array and a large number of antenna elements can provide service to many user terminals (UTs) in full frequency reuse (FFR) schemes. Since the number of UTs on-ground are many more than the transmit antennas on the satellite, user scheduling is necessary. Scheduling can be accomplished by grouping users into different clusters: users within the same cluster are multiplexed and served together via Space Division Multiple Access (SDMA), i.e., digital beamforming or Multi-User MIMO techniques; the different clusters of users are then served on different time slots via Time Division Multiple Access (TDMA). The design of an optimal user grouping strategy is known to be an NP-complete problem which can be solved only through exhaustive search. In this thesis, we provide a graph-based user scheduling and feed space beamforming architecture for the downlink with the aim of reducing user inter-beam interference. The main idea is based on clustering users whose pairwise great-circle distance is as large as possible. First, we create a graph where the users represent the vertices, whereas an edge in the graph between 2 users exists if their great-circle distance is above a certain threshold. In the second step, we develop a low complex greedy user clustering technique and we iteratively search for the maximum clique in the graph, i.e., the largest fully connected subgraph in the graph. Finally, by using the 3 aforementioned power normalization techniques, a Minimum Mean Square Error (MMSE) beamforming matrix is deployed on a cluster basis. The suggested scheduling system is compared with a position-based scheduler, which generates a beam lattice on the ground and randomly selects one user per beam to form a cluster.

Mòdul per a la gestió d'una borsa de treball a un centre universitari

Aquest projecte consisteix en realitzar el disseny, la implementació i el desenvolupament d’una aplicació que permeti la gestió administrativa d’una oficina de borsa de treball per a un centre universitari. Per a poder realitzar aquesta tasca cal que ofereixi les eines necessàries per a poder introduir, mantenir i explotar les dades relacionades amb estudiants, empreses, convenis, ofertes i reconeixements, que són els elements bàsics que composen les tasques administratives de la borsa de treball. L’aplicació resultant ha de ser multiusuari, dissenyada segons el model client-servidor i s’ha d’integrar com un mòdul nou dins d’una altra aplicació ja existent.

Evaluation of the MIT-Scan-T2 for Non-Destructive PCC Pavement Thickness Determination Final Report, July 2008

The MIT-Scan-T2 device is marketed as a non-destructive way to determine pavement thickness on both HMA and PCC pavements. PCC pavement thickness determination is an important incentivedisincentive measurement for the Iowa DOT and contractors. The thickness incentive can be as much as 3% of the concrete contact unit price and the disincentive can be as severe as remove and replace. This study evaluated the potential of the MIT device for PCC pavement thickness quality assurance. The limited testing indicates the unit is sufficiently repeatable and accurate enough to replace core drilling as the thickness measurement method. Further study is needed to statistically establish the single user and multi-user/device precision as well as establish an appropriate sampling protocol and PWL specification.

Kontekstitietoisen mobiilipelin suunnittelu ja toteutus

Kontekstitietoisuuden katsotaan voivan parantaa sovellusten ja palvelujen käytettävyyttä matkapuhelimissa. Kontekstitietoisuuden tekniikoita voidaan käyttää myös peleissä, joko siksi, että ne mahdollistavat uudenlaisia pelejä, tai siksi, että peleillä voidaan havainnollistaa ja testata eri tekniikoiden toimintaa. Diplomityössä esitellään prototyyppi monen pelaajan kontekstitietoisesta mobiilipelistä, jossa pelivälineinä käytetään kamerapuhelimella luettavia tavallisia viivakoodeja. Viivakoodit on yhdistetty palvelimella sijaitsevan pelimaailman kohteisiin, joiden omistuksesta pelaajat kilpailevat. Peliä on tarkoitus arvioida myöhemmin pelattavuuden ja idean kiinnostavuuden kannalta. Prototyypin toinen tehtävä on havainnollistaa Multi-User Publishing Environment (MUPE) -sovellusalustan tukea kontekstitietoisuudelle. Työ kuvaa pelin suunnittelun, toteutuksen ja arvioinnin alkaen varhaisimmista ideoista ja päättyen osittaiseen prototyyppiin. Prototyypissä on toteutettu osa pelilogiikasta ja käyttöliittymästä, mutta sitä ei ole integroitu kontekstitietoa kerääviin sensoreihin. Pelin suunnittelussa käytettiin apuna heuristista arviointia ja kahta fokusryhmähaastattelua.

Virtuaalitilan suunnitteluja toteutus nuorisotyön tueksi

Tämän diplomityön tarkoituksena on suunnitella ja toteuttaa nuorisotyön tarpeisiin soveltuva virtuaalitila, jossanuoret voivat keskustella ongelmistaan oikean nuorisotyöntekijän kanssa. Ensin tutkitaan olemassa olevien virtuaalimaailmojen nykyistä tilaa, sekä luodaan katsaus virtuaalisuuteen ja mallintamiseen liittyviin perustekniikoihin. Olemassa olevien virtuaalimaailmojen ja niiden ominaisuuksien pohjalta suunnitellaan uusi, täysin nuorten auttamiseen tarkoitettu virtuaalitila. Tämän työn tarkoituksena ei ole tutkia nuorten auttamisen sosiaalista problematiikkaa, vaan tekniikoita, joilla auttaminen tehdään mahdolliseksi. Työn käytännöllisenä osuutena toteutettiin suunniteltu monen käyttäjän virtuaalitila, jossa käyttäjät voivat kommunikoida keskenään, keskustella nuorisotyöntekijän kanssa tai pelata ajanvietteeksi tarkoitettua junapeliä. Virtuaalitilan toteutuksessa käytettiin hyödyksi kolmiulotteista mallinnusta, Lingo-skriptikieltä, sekä Macromedian tarjoamaa monen käyttäjän palvelinta. Kaikki toteutetut osat koottiin yhdeksi sovellukseksi, joka julkaistiin Shockwave-elokuvana www-sivustolla.

Design and Implementation of MUPE Server Context Tool for Eclipse IDE

The development of software tools begun as the first computers were built. The current generation of development environments offers a common interface to access multiple software tools and often also provide a possibility to build custom tools as extensions to the existing development environment. Eclipse is an open source development environment that offers good starting point for developing custom extensions. This thesis presents a software tool to aid the development of context-aware applications on Multi-User Publishing Environment (MUPE) platform. The tool is implemented as an Eclipse plug-in. The tool allows developer to include external server side contexts to their MUPE applications. The tool allows additional context sources to be added through the Eclipse's extension point mechanism. The thesis describes how the tool was designed and implemented. The implementation consists of tool core component part and an additional context source extension part. Tool core component is responsible for the actual context addition and also provides the needed user interface elements to the Eclipse workbench. Context source component provides the needed context source related information to the core component. As part of the work an update site feature was also implemented for distributing the tool through Eclipse update mechanism.

Language learning and MUDs : an overview. 'Aprendizaje de idiomas y MUDs : una visión general'.

La traducción literal de MUD es Mazmorra o Calabozo multiusuario o Dimensión multiusuario. Un MUD es un juego de rol en línea que es ejecutado en un servidor. El artículo incluye direcciones de varios MUDs

Maximising concurrency and scalability in a consistent, causal, distributed virtual reality system, whilst minimising the effect of network delays

The development of large scale virtual reality and simulation systems have been mostly driven by the DIS and HLA standards community. A number of issues are coming to light about the applicability of these standards, in their present state, to the support of general multi-user VR systems. This paper pinpoints four issues that must be readdressed before large scale virtual reality systems become accessible to a larger commercial and public domain: a reduction in the effects of network delays; scalable causal event delivery; update control; and scalable reliable communication. Each of these issues is tackled through a common theme of combining wall clock and causal time-related entity behaviour, knowledge of network delays and prediction of entity behaviour, that together overcome many of the effects of network delay.

Maximising concurrency and scalability in a consistent, causal, distributed virtual reality system, whilst minimising the effect of network delays

The development of large scale virtual reality and simulation systems have been mostly driven by the DIS and HLA standards community. A number of issues are coming to light about the applicability of these standards, in their present state, to the support of general multi-user VR systems. This paper pinpoints four issues that must be readdressed before large scale virtual reality systems become accessible to a larger commercial and public domain: a reduction in the effects of network delays; scalable causal event delivery; update control; and scalable reliable communication. Each of these issues is tackled through a common theme of combining wall clock and causal time-related entity behaviour, knowledge of network delays and prediction of entity behaviour, that together overcome many of the effects of network delays.

A Real-time, Predictive Architecture for Distributed Virtual Reality

User interaction within a virtual environment may take various forms: a teleconferencing application will require users to speak to each other (Geak, 1993), with computer supported co-operative working; an Engineer may wish to pass an object to another user for examination; in a battle field simulation (McDonough, 1992), users might exchange fire. In all cases it is necessary for the actions of one user to be presented to the others sufficiently quickly to allow realistic interaction. In this paper we take a fresh look at the approach of virtual reality operating systems by tackling the underlying issues of creating real-time multi-user environments.

Continuous prewarping of time for multiuser interactive virtual environments

Dynamic multi-user interactions in a single networked virtual environment suffer from abrupt state transition problems due to communication delays arising from network latency--an action by one user only becoming apparent to another user after the communication delay. This results in a temporal suspension of the environment for the duration of the delay--the virtual world `hangs'--followed by an abrupt jump to make up for the time lost due to the delay so that the current state of the virtual world is displayed. These discontinuities appear unnatural and disconcerting to the users. This paper proposes a novel method of warping times associated with users to ensure that each user views a continuous version of the virtual world, such that no hangs or jumps occur despite other user interactions. Objects passed between users within the environment are parameterized, not by real time, but by a virtual local time, generated by continuously warping real time. This virtual time periodically realigns itself with real time as the virtual environment evolves. The concept of a local user dynamically warping the local time is also introduced. As a result, the users are shielded from viewing discontinuities within their virtual worlds, consequently enhancing the realism of the virtual environment.