In wireless networks, the exponentially increasing demands for wireless services are encountered by the scarcity of the available radio resources. More bandwidth is required for not only accommodating the increasing number of users, but also to meet the requirements of the new services such as TV on demand, wireless gaming, and mobile Internet. Non-orthogonal multiple access (NOMA) has attracted a great attention recently due to its superior spectral efficiency (SE) over orthogonal multiple access and could play a vital role in improving the capacity of future networks. In particular, power based NOMA multiplexes the users in power domain via superposition coding (SC) and allows them to access the whole spectrum simultaneously while using successive interference cancellation (SIC) at the receiver side for signal detection. Since NOMA exploits the power domain for multiple access, power allocation is vital to achieve superior SE with NOMA. Resource allocation and its optimization are general methods used to further improve the NOMA based networks performance. In this thesis, the resource allocation in the downlink NOMA system is considered and optimized for different objective functions such as the sum rate and the energy efficiency (EE). In addition, the combination of NOMA and multiple antenna is considered using linear and non-linear precoders. In all the considered cases, suboptimal power allocation schemes are proposed and compared to the numerically obtained optimal one. Results confirm that NOMA outperforms OFDMA. It also support the effectiveness of the proposed schemes as compared to the existing ones and to the optimal one. The results also reveal that using multiple antennas with NOMA can significantly enhance the overall performance. Furthermore, a NOMA-multicell scenario is considered to test the proposed schemes under the effect of intercell interference (ICI). The results prove that the proposed methods effective as compared to the optimal one at a much lower complexity.

Designing distributed algorithms for optimizing system-wide performances of large scale communication networks is a challenging task. The key part of this design involves a lot of combinatorial network optimization problems, which are computationally intractable in general and hard to approximate even in a centralized manner. Inspired by the seminal work of Jiang-Walrand, Markov approximation framework was proposed for synthesizing distributed algorithms for general combinatorial network optimization problems. To provide performance guarantees, convergence properties of these distributed algorithms are of significance. / First, we consider instances of the designed Markov chain over resource allocation algorithms. We focus on the convergence issues. We find several examples such that the related convergence results can be applied directly. These examples include optimal path (or tree) selection for wireline networks, optimal neighboring selection for peer-to-peer networks, and optimal channel (or power) assignment for wireless local area networks. / In this thesis, we first review Markov approximation framework and further develop this framework by studying convergence properties of distributed algorithms. These system-wide algorithms consist of the designed Markov chain and resource allocation algorithms. We concentrate on two general scenarios: the designed Markov chain over resource allocation algorithms and resource allocation algorithms over the designed Markov chain. With imprecise measurements of network parameters and without the time-scale separation assumption, we prove convergence to near-optimal solutions for both scenarios under mild conditions. Then we apply Markov approximation framework and associated convergence results to various combinatorial network optimization problems. / Second, we consider instances of resource allocation algorithms over the designed Markov chain. We focus on the system-wide performances. Two instances are investigated: cross-layer optimization for wireless networks with deterministic channel model and wireless networks with network coding. For both instances, guided by Markov approximation framework, we design distributed schemes to achieve maximum utilities. These schemes include primal-dual flow control algorithms, Markov chain based scheduling algorithms, and routing (or network coding) algorithms. Under time-dependent step sizes and update intervals, we show that these distributed schemes converge to the optimal solutions with probability one. Further, under constant step sizes and constant update intervals, we prove that these distributed schemes also converge to a bounded neighborhood of optimal solutions with probability one. These analytical results are validated by numerical results as well. / Shao, Ziyu. / Adviser: Shou Yen Robert Li. / Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 134-140). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Resource allocation in wireless systems is addressed via a flow calculus approach in this thesis. Because of the exponential relationship between transmission rates and powers, the marginal increase in power at higher rate regions is larger. To support the high rate transmissions in the next generation wireless systems and applications, we are motivated to consider simultaneous transmissions of multiple distinct flows. / The first part of this thesis is concerning the resource allocation problems in single-source networks. We illustrate what can really be achieved by using multiple relays in parallel relay networks. Simulation results indicate a large improvement from using a single flow to using two distinct flows. By using two distinct flows, the performance is close to optimal. Then, we discuss the trade-off between power and coding complexity by proposing a combination of time-division and cooperative broadcasting. Since the problem involved is NP-hard, we propose a sub-optimal algorithm with a lower computational complexity. The algorithm has a satisfactory performance in terms of total transmission power compared with other schemes and a lower bound. / The second part discusses the issues in multiple-source networks. We show the superior performance of spreading the information over multiple distinct flows in uplink systems. We also discuss a sub-optimal scheme with a satisfactory tradeoff between power and complexity. Furthermore, we use distributed rate allocation. Then, we focus on the relaying situations with information loss during transmissions. We discuss two cases. The first case involves lossy links, while the second case involves the selfish behaviors of the users. In the first case, retransmissions are employed to recover the lost information. We propose a distributed algorithm in which each user allocates its own transmission rates. Also, we suggest a minimax delay data allocation scheme, which reduces the chance of having a long delay for the data due to loss and recovery. In the second case, we use a game-theoretic approach to analyze the problem. We suggest a pricing game with two parts, namely rate allocation and price-setting. The Nash Equilibrium of this pricing game is proved to be the optimal solution to our problem. / Tam, Wai Pan. / Adviser: Tat-Ming Lok. / Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 175-190). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

