An analytical model for CDMA downlink rate optimization taking into account uplink coverage restriction

This paper models and analyzes downlink and uplink power assignment in Code Division Multiple Access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron-Frobenius eigenvalue of that matrix, which provides a quick assessment of the feasibility of the power assignment for each distribution of calls over the segments. Our results allow for a fast evaluation of outage and blocking probabilities. The result also enables a quick evaluation of feasibility that may be used for capacity allocation. Our combined downlink and uplink feasibility model is applied to determine maximal system throughput in terms of downlink rates. \u

Alocação de recursos para sistemas móveis multi-utilizador e multi-antena

Doutoramento em Engenharia ElectrotécnicaThe thesis addresses the sum rate or spectral e ciency maximization problem in cellular systems with two main components, multiple antennas and multiple users. In order to solve such a problem, several resource allocation techniques are studied and developed for di erent cellular scenarios. The antennas at the transmitters are arranged in several con gurations, i.e., co-located or distributed and for such arrangements di erent levels of coordination and cooperation between transmitters are investigated. Accounting for more receiver antennas than transmitter antennas implies that system optimization must select the best transmitter-receiver match (combinatorial problem) which can be solved with di erent degrees of cooperation between transmitters. The system models studied can be classi ed either as interference limited or as power limited systems. In interference limited systems the resource allocation is carried out independently by each transmitter which yield power leakage to unintended receivers. For this kind of systems, the access network using distributed antenna architectures is examined. The properties of distributed antenna in cellular systems as well as the gains they provide in terms of frequency reuse and throughput are assessed. Accounting for multiple user scenarios, several techniques and algorithms for transmitter-receiver assignment, power allocation, and rate allocation are developed in order to maximize the spectral e ciency. In power limited systems the transmitters jointly allocate resources among transmit and receive antennas. The transmitters are equipped with multiple antennas and signal processing is implemented in order to suppress inter-user interference. Single-cell and multi-cell systems are studied and the problem of sum rate maximization is tackled by decoupling the user selection and the resource allocation (power and precoding) processes. The user selection is a function of the type of precoding technique that is implemented and the level of information that can be processed at the transmitter. The developed user selection algorithms exploit information provided by novel channel metrics which establish the spatial compatibility between users. Each metric provides a di erent trade-o between the accuracy to identify compatible users, and the complexity required to compute it. Numerical simulations are used to assess the performance of the proposed user selection techniques (metrics and algorithms) whose performance are compared to state-of-the-art techniques.Esta tese descreve o problema da maximização da taxa de transmissão ou e ciência espectral em sistemas moveis tomando em atenção duas características fundamentais destes, o número de antenas e utilizadores. A fim de resolver este tipo de problema, várias técnicas de alocação de recursos foram estudadas e propostas para diferentes cenários. As antenas nos transmissores estão organizadas em diferentes configurações, podendo ser localizadas ou distribuídas e para estes esquemas, diferentes níveis de cooperação e coordenação entre transmissores foram investigados. Assumindo mais antenas receptoras do que antenas transmissoras, implica que a otimização do sistema seleccione as melhores combinações de transmissor-receptor (problema combinatório), o que pode ser concretizado usando diferentes graus de cooperação entre transmissores. Os modelos de sistemas estudados, podem ser classificados como sistemas limitados por interferência ou sistemas limitados por potência. Em sistemas limitados por interferência a alocação de recursos e feita independentemente para cada transmissor o que resulta em perda de energia para os receptores não tomados em consideração. Para este tipo de sistemas, e considerado o caso em que a rede de acesso e constituída por antenas distribuídas. Os ganhos obtidos devido ao uso de antenas distribuídas, quer em termos do planeamento de frequências quer da maximização da taxa de transmissão são considerados. Assumindo esquemas multi-utilizador, várias técnicas e algoritmos de transmissão-recepção, alocação de potência e de taxa de transmissão foram desenvolvidos para maximizar a e ciência espectral. Para sistemas limitados em potência os transmissores alocam os recursos quer de antenas de transmissão quer de recepção conjuntamente. Os transmissores estão equipados com várias antenas e o processamento de sinal e implementado de modo a eliminar a interferência entre utilizadores. Sistemas de célula única e de múltiplas células foram estudados. Para estes foi considerado o problema da maximização de taxa de transmissão o qual foi resolvido heuristicamente, através do desacoplamento do problema em duas partes, uma onde se efectua a seleção de utilizadores e outra onde se considera a alocação de recursos. A seleção de utilizadores e feita em função do tipo de técnicas de pré-codificação implementadas e do nível de informação que o transmissor possui. Os algoritmos de seleção de utilizadores desenvolvidos verificam a compatibilidade espacial entre utilizadores, usando para tal métricas propostas. Cada uma das métricas oferece um trade-off diferente entre a precisão para identificar um utilizador compatível e a complexidade necessária para a implementar. Foram usadas simulações numéricas para avaliar a performance das técnicas de seleção de utilizadores propostas (métricas e algoritmos), performance que foi comparada com as técnicas mais inovadoras

