No description available.

The fusion of computers and communications has promised to herald the age of information super-highway over high speed communication networks where the ultimate goal is to enable a multitude of users at any place, access information from anywhere and at any time. This, in a nutshell, is the goal envisioned by the Personal Communication Services (PCS) and Xerox's ubiquitous computing. In view of the remarkable growth of the mobile communication users in the last few years, the radio frequency spectrum allocated by the FCC (Federal Communications Commission) to this service is still very limited and the usable bandwidth is by far much less than the expected demand, particularly in view of the emergence of the next generation wireless multimedia applications like video-on-demand, WWW browsing, traveler information systems etc. Proper management of available spectrum is necessary not only to accommodate these high bandwidth applications, but also to alleviate problems due to sudden explosion of traffic in so called hot cells. In this dissertation, we have developed simple load balancing techniques to cope with the problem of tele-traffic overloads in one or more hot cells in the system. The objective is to ease out the high channel demand in hot cells by borrowing channels from suitable cold cells and by proper assignment (or, re-assignment) of the channels among the users. We also investigate possible ways of improving system capacity by rescheduling bandwidth in case of wireless multimedia traffic. In our proposed scheme, traffic using multiple channels releases one or more channels to increase the carried traffic or throughput in the system. Two orthogonal QoS parameters, called carried traffic and bandwidth degradation, are identified and a cost function describing the total revenue earned by the system from a bandwidth degradation and call admission policy, is formulated. A channel sharing scheme is proposed for co-existing real-time and non-real-time traffic and analyzed using a Markov modulated Poisson process (MMPP) based queueing model. The location management problem in mobile computing deals with the problem of a combined management of location updates and paging in the network, both of which consume scarce network resources like bandwidth, CPU cycles etc. An easily implementable location update scheme is developed which considers per-user mobility pattern on top of the conventional location area based approach and computes an update strategy for each user by minimizing the average location management cost. The cost optimization problem is elegantly solved using a genetic algorithm.

University of the Witwatersrand Faculty of Engineering and the Built Environment School of Information and Electrical Engineering / Mobile Broadband is now more of a necessity than a luxury, especially amongst the younger generation, irrespective of where they live. Mobile WiMax and LTE, the latest and fastest Mobile Broadband technologies, mark significant improvements over 3G networks because they use IP (Internet Protocol) end-to-end. To end-users, this means faster network speeds, better quality services, and increased coverage area. To the Network Operators, this means simplified network architectures, efficient use of resources, and improved security. In this report, the different issues and challenges related to deploying Mobile WiMax (802.16e or 802.16m) in rural South Africa, were identifed and explored. In this project, Atoll, SONAR, and Touch Point analysis tools were used to determine which Mobile Broadband technology is economically and technically suited for rural South Africa. It was found that LTE yields superior performance results than WiMax, which in turn yields superior performance results to all other existing 3G technologies. However it will take time for LTE to reach rural areas therefore WiMax can be considered as a solution to extend Broadband services to rural South Africa and thus assist in bridging the digital divide. Recommendations on how best to deploy Mobile WiMax are made based on observations made from the experimental work. / MT2017

