In this thesis we study several resource management problems in two classes of wireless networks. The thesis is in two parts, the first being concerned with game theoretic approaches for cellular networks, and the second with control theoretic approaches for mobile opportunistic networks. In Part I of the thesis, we first investigate optimal association and power control for the uplink of multichannel multicell cellular networks, in which each channel is used by exactly one base station (BS) (i.e., cell). Users have minimum signal to interference ratio(SINR) requirements and associate with BSs where least transmission powers are required. We formulate the problem as a non-cooperative game among users. We propose a distributed association and power update algorithm, and show its convergence to a Nash equilibrium of the game. We consider network models with discrete mobiles(yielding an atomic congestion game),as well as a continuum of mobiles(yielding a population game). We find that the equilibria need not be Pareto efficient, nor need they be system optimal. To address the lack of system optimality, we propose pricing mechanisms. We show that these prices weakly enforce system optimality in general, and strongly enforce it in special settings. We also show that these mechanisms can be implemented in distributed fashions. Next, we consider the hierarchical problems of user association and BS placement, where BSs may belong to the same(or, cooperating) or to competing service providers. Users transmit with constant power, and associate with base stations that yield better SINRs. We formulate the association problem as a game among users; it determines the cell corresponding to each BS. Some intriguing observations we report are:(i)displacing a BS a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction;(ii)A cell corresponding to a BS may be the union of disconnected sub-cells. We then study the problem of the placement of BSs so as to maximize service providers’ revenues. The service providers need to take into account the mobiles’ behavior that will be induced by the placement decisions. We consider the cases of single frequency band and disjoint frequency bands of operation. We also consider the networks in which BSs employ successive interference cancellation(SIC) decoding. We observe that the BS locations are closer to each other in the competitive case than in the cooperative case, in all scenarios considered. Finally, we study cooperation among cellular service providers. We consider networks in which communications involving different BSs do not interfere. If service providers jointly deploy and pool their resources, such as spectrum and BSs, and agree to serve each others’ customers, their aggregate payoff substantially increases. The potential of such cooperation can, however ,be realized only if the service providers intelligently determine who they would cooperate with, how they would deploy and share their resources, and how they would share the aggregate payoff. We first assume that the service providers can arbitrarily share the aggregate payoff. A rational basis for payoff sharing is imperative for the stability of the coalitions. We study cooperation using the theory of transferable payoff coalitional games. We show that the optimum cooperation strategy, which involves the acquisition of channels, and deployment and allocation of BSs to customers, is the solution of a concave or an integer optimization problem. We then show that the grand coalition is stable, i.e., if all the service providers cooperate, there is an operating point offering each service provider a share that eliminates the possibility of a subset of service providers splitting from the grand coalition; this operating point also maximizes the service providers’ aggregate payoff. These stabilizing payoff shares are computed by solving the dual of the above optimization problem. Moreover, the optimal cooperation strategy and the stabilizing payoff shares can be obtained in polynomial time using distributed computations and limited exchange of confidential information among the service providers. We then extend the analysis to the scenario where service providers may not be able to share their payoffs. We now model cooperation as a nontransferable payoff coalitional game. We again show that there exists a cooperation strategy that leaves no incentive for any subset of service providers to split from the grand coalition. To compute this cooperation strategy and the corresponding payoffs, we relate this game and its core to an exchange market and its equilibrium. Finally, we extend the formulations and the results to the case when customers are also decision makers in coalition formation. In Part II of this thesis, we consider the problem of optimal message forwarding in mobile opportunistic wireless networks. A message originates at a node(source), and has to be delivered to another node (destination). In the network, there are several other nodes that can assist in relaying the message at the expense of additional transmission energies. We study the trade-off between delivery delay and energy consumption. First, we consider mobile opportunistic networks employing two-hop relaying. Because of the intermittent connectivity, the source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. We also discuss a few other related open loop policies. Finally, we investigate the case where a message has to be delivered to several destinations, but we are concerned with delay until a certain fraction of them receive the message. The network employs epidemic relaying. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain, and derive the optimal forwarding policy. As observed earlier, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we then obtain an ODE(i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal deterministic policy. We evaluate the performance of this policy over finite networks, and demonstrate that this policy performs close to the optimal closed loop policy. We also briefly discuss the case where message forwarding is accomplished via two-hop relaying.

Multiuser and cooperative orthogonal frequency division multiplexing(OFDM) systems are being actively researched and adopted in wireless standards, owing to their advantages of robustness to multipath fading, modularity, and ability to achieve high data rates. In OFDM based systems, perfect frequency and timing synchronization is essential to maintain orthogonality among the subcarriers at the receiver. In multiuser OFDM on the uplink, timing offsets (TOs) and/or carrier frequency offsets (CFOs) of different users, caused due to path delay differences between different users, Doppler and/or poor oscillator alignment, can destroy orthogonality among subcarriers at the receiver. This results in multiuser interference (MUI)and consequent performance degradation. In this thesis, we are concerned with the analysis and mitigation of the effect of large CFOs and TOs in multiuser OFDM systems, including uplink orthogonal frequency division multiple access (OFDMA),uplink single-carrier frequency division multiple access(SC-FDMA), and cooperative OFDM. Uplink OFDMA: In the first part of this thesis, we analytically quantify the effect of large CFOs and TOs on the signal-to-interference plus noise ratio(SINR) and uncoded bit error rate(BER) performance of uplink OFDMA on Rayleigh and Rician fading channels, and show analytical results to closely match with simulation results. Such an SINR/BER analysis for uplink OFDMA in the presence of both large CFOs as well as TOs has not been reported before. We also propose interference cancelling(IC) receivers to mitigate the performance degradation caused due to large CFOs and TOs of different users. SC-FDMA versus OFDMA: An issue with uplink OFDMA is its high peak-to-average power ratio(PAPR).Uplink SC-FDMA is proposed in the standards as a good low-PAPR alternative to uplink OFDMA; e.g., SC-FDMA has been adopted in the uplink of 3GPP LTE. A comparative investigation of uplink SC-FDMA and OFDMA from a sensitivity to large CFOs and TOs view point has not been reported in the literature. Consequently, in the second part of the thesis, we carry out a comparative study of the sensitivity of SC-FDMA and OFDMA schemes to large CFOs and TOs of different users on the uplink. Our results show that while SC-FDMA achieves better performance due to its inherent frequency diversity advantage compared to OFDMA in the case of perfect synchronization, its performance can get worse than that of OFDMA in the presence of large CFOs and TOs. We further show that use of low-complexity multistage IC techniques, with the knowledge of CFOs and TOs of different users at the receiver, can restore the performance advantage of SC-FDMA over OFDMA. Cooperative OFDM: Cooperative OFDM is becoming popular because of its ability to provide spatial diversity in systems where each node has only one antenna. In most studies on cooperative communications, perfect time synchronization among cooperating nodes is assumed. This implies that the transmissions from different cooperating nodes reach the destination receiver in orthogonal time slots. In practice, however, due to imperfect time synchronization, orthogonality among different nodes’ signals at the destination receiver can be lost, causing inter-symbol interference(ISI).In the third part of the thesis, we investigate cooperative OFDM communications using amplify-and-forward(AF) protocol at the relay, in the presence of imperfect timing synchronization. We derive analytical expressions for the ISI as function of timing offset for cooperative OFDM with AF protocol, and propose an IC receiver to mitigate the effects of timing offset induced ISI.

Η παρούσα διπλωματική εργασία έγινε στα πλαίσια του Προγράμματος Μεταπτυχιακών Σπουδών Ηλεκτρονικής και Υπολογιστών, στο Τμήμα Φυσικής του Πανεπιστημίου Πατρών. Αντικείμενό της αποτελεί η μελέτη του φυσικού επιπέδου συστημάτων κινητής τηλεφωνίας τρίτης γενιάς και η εξομοίωση χαρακτηριστικού καναλιού του φυσικού επιπέδου σύμφωνα με την παγκόσμια προτυποποίηση 3GPP. Στο πρώτο κεφάλαιο γίνεται ιστορική ανασκόπηση των συστημάτων προηγούμενων γενεών. Αναφέρονται βασικά προβλήματα που πρέπει να αντιμετωπίσει ένα τηλεπικοινωνιακό σύστημα καθώς και η βασική δομή των κυψελοειδών συστημάτων. Γίνεται εισαγωγή στα συστήματα τρίτης γενιάς ως προς τις απαιτήσεις, τις υπηρεσίες που προσφέρουν, την προτυποποίηση και την αρχιτεκτονική τους. Στο δεύτερο κεφάλαιο μελετώνται οι τρόποι πολλαπλής πρόσβασης με ιδιαίτερη έμφαση στην προσπέλαση με διαίρεση κωδικών. Αναλύονται τα συστήματα διάχυσης φάσματος. Γίνεται εκτενής αναφορά και υλοποίηση προγραμμάτων για τις ψευδοτυχαίες ακολουθίες και τις ακολουθίες Gold. Στο τρίτο κεφάλαιο μελετάται η δομή δικτύων επικοινωνίας κατά το μοντέλο OSI. Αναφέρονται τα επίπεδα των τηλεπικοινωνιακών συστημάτων με διεξοδική μελέτη του φυσικού επιπέδου και στις διεπαφές που χρησιμοποιεί για επικοινωνία καθώς και στις υπηρεσίες που προσφέρει. Αναλύεται η δομή όλων των φυσικών καναλιών και εξομοιώνεται η διαδικασία ενθυλάκωσης του καναλιού PRACH. Στο τέταρτο κεφάλαιο αναλύονται οι κώδικες διάχυσης των φυσικών καναλιών ανερχόμενης ζεύξης καθώς και η διαδικασία διάχυσης τους. Δημιουργούνται προγράμματα που παράγουν αυτούς τους κώδικες και γίνεται εξομοίωση της διάχυσης και της αποδιάχυσης του PRACH καναλιού. Στο πέμπτο κεφάλαιο αναφέρεται η διαδικασία κωδικοποίησης πηγής και μελετάται η PSK διαμόρφωση και αποδιαμόρφωση που χρησιμοποιούν τα συστήματα τρίτης γενιάς. Υλοποιούνται προγράμματα που εξομοιώνουν τη συνολική διαδικασία σε ενθόρυβο κανάλι AWGN μελετώντας την επίδραση του θορύβου σε μεταδιδόμενο σήμα. Όλες οι εξομοιώσεις υλοποιήθηκαν με το πρόγραμμα Matlab 7.1. / This master thesis is a part of the post-graduate course of the Physics department of the University of Patras, on Electronics and Computers. Its main objective is the study of the physical layer of 3rd generation telecommunication systems and the simulation of a particular channel, in accordance to 3GPP specifications. In the first chapter we review telecommunication systems of previous generations. We also refer to major problems that need to be dealt with and also the basic structure of cellular networks. 3rd generation telecommunication systems, their requirements, offered services, standardisation and architecture are all introduced. In the second chapter we study multiple access methods, emphasising CDMA methods. Moreover, spread spectrum systems are analysed. Finally we refer to pseudorandom and Gold sequences. Programs are created which generate these sequences. In the third chapter we look into the structure of communication networks according to the OSI model. The layers of telecommunication systems are mentioned, laying emphasis on the physical layer, the interfaces used for communication as well as the offered services. We report all physical channels and we simulate the encapsulation of the PRACH channel. In the fourth chapter we analyse the spreading and scrambling codes referring to the uplink channels. Next we point out the code allocation process. Programs are created which generate these spreading and scrambling codes and we finally simulate the spreading and de-spreading process of the PRACH channel. In the fifth chapter we outline the source coding process using PCM, and we study PSK modulation and demodulation which are used by 3rd generation telecommunication systems. We create programs that simulate the whole procedure in a noisy channel, and we study the effect of AWGN. The programs were created and the simulations were run using Matlab version 7.1.

This thesis treats of QoS (Quality of Service) in UMTS system. The term quality of service is frequently used, recently, however not only in computer networks, but also more and more in mobile networks also. Present system of 2nd generation (2G) GSM enables only limited exploitation of QoS function. System UMTS is a system of 3rd generation (3G) already and contains quality of service in greater measure which is ensured with number of algorithms and functions. Individual QoS functions enable effective utilization of radio interface, support maintenance of planned coverage and offer high spectral efficiency. Functions that cater to quality of service are called RRM functions (Radio Resource Management). There exist five basic functions in UMTS system that are Admission control (AC), Power control (PC), Load control (LC), Handover control (HC) and Packet scheduler (PS). These functions are responsible for control of network access, control of power, control of network load, control of handover and packet (bit rate) scheduling. Last three functions are usually collectively designated as Congestion control, control of network overload. UMTS layer model, differentiation of services, traffic classes and 3GPP concept are also discussed. In thesis the attention is piad to Admission control algorithm – control of network access – in the uplink direction and to different ways of load (in the cell) modeling. Individual approaches are simulated in MATLAB. A possibility of using algorithm in the real system is discussed in conclusion.