Game Theoretic Models for Power Control in Wireless Networks

Τα τελευταία χρόνια, η τεχνολογία των κινητών επικοινωνιών έχει εξελιχθεί ραγδαία εξαιτίας των αυξανόμενων απαιτήσεων των χρηστών, όπως είναι η πρόσβαση σε υπηρεσίες του Διαδικτύου μέσω των ασύρματων έξυπνων κινητών συσκευών καθώς και οι απαιτήσεις σε καλύτερη ποιότητα στις προσφερόμενες υπηρεσίες. Σήμερα, οι συσκεύες αυτές χρησιμοποιούν την τέταρτη γενιά δικτύων (4Gή LTE) καθώς αντικαθιστάτην τρίτη γενιά δικτύων (3G) και προσφέρει στους χρήστες βελτιωμένες υπηρεσίες με υψηλότερες ταχύτητες. Οι ασύρματες έξυπνες κινητές συσκευές (smartphones) έχουν μεγάλη ζήτηση στην αγορά, για το λόγο αυτό γίνεται προσπάθεια να εξελιγχθούν σε επίπεδο ενεργειακής κατανάλωσης, ώστε ο χρήστης να μην χρειάζεται να επαναφορτίζει τη συσκευή του σε τακτά χρονικά διαστήματα. Η θεωρία παιγνίων παρέχει πολύτιμα μαθηματικά εργαλεία όπου μπορούν να χρησιμοποιηθούν για την επίλυση των διαφόρων προβλημάτων που αντιμετώπιζουν τα ασύρματα δίκτυα. Στην παρούσα διπλωματική εργασία μελετάτε το πρόβλημα του ελέγχου ισχύος εκπομπής (powercontrol). Συγκεκριμένα, μελετάμε παιγνιοθεωρητικά μοντέλα για έλεγχο ισχύος εκπομπής σε ασύρματα δίκτυα (CDMA& LTE). Η μελέτη μας επικεντρώνεται στα μη συνεργατικά παίγνια και υποθέτουμε ότι οι χρήστες του δικτύου (αποστολείς, παραλείπτες) είναι εγωιστές και ορθολογιστές. Στη συνέχεια, εισάγουμε αλγορίθμους μάθησης, regretlearningalgorithms, καθώς και την σύνδεση τους με την θεωρία παιγνίων. Τέλος, ερευνάμε τις διάφορες regretlearningτεχνικές εφαρμόζοντάς τες στο πρόβλημα του powercontrolστα ασύρματα δίκτυα επόμενης γενιάς.In recent years, the technology of mobile communications has evolved rapidly due to increasing requirements, such as access to Internet services via mobile phones and requirements better quality services. Nowadays, the devices use the Long Term Evolution (LTE), which called also as 4G networks. The fourth generation (4G) networks replace the third networks generation (3G) and offer to users improved services at higher speeds. Mobile devices to access the Internet, such as smartphones, tablet PCs and netbooks are in high demand in the market for it is an effort to develop in energy consumption level, that the user does not need recharge the device at regular time intervals. Game theory provides valuable mathematical tools that can be used to solve problems of wireless communication networks and can be applied to multiple layers of wireless networks. In this thesis, we study power control issue and consider it at the physical layer of wireless networks. Specifically, we study game theoretic models for power control in wireless communication networks (CDMA & LTE). In the game theory, we have focused in the non-cooperative power control games and assumed that both transmitters and receivers are selfish and rational. In addition, we insert regret learning techniques and their connection with the game theory. Finally, we investigate the regret learning techniques applied to the problem of power control in the next generation networks