As redes de sensores sem fio (RSSF) são uma tecnologia que ganhou muita importância nos últimos anos. Dentro das diversas aplicações para essas redes, o rastreamento de alvos é considerado essencial. Nessa aplicação, a RSSF deve determinar, de forma colaborativa, a trajetória de um ou mais alvos que se encontrem dentro de sua área de cobertura. O presente trabalho apresenta um algoritmo colaborativo baseado na fatoração multifrontal QR para estimação de trajetórias de alvos com RSSF. A solução proposta está inserida no âmbito da estimação por lotes, na qual os dados são coletados pelos sensores durante a aplicação e só no final é realizada a estimativa da trajetória do alvo. Uma vez coletados os dados, o problema pode ser modelado como um sistema de equações sobredeterminado Ax = b cuja característica principal é ser esparso. A solução desse sistema é dada mediante o método de mínimos quadrados, no qual o sistema é transformado num sistema triangular superior, que é solucionado mediante substituição inversa. A fatoração multifrontal QR é ideal neste contexto devido à natureza esparsa da matriz principal do sistema. A fatoração multifrontal QR utiliza um grafo denominado árvore de eliminação para dividir o processo de fatoração de uma matriz esparsa em fatorações densas de pequenas submatrizes denominadas matrizes frontais. Mapeando a árvore de eliminação na RSSF consegue-se que essas fatorações densas sejam executadas pelos nós sensoriais que detectaram o alvo durante seu trajeto pela rede. Dessa maneira, o algoritmo consegue realizar a fatoração da matriz principal do problema de forma colaborativa, dividindo essa tarefa em pequenas tarefas que os nós de sensoriais da rede possam realizar. / Wireless Sensor Networks (WSN) is a technology that have gained a lot of importance in the last few years. From all the possible applications for WSN, target tracking is considered essential. In this application, the WSN has to determine, in a collaborative way, the trajectory of one or more targets that are within the sensing area of the network. The aim of this document is to present a collaborative algorithm based on multifrontal QR factorization for the solution of the target trajectory estimation problem with WSN. This algorithm uses a batch estimation approach, which assumes that all sensing data are available before the estimation of the target trajectory. If all the observations of the target trajectory is available, the problem can be modeled as an overdetermined system of equations Ax = b where A is sparse. This system of equations is solved by least squares method. The multifrontal QR factorization uses a tree graph called elimination tree to reorganize the overall factorization of a sparse matrix into a sequence of partial factorizations of dense smaller matrices named frontal matrices. By mapping the elimination tree into the WSN, the sensor nodes that observed the target can factorize the frontal matrices. In this manner, the WSN factorizes the matrix A in a collaborative way, dividing the work in small tasks that the sensor nodes could execute.

As etapas envolvidas na produção de uma mina podem ser modeladas e gerenciadas de forma mais eficiente quando há um fluxo mútuo e contínuo de informações, que vão desde a geologia até às especificações do produto final. Através da modelagem e gerenciamento das diversas etapas envolvidas no processo mineiro é possível melhorar significativamente o planejamento e operação das minas. A incorporação de componentes tecnológicos diversos tais como software de mineração, software de realidade virtual e componentes wireless, permite tomar decisões baseadas em modelos mais realísticos e precisos. Para tal, é proposta uma metodologia de integração destas tecnologias no controle das tarefas de decapeamento no planejamento de lavra de curto prazo, visando aprimorar o controle de qualidade no minério lavrado através do uso de técnicas de simulação condicional. A integração dessas tecnologias permite a transmissão de dados em tempo real entre planejamento e operação de mina, proporcionando melhorias na produtividade, na eficiência e no controle dos processos, além de promover melhorias na qualidade do material lavrado através do conhecimento do nível de incerteza associado em cada plano operacional de lavra. Uma solução composta por tecnologias integradas permite que o pessoal de operação de mina alcance os resultados de forma mais rápida e eficiente, melhorando significativamente a produtividade das operações da mina e a qualidade do minério lavrado. / The stages involved in mining production can be modeled and managed in a more efficient way when there is an integrated and continuous flow of information, from geology all the way down the mine value chain to the final specifications of the product. It is possible to improve the efficiency of decision-making in mine planning and operations through proper data-flow management. With the incorporation of technological components such as mining software, virtual reality software and wireless components, it is possible to take decisions based on models that are more accurate and realistic. This research considers a methodology technology integration for the tasks of waste moving in the short term mine planning, to improve the quality control in mined ore using conditional simulation techniques. The integration of these technologies allows instantaneous transmission of data between mine planning and the mine operation, improving productivity and efficiency in process control. In addition, it provides a measure of the uncertainty associated with the operational mining planning. An integrated solution allows mine planners and equipment operators to obtain quicker and more efficient results, improving significantly productivity in the operation of the mine and quality of the mined ore.

