Thesis (Ph. D.)--West Virginia University, 2006. / Title from document title page. Document formatted into pages; contains x, 176 p. : ill. (some col.), maps (some col.). Includes abstract. Includes bibliographical references (p. 152-160).

Thesis (M.S.)--Ohio University, August, 2004. / Title from PDF t.p. Includes bibliographical references (p. 95-98)

Thesis (M.S)--Ohio University, March, 2005. / Title from PDF t.p. Includes bibliographical references (p. 88-92)

Thesis (Ph. D.)--State University of New York at Binghamton, Department of Systems Science and Industrial Engineering, 2005. / Includes bibliographical references.

This research aims to understand the different requirements of civilian multiple autonomous vehicle systems in order to propose an adequate solution for the resource allocation problem. A new classification of unmanned system applications is presented with focus on unmanned aerial vehicles (UAVs). The main resource allocation systems requirements in each category are presented and discussed. A novel dynamic resource allocation model is introduced for efficient sharing of services provided by ad hoc assemblies of heterogeneous autonomous vehicles. A key contribution is the provision of capability to dynamically select sensors and platforms within constraints imposed by time dependencies, refuelling, and transportation services. The resource allocation problem is modelled as a connected network of nodes and formulated as an Integer Linear Program (ILP). Solution fitness is prioritized over computation time. Simulation results of an illustrative scenario are used to demonstrate the ability of the model to plan for sensor selection, refuelling, collaboration and cooperation between heterogeneous resources. Prioritization of operational cost leads to missions that use cheaper resources but take longer to complete. Prioritization of completion time leads to shorter missions at the expense of increased overall resource cost. Missions can be successfully re-planned through dynamic reallocation of new requests during a mission. Monte Carlo studies on systems of increasing complexity show that good solutions can be obtained using low time resolutions, with small time windows at a relatively low computational cost. In comparison with other approaches, the developed ILP model provides provably optimal solutions at the expense of longer computation time. Flight test procedures were developed for performing low cost experiments on a small scale, using commercial off the shelf equipment, with ability to infer conclusions on the large-scale implementation. Flight test experiments were developed and performed that assessed the performance of the developed ILP model and successfully demonstrated its main capabilities.