Stochastic Signal Processing and Power Control for Wireless Communication Systems

This dissertation is concerned with dynamical modeling, estimation and identification of wireless channels from received signal measurements. Optimal power control algorithms, mobile location and velocity estimation methods are developed based on the proposed models. The ultimate performance limits of any communication system are determined by the channel it operates in. In this dissertation, we propose new stochastic wireless channel models which capture both the space and time variations of wireless systems. The proposed channel models are based on stochastic differential equations (SDEs) driven by Brownian motions. These models are more realistic than the time invariant models encountered in the literature which do not capture and track the time varying characteristics of the propagation environment. The statistics of the proposed models are shown to be time varying, and converge in steady state to their static counterparts. Cellular and ad hoc wireless channel models are developed. In urban propagation environment, the parameters of the channel models can be determined from approximating the band-limited Doppler power spectral density (DPSD) by rational transfer functions. However, since the DPSD is not available on-line, a filterbased expectation maximization algorithm and Kalman filter to estimate the channel parameters and states, respectively, are proposed. The algorithm is recursive allowing the inphase and quadrature components and parameters to be estimated on-line from received signal measurements. The algorithms are tested using experimental data, and the results demonstrate the method’s viability for both cellular and ad hoc networks. Power control increases system capacity and quality of communications, and reduces battery power consumption. A stochastic power control algorithm is developed using the so-called predictable power control strategies. An iterative distributed algorithm is then deduced using stochastic approximations. The latter only requires each mobile to know its received signal to interference ratio at the receiver

An Optimization Theoretical Framework for Resource Allocation over Wireless Networks

With the advancement of wireless technologies, wireless networking has become ubiquitous owing to the great demand of pervasive mobile applications. Some fundamental challenges exist for the next generation wireless network design such as time varying nature of wireless channels, co-channel interferences, provisioning of heterogeneous type of services, etc. So how to overcome these difficulties and improve the system performance have become an important research topic. Dynamic resource allocation is a general strategy to control the interferences and enhance the performance of wireless networks. The basic idea behind dynamic resource allocation is to utilize the channel more efficiently by sharing the spectrum and reducing interference through optimizing parameters such as the transmitting power, symbol transmission rate, modulation scheme, coding scheme, bandwidth, etc. Moreover, the network performance can be further improved by introducing diversity, such as multiuser, time, frequency, and space diversity. In addition, cross layer approach for resource allocation can provide advantages such as low overhead, more efficiency, and direct end-to-end QoS provision. The designers for next generation wireless networks face the common problem of how to optimize the system objective under the user Quality of Service (QoS) constraint. There is a need of unified but general optimization framework for resource allocation to allow taking into account a diverse set of objective functions with various QoS requirements, while considering all kinds of diversity and cross layer approach. We propose an optimization theoretical framework for resource allocation and apply these ideas to different network situations such as: 1.Centralized resource allocation with fairness constraint 2.Distributed resource allocation using game theory 3.OFDMA resource allocation 4.Cross layer approach On the whole, we develop a universal view of the whole wireless networks from multiple dimensions: time, frequency, space, user, and layers. We develop some schemes to fully utilize the resources. The success of the proposed research will significantly improve the way how to design and analyze resource allocation over wireless networks. In addition, the cross-layer optimization nature of the problem provides an innovative insight into vertical integration of wireless networks

