Spelling suggestions: "subject:"apectrum allocation"" "subject:"espectrum allocation""
1 |
STUDY OF SPECTRUM ALLOCATION SCHEMES IN GENERALIZED MULTI PROTOCOL LABEL SWITCHED CONTROL PLANE ENABLED FLEXI GRID NETWORKSMathur, Tushar 06 August 2015 (has links)
No description available.
|
2 |
Estimation of Cost-based Channel Occupancy in Cognitive Radio Using Sequential Monte Carlo MethodsJanuary 2014 (has links)
abstract: Dynamic channel selection in cognitive radio consists of two main phases. The first phase is spectrum sensing, during which the channels that are occupied by the primary users are detected. The second phase is channel selection, during which the state of the channel to be used by the secondary user is estimated. The existing cognitive radio channel selection literature assumes perfect spectrum sensing. However, this assumption becomes problematic as the noise in the channels increases, resulting in high probability of false alarm and high probability of missed detection. This thesis proposes a solution to this problem by incorporating the estimated state of channel occupancy into a selection cost function. The problem of optimal single-channel selection in cognitive radio is considered. A unique approach to the channel selection problem is proposed which consists of first using a particle filter to estimate the state of channel occupancy and then using the estimated state with a cost function to select a single channel for transmission. The selection cost function provides a means of assessing the various combinations of unoccupied channels in terms of desirability. By minimizing the expected selection cost function over all possible channel occupancy combinations, the optimal hypothesis which identifies the optimal single channel is obtained. Several variations of the proposed cost-based channel selection approach are discussed and simulated in a variety of environments, ranging from low to high number of primary user channels, low to high levels of signal-to-noise ratios, and low to high levels of primary user traffic. / Dissertation/Thesis / M.S. Electrical Engineering 2014
|
3 |
Policy-Based Flexible Spectrum Usage for Next-Generation Mobile Communication Networks / Policy-Based Flexible Spectrum Usage for Next-Generation Mobile Communication NetworksMusil, Tomáš January 2010 (has links)
This Master's thesis deals with proposal of Flexible Spectrum Usage (FSU) algorithm based on policy agreed among operators. The introduction presents basic information about properties of next generation mobile communication ITM-Advanced system. After the introductory part the attention is given to the items efficient for FSU implementation as well as parameters used for evaluation of FSU algorithm efficiency. Several variants policy based FSU algorithm utilize value of Signal to Interference plus Noise Ratio (SINR) is designed. The SINR information is used to combat with mutual interference which is caused by coexistence of several operators in the same geographical area sharing over the same spectrum pool. Individual needed as traffic and quality of service requirements of each operator is taken into consideration as well. The main aim is to maximize cell troughput as well as data- rates for each user of HBS. For simulation of proposal algorithm is considered deployment of four Currently Home Base Stations (HBS) in indoor loacal area scenerio with random number of users in given range. Each operator makes independent dicision without signalling exchange among other. The only considered information that HBS can use is gotten by scenning its environment. This problem soliving is considered to use Cognitive Radio (CR)
|
4 |
Policy-Based Flexible Spectrum Usage for Next-Generation Mobile Communication Networks / Policy-Based Flexible Spectrum Usage for Next-Generation Mobile Communication NetworksMusil, Tomáš January 2010 (has links)
This Master's thesis deals with proposal of Flexible Spectrum Usage (FSU) algorithm based on policy agreed among operators. The introduction presents basic information about properties of next generation mobile communication ITM-Advanced system. After the introductory part the attention is given to the items efficient for FSU implementation as well as parameters used for evaluation of FSU algorithm efficiency. Several variants policy based FSU algorithm utilize value of Signal to Interference plus Noise Ratio (SINR) is designed. The SINR information is used to combat with mutual interference which is caused by coexistence of several operators in the same geographical area sharing over the same spectrum pool. Individual needed as traffic and quality of service requirements of each operator is taken into consideration as well. The main aim is to maximize cell troughput as well as data- rates for each user of HBS. For simulation of proposal algorithm is considered deployment of four Currently Home Base Stations (HBS) in indoor loacal area scenerio with random number of users in given range. Each operator makes independent dicision without signalling exchange among other. The only considered information that HBS can use is gotten by scenning its environment. This problem soliving is considered to use Cognitive Radio (CR)
|
5 |
Υλοποίηση μαθηματικο-ευριστικού αλγορίθμου δρομολόγησης και ανάθεσης φάσματος για ελαστικά δίκτυα οπτικών ινώνΚοντοδήμας, Κωνσταντίνος 16 April 2015 (has links)
Η Ορθογώνια Πολυπλεξία Διαίρεσης Συχνότητας (OFDM) έχει προταθεί ως τεχνική διαμόρφωσης σε οπτικά δίκτυα, λόγω της καλής φασματικής απόδοσής της, της ευελιξίας και της ανοχής της σε βλάβες. Η διαμόρφωση OFDM επιτρέπει την ελαστική ανάθεση φάσματος, χρησιμοποιώντας μεταβλητό πλήθος υποφερουσών, καθώς και την επιλογή του κατάλληλου επιπέδου διαμόρφωσης με βάση την απόσταση της μετάδοσης. Το «Πρόβλημα Δρομολόγης και Ανάθεσης Φάσματος» (RSA) έχει αποδειχθεί ότι είναι ένα NP-πλήρες πρόβλημα, γεγονός που υποδηλώνει τη χρήση γραμμικού προγραμματισμού για τη λύση του. Στόχος της διπλωματικής εργασίας είναι η βελτίωση της απόδοσης του υπάρχοντος αλγορίθμου ακέραιου γραμμικού προγραμματισμού, με χρήση μεταευριστικών, έτσι ώστε στο ίδιο χρονικό διάστημα να υπολογίζεται αποδοτικότερη χρησιμοποίηση του συνολικού απαιτούμενου φάσματος, για το σύνολο των μεταδόσεων στο δίκτυο. / Orthogonal Frequency Division Multiplexing (OFDM) has been proposed as a modulation technique for optical networks, because of its good spectral efficiency, flexibility, and tolerance to impairments. OFDM modulation allows elastic spectrum allocation, using a variable number of subcarriers and choosing an appropriate modulation level, taking into account the transmission distance. The “Routing and Spectrum Allocation” (RSA) problem has been proved to be a NP-complete problem, which suggests the usage of linear programming in order to be solved. This diploma thesis aims to improve the efficiency of the existing integer linear programming algorithm, by using metaheuristics, so that at the same time period a more efficient utilization of the required spectrum is computed, for all network transmissions.
|
6 |
Roteamento e alocação de espectro em redes ópticas elásticas / Routing and spectrum assignment in elastic optical networksMoura, Pedro Mesquita, 1989- 27 August 2018 (has links)
Orientador: Nelson Luis Saldanha da Fonseca / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-27T20:17:10Z (GMT). No. of bitstreams: 1
Moura_PedroMesquita_M.pdf: 2113385 bytes, checksum: 1ba529be35f0f2fbcb95f91c01acfa29 (MD5)
Previous issue date: 2015 / Resumo: As redes ópticas com multiplexação por comprimento de onda empregam uma grade fixa de divisão do espectro, dividindo-o em grandes faixas com alta capacidade de transmissão. Apesar de este esquema atingir altas velocidades de até 100Gb/s atualmente, a demanda de tráfego está cada vez maior e novas soluções são propostas como futuro das redes ópticas. A divisão do espectro em grandes faixas pode gerar problemas de falta de flexibilidade, onde requisições com baixas demandas de tráfego subutilizam comprimentos de onda. Nesse contexto as redes ópticas elásticas emergem, buscando flexibilizar a alocação do espectro utilizando alta granularidade na divisão do espectro, de modo que as conexões utilizem tipicamente vários slots, que são a unidade de alocação de redes ópticas elásticas. Utilizando-se da tecnologia de Multiplexação por Divisão de Frequências Ortogonais (OFDM), é possível fazer com que os slots adjacentes se sobreponham ortogonalmente, sem interferência, atingindo alta eficiência de utilização do espectro. O roteamento e alocação de espectro surge neste contexto com o objetivo de alocar rotas nas redes ópticas elásticas, necessitando caminhos na rede que possuam espectro suficiente para acomodar a demanda de tráfego, e a fim de manter o sinal no domínio óptico e evitar a custosa operação de conversão opto eletrônica, é necessário manter a mesma porção do espectro alocada em todos os enlaces do caminho, problema denominado de restrição de continuidade do espectro. Os slots devem ser também adjacentes para que estes se sobreponham utilizando OFDM, problema chamado de restrição de contiguidade do espectro. Esta dissertação investiga o problema roteamento e alocação de espectro e propõe algoritmos que melhoram características da rede, como qualidade de serviço, custo operacional e eficiência energética / Abstract: Wavelength division multiplexing optical networks employ fixed grid for spectrum, with high capacity transmission slots. Although this division allows high speeds of up to 100Gbps nowadays, the traffic demand grows each year and new solutions are needed in optical networks. The high capacity fixed grid can produce problems like the sub utilization of wavelengths by requests with lower traffic demand than their capacity. In this context the elastic optical networks emerged, allowing flexible division of spectrum, in a way that connections allocate several slots, the unit of spectrum of elastic optical networks. Together with Orthogonal Frequency Division Multiplexing (OFDM), it is possible to orthogonally overlap adjacent slots, without interference, achieving higher spectrum efficiency. The routing and spectrum assignment problem aims to allocate routes and spectrum in elastic optical networks, finding for paths with enough spectrum to accommodate the traffic demand. In order to avoid the costly optoelectronic signal conversion, it is necessary to allocate the same portion of spectrum in each link of the path, problem called spectrum continuity constraint. The slots must also be allocated contiguously, in order to the overlapping with OFDM be effective, problem called spectrum contiguity constraint. This work investigate the routing and spectrum assignment problem and proposes algorithms to improve network characteristics such as quality of service, operational expenditure and energy efficiency / Mestrado / Ciência da Computação / Mestre em Ciência da Computação
|
7 |
Cognitive radio performance optimisation through spectrum availability predictionBarnes, Simon Daniel 27 June 2012 (has links)
The federal communications commission (FCC) has predicted that, under the current regulatory environment, a spectrum shortage may be faced in the near future. This impending spectrum shortage is in part due to a rapidly increasing demand for wireless services and in part due to inefficient usage of currently licensed bands. A new paradigm pertaining to wireless spectrum allocation, known as cognitive radio (CR), has been proposed as a potential solution to this problem. This dissertation seeks to contribute to research in the field of CR through an investigation into the effect that a primary user (PU) channel occupancy model will have on the performance of a secondary user (SU) in a CR network. The model assumes that PU channel occupancy can be described as a binary process and a two state Hidden Markov Model (HMM) was thus chosen for this investigation. Traditional algorithms for training the model were compared with certain evolutionary-based training algorithms in terms of their resulting prediction accuracy and computational complexity. The performance of this model is important since it provides SUs with a basis for channel switching and future channel allocations. A CR simulation platform was developed and the results gained illustrated the effect that the model had on channel switching and the subsequently achievable performance of a SU operating within a CR network. Performance with regard to achievable SU data throughput, PU disruption rate and SU power consumption, were examined for both theoretical test data as well as data obtained from real world spectrum measurements (taken in Pretoria, South Africa). The results show that a trade-off exists between the achievable SU throughput and the average PU disruption rate. Significant SU performance improvements were observed when prediction modelling was employed and it was found that the performance and complexity of the model were influenced by the algorithm employed to train it. SU performance was also affected by the length of the quick sensing interval employed. Results obtained from measured occupancy data were comparable with those obtained from theoretical occupancy data with an average percentage similarity score of 96% for prediction accuracy (using the Viterbi training algorithm), 90% for SU throughput, 83% for SU power consumption and 71% for PU disruption rate. / Dissertation (MEng)--University of Pretoria, 2012. / Electrical, Electronic and Computer Engineering / unrestricted
|
8 |
Adaptive Radio Resource Management in Cognitive Radio Communications using Fuzzy ReasoningShatila, Hazem Sarwat 23 April 2012 (has links)
As wireless technologies evolve, novel innovations and concepts are required to dynamically and automatically alter various radio parameters in accordance with the radio environment. These innovations open the door for cognitive radio (CR), a new concept in telecommunications. CR makes its decisions using an inference engine, which can learn and adapt to changes in radio conditions.
Fuzzy logic (FL) is the proposed decision-making algorithm for controlling the CR's inference engine. Fuzzy logic is well-suited for vague environments in which incomplete and heterogeneous information is present. In our proposed approach, FL is used to alter various radio parameters according to experience gained from different environmental conditions. FL requires a set of decision-making rules, which can vary according to radio conditions, but anomalies rise among these rules, causing degradation in the CR's performance. In such cases, the CR requires a method for eliminating such anomalies. In our model, we used a method based on the Dempster-Shafer (DS) theory of belief to accomplish this task. Through extensive simulation results and vast case studies, the use of the DS theory indeed improved the CR's decision-making capability. Using FL and the DS theory of belief is considered a vital module in the automation of various radio parameters for coping with the dynamic wireless environment.
To demonstrate the FL inference engine, we propose a CR version of WiMAX, which we call CogMAX, to control different radio resources. Some of the physical parameters that can be altered for better results and performance are the physical layer parameters such as channel estimation technique, the number of subcarriers used for channel estimation, the modulation technique, and the code rate. / Ph. D.
|
9 |
Statistical Analysis of Wireless Systems Using Markov ModelsAkbar, Ihsan Ali 06 March 2007 (has links)
Being one of the fastest growing fields of engineering, wireless has gained the attention of researchers and commercial businesses all over the world. Extensive research is underway to improve the performance of existing systems and to introduce cutting edge wireless technologies that can make high speed wireless communications possible.
The first part of this dissertation deals with discrete channel models that are used for simulating error traces produced by wireless channels. Most of the time, wireless channels have memory and we rely on discrete time Markov models to simulate them. The primary advantage of using these models is rapid experimentation and prototyping. Efficient estimation of the parameters of a Markov model (including its number of states) is important to reproducing and/or forecasting channel statistics accurately. Although the parameter estimation of Markov processes has been studied extensively, its order estimation problem has been addressed only recently. In this report, we investigate the existing order estimation techniques for Markov chains and hidden Markov models. Performance comparison with semi-hidden Markov models is also discussed. Error source modeling in slow and fast fading conditions is also considered in great detail.
Cognitive Radio is an emerging technology in wireless communications that can improve the utilization of radio spectrum by incorporating some intelligence in its design. It can adapt with the environment and can change its particular transmission or reception parameters to execute its tasks without interfering with the licensed users. One problem that CR network usually faces is the difficulty in detecting and classifying its low power signal that is present in the environment. Most of the time traditional energy detection techniques fail to detect these signals because of their low SNRs. In the second part of this thesis, we address this problem by using higher order statistics of incoming signals and classifying them by using the pattern recognition capabilities of HMMs combined with cased-based learning approach.
This dissertation also deals with dynamic spectrum allocation in cognitive radio using HMMs. CR networks that are capable of using frequency bands assigned to licensed users, apart from utilizing unlicensed bands such as UNII radio band or ISM band, are also called Licensed Band Cognitive Radios. In our novel work, the dynamic spectrum management or dynamic frequency allocation is performed by the help of HMM predictions. This work is based on the idea that if Markov models can accurately model spectrum usage patterns of different licensed users, then it should also correctly predict the spectrum holes and use these frequencies for its data transmission. Simulations have shown that HMMs prediction results are quite accurate and can help in avoiding CR interference with the primary licensed users and vice versa. At the same time, this helps in sending its data over these channels more reliably. / Ph. D.
|
10 |
Proteção compartilhada e restauração de tráfego em redes ópticas de segmentação espectral flexível / Shared protection and traffic restoration in elastic optical networksCapelari, Natália Santa Bárbara 05 May 2016 (has links)
A busca de sistemas de comunicação eficientes e econômicos é cada vez maior, principalmente com o aumento da demanda por tráfego e banda de transmissão. Conhecidas pela utilização eficiente de largura de banda, as redes ópticas de segmentação espectral flexível têm sido intensamente estudadas e são consideradas boas candidatas para a próxima geração de redes. Tais redes flexíveis utilizam formatos de modulação multinível e multiplexação multiportadora. Sistemas com alta capacidade de transmissão devem ser extremamente confiáveis, pois a falha em um dispositivo ou enlace da rede acarreta enorme perda de dados. Por isso, as técnicas de proteção e restauração do tráfego devem ser eficientes, de modo a garantir a sobrevivência da rede. Neste trabalho, foi desenvolvido um algoritmo capaz de lidar com cada requisição de conexão, encontrar um caminho óptico para transmissão e reservar outro caminho para recuperação do tráfego em caso de falha na rede. A seleção dos caminhos primário e de proteção utiliza a técnica smart-fit, que escolhe a solução com menor custo final, definido pela distância da rota percorrida somada ao custo do índice inicial da faixa espectral alocada, buscando equilibrar a escolha entre a posição no espectro e rota escolhida. Além disso, são definidos custos diferentes para slots de frequência livres e compartilhados, a fim de incentivar o compartilhamento espectral em caminhos de proteção. Dentre as técnicas de alocação espectral, a varredura com janela espectral varre o espectro em todos os enlaces da rota, slot por slot, em busca de uma faixa livre com tamanho suficiente para atender uma demanda. Neste trabalho, foi desenvolvida uma técnica chamada busca lógica, que lida simultaneamente com todos os enlaces da rota ao realizar operações lógicas com seus espectros. Em seguida, é realizada uma convolução entre a janela espectral, com tamanho da demanda, e o espectro resultante. A partir desse resultado, é possível saber as posições no espectro onde a demanda poderá ser alocada. Tal técnica, como será demonstrado, é mais veloz que a varredura com janela espectral. Para garantir a eficácia e confiabilidade do algoritmo, utilizando o software MATLAB, avaliou-se a probabilidade de bloqueio e probabilidade de bloqueio de banda, a fragmentação espectral média na rede, o grau de compartilhamento, a taxa de utilização espectral e a taxa de capacidade reservada. O algoritmo desenvolvido foi capaz de organizar o tráfego na rede de modo ordenado e pouco fragmentado, além de utilizar de maneira eficiente os recursos destinados à proteção. / The search for efficient and economical communication systems is increasing, especially with the increased demand for traffic and bandwidth transmission. The elastic optical networks, well known for their efficient using of bandwidth, have been thoroughly studied and are considered good candidates for the next generation networks. Such flexible networks use multilevel modulation formats and multicarrier multiplexing. Systems with high transmission capacity should be extremely reliable, as a failure in a device or link brings huge data loss. Therefore, traffic protection and restoration techniques should be efficient, to ensure network survivability. In this work, we propose an algorithm capable of managing each connection request, finding an optical path for transmission and a protection path to recover traffic in case of network failure. The selection of the primary and protection path uses the smart-fit technique, which chooses the solution with the lower final cost, defined by the route\'s distance plus the index\'s cost of the first slot of the allocated spectrum, in order to balance the choice between the position in the spectrum and the chosen route. In addition, different costs for free or shared frequency slots are defined, so as to encourage spectral sharing in protection paths. Among the spectrum allocation techniques, scanning with spectrum window scans the spectrum in all links of the route, slot by slot, searching for a free band large enough to meet the demand. In this work, we developed a new technique, called logical search, that simultaneously deals with all the links in the route, by performing logical operations with them. Then, a convolution is performed between a spectrum window, with the same size of the demand, and the resulting spectrum. From this result, it is possible to know all the positions in the spectrum where the demand may fit. This technique, as will be shown, is faster than the scan with spectrum window. To guarantee the efficiency and reliability of the algorithm, using the MATLAB software, we evaluated the blocking probability and bandwidth blocking probability, the average spectral fragmentation in the network, the shareability ratio, the spectral utilization ratio and the spare capacity ratio. The developed algorithm was able to organize the traffic in an orderly and less fragmented way, and use the protection resources efficiently.
|
Page generated in 0.1883 seconds