Aujourd'hui, l'extension des exigences du trafic de données sans fil dépasse le taux de croissance de la capacité des nouvelles technologies d'accès sans fil. Par conséquent, les réseaux sans fil mobiles de la future génération proposent des architectures hétérogènes, généralement appelées réseaux sans fil hétérogènes (HWN). HWN se caractérisent par l'intégration des réseaux cellulaires et des réseaux locaux sans fil (WLAN) pour répondre aux besoins des utilisateurs et améliorer la capacité du système. En fait, l'intégration de différents types de technologies d'accès sans fil dans HWN offre des choix flexibles pour que les utilisateurs soient associés au réseau qui répond le mieux à leurs besoins. Dans ce contexte, cette thèse traite le problème d'association d'utilisateurs et le problème d'allocation de ressources dans un système sans fil hétérogène basé sur des points d'accès Wi-Fi intégrés et des stations de base L TE. Les contributions de cette thèse pourraient être divisées en trois parties principales. Dans la première partie, un nouveau problème d'association d'utilisateurs et d'optimisation de l'allocation des ressources est formulé pour maximiser la satisfaction globale des utilisateurs dans le système. La satisfaction de l'utilisateur est basée sur une fonction de profit pondérée qui vise à améliorer la puissance relative du signal reçu et la diminution de la consommation d'énergie des terminaux mobiles (MT). Étant donné qu'un MT n'est autorisé à être associé qu'à un seul réseau à la fois, le problème d'optimisation formulé est binaire avec une complexité NP complète. Ensuite, plusieurs solutions centralisées avec une complexité à temps polynomial sont proposées pour résoudre le problème formulé. Les solutions proposées sont basées sur des approches heuristiques et sur la relaxation continue du problème d'optimisation binaire formulé. La deuxième partie de la thèse vise à fournir une solution distribuée pour le problème formulé. La solution distribuée proposée déploie la technique de détente lagrangienne pour convertir le problème global formulé en plusieurs problèmes de Knapsack distribués, chaque réseau traite son problème Knapsack correspondant. La méthode de sous gradient est utilisée pour trouver les multiplicateurs lagrangiens optimaux ou sous optimaux. Enfin, la troisième partie de la thèse étudie de nouvelles perspectives de la formulation du problème d'optimisation et ses solutions centralisées et distribuées correspondantes. Un problème d'association d'utilisateurs et d'allocation de ressources basé sur la priorité est formulé. Le problème est ensuite réduit en plusieurs problèmes résolus à l'aide des solutions proposées réparties et centralisées. En outre, une nouvelle solution de maximisation de l'efficacité énergétique est proposée en modifiant les objectifs du problème d'optimisation originalement formulé. / It is indicated that the expansion of the wireless data traffic requirements exceeds the capacity growth rate of new wireless access technologies. Therefore, next-generation mobile wireless networks are moving toward heterogeneous architectures usually referred to as heterogeneous wireless networks (HWNs). HWNs are usually characterized by the integration of cellular networks and wireless local area networks (WLANs) to meet user requirements and enhance system capacity. In fact, integrating different types of wireless access technologies in HWNs provides flexible choices for users to be associated with the network that best satisfies their needs. In this context, this thesis discusses the user association and downlink resource allocation problem in a heterogeneous wireless system that is based on integrated Wi-Fi access points (APs) and long-term evolution (L TE) base stations (BSs). The contributions of this thesis could be divided into three main parts. In the first part, a novel user association and resource allocation optimization problem is formulated to maximize the overall user satisfaction in the system. The user satisfaction is based on a weighted profit function that aims at enhancing the relative received signal strength and decreasing the power consumption of mobile terminals (MTs). Since a MT is only allowed to be associated with a single network at a time, the formulated optimization problem is binary with an NP-complete complexity. Then, multiple centralized solutions with polynomial-time complexities are proposed to solve the formulated problem. The proposed centralized solutions are based on heuristic approaches and on the continuous re laxation of the formulated binary optimization problem. The second part of the thesis aims at providing a distributed solution for the formulated problem. The proposed distributed solution deploys the Lagrangian relaxation .technique in order to convert the global formulated problem into multiple distributed Knapsack problems each network processes its corresponding Knapsack problem. The sub-gradient method is used in order to find the optimal, or near optimal, Lagrangian multipliers. Finally, the third part of the thesis studies new perspectives of the formulated optimization problem and its corresponding centralized and distributed solutions. Mainly, a generalized priority-aware user association and resource allocation problem is formulated. The priority-aware problem is then reduced into multiple problems that are solved using the proposed centralized and distributed solutions. Moreover, a novel power efficiency maximization solution is proposed by altering the objectives of the main formulated optimization problem.