One of the key requirements of fifth generation (5G) systems is having a connection to mobile networks without interruption at anytime and anywhere, which is also known as seamless connectivity. Nowadays, fourth generation (4G) systems, Long Term Evolution (LTE) and Long Term Evolution Advanced (LTE-A), are mature enough to provide connectivity to most terrestrial mobile users. However, for airborne mobile users, there is no connection that exists without interruption. According to the regulations, mobile connectivity for aircraft passengers can only be established when the altitude of the aircraft is above 3000 m. Along with demands to have mobile connectivity during a flight and the seamless connectivity requirement of 5G systems, there is a notable interest in providing in-flight wireless services during all phases of a flight. In this thesis, many issues related to the deployment and operation of the onboard systems have been investigated. A measurement and modelling procedure to investigate radio frequency (RF) propagation inside an aircraft is proposed in this thesis. Unlike in existing studies for in-cabin channel characterization, the proposed procedure takes into account the deployment of a multi-cell onboard system. The proposed model is verified through another set of measurements where reference signal received power (RSRP) levels inside the aircraft are measured. The results show that the proposed model closely matches the in-cabin RSRP measurements. Moreover, in order to enforce the distance between a user and an interfering resource, cell sectorization is employed in the multi-cell onboard system deployment. The proposed propagation model is used to find an optimum antenna orientation that minimizes the interference level among the neighbouring evolved nodeBs (eNBs). Once the optimum antenna deployment is obtained, comprehensive downlink performance evaluations of the multi-cell, multi-user onboard LTE-A system is carried out. Techniques that are proposed for LTE-A systems, namely enhanced inter-cell interference coordination (eICIC) and carrier aggregation (CA), are employed in the system analysis. Different numbers of eNBs, antenna mounting positions and scheduling policies are examined. A scheduling algorithm that provides a good tradeoff between fairness and system throughput is proposed. The results show that the downlink performance of the proposed onboard LTE-A system achieves not only 75% of the theoretical limits of the overall system throughput but also fair user data rate performance, irrespective of a passenger's seat location. In order to provide the seamless connectivity requirement of 5G systems, compatibility between the proposed onboard system deployment and the already deployed terrestrial networks is investigated. Simulation based analyses are carried out to investigate power leakage from the onboard systems while the aircraft is in the parked position on the apron. According to the regulations, the onboard system should not increase the noise level of the already deployed terrestrial system by 1 dB. Results show that the proposed onboard communication system can be operated while the aircraft is in the parked position on the apron without exceeding the 1 dB increase in the noise level of the already deployed terrestrial 4G network. Furthermore, handover parameters are obtained for different transmission power levels of both the terrestrial and onboard systems to make the transition from one system to another without interruption while a passenger boards or leaves the aircraft. Simulation and measurement based analyses show that when the RSRP level of the terrestrial system is below -65 dBm around the aircraft, a boarding passenger can be smoothly handed over to the onboard system and vice versa. Moreover, in order to trigger the handover process without interfering with the data transmission, a broadcast control channel (BCCH) power boosting feature is proposed for the in-cabin eNBs. Results show that employing the BCCH power boosting feature helps to trigger the handover process as soon as the passengers step on board the aircraft.

