1 |
A low complexity algorithm for dynamic fair resource allocation in OFDMA systemsMoreira, André Luis Cavalcanti 31 January 2008 (has links)
Made available in DSpace on 2014-06-12T15:50:41Z (GMT). No. of bitstreams: 1
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2008 / A popularização da Internet e a demanda por acesso de alta velocidade levou ao
desenvolvimento da Broadband Wireless Access. Apesar do seu grande potencial, a
comunicação via rádio impõe alguns desafios. Uma grande limitação é o próprio meio de
transmissão devido a efeitos inerentes à propagação de radio como o path loss, frequency
selective fading, espalhamento Doppler e multipath delay-spread.
Nesse contexto, o OFDM é uma tecnologia promissora por causa de sua
tolerância a problemas de perdas e multi-caminho. Devido à combinação de canais
independentes, é possível usar diferentes modulações em cada sub-carrier, de acordo
com as condições do canal. Esta técnica é conhecida como adaptive modulation and
coding. Além disso, em uma arquitetura ponto a multi-ponto, múltiplos usuários podem
compartilhar o espectro ao se atribuir diferentes conjuntos de sub-carriers, tirando
vantagem do um efeito conhecido como diversidade multi-usuário. Em comparação com
outras técnicas de múltiplo acesso, o OFDMA permite um melhor aproveitamento da
diversidade multi-usuário com a possibilidade de uma alocação com alta granularidade.
Muitas pesquisas têm investigado técnicas adaptativas capazes de melhorar a eficiência
espectral em sistemas multi-usuário. Essas técnicas são normalmente formuladas como
constraint optimization problems, conhecidos por serem NP-hard.
Neste trabalho, adotamos uma abordagem heurística para lidar com esse tipo de
problema. O objetivo principal é desenvolver uma estratégia de alocação fazendo uso
eficiente dos recursos disponíveis e maximizando a eficiência espectral total. Entretanto,
um estratégia que apenas procura maximizar a eficiência espectral pode gerar um
problema relacionado à justiça no compartilhamento de recursos. Outrossim, com a
popularização das redes sem fio, é esperado que elas sejam capazes de prover uma maior
variedade de serviços com diferentes requisites de QoS e largura de banda. Portanto,
procuramos desenvolver um algoritmo que permita ao operador da rede definir esses
requisitos. De acordo com eles, o algoritmo deve fornecer o maior throughput possível
dentro dos limites estabelecidos por essas restrições
|
2 |
Design and Analysis of QoS-Aware Key Management and Intrusion Detection Protocols for Secure Mobile Group Communications in Wireless NetworksCho, Jin-Hee 10 December 2008 (has links)
Many mobile applications in wireless networks such as military battlefield, emergency response, and mobile commerce are based on the notion of secure group communications. Unlike traditional security protocols which concern security properties only, in this dissertation research we design and analyze a class of QoS-aware protocols for secure group communications in wireless networks with the goal to satisfy not only security requirements in terms of secrecy, confidentiality, authentication, availability and data integrity, but also performance requirements in terms of latency, network traffic, response time, scalability and reconfigurability.
We consider two elements in the dissertation research: design and analysis. The dissertation research has three major contributions. First, we develop three "threshold-based" periodic batch rekeying protocols to reduce the network communication cost caused by rekeying operations to deal with outsider attacks. Instead of individual rekeying, i.e., performing a rekeying operation right after each group membership change event, these protocols perform batch rekeying periodically. We demonstrate that an optimal rekey interval exists that would satisfy an imposed security requirement while minimizing the network communication cost.
Second, we propose and analyze QoS-aware intrusion detection protocols for secure group communications in mobile ad hoc networks to deal with insider attacks. We consider a class of intrusion detection protocols including host-based and voting-based protocols for detecting and evicting compromised nodes and examine their effect on the mean time to security failure metric versus the response time metric. Our analysis reveals that there exists an optimal intrusion detection interval under which the system lifetime metric can be best traded off for the response time performance metric, or vice versa. Furthermore, the intrusion detection interval can be dynamically adjusted based on the attacker behaviors to maximize the system lifetime while satisfying a system-imposed response time or network traffic requirement.
Third, we propose and analyze a scalable and efficient region-based group key management protocol for managing mobile groups in mobile ad hoc networks. We take a region-based approach by which group members are broken into region-based subgroups, and leaders in subgroups securely communicate with each other to agree on a group key in response to membership change and member mobility events. We identify the optimal regional area size that minimizes the network communication cost while satisfying the application security requirements, allowing mobile groups to react to network partition/merge events for dynamic reconfigurability and survivability. We further investigate the effect of integrating QoS-aware intrusion detection with region-based group key management and identify combined optimal settings in terms of the optimal regional size and the optimal intrusion detection interval under which the security and performance properties of the system can be best optimized.
We evaluate the merits of our proposed QoS-aware security protocols for mobile group communications through model-based mathematical analyses with extensive simulation validation. We perform thorough comparative analyses against baseline secure group communication protocols which do not consider security versus performance tradeoffs, including those based on individual rekeying, no intrusion detection, and/or no-region designs. The results obtained show that our proposed QoS-aware security protocols outperform these baseline algorithms. â / Ph. D.
|
Page generated in 0.0403 seconds