De kommunala resurserna är stora i sitt omfång men ofta begränsade i relation till verksamheterna behov. Arbetet att fördela resurser har därmed en central roll i de svenska kommunerna. Sedan förtydligandet av organiseringsfriheten i den offentliga sektorn har kommunerna själva haft möjligheten att utforma sina processer efter de lokala förutsättningarna. Detta har medfört att det idag finns ett vitt spann av resursfördelningssystem, där olika faktorer ligger bakom systemets utformning. Syftet med den här fallstudien är att öka förståelsen för den kommunala resursfördelningen genom att identifiera faktorer och bakomliggande idéer. Baserat på intervjuer i två medelstora svenska kommuner har studien avsett att få en insyn i två olika resursfördelningssystem. För att förstå hur bakomliggande idéer och faktorer påverkar utformningen av resursfördelningssystemet, har empirin satts i relation till institutionella teorier. Här har studien kunnat visa på att den kommunala resursfördelningen till stor del är ett sätt att försöka förutspå det framtida resursbehovet och hur det förändras. Beräkningsvariablerna som innefattas är ofta en spegling av de kommunala förutsättningarna, i vilken de politiska prioriteringarna arbetar för kvalitetshöjande åtgärder. Dessa beräkningar tenderar att utformas utifrån rationella bedömningar, där kommunen överväger olika alternativ för att utveckla ett system i linje med de egna preferenserna. Trots detta har en del likheter identifierats kring den övergripande utformning där skillnader mer återfinns på detaljerad nivå. I det här tycks kommunerna eftersträva ett resursfördelningssystem som principiellt fungerar som en institutionell mekanik. Detta ökar dessvärre risken för spårberoende där studien visat på att utformningen tenderar att fastna på samma stig, där uppdateringar sker men med utgångspunkt i det historiska. / The municipal resources are large in their quantities but often limited in relation to the need of the compulsory operations. The process to allocate resources is thus a central role in the Swedish municipalities. The municipalities have been given a wide range of freedom when it comes to organize themselves, this gives them the ability to design their processes in a way that benefit their own local conditions. As a result, a wide range of resource allocation systems can be identified with different factors included in the system's design. The purpose of this case study is to increase the understanding of the municipal resource allocation by identifying the factors included and underlying ideas. Based on interviews in two medium-sized Swedish municipalities, the study has been designed to gain insight into two different resource allocation systems. In order to understand how underlying ideas and different factors affect the design of the resource allocation system, the empirical data has been analyzed in relation to institutional theories. The result of the study has shown that the municipal resource distribution is mainly an attempt to predict possible changes in future needs. The different calculations included are often ways of trying to reflect the municipal conditions, in which the political priorities mainly intend to deal with changes in quality of the operations. The calculations of future needs tend to be based on rational assessments, where the municipality is considering different options for developing a system in line with its own preferences. Nevertheless, a number of similarities have been identified in the overall design of the system where differences are found at a detailed level. Both the municipalities in this study seem to look for a resource allocation system in which the function principally works as an institutional mechanics. This, however, increases the risk of path dependence where the study shows that the design tends to get stuck in the same tracks, where the system continuously updates but with the historical path as a base.

p. 1-86 / Submitted by Santiago Fabio (fabio.ssantiago@hotmail.com) on 2013-04-10T20:57:00Z No. of bitstreams: 1 DissertacaoAdriana Aquino.pdf: 512112 bytes, checksum: e66844469c0d5fbd2d4cad1162b090c3 (MD5) / Approved for entry into archive by Maria Creuza Silva(mariakreuza@yahoo.com.br) on 2013-04-11T19:17:17Z (GMT) No. of bitstreams: 1 DissertacaoAdriana Aquino.pdf: 512112 bytes, checksum: e66844469c0d5fbd2d4cad1162b090c3 (MD5) / Made available in DSpace on 2013-04-11T19:17:17Z (GMT). No. of bitstreams: 1 DissertacaoAdriana Aquino.pdf: 512112 bytes, checksum: e66844469c0d5fbd2d4cad1162b090c3 (MD5) Previous issue date: 2009 / O objetivo deste estudo foi analisar a evolução do financiamento federal para as ações de vigilância sanitária no período de 1998 a 2008 de forma a identificar se as mudanças no marco normativo federal foram favoráveis a uma maior alocação de recursos para a área. Para tanto, foi realizada uma revisão documental acerca da organização do sistema de saúde brasileiro, da inserção da vigilância sanitária neste contexto e do financiamento das ações de Visa no período, de modo a estabelecer suas fontes, os mecanismos de transferência e os critérios de alocação de recursos. Para viabilizar esta análise, os valores repassados para estados, municípios e Distrito Federal foram atualizados pelo Índice de Preços ao Consumidor Amplo (IPCA) e dispostos em uma série temporal de forma a se identificar o tipo de variação e a tendência do período. Constatou-se que apesar dos significativos avanços no marco normativo federal relativo ao financiamento da vigilância sanitária e da incontestável tendência de crescimento das transferências, o montante de recursos repassados está aquém do previsto nas normas. A principal causa verificada foi a dificuldade de pactuação do governo federal com as demais esferas de governo. / Salvador