Este trabalho apresenta uma nova aplicação de wavelets em sistemas de espalhamento espectral. A aplicação apresentada foi realizada no contexto de detecção multiusuário e pode ser empregada em sistemas de acesso múltiplo por divisão de código. A detecção e a estimação são realizadas através de um algoritmo de inferência bayesiana, empregando o Amostrador de Gibbs e utilizando as wavelets para melhorar a relação sinal ruído na recepção. Na transmissão, um código específico, baseado na wavelet de Haar, modula o sinal contendo a informação preparando-o contra alterações que possam ocorrer devido a características intrínsecas do canal de ruído branco, gaussiano e aditivo. Esta técnica foi aqui denominada de modulação wavelet. Na recepção, uma transformada wavelet de Haar é aplicada ao sinal, gerando coeficientes wavelets. A ortogonalidade da wavelet de Haar torna possível executar um procedimento de cancelamento de ruído, em inglês denoising, que melhora a qualidade da recepção. Para validar a abordagem apresentada neste trabalho, foi executada uma série de simulações. Os resultados mostraram um melhor desempenho sistêmico com o emprego de wavelets. Nas simulações foram observados vários parâmetros de sistema, dentre eles e amplitude do sinal, a taxa de erro de bits (BER, bit error rate) e a variância do sinal. Os resultados foram bastante satisfatórios, indicando uma redução do ruído da ordem de 3dB em relação ao valor sem cancelamento de ruído. Este trabalho abre novas oportunidades de pesquisa para o uso de wavelets em sistemas de espalhamento espectral e telecomunicações em geral. / This work presents a new application of wavelets to spread spectrum systems. The presented application was made in the context of multiuser detection and can be used in code-division multiple access systems. Detection and estimation are performed through a Bayesian inference algorithm and, employing the Gibbs sampler and utilizing wavelets to improve the signal-to-noise ratio at the reception. At the transmission, a specific code based on the Haar wavelet modulates the signal containing the information, preparing it to alterations that may occur due to the intrinsic characteristics of the additive Gaussian noise channel. This technique was here denominated wavelet modulation. At the reception, a Haar wavelet transform is applied to the signal, generating wavelet coefficients. The orthogonality of the Haar wavelet makes it possible to perform a noise cancelling process, called denoising, which enhances the receiving quality. To validate the approach presented in this work, a number of simulations were performed. The results showed a better system performance with the use of wavelets. Several parameters were monitored in the simulations, among them the signal amplitude, de BER (bit error rate), and the signal variance. The results were very satisfactory, indicating a noise reduction of approximately 3dB referred to the value without noise cancelling. This work opens new research opportunities for the use of wavelets in spread spectrum systems and Telecommunications in general.

Energy e ciency is a critical constraint in wireless sensor networks. Wireless sensor networks (WSNs) consist of a large number of battery-powered sensor nodes, connected to each other and equipped with low-power transmission radios. Usually, the sensor nodes closer to the sink are more likely to become overloaded and subject to draining their battery faster than the nodes farther away, creating a funneling e ect. The use of a mobile device as a sink node to perform data gathering is a well known solution to balance the energy consumption in the entire network. To address this problem, in this work we consider the use of an UAV as a mobile sink. An unmanned aircraft vehicle (UAV) is an aircraft without a human pilot on-board, popularly known as a Drone. In this thesis, besides the use of the UAV as a mobile sink node, we propose an UAV-aided algorithm for data gathering in wireless sensor networks, called Humming- bird. Our distributed algorithm is energy-e cient. Rather than using an arbitrary path, the UAV implements an approximation algorithm to solve the well-known NP- Hard problem, the Traveling Salesman Problem (or TSP), to setup the trajectory of node points to visit for data gathering. In our approach, both the path planning and the data gathering are performed by the UAV, and this is seamlessly integrated with sensor data reporting. The results, using ns-3 network simulator show that our algorithm improves the network lifetime compared to regular (non-UAV) data gathering, especially for data intensive applications. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