Neste trabalho são investigados problemas de alocação de espetro e potência em redes sem fio de múltiplo acesso e propostas sete soluções distintas para diferentes cenários e topologias que serão enumeradas a seguir. Primeiramente o problema de maximização da eficiência energética em redes cooperativas do tipo multiportadora com múltiplo acesso por divisão de código de sequência direta é abordado e as seguintes soluções são apresentadas: duas abordagens na perspectiva de teoria de jogos, uma utilizando algoritmo de water-filling (1) e outra utilizando o algoritmo distribuído de controle de potência baseado no equilíbrio de Verhulst (2), uma terceira solução também inspirado no último algoritmo citado e na média dos coeficientes de canal das subportadoras do sistema (3); uma abordagem heurística utilizando o algoritmo dos vaga-lumes (4) e outra utilizando a otimização por enxame de partículas (5). Em segundo lugar, foram investigados problemas de otimização em sistemas de múltiplo acesso por divisão ortogonal de frequência com provisão de qualidade de serviço estatística. Nesta segunda topologia dois problemas distintos foram analisados: o primeiro problema de maximização da capacidade efetiva do sistema foi solucionado utilizando o método de decomposição dual de Lagrange (6), o segundo problema cujo objetivo é a maximização da eficiência energética efetiva foi investigado e um solução baseada na combinação do método de Dinkelba e da decomposição dual de Lagrange foi proposta (7). Simulações computacionais foram conduzidas tendo em vista averiguar o desempenho das abordagens propostas e, quando possível, tais resultados numéricos foram comparados àqueles obtidos a partir de algoritmos alternativos existentes na literatura. / This work investigates the spectrum and power allocation problems in wireless multiple access networks and seven dfferent solutions to different scenarios and topologies, which are enumerated as follows. Three distinct solutions are presented to the energy effiency maximization problem in multicarrier direct sequence code division multiple acess cooperative: two game theoretic approaches, one using the iterative water-filling algorithm (1) and another one using the distributed power control algorithm based on Verhulst equilibrium concept (2), and a third solution also based on the last algorithm but considering the average channel power gain (3); an heuristic approach using the firefly algorithm (4) and the particle swarm optimization algorithm (5). In orthogonal frequency division multiple acess networks, optimization problems considering a statistical quality of service metric were analyzed: the first one is the effective capacity maximization which was solved through Lagrange dual decomposition method (6). The second one, in which the objective is to maximize the effective energy effiency was addressed and solution based on the Dinkelba method and further application of Lagrange dual decomposition was developed (7). Simulations were conducted to verify the proposed approaches performance and, whenever possible, the numerical results were compared to previous solution proposed in the literature.