Design considerations in wireless sensor networks

We consider three problems in the design of wireless sensor networks: cross-layer optimization, neighbor discovery, and scheduling as a method of medium access control (MAC). Cross-layer optimization will be important for sensor networks, which typically have only one or two objectives to meet. We consider a sensor network which performs decentralized detection. We devise a method in which local observations by sensors are condensed into a single bit message and forwarded to a sink node which makes a final decision. The method involves unusual interactions between the application, the routing function, and the physical layer. Neighbor discovery is useful in sensor networks whose nodes are immobile, since routing and scheduling algorithms can make good use of neighbor information. We propose an asynchronous neighbor discovery algorithm. The algorithm is probabilistic: each node obtains a list of its neighbors which is possibly incomplete. Performance is analyzed and optimal parameter settings are obtained. Scheduling deserves consideration as a MAC in sensor networks, because MACs based on contention methods waste energy in retransmissions. We state a natural centralized scheduling problem, in which link demands are to be satisfied under signal-to-interference-and-noise-ratio (SINR) constraints, and transmit powers may be varied. We show that solving this minimum length scheduling problem is at least as hard as another problem we define, MAX-SINR-MATCHING, in the sense that if there is no polynomial-time algorithm to solve the latter then there is no polynomial-time algorithm to solve the former. We give evidence that MAX-SINR-MATCHING is a difficult problem. We add several theorems on the SINR model which exploit algebraic structure. The theorems predict what sets of links could be simultaneously activated in a wireless network and depend only on the SINR requirements of the nodes and the worst propagation loss in a network. These theorems apply to all wireless networks which can be described by SINR requirements, not only to sensor networks

Heterogeneous Wireless Networks: An Analysis of Network and Service Level Diversity

Future wireless systems will be a collection of symbiotic and hierarchical networks that address different aspects of communication needs. This architectural heterogeneity constitutes a network level diversity, where wireless domains can benefit from each other's spare resources in terms of bandwidth and energy. The dissertation investigates the network diversity through particularly interesting scenarios that involve capacity-limited multi-hop ad hoc networks and high-bandwidth wired or wireless infrastructures. Heterogeneity and infrastructures not only exist at the level of networking technologies and architectures, but also at the level of available services in each network domain. Efficient discovery of services across the domains and allocation of service points to individual users are beneficial for facilitating the actual communication, supplying survivable services, and better utilizing the network resources. These concepts together define the service level diversity, which is the second topic studied in our dissertation. In this dissertation, we first focus on a large-scale hybrid network, where a relatively resource abundant infrastructure network overlays a multi-hop wireless network. Using a random geometric random graph model and defining appropriate connectivity constraints, we derive the overall transport capacity of this hybrid network. In the sequel, we dwell upon hybrid networks with arbitrary size and topology. We develop a Quality of Service (QoS) based framework to utilize the joint resources of the ad hoc and infrastructure tier with minimal power exposure on other symbiotic networks that operate over the same radio frequency bands. The framework requires a cross-layer approach to adequately satisfy the system objectives and individual user demands. Since the problem is proven to be intractable, we explore sub-optimal but efficient algorithms to solve it by relying on derived performance bounds. In the last part of the dissertation, we shift our attention from network level diversity to service level diversity. After investigating possible resource discovery mechanisms in conjunction with their applicability to multi-hop wireless environments, we present our own solution, namely Distributed Service Discovery Protocol (DSDP). DSDP enables a highly scalable, survivable, and fast resource discovery under a very dynamic network topology. It also provides the necessary architectural and signaling mechanisms to effectively implement resource allocation techniques

Modern Random Access for Satellite Communications

The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its performance analysed. The comparison of both slot-synchronous and asynchronous RA at higher layer, follows. Next, the optimization procedure, for slot-synchronous RA with irregular repetitions, is extended to the Rayleigh block fading channel. Finally, random access with multiple receivers is considered.Comment: PhD Thesis, 196 page