Modelo de propagação indoor multi-andar em 2.4 GHz com estimativa de parâmetros de QoS em chamadas VoIP

O advento de novas formas multimídia tem atraído uma clientela exigente, onde preocupação não é somente com o serviço, mas também, com a qualidade que esse serviço pode ser oferecido. As WLAN (Wireless Local Area Networks) tornaram-se a forma mais comum de roteamento de Internet, devido ao seu baixo custo e facilidade de implementação. Para realizar um bom roteamento é necessário um planejamento, utilizando-se modelos. Os modelos de propagação existentes na literatura fazem a predição da intensidade do sinal, mas algumas vezes não contemplam a previsão de um bom serviço. Nesse sentido a presente dissertação propõe-se a elaborar um modelo de propagação empírico indoor multi-andar que não só prediz a potência recebida, mas também faz uma previsão para algumas métricas de QoS (Quality of Service) de chamadas VoIP (Voice over Internet Protocol). Para a elaboração do modelo proposto foram feitas campanhas de medição, em um prédio de dois andares, em pisos distintos mantendo-se a posição do ponto de acesso (PA) fixa. Estudos de geometria analítica para a contagem e agregação de perdas em pisos e paredes. Os resultados do modelo proposto foram comparados com um modelo da literatura que tem um comportamento similar, onde é possível verificar o melhor desempenho do modelo proposto, e para efeito de estudo um andar completamente simulado foi introduzido para avaliação.

Cross-layer optimizations for multimedia distribution over Wireless Multimedia Sensor Networks and Flying Ad-Hoc Networks with quality of experience support

The proliferation of multimedia content and the demand for new audio or video services have fostered the development of a new era based on multimedia information, which allowed the evolution of Wireless Multimedia Sensor Networks (WMSNs) and also Flying Ad-Hoc Networks (FANETs). In this way, live multimedia services require realtime video transmissions with a low frame loss rate, tolerable end-to-end delay, and jitter to support video dissemination with Quality of Experience (QoE) support. Hence, a key principle in a QoE-aware approach is the transmission of high priority frames (protect them) with a minimum packet loss ratio, as well as network overhead. Moreover, multimedia content must be transmitted from a given source to the destination via intermediate nodes with high reliability in a large scale scenario. The routing service must cope with dynamic topologies caused by node failure or mobility, as well as wireless channel changes, in order to continue to operate despite dynamic topologies during multimedia transmission. Finally, understanding user satisfaction on watching a video sequence is becoming a key requirement for delivery of multimedia content with QoE support. With this goal in mind, solutions involving multimedia transmissions must take into account the video characteristics to improve video quality delivery. The main research contributions of this thesis are driven by the research question how to provide multimedia distribution with high energy-efficiency, reliability, robustness, scalability, and QoE support over wireless ad hoc networks. The thesis addresses several problem domains with contributions on different layers of the communication stack. At the application layer, we introduce a QoE-aware packet redundancy mechanism to reduce the impact of the unreliable and lossy nature of wireless environment to disseminate live multimedia content. At the network layer, we introduce two routing protocols, namely video-aware Multi-hop and multi-path hierarchical routing protocol for Efficient VIdeo transmission for static WMSN scenarios (MEVI), and cross-layer link quality and geographical-aware beaconless OR protocol for multimedia FANET scenarios (XLinGO). Both protocols enable multimedia dissemination with energy-efficiency, reliability and QoE support. This is achieved by combining multiple cross-layer metrics for routing decision in order to establish reliable routes.

Relax and cut: limitantes duais para o problema do caixeiro viajante

Pós-graduação em Matemática - IBILCE

Um modelo bi-nível para o investimento multi-etapa em capacidade de transmissão e geração de energia elétrica em mercados competitivos

Pós-graduação em Engenharia Elétrica - FEIS

Multi-scale lacunarity as an alternative to quantify and diagnose the behavior of prostate cancer