Chen, Jieying. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (p. 58-62). / Abstract in English only. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Literature Review --- p.5 / Chapter 1.3 --- Contributions Of This Thesis --- p.7 / Chapter 1.4 --- Structure Of This Thesis --- p.8 / Chapter 2 --- Problem Formulation --- p.9 / Chapter 2.1 --- The JBAPC Problem --- p.9 / Chapter 2.2 --- The Single-Stage Reformulation --- p.12 / Chapter 3 --- The BARN Algorithm --- p.15 / Chapter 3.1 --- Preliminary Mathematics --- p.15 / Chapter 3.1.1 --- Duality Of The Linear Optimization Problem --- p.15 / Chapter 3.1.2 --- Benders Decomposition --- p.18 / Chapter 3.2 --- Solving The JBAPC Problem Using BARN Algorithm --- p.21 / Chapter 3.3 --- Performance And Convergence --- p.24 / Chapter 3.3.1 --- Global Convergence --- p.26 / Chapter 3.3.2 --- BARN With Error Tolerance --- p.26 / Chapter 3.3.3 --- Trade-off Between Performance And Convergence Time --- p.26 / Chapter 4 --- Accelerating BARN --- p.30 / Chapter 4.1 --- The Relaxed Master Problem --- p.30 / Chapter 4.2 --- The Feasibility Pump Method --- p.32 / Chapter 4.3 --- A-BARN Algorithm For Solving The JBAPC Problem --- p.34 / Chapter 5 --- Computational Results --- p.36 / Chapter 5.1 --- Global Optimality And Convergence --- p.36 / Chapter 5.2 --- Average Convergence Time --- p.37 / Chapter 5.3 --- Trade-off Between Performance And Convergence Time --- p.38 / Chapter 5.4 --- Average Algorithm Performance Of BARN and A-BARN --- p.39 / Chapter 6 --- Discussions --- p.47 / Chapter 6.1 --- Resource Allocation In The Uplink Multi-cell Networks --- p.47 / Chapter 6.2 --- JBAPC Problem In The Uplink Multi-cell Networks --- p.48 / Chapter 7 --- Conclusion --- p.50 / Chapter 7.1 --- Conclusion Of This Thesis --- p.50 / Chapter 7.2 --- Future Work --- p.51 / Chapter A --- The Proof --- p.52 / Chapter A.l --- Proof of Lemma 1 --- p.52 / Chapter A.2 --- Proof of Lemma 3 --- p.55 / Bibliography --- p.58

Neste trabalho são investigados problemas de alocação de espetro e potência em redes sem fio de múltiplo acesso e propostas sete soluções distintas para diferentes cenários e topologias que serão enumeradas a seguir. Primeiramente o problema de maximização da eficiência energética em redes cooperativas do tipo multiportadora com múltiplo acesso por divisão de código de sequência direta é abordado e as seguintes soluções são apresentadas: duas abordagens na perspectiva de teoria de jogos, uma utilizando algoritmo de water-filling (1) e outra utilizando o algoritmo distribuído de controle de potência baseado no equilíbrio de Verhulst (2), uma terceira solução também inspirado no último algoritmo citado e na média dos coeficientes de canal das subportadoras do sistema (3); uma abordagem heurística utilizando o algoritmo dos vaga-lumes (4) e outra utilizando a otimização por enxame de partículas (5). Em segundo lugar, foram investigados problemas de otimização em sistemas de múltiplo acesso por divisão ortogonal de frequência com provisão de qualidade de serviço estatística. Nesta segunda topologia dois problemas distintos foram analisados: o primeiro problema de maximização da capacidade efetiva do sistema foi solucionado utilizando o método de decomposição dual de Lagrange (6), o segundo problema cujo objetivo é a maximização da eficiência energética efetiva foi investigado e um solução baseada na combinação do método de Dinkelba e da decomposição dual de Lagrange foi proposta (7). Simulações computacionais foram conduzidas tendo em vista averiguar o desempenho das abordagens propostas e, quando possível, tais resultados numéricos foram comparados àqueles obtidos a partir de algoritmos alternativos existentes na literatura. / This work investigates the spectrum and power allocation problems in wireless multiple access networks and seven dfferent solutions to different scenarios and topologies, which are enumerated as follows. Three distinct solutions are presented to the energy effiency maximization problem in multicarrier direct sequence code division multiple acess cooperative: two game theoretic approaches, one using the iterative water-filling algorithm (1) and another one using the distributed power control algorithm based on Verhulst equilibrium concept (2), and a third solution also based on the last algorithm but considering the average channel power gain (3); an heuristic approach using the firefly algorithm (4) and the particle swarm optimization algorithm (5). In orthogonal frequency division multiple acess networks, optimization problems considering a statistical quality of service metric were analyzed: the first one is the effective capacity maximization which was solved through Lagrange dual decomposition method (6). The second one, in which the objective is to maximize the effective energy effiency was addressed and solution based on the Dinkelba method and further application of Lagrange dual decomposition was developed (7). Simulations were conducted to verify the proposed approaches performance and, whenever possible, the numerical results were compared to previous solution proposed in the literature.