A virtualização de redes é uma solução proposta para superar a chamada ossificação da Internet pois permite o desenvolvimento de novas arquiteturas de rede de forma flexível e controlada. Com a virtualização de redes, é possível criar múltiplas redes virtuais operando simultaneamente em uma infraestrutura física compartilhada. No entanto, o gerenciamento de redes com suporte a virtualização apresenta desafios que precisam ser resolvidos para obter um ambiente de rede confiável e funcional. Um dos principais aspectos relacionados ao gerenciamento de ambientes de virtualização de redes diz respeito ao aprovisionamento de redes virtuais. O aprovisionamento de redes virtuais define como os recursos de rede virtuais (nós e enlaces) são alocados na infraestrutura física. O aprovisionamento de redes virtuais é comumente baseado em algoritmos de mapeamento que possuem objetivos bem definidos como reduzir o custo de alocação, realizar balanceamento de carga ou minimizar o consumo de energia. Embora redes virtuais compartilhem a mesma infraestrutura, elas tipicamente são utilizadas para hospedar várias aplicações que possuem diferentes objetivos. Infelizmente, as soluções de aprovisionamento atuais focam em um único ou em um conjunto muito limitado de objetivos que podem não ser capazes de satisfazer os requisitos de um número cada vez mais crescente de aplicações. Novas aplicações podem exigir objetivos diferentes dos que são suportados pelo sistema de aprovisionamento que está em operação em uma infraestrutura de virtualização de redes. Nesta tese, o problema de Aprovisionamento de Redes Virtuais Orientado à Aplicação é formulado e um arcabouço de aprovisionamento adaptativo para redes virtualizadas que considera as caracteristicas de várias aplicações bem como seus requisitos de desempenho é proposto. O arcabouço proposto é baseado no conceito de paradigma de alocação, que é um conjunto de políticas de aprovisionamento que guiam o processo de alocação de recursos. Um paradigma traduz objetivos de Provedores de Infraestrutura e Provedores de Serviço para ações de alocação individuais que criam as redes virtuais. Uma linguagem de políticas para paradigmas é também definida para expressar o relacionamento entre paradigmas, objetivos e ações. Para determinar a eficiência de um paradigma de alocação, é proposto um modelo para quantificar o desempenho de redes virtuais que é baseado em dados coletados de sistemas de benchmarking aplicados no contexto de ambientes virtualizados. O modelo proposto é capaz de calcular o desempenho das redes virtuais alocadas e influenciar mudanças em paradigmas de alocação. Simulações foram conduzidas para verificar a viabilidade da solução proposta e comparar diferentes paradigmas de alocação. Resultados mostram que o uso de paradigmas de alocação pode ajudar administradores de ambientes de virtualização de redes a escolher a melhor estratégia de alocação dado um conjunto de objetivos definidos pelos Provedores de Infraestrutura e pelos Provedores de Serviço. / Network virtualization is a feasible solution to tackle the so-called Internet ossification by enabling the deployment of novel network architectures in a flexible and controlled way. With network virtualization, it is possible to have multiple virtual networks (VNs) running simultaneously on top of a shared physical infrastructure. Network management with virtualization support, however, poses challenges that need to be addressed in order to fully achieve an effective and reliable networking environment. One of the main aspects related to the management of network virtualization environments is virtual network provisioning. Virtual network provisioning defines how virtual network resources (nodes and links) are allocated in the physical infrastructure. VN provisioning often relies on embedding algorithms that aim to achieve well defined objectives, such as reducing allocation cost, load balancing, or minimizing energy consumption. Although VNs share the same infrastructure, they typically host diverse applications with different goals. Unfortunately, current provisioning solutions focus on a single or a limited set of objectives that may not simultaneously match the requirements of an increasing number of applications deployed in networks everyday. Novel applications may require different objectives that are not supported by the active provisioning system. In this thesis, we formulate the Application-Aware Virtual Network Provisioning Problem (AVNP) and propose an adaptive provisioning framework for virtualized networks that takes into consideration the characteristics of multiple applications and their distinct performance objectives. The proposed framework is based on the concept of allocation paradigm, which is defined as a set of provisioning policies that guide the resource allocation process. A paradigm translates objectives from both Infrastructure Providers (InPs) and Service Providers (SPs) to individual allocation actions that actually provision VNs. A policy language is also defined to express the relationship between paradigms, objectives, and actions. To determine the efficiency of a particular paradigm, we propose a virtual network performance computation model based on data measured from existing virtualization benchmarks. The model is able to quantify the performance of allocated VNs and guide paradigm changing decisions. Extensive simulations were performed to verify the viability of the proposed solution and compare different paradigms. Results show the feasibility of allocation paradigms in helping network providers to select the best provisioning strategy given a set of InP/SP objectives.