Prostate cancer is a serious public health problem accounting for up to 30% of clinical tumors in men. The diagnosis of this disease is made with clinical, laboratorial and radiological exams, which may indicate the need for transrectal biopsy. Prostate biopsies are discerningly evaluated by pathologists in an attempt to determine the most appropriate conduct. This paper presents a set of techniques for identifying and quantifying regions of interest in prostatic images. Analyses were performed using multi-scale lacunarity and distinct classification methods: decision tree, support vector machine and polynomial classifier. The performance evaluation measures were based on area under the receiver operating characteristic curve (AUC). The most appropriate region for distinguishing the different tissues (normal, hyperplastic and neoplasic) was defined: the corresponding lacunarity values and a rule's model were obtained considering combinations commonly explored by specialists in clinical practice. The best discriminative values (AUC) were 0.906, 0.891 and 0.859 between neoplasic versus normal, neoplasic versus hyperplastic and hyperplastic versus normal groups, respectively. The proposed protocol offers the advantage of making the findings comprehensible to pathologists. (C) 2014 Elsevier Ltd. All rights reserved.

Planejamento de reativos em sistemas elétricos de potência multi-área através de modelos estocásticos

Pós-graduação em Engenharia Elétrica - FEIS

Despacho ótimo de potências ativa e reativa de sistema elétricos multi-áreas considerando restrições físicas, econômicas e ambientais =: Envronmentally constrained active-reactive optimal power flow-a compromising strategy for economic-emission dispatch and a multi-area paradigm

Pós-graduação em Engenharia Elétrica - FEIS

Processing optimized for symmetry in the problem of evasive maneuvers

The increasing number of space debris in operating regions around the earth constitutes a real threat to space missions. The goal of the research is to establish appropriate scientific-technological conditions to prevent the destruction and/or impracticability of spacecraft in imminent collision in these regions. A definitive solution to this problem has not yet been reached with the degree of precision that the dynamics of spatial objects (vehicle and debris) requires mainly due to the fact that collisions occur in chains and fragmentation of these objects in the space environment. This fact threatens the space missions on time and with no prospects for a solution in the near future. We present an optimization process in finding the initial conditions (CIC) to collisions, considering the symmetry of the distributions of maximum relative positions between spatial objects with respect to the spherical angles. For this, we used the equations of the dynamics on the Clohessy-Witshire, representing a limit of validation that is highly computationally costly. We simulate different maximum relative positions values of the corresponding initial conditions given in terms of spherical angles. Our results showed that there are symmetries that significantly reduce operating costs, such that the search of the CIC is advantageously carried out up to 4 times the initial processing routine. Knowledge of CIC allows the propulsion system operating vehicle implement evasive maneuvers before impending collisions with space debris.

The benefits of soft sensor and multi-rate control for the implementation of wireless networked control systems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Desempenho de sondas Lambda no monitoramento de motores do ciclo Otto alimentados por etanol e GNV

Pós-graduação em Engenharia Mecânica - FEB

Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.

Routing and Wavelength Assignment (RWA) with Power Considerations In All- Optical Wavelength-Routed Networks

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed

Routing Algorithms for All-Optical Networks with Power Considerations: The Unicast Case

In this paper, we investigate the problem of routing connections in all-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

Minimizing the Number of Optical Amplifiers Needed to Support a Multi-Wavelength Optical LAN/MAN

Optical networks based on passive star couplers and employing wavelength-division multiplexing (WDhf) have been proposed for deployment in local and metropolitan areas. Amplifiers are required in such networks to compensate for the power losses due to splitting and attenuation. However, an optical amplifier has constraints on the maximum gain and the maximum output power it can supply; thus optical amplifier placement becomes a challenging problem. The general problem of minimizing the total amplifier count, subject to the device constraints, is a mixed-integer non-linear problem. Previous studies have attacked the amplifier placement problem by adding the “artificial” constraint that all wavelengths, which are present at a particular point in a fiber, be at the same power level. In this paper, we present a method to solve the minimum amplifier- placement problem while avoiding the equally powered- wavelength constraint. We demonstrate that, by allowing signals to operate at different power levels, our method can reduce the number of amplifiers required in several small to medium-sized networks.