L'optimisation de l'utilisation des liens satellites est un enjeu majeur pour augmenter la rentabilité des systèmes satellites. L'augmentation de la réutilisation des fréquences est une des approches les plus prometteuses. La réutilisation des fréquences permet de transmettre plus d'informations sur une même fréquence, pour peu que les interférences entre les deux signaux ne soient pas trop importantes. Il est donc capital de contrôler l'impact de ces interférences, que ce soit via l'utilisation de schémas de réutilisation de fréquences, ou encore via des techniques de coordination dynamique des interférences, où la sélection des utilisateurs qui peuvent transmettre sur les mêmes fréquences est faite en prenant les interférences en compte / Optimizing satellite links is a major challenge to increase satellite systems profitability. Increasing the frequency reuse is one of the most promising approaches. Reusing multiple times the same frequency enables to transmit more information on the same frequency, as long as the two or more signals do not generate too high mutual interferences. It is therefore of capital importance to control these interference impacts, be it through the use of frequency reuse scheme or through the use of advanced dynamic interference coordination techniques, where the user selection is done with the knowledge of interference levels.

Resource allocation in control and communication systems constitutes the distribution of (finite) system resources in a way that achieves maximum system functionality and or cost effectiveness. Specific resource allocation problems in subband coding, Discrete Multi-tone modulation based systems and autonomous multi-agent control are addressed in this thesis. In subband coding, the number of bits used (out of a target bit budget) to code a sub- band signal are allocated in a way that minimizes the coding distortion. In Discrete Multi-tone modulation based systems, high bit rate streams are split into several parallel lower rate streams. These individual data streams are transmitted over different subchannels. Given a target bit rate, the goal of resource allocation is to distribute the bits among the different subchannels such that the total transmitted power is minimized. The last problem is achieving stable control of a fleet of autonomous agents by utilizing the available communication resources (such as transmitted Power and bandwidth) as effectively as possible. We present an efficient bit loading algorithm that applies to both subband coding and single-user multicarrier communication system. The goal is to effect an optimal distribution of B bits among N subchannels (subbands) to achieve a minimum transmitted power (distortion error variance) for multicarrier (subband coding) systems. All the algorithms in literature, except a few (which provides a suboptimal solution), have run times that increase with B. By contrast, we provide an algorithm that solves the aforementioned problems exactly and with a complexity (given by O(N log(N)),) which is dependent only on N. Bit loading in multi-user multicarrier systems not only involves the distribution of bit rates across the subchannels but also the assignment of these subchannels to different users. The motivation for studying suboptimal bit allocation is underscored by implicit and explicit claims made in some of the papers which present suboptimal bit loading algorithms, without a formal proof, that the underlying problem is NP-hard. Consequently, for no other reason than the sake of completeness, we present a proof for NP-hardness of the multiuser multicarrier bit loading problem, thereby formally justifying the search for suboptimal solutions. There has been a growing interest in the area of cooperative control of networks of mobile autonomous agents. Applications for such a set up include organization of large sensor networks, air traffic control, achieving and maintaining formations of unmanned vehicles operating under- water, air traffic control etc. As in Abel et al, our goal is to devise control laws that, require minimal information exchange between the agents and minimal knowledge on the part of each agent of the overall formation objective, are fault tolerant, scalable, and easily reconfigurable in the face of the loss or arrival of an agent, and the loss of a communication link. A major drawback of the control law proposed in Abel et al is that it assumes all agents can exchange information at will. This is fine if agents acquire each others state information through straightforward sensing. If however, state information is exchanged through broadcast commu- nication, this assumption is highly unrealistic. By modifying the control law presented in Abel et al, we devise a scheme that allows for a sharing of the resource, which is the communication channel, but also achieves the desired formation stably. Accordingly we modify the control law presented in [23] to be compatible with networks constrained by MAC protocols.

An ecologically based model of forest succession is presented. In the model, trees compete for a share of limited growth resources available from their environment. Competition is reflected by each tree's effect on the resource pool and is not explicitly modeled. Model parameters were fit to field data from subalpine forests of the Rocky Mountains. A technique for estimating model parameters from understory-tolerance rankings and silvical characteristics of each species is also presented. The model's output was consistent with our current understanding of forest dynamics. Emergent properties of the model also mimicked natural processes such as self-thinning, release, and maximum stand basal area as a function of species present and site quality.