In this thesis, a comprehensive investigation of the state-of-the-art guidelines for the conducted schemes in the near vicinity of the human body has been provided. The primary objectives of this work have been mainly focused on the electromagnetic (EM) wave exposure at both the microwave and millimetre-wave (mm-wave) frequency bands, along with their thorough analyses for a number of wireless technologies, such as the smart meters (SMs) and multiple-input multiple-output (MIMO) antennas. This work has undertaken a detailed theoretical and numerical modelling, as well as experimental measurements to propose the frameworks for the exposure conditions regarding the advanced wireless systems and applications. The employed numerical methods have been validated using the finite integration technique (FIT)-based simulations. The specific absorption rate (SAR) distributions have been determined using the anatomically realistic human models at various frequency bands. In this regard, each human model is assigned with the age- and frequency-dependent (AFD) dielectric properties, based on the novel expressions. This has then resulted in the representation of dispersive and age-dependent dielectric properties, in order to potentially improve the accuracy of the current assessment methods. Moreover, a number of generalised exposure conditions involving the standing and sleeping postures have been assessed for the home area network operating at the microwave band. The obtained results on the study on the SMs have been partly used by the Public Health England to provide the practical guidelines for the improvement of the services provided for the public. Furthermore, an assessment of the MIMO mobile handset has been performed in two exposure conditions, involving calling and body worn postures. Some aspects of this MIMO study has shown higher absorption levels in comparison with the basic restriction limits. A new SAR estimation approach has also been adopted to address the compliance assessment issues at the mm-wave bands. Finally, this work has identified a number of key factors that cause the high absorption levels in the human body and has provided insight into the efficient techniques in order to reduce such effects.

From wirelessly connected robots to car-to-car communications, and to smart cities, almost every aspect of our lives will benefit from future wireless communications. While promise an exciting future world, next-generation wireless communications impose requirements on the data rate, spectral efficiency, and latency (among others) that are higher than those for today's systems by several orders of magnitude. Full-duplex wireless, an emergent wireless communications paradigm, breaks the long-held assumption that it is impossible for a wireless device to transmit and receive simultaneously at the same frequency, and has the potential to immediately double network capacity at the physical (PHY) layer and offers many other benefits (such as reduced latency) at the higher layers. Recently, discrete-component-based demonstrations have established the feasibility of full-duplex wireless. However, the realization of integrated full duplex radios, compact radios that can fit into smartphones, is fraught with fundamental challenges. In addition, to unleash the full potential of full-duplex communication, a careful redesign of the PHY layer and the medium access control (MAC) layer using a cross-layer approach is required. The biggest challenge associated with full duplex wireless is the tremendous amount of transmitter self-interference right on top of the desired signal. In this dissertation, new self-interference-cancellation approaches at both system and circuit levels are presented, contributing towards the realization of full-duplex radios using integrated circuit technology. Specifically, these new approaches involve elimination of the noise and distortion of the cancellation circuitry, enhancing the integrated cancellation bandwidth, and performing joint radio frequency, analog, and digital cancellation to achieve cancellation with nearly one part-per-billion accuracy. In collaboration with researchers at higher layers of the stack, a cross-layer approach has been used in our full-duplex research and has allowed us to derive power allocation algorithms and to characterize rate-gain improvements for full-duplex wireless networks. To enable experimental characterization of full-duplex MAC layer algorithms, a cross-layered software-defined full-duplex radio testbed has been developed. In collaboration with researchers from the field of micro-electro-mechanical systems, we demonstrate a multi-band frequency-division duplexing system using a cavity-filter-based tunable duplexer and our integrated widely-tunable self-interference-cancelling receiver.