Até 2020 espera-se que as redes celulares aumentam em dez vezes a área de cobertura, suporte cem vezes mais equipamentos de usuários e eleve a capacidade da taxa de dados em mil vezes, comparada as redes celulares atuais. A densa implantação de pequenas células é considerada uma solução promissora para alcançar essas melhorias, uma vez que aproximar as antenas dos usuários proporciona maiores taxas de dados, devido à qualidade do sinal em curtas distâncias. No entanto, operar um grande número de antenas pode aumentar significativamente o consumo de energia da infraestrutura de rede. Além disso, a grande inserção de novos rádios pode ocasionar maior interferência espectral entre as células. Nesse cenário, a gestão dos recursos de rádio é essencial devido ao impacto na qualidade do serviço prestado aos usuários. Por exemplo, baixas potências de transmissão podem deixar usuários sem conexão, enquanto altas potências elevam a possibilidade de ocorrência de interferência. Além disso, a reutilização não planejada dos recursos de rádio causa a ocorrência de interferência, resultando em baixa capacidade de transmissão, enquanto a subutilização de recursos limita a capacidade total de transmissão de dados. Uma solução para controlar a potência de transmissão, atribuir os recursos de rádio e garantir o serviço aos usuários é essencial. Nesta dissertação, é proposto um algoritmo adaptativo de Monte Carlo para realizar alocação global de recursos de forma eficiente em termos de energia, para arquiteturas Heterogeneous Cloud Radio Access Network (H-CRAN), projetadas como futuras redes de quinta geração (5G). Uma solução eficiente para a alocação de recursos em cenários de alta e baixa densidade é proposta. Nossas contribuições são triplas: (i) proposta de uma abordagem global para o problema de atribuição de recursos de rádio na arquitetura HCRAN, cujo caráter estocástico garante uma amostragem geral de espaço de solução; (ii) uma comparação crítica entre nossa solução global e um modelo local; (iii) a demonstração de que, para cenários de alta densidade, a Eficiência Energética não é uma medida adequada para alocação eficiente, considerando a capacidade de transmissão, justiça e total de usuários atendidos. Além disso, a proposta é comparada em relação a três algoritmos de alocação de recursos de última geração para redes 5G. / Up until 2020 it is expected that cellular networks must raise the coverage area in 10-fold, support a 100-fold more user equipments, and increase the data rate capacity by a 1000-fold in comparison with current cellular networks. The dense deployment of small cells is considered a promising solution to reach such aggressive improvements, once it moves the antennas closer to the users, achieving higher data rates due to the signal quality at short distances. However, operating a massive number of antennas can significantly increase the energy consumption of the network infrastructure. Furthermore, the large insertion of new radios brings greater spectral interference between the cells. In this scenery, the optimal management of radio resources turn an exaction due to the impact on the quality of service provided to the users. For example, low transmission powers can leave users without connection, while high transmission powers can contribute to inter radios interference. Furthermore, the interference can be raised on the unplanned reuse of the radio resources, resulting in low data transmission per radio resource, as the under-reuse of radio resources limits the overall data transmission capacity. A solution to control the transmission power, assign the spectral radio resources, and ensure the service to the users is essential. In this thesis, we propose an Adaptive Monte Carlo algorithm to perform global energy efficient resource allocation for Heterogeneous Cloud Radio Access Network (HCRAN) architectures, which are forecast as future fifth-generation (5G) networks. We argue that our global proposal offers an efficient solution to the resource allocation for both high and low density scenarios. Our contributions are threefold: (i) the proposal of a global approach to the radio resource assignment problem in H-CRAN architecture, whose stochastic character ensures an overall solution space sampling; (ii) a critical comparison between our global solution and a local model; (iii) the demonstration that, for high density scenarios, Energy Efficiency is not a well suited metric for efficient allocation, considering data rate capacity, fairness, and served users. Moreover, we compare our proposal against three state-of-the-art resource allocation algorithms for 5G networks.