動態頻譜共享(dynamic spectrum sharing) 允許不具有執照的無線電用戶(坎級用戶)擇機使用具有執照的無線電用戶(主用戶)的頻譜，因此被認為是一種有效解決頻譜低效利用問題的方案。本論文研究次級用戶如何智能地實現高效率的動態頻譜共享。我們考慮兩種智能共享模式:社交智能(social intelligence) 以及個體智能(individual intelligence) 。 / 對於社交智能，次級用戶基於社交互動(social interactions) 來協作地共享頻譜。受到電子商務工業的推薦系統(recommendation sYstem) 的啟發，我們提出了一種基於推薦的社交頻譜共享機制。其中，次級用戶相互協作，彼此推薦良好的信道， 并動態接入信道。我們設計了種基於馬爾科夫決策過程( Markovdecision process) 的自適應信道推薦算法。該算法可突現良好的系統通信性能。同時，我們也提出種基於模仿(imitation) 的社交頻譜分享機制。其中，次級用戶根據自身觀察來估計自己的期望通信速率并彼此分享。如果鄰近用戶的期望通信速率更高，該用戶則模仿鄰近用戶的信道接入。我們證明該機制能夠有效地收斂到模仿均衡。如果次級用戶的數目較多，收斂的模仿均衡即是納什均衡(Nashequilibrium) 。該均衡是個次級用戶相互滿意的頻譜共享結果。 / 對於個體智能，次級用戶基於策略互動(strategic interactions) 來競爭地共享頻譜。對於基於空間複用(spatial reuse) 的競爭性頻譜共享，我們提出了種新穎的空間頻譜接入博弈框架。我們研究了不同的干擾圖形結構對於納什均衡的存在性的影響。同時，我們設計了種基於用戶自身觀察的分佈式學習算法。該算法適用於所有空間頻譜接入博弈，并能夠有效地收斂到近似納什均衡(approximateNash equilibrium) 。對於基於數據庫的電視頻譜(white-space spectrum) 無線AP(access point)網絡，我們運用博弈理論方法為分佈式AP 信道選擇問題以及分佈式次級用戶AP 連接問題建立理論模型。我們證明了分佈式AP信道選擇博奔以及分佈式次級用戶AP 連接博弈屬於勢博弈(potential game) 的範疇。基於勢博莽的有限改進性質(finite improvement property) ，我們設計了分佈式算法能夠有效地收斂到納什均衡。 / Dynamic spectrum sharing enables unlicensed secondary wireless users to opportunistically share the spectrum with licensed primary users, and thus is envisioned as a promising solution to address the spectrum under-utilization problem. This thesis explores the intelligence of secondary users for achieving efficient distributed spectrum sharing. We consider two types of intelligences: social intelligence and individual intelligence. / For the social intelligence, secondary users share the spectrum collaboratively based on social interactions. Inspired by the recommendation system in the electronic commerce industry, we propose a recommendation-based social spectrum sharing mechanism, where secondary users collaboratively recommend "good" channels to each other and access accordingly. We devise an adaptive channel recommendation algorithm based on Markov decision process, which achieves a good system communication performance. We then propose an imitation-based social spectrum sharing mechanism, where each secondary user estimates its expected throughput based on local observations, and imitates another neighboring user’s channel selection if neighbor’s estimated throughput is higher. We show that the mechanism can converge to an imitation equilibrium. When the number of users is large, the convergent imitation equilibrium corresponds to a Nash equilibrium, which is a mutually satisfactory spectrum sharing solution. / For the individual intelligence, secondary users share the spectrum competitively based on strategic interactions. To formulate the competitive spectrum sharing with spatial reuse, we propose a framework of spatial spectrum access game on general directed interference graphs. We investigate the impact of the underlying interference graph structure on the existence of a Nash equilibrium. We also design a distributed learning algorithm based on local observations that can converge to an approximate Nash equilibrium for any spatial spectrum access games. We then apply the game theoretic approach for modeling the distributed channel selection problem among the APs and distributed AP association problem among the secondary users in database-assisted white-space AP networks. We show that both the distributed AP channel selection game and the distributed AP association game are potential games. We then design distributed algorithms for achieving Nash equilibria by utilizing the finite improvement property of potential game. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Chen, Xu. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 180-188). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation and Overview --- p.1 / Chapter 1.2 --- Thesis Outline --- p.5 / Chapter I --- Social Intelligence For Distributed Spectrum Sharing --- p.7 / Chapter 2 --- Recommendation-based Social Spectrum Sharing --- p.8 / Chapter 2.1 --- Introduction --- p.8 / Chapter 2.2 --- System Model --- p.12 / Chapter 2.3 --- Introduction To Channel Recommendation --- p.13 / Chapter 2.3.1 --- Review of Static Channel Recommendation --- p.14 / Chapter 2.3.2 --- Motivations For Adaptive Channel Recommendation --- p.16 / Chapter 2.4 --- Adaptive Channel Recommendation With Channel Homogeneity --- p.18 / Chapter 2.4.1 --- MDP Formulation For Adaptive Channel Recommendation --- p.19 / Chapter 2.4.2 --- Existence of Optimal Stationary Policy --- p.21 / Chapter 2.5 --- Model Reference Adaptive Search For Optimal Spectrum Access Policy --- p.22 / Chapter 2.5.1 --- Model Reference Adaptive Search Method --- p.23 / Chapter 2.5.2 --- Model Reference Adaptive Search For Optimal Spectrum Access Policy --- p.24 / Chapter 2.5.3 --- Convergence of Model Reference Adaptive Search --- p.29 / Chapter 2.6 --- Adaptive Channel Recommendation With Channel Heterogeneity --- p.30 / Chapter 2.7 --- Numerical Results --- p.33 / Chapter 2.7.1 --- Simulation Setup --- p.33 / Chapter 2.7.2 --- Homogeneous Channel Recommendation --- p.34 / Chapter 2.7.3 --- Heterogenous Channel Recommendation --- p.35 / Chapter 2.8 --- Chapter Summary --- p.38 / Chapter 2.9 --- Appendix --- p.39 / Chapter 2.9.1 --- Proof of Lemma 2.1 --- p.39 / Chapter 2.9.2 --- Derivation of Transition Probability --- p.40 / Chapter 2.9.3 --- Proof of Theorem 2.1 --- p.41 / Chapter 2.9.4 --- Proof of Theorem 2.2 --- p.42 / Chapter 2.9.5 --- Proof of Theorem 2.3 --- p.47 / Chapter 2.9.6 --- Proof of Theorem 2.4 --- p.50 / Chapter 3 --- Imitation-based Social Spectrum Sharing --- p.52 / Chapter 3.1 --- Introduction --- p.52 / Chapter 3.2 --- Spectrum Sharing System Model --- p.55 / Chapter 3.3 --- Imitative Spectrum Access Mechanism --- p.58 / Chapter 3.3.1 --- Expected Throughput Estimation --- p.59 / Chapter 3.3.2 --- Information Sharing Graph --- p.63 / Chapter 3.3.3 --- Imitative Spectrum Access --- p.63 / Chapter 3.4 --- Convergence of Imitative Spectrum Access --- p.65 / Chapter 3.4.1 --- Cluster-based Representation of Information Sharing Graph --- p.65 / Chapter 3.4.2 --- Dynamics of Imitative Spectrum Access --- p.67 / Chapter 3.4.3 --- Convergence of Imitative Spectrum Access --- p.71 / Chapter 3.5 --- Imitative Spectrum Access with Innovation --- p.73 / Chapter 3.6 --- Imitative Spectrum Access With User Heterogeneity --- p.75 / Chapter 3.7 --- Simulation Results --- p.77 / Chapter 3.7.1 --- Large User Population --- p.78 / Chapter 3.7.2 --- Small User Population --- p.82 / Chapter 3.7.3 --- Markovian Channel Environment --- p.85 / Chapter 3.7.4 --- Imitative Spectrum Access With User Heterogeneity --- p.88 / Chapter 3.8 --- Chapter Summary --- p.88 / Chapter 3.9 --- Appendix --- p.89 / Chapter 3.9.1 --- Proof of Theorem 3.1 --- p.89 / Chapter 3.9.2 --- Proof of Theorem 3.2 --- p.91 / Chapter II --- Individual Intelligence For Distributed Spectrum Sharing --- p.93 / Chapter 4 --- Spatial Spectrum Access Game --- p.94 / Chapter 4.1 --- Introduction --- p.94 / Chapter 4.2 --- System Model --- p.97 / Chapter 4.3 --- Spatial Spectrum Access Game --- p.101 / Chapter 4.4 --- Existence of Nash Equilibria --- p.102 / Chapter 4.4.1 --- Existence of Pure Nash Equilibria on Directed Interference Graphs --- p.103 / Chapter 4.4.2 --- Existence of Pure Nash Equilibria on Undirected Interference Graphs --- p.108 / Chapter 4.5 --- Distributed Learning For Spatial Spectrum Access --- p.113 / Chapter 4.5.1 --- Expected Throughput Estimation --- p.114 / Chapter 4.5.2 --- Distributed Learning Algorithm --- p.115 / Chapter 4.5.3 --- Convergence of Distributed Learning Algorithm --- p.117 / Chapter 4.6 --- Numerical Results --- p.121 / Chapter 4.7 --- Chapter Summary --- p.126 / Chapter 4.8 --- Appendix --- p.127 / Chapter 4.8.1 --- Proof of Theorem 4.2 --- p.127 / Chapter 4.8.2 --- Proof of Theorem 4.3 --- p.129 / Chapter 4.8.3 --- Proof of Lemma 4.4 --- p.131 / Chapter 4.8.4 --- Proof of Lemma 4.5 --- p.133 / Chapter 4.8.5 --- Proof of Theorem 4.5 --- p.136 / Chapter 4.8.6 --- Proof of Theorem 4.6 --- p.139 / Chapter 5 --- Distributed AP Channel Selection Game --- p.141 / Chapter 5.1 --- Introduction --- p.141 / Chapter 5.2 --- Distributed AP Channel Selection --- p.144 / Chapter 5.2.1 --- Problem Formulation --- p.144 / Chapter 5.2.2 --- Distributed AP Channel Selection Game --- p.146 / Chapter 5.3 --- Distributed AP Channel Selection Algorithms --- p.149 / Chapter 5.3.1 --- Distributed AP Channel Selection Algorithm With Information Exchange --- p.149 / Chapter 5.3.2 --- Distributed AP Channel Selection Algorithm Without Information Exchange --- p.151 / Chapter 5.4 --- Numerical Results --- p.157 / Chapter 5.4.1 --- Distributed AP Channel Selection With Information Exchange --- p.157 / Chapter 5.4.2 --- Distributed AP Channel Selection Without Information Exchange --- p.159 / Chapter 5.5 --- Chapter Summary --- p.161 / Chapter 5.6 --- Appendix --- p.162 / Chapter 5.6.1 --- Proof of Theorem 5.2 --- p.162 / Chapter 6 --- Distributed AP Association Game --- p.165 / Chapter 6.1 --- Introduction --- p.165 / Chapter 6.2 --- Distributed AP Association --- p.166 / Chapter 6.2.1 --- Channel Contention Within an AP --- p.167 / Chapter 6.2.2 --- Distributed AP Association Game --- p.168 / Chapter 6.2.3 --- Distributed AP Association Algorithm --- p.170 / Chapter 6.3 --- Numerical Results --- p.172 / Chapter 6.4 --- Chapter Summary --- p.175 / Chapter 7 --- Conclusions and Future Work --- p.176 / Bibliography --- p.180