The term "green networking" refers to energy-efficient networking technologies and products, while minimizing resource usage as possible. This thesis targets the problem of resource allocation in small cells networks in a green networking context. We develop algorithms for different paradigms. We exploit the framework of coalitional games theory and some stochastic geometric tools as well as the crowding game model. We first study the mobile assignment problem in broadcast transmission where minimal total power consumption is sought. A green-aware approach is followed in our algorithms. We examine the coalitional game aspects of the mobile assignment problem. This game has an incentive to form grand coalition where all players join to the game. By using Bondareva-Shapley theorem, we prove that this coalitional game has a non-empty core which means that the grand coalition is stable. Then, we examine the cost allocation policy for different methods. In a second part, we analyze a significant problem in green networking called switching off base stations in case of cooperating service providers by means of stochastic geometric and coalitional game tools. The coalitional game herein considered is played by service providers who cooperate in switching off base stations. We observed the Nash stability which is a concept in hedonic coalition formation games. We ask the following question: Is there any utility allocation method which could result in a Nash-stable partition? We address this issue in the thesis. We propose the definition of the Nash-stable core which is the set of all possible utility allocation methods resulting in stable partitions obtained according to Nash stability. We finally consider games related to the association of mobiles to an access point. The player is the mobile which has to decide to which access point to connect. We consider the choice between two access points or more, where the access decisions may depend on the number of mobiles connected to each access points. We obtained new results using elementary tools from congestion and crowding games. Last but not least, we extend our work to cooperative transmissions. We formulate the partner selection problem in cooperative relaying based on a matching theoretic approach. Partner selection is described as a special stable roommate problem where each player ranks its partners by some criterion. We adapted Irving's algorithm for determining the partner of each player. We introduced a decentralized version of the Irving's algorithm.

當發生大規模地震或強烈颱風等大型天然災害，其災後72小時為人命搜救之黃金期。由歷來的大型災變中，可知行動通訊系統其實極為脆弱且不可靠，而通訊系統癱瘓將影響救災工作之成效。本論文中探討的應急通訊系統利用倖存之連通基地台和斷訊卻沒有損毀的基地台，以無線電互相連接成一個轉送拓樸以建構臨時性通訊系統，稱為應急蜂巢式行動通訊網路(Contingency Cellular Network，CCN)。 在災難發生後，災區通常有許多須要較高通話需求的關鍵區域，其通話需求遠高於輕度災區，建置CCN時必須優先保障其通訊需求，我們先前之研究所提出的樹狀轉送拓樸其結構較脆弱，若任何一個link斷訊失去轉送功能，則其節點以下的使用者通訊將受到影響，導致任何一個節點對外通訊能力非常脆弱，影響CCN之可用度。為了提升CCN之可用度，我們提出了多路徑的CCN網路拓樸解決方案，在本方案中，每個關鍵區域都有數條對外通訊的連線。 本論文以各基地台通訊範圍內的通訊需求人數與災區毀損程度，作為效益參數，在有限緊急修復資源下，將問題塑模為一個類似K-Maximum Spanning Tree問題的Length Bounded Disjoint K-Path Max-Profit Mesh問題，我們證明它屬於NP-Hard問題，並且提出快速且效能不差之啟發式演算法，可在緊急時建立應急蜂巢式行動網路的多路徑網路拓樸。本文以電腦模擬方式，進行實驗以驗證我們的模型之適切性，並評估多路徑拓樸可提升之CCN可用度，實驗結果可提供使用者依不同的CCN可用度及總救災效益需求，選擇所需之多路徑數量。 / When stricken by a catastrophic natural disaster, the golden 72 hours is very critical to life saving. However, communication systems including cellular networks often crashed due to various causes making big impact to the efficiency of disaster response. Our research proposes the Contingency Cellular Network (CCN) by connecting disconnected base stations together using wireless links to form an overlay Ad Hoc network over a disconnected cellular network. 　　In our previous study, we proposed a tree topology to construct CCN, which is vulnerable since a single link failure may have a big impact to the availability of CCN. This thesis proposes a multi-path topology to enhance the availability of CCN such that the selected critical areas will have redundant communication paths connecting to the core network and thus, have higher resiliency against link failure. We model the CCN Multi-path Network Topology Design problem into a combinatorial problem, called Length Bounded Disjoint K-Path Max-Profit Mesh Problem. We take the degree of emergency and the population of each stricken area as the priority measure as well as the amount of emergency recovery resources as the capacity constraint in the topology computation model. The problem is proven to be NP Hard. Therefore, we designed an efficient heuristic algorithm (HLBDK) to solve the problem when it is needed in urgent. Finally, we evaluated the proposed algorithm by simulation. The simulation results show that the average performance deviation of the proposed heuristic algorithm away from the optimal solutions is smaller than 7% in all cases. A significant improvement in the availability can be obtained by using multi-path topology at a reasonable performance degradation. Our research results provide users a fundamental base to determine their availability requirement at a countable performance degradation.

Cette thèse porte sur l'étude du réseau lacuno-canaliculaire (Lacuno-canalicular Network : LCN) osseux grâce à différentes techniques de microscopie optique. Le LCN correspond à l'empreinte dans la matrice osseuse du réseau ostéocytaire formé de cellules dendritiques (les ostéocytes) interconnectées. Bien qu'il joue un rôle majeur dans la formation, le remodelage et le maintien des propriétés biomécaniques de l'os, les informations sur ce réseau cellulaire dans sa globalité restent limitées. Cela provient notamment de la difficulté à caractériser ce réseau dense et complexeavec une résolution sub-micrométrique sur des échelles allant jusqu'à l'organe entier. Dans cetravail de thèse nous avons cherché à améliorer la caractérisation du LCN en utilisant deux approches : la mise en place d'une méthode d'analyse du LCN à grande échelle à partir dela microscopie confocale d'une part et l'évaluation du potentiel de la microscopienon linéaire pour l'étude du LCN d'autre part.Dans un premier temps nous avons mis au point un protocole allant de la préparation des échantillons jusqu'au traitement des images et à l'analyse des données afin d'optimiser l'imagerie confocale des tissus osseux dans le but d'obtenir une analyse quantitative du réseau à grande échelle. Les résultats préliminaires mettent en évidence une grande variabilité des paramètres du réseau à toutes les échelles révélant la complexité de celui-ci. Cette analyse a été mise en pratique afin d'étudier les variations du LCN à l'échelle d'un fémur entier de souris.Dans un second temps, nous avons évaluer le potentiel de la microscopie optique non linéaire et notamment de la génération de troisième harmonique (THG) pour l'imagerie et l'étude du LCN. Nous avons tout d'abord montré la possibilité de visualiser le LCN, sans marquage fluorescent, grâce à la microscopie THG. A partir de cette preuve de principe nous avons expliqué l'origine des contrastes observés dans l'os par microscopie THG : un signal provenant des porosités et permettant de visualiser le réseau et un signal de fond structuré provenant des interfaces entre les fibrilles de collagène. Nous avons également évaluer les possibilités de la combinaisons de signaux non linéaires, principalement ceux de la THG et de la SHG (génération de seconde harmonique) qui permettent de visualiser simultanément le réseau et la matrice de collagène respectivement. Une corrélation entre la structure du réseau et l'organisation du collagène a pu être établie grâce à la visualisation de ces deux signaux sur de grandes échelles. Enfin des résultats quantitatifs sur le LCN ont pu être obtenus à partir des images THG permettant une étude des effets de la micro-gravité sur la structure de ce réseau. / This thesis focuses on the study of bone lacuno-canalicular network (LCN) using different optical microscopy techniques. The LCN is the porosity network in the bone matrix where the cellular network lie. It is formed of dendritic cells: the osteocytes which are connected to each other. Although it plays a major role in the formation, remodeling and maintenance of biomechanical properties of bone, only little is known about this network as a whole. This can be explain by the difficult characterization of such a dense and complex network with sub-micron resolution and scales up to the entire organ. In this work we have sought to improve the characterization of the LCN using two approaches: the development of a method to analyse the network on large scale using confocal microscopy on one hand, and the assessment of the potential of non linear microscopy technique to study the LCN on the other hand.First, we have developed a protocol from sample preparation to image processing and data analysis to optimize confocal imaging of bone tissue in order to obtain a quantitative large scale analysis of the network. Preliminary results show a wide variation of network parameters at all scales revealing its complexity. This analysis was then used in order to assess changes in the LCN across an entire mice femur.Secondly, we study the potential of the non-linear optical microscopies especially the third harmonic generation (THG) microscopy for imaging and the study of the LCN. Initially, we demonstrated the ability to visualise the LCN without fluorescent labelling using THG microscopy. From this proof of concept we explained the origin of the different ThG microscopy contrasts observed in bone tissue: a signal from the porosities allowing to visualize the network and a structured background signal generated at the interfaces between collagen fibrils. We also assess the possibilities of combinations between different non-linear signals, mainly THG and SHG (second harmonic generation) that can simultaneously image the network and the collagen matrix respectively. A correlation between the network structure and collagen organization has been established using the visualization of these two signals over large scales. Finally quantitative parameters of the LCN were obtained from THG images and applied to study the effects of microgravity on the cellular network structure.

Les nouveaux services de télécommunication accessibles en mobilité entraînent une demande croissante de débit et amènent aux limites de capacités des réseaux actuels. Pour répondre à cette demande, les opérateurs cellulaires déploient de nouvelles technologies et densifient leurs réseaux en ajoutant des petites cellules, où les stations de base sont plus proches des utilisateurs. Compte tenu de la visibilité directe et de la faible hauteur des antennes, le canal de propagation des petites cellules est différent de celui des macro-cellules et les modèles stochastiques de canal existants ne sont plus adaptés. C’est dans ce contexte que se situe cette thèse, qui explore les problématiques de dynamique dans le canal de propagation et dans l’utilisation des ressources radio. Nous proposons dans une première partie de caractériser les dynamiques dans le canal de propagation de petite cellule en milieu extérieur. Cette caractérisation se base sur des prédictions déterministes, où une partie de l’environnement est généré de manière aléatoire afin de procéder à des études statistiques. Pour cela, nous mettons en place une plateforme de simulation, capable de générer des objets statiques, de les déplacer et de les prendre en compte dans des outils de prédiction de propagation adaptés aux petites cellules. Une phase de mesures de l’impact du trafic de véhicules sur la puissance du signal permet de valider les outils de propagation développés dans la plateforme. L’objectif de la deuxième partie de la thèse est d’évaluer l’impact de ces nouvelles topologies sur les performances des réseaux hétérogènes. Nous présentons un modèle hybride de propagation qui prend en compte les variations de signal dues au trafic de véhicules en combinant les approches déterministes et statistiques, pour avoir les avantages de résultats précis et d’un temps de calcul rapide. Ce modèle hybride est utilisé par la suite dans un processus de simulation de réseau cellulaire 3G LTE au niveau système, où nous évaluons l’impact du trafic de véhicules sur le débit maximal, la consommation d’énergie et le respect de la qualité de service. / New services available with modern mobile telecommunication networks lead to a growing demand for better bit rates up to reach the capacity limits of current networks. To face this demand, cellular network operators deploy new technologies and densify their radio access by adding small cells, where the distance between the mobile users and the base stations is decreased. Given the Line of Sight conditions and the low height of base station antennas, the small-cell propagation channel is different from the classical macro-cellular channel and existing stochastic channel models are not suited anymore. In this context, this Ph.D. work proposes to explore challenges on the dynamics of the channel and of radio resource usage. In a first part, we propose to characterize the dynamics of the propagation channel in small-cell outdoor environments. This characterization is based on deterministic predictions, where part of the environment is randomly generated in order to proceed to statistical analysis. We describe a simulation framework able to generate static objects, to move them and to take them into account in propagation prediction tools targeted for small-cell environments. Measurements of the impact of vehicular traffic on received power enable the validation of propagation tools developed in the framework. In the second part of this work, we propose to evaluate the impact of those new topologies on the performance of heterogeneous networks. We present a hybrid propagation model taking into account signal variations due to vehicular traffic by combining deterministic and statistic approaches in order to benefit from both advantages: accurate results and quick simulations. This hybrid model is finally used in a cellular 3G LTE network simulation process where we evaluate the impact of vehicular traffic on maximal throughputs, energy consumption and quality of service.

Abstract The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a number of new network paradigms are proposed in this thesis. First, a new algorithm for efficient relaying topology control is presented to jointly optimize the relaying topology, routing and scheduling resulting in a two dimensional or space time routing protocol. The algorithm is aware of intercell interference (ICI), and requires coordinated action between the cells to jointly choose the relaying topology and scheduling to minimize the system performance degradation due to ICI. This framework is extended to include the optimization of power control. Both conventional and cooperative relaying schemes are considered. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Seeking for a more tractable network model to effectively use context awareness and relying on the latest results on network information theory, we apply a hexagonal tessellation for inner partition of the cell into smaller subcells of radius r. By using only one single topology control parameter (r), we jointly optimize routing, scheduling and power control to obtain the optimum trade-off between throughput, delay and power consumption in multicast MCNs. This model enables high resolution optimization and motivates the further study of network protocols for MCNs. A new concept for route discovery protocols is developed and the trade-off between cooperative diversity and spatial reuse is analyzed by using this model. Finally, a new architecture for MCN is considered where multihop transmissions are performed by a Delay Tolerant Network, and new solutions to enhance the performance of multicast applications for multimedia content delivery are presented. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks. / Tiivistelmä Tiedonsiirron ja tiedonsiirtonopeuksien suuri kasvu sekä tehonkulutuksen pieneneminen tulevien sukupolvien matkapuhelinjärjestelmissä tekevät monihyppyiset matkapuhelinverkot houkutteleviksi vaihtoehdoiksi. Tässä työssä esitetään uusia tiedonsiirtoverkkojen paradigmoja monihyppyisten matkapuhelinverkkojen hyödyntämiseksi. Työssä esitellään uusi algoritmi tehokkaaseen releointitopologian hallintaan, joka optimoi yhtäaikaisesti topologian, reitityksen sekä lähetyshetkien ajoituksen ja mahdollistaa tila-aika-reititysprotokollan toteutuksen. Esitetty algoritmi huomioi solujen keskinäishäiriön ja vaaditulla solujen välisellä koordinoidulla hallinnalla saadaan yhdessä valittua topologia ja ajoitus, jotka minimoivat solujen keskinäisistä häiriöistä johtuvan suorituskyvyn heikentymisen. Myöhemmin tätä viitekehystä on laajennettu lisäämällä siihen tehonsäädön optimointi. Työssä on tutkittu sekä perinteisiä että kooperatiivisia releointimenetelmiä. Lisäksi työssä esitetään uusi geneettinen algoritmi heuristiseksi approksimaatioksi verkon liikenteen muutoksen vaatimaan releointitopologian uudelleen järjestelyyn. Työssä tarkastellaan lisäksi verkkokoodausta ylä- ja alasuuntaan tapahtuvan tiedonsiirron yhdistämiseksi sisällyttämällä se solujen keskinäishäiriön huomioivaan kahdensuuntaiseen releointiin. Etsittäessä paremmin mukautuvaa ja kontekstitietoisuutta hyödyntävää verkkomallia, joka käyttää hyväkseen viimeisimpiä verkkojen informaatioteoreettisia tuloksia, voidaan verkon solut pilkkoa pienempiin kuusikulmaisiin alisoluihin. Käyttämällä ainoastaan näiden alisolujen sädettä r voidaan puolestaan verkon reititys, ajoitus ja tehon säätö optimoida yhtäaikaisesti saavuttaen paras mahdollinen kompromissi verkon läpäisyn, viiveen ja tehonkulutuksen välillä. Kehitetty malli mahdollistaa korkean resoluution optimoinnin ja motivoi uusien verkkoprotokollien kehitystä monihyppyisissä matkapuhelinverkoissa. Tätä mallia käyttäen esitellään myös uusi konsepti reitinetsintäprotokollille sekä analysoidaan kooperatiivisen diversiteetin ja tila-avaruudessa tapahtuvan uudelleenkäytön välistä kompromissiratkaisua. Lopuksi työssä tarkastellaan monihyppyisen matkapuhelinverkon uutta arkkitehtuuria, jossa monihyppylähetykset suoritetaan viivesietoisella verkolla ja esitetään uusia ratkaisuja multimediasisällön monilähetysten tehokkuuden parantamiseksi. Työssä saadut tulokset osoittavat, että ehdotetut algoritmit parantavat järjestelmien suorituskykyä verrattuna aiemmin tiedossa olleisiin tuloksiin. Työn tuloksilla voidaan olettaa myös olevan suuri vaikutus tulevaisuuden matkapuhelinverkkojen analysointiin ja suunnitteluun.

An iterative travel time forecasting scheme, named the Advanced Multilane Prediction based Real-time Fastest Path (AMPRFP) algorithm, is presented in this dissertation. This scheme is derived from the conventional kernel estimator based prediction model by the association of real-time nonlinear impacts that caused by neighboring arcs’ traffic patterns with the historical traffic behaviors. The AMPRFP algorithm is evaluated by prediction of the travel time of congested arcs in the urban area of Jacksonville City. Experiment results illustrate that the proposed scheme is able to significantly reduce both the relative mean error (RME) and the root-mean-squared error (RMSE) of the predicted travel time. To obtain high quality real-time traffic information, which is essential to the performance of the AMPRFP algorithm, a data clean scheme enhanced empirical learning (DCSEEL) algorithm is also introduced. This novel method investigates the correlation between distance and direction in the geometrical map, which is not considered in existing fingerprint localization methods. Specifically, empirical learning methods are applied to minimize the error that exists in the estimated distance. A direction filter is developed to clean joints that have negative influence to the localization accuracy. Synthetic experiments in urban, suburban and rural environments are designed to evaluate the performance of DCSEEL algorithm in determining the cellular probe’s position. The results show that the cellular probe’s localization accuracy can be notably improved by the DCSEEL algorithm. Additionally, a new fast correlation technique for overcoming the time efficiency problem of the existing correlation algorithm based floating car data (FCD) technique is developed. The matching process is transformed into a 1-dimensional (1-D) curve matching problem and the Fast Normalized Cross-Correlation (FNCC) algorithm is introduced to supersede the Pearson product Moment Correlation Co-efficient (PMCC) algorithm in order to achieve the real-time requirement of the FCD method. The fast correlation technique shows a significant improvement in reducing the computational cost without affecting the accuracy of the matching process.

This work deals with a mobile signal propagation in electromagnetic wave form in a real environment of city microcell. The electromagnetic wave passing through the city environment is affected by many kinds of mechanism. It includes especially diffraction along vertical edges of buildings, diffraction across building roofs and buildings or ground refraction. These mechanisms are time variable. If we want to predicate them, we have to use sort of approached model. For an experimental part of this work, the Berg’s recursive model with a possibility of path loses or signal level prediction in a selected microcellular system is chosen. The software for a cellular network coverage is created on the basis of this fact. Its advantage is a possibility of up to five base stations placing and many kinds of settings, e.g. operating frequency, base station transmitting power, base and mobile station antennas height etc. There is a possibility of system GSM 900, GSM 1800 or UMTS choice. The Berg’s recursive model features are checked by simulations on experimental and real maps of build-up area.

The diploma thesis describes mobile communication systems GSM and UMTS including the operating principle of these systems. It also deals with the GPS issues and the determination of the location by this system. The signal path losses issues between the transmitter and receiver are also described. The focus is also put on Telit UC864-G model and the measurement system, operated by the created programme with the graphic user interface, which measures parameters of the cellular network according to entered input parameters and saves the measured values into the file. The part of the diploma thesis describes another created programme with the graphic user interface displaying the measured network parameters in map data with the possibility to compare the distribution of the measured signal value in both outdoor and indoor environment and the theoretical value set by the propagation models.

Dans la modélisation et l'évaluation des performances de la communication cellulaire sans fil, la géométrie stochastique est largement appliquée afin de fournir des solutions plus efficaces et plus précises. Le processus ponctuel de Poisson homogène (H-PPP), est le processus ponctuel le plus largement utilisé pour modéliser les emplacements spatiaux des stations de base (BS) en raison de sa facilité de traitement mathématique et de sa simplicité. Pour les fortes corrélations spatiales entre les emplacements des stations de base, seuls les processus ponctuels (PP) avec inhibitions et attractions spatiales peuvent être utiles. Cependant, le temps de simulation long et la faible aptitude mathématique rendent les PP non-Poisson non adaptés à l'évaluation des performances au niveau du système. Par conséquent, pour surmonter les problèmes mentionnés, nous avons les contributions suivantes dans cette thèse: Premièrement, nous introduisons une nouvelle méthodologie de modélisation et d’analyse de réseaux cellulaires de liaison descendante, dans laquelle les stations de base constituent un processus ponctuel invariant par le mouvement qui présente un certain degré d’interaction entre les points. L'approche proposée est basée sur la théorie des PP inhomogènes de Poisson (I-PPP) et est appelée approche à double amincissement non homogène (IDT). L’approche proposée consiste à approximer le PP initial invariant par le mouvement avec un PP équivalent constitué de la superposition de deux I-PPP conditionnellement indépendants. Les inhomogénéités des deux PP sont créées du point de vue de l'utilisateur type ``centré sur l'utilisateur''. Des conditions suffisantes sur les paramètres des fonctions d'amincissement qui garantissent une couverture meilleure ou pire par rapport au modèle de PPP homogène de base sont identifiées. La précision de l'approche IDT est justifiée à l'aide de données empiriques sur la distribution spatiale des stations de base. Ensuite, sur la base de l’approche IDT, une nouvelle expression analytique traitable du rapport de brouillage moyen sur signal (MISR) des réseaux cellulaires où les stations de base présentent des corrélations spatiales est introduite. Pour les PP non-Poisson, nous appliquons l'approche IDT proposée pour estimer les performances des PP non-Poisson. En prenant comme exemple le processus de points β-Ginibre ( β -GPP), nous proposons de nouvelles fonctions d’approximation pour les paramètres clés dans l’approche IDT afin de modéliser différents degrés d’inhibition spatiale et de prouver que MISR est constant en densification de réseau. Nous prouvons que la performance MISR dans le cas β-GPP ne dépend que du degré de répulsion spatiale, c'est-à-dire β , quelles que soient les densités de BS. Les nouvelles fonctions d'approximation et les tendances sont validées par des simulations numériques.Troisièmement nous étudions plus avant la méta-distribution du SIR à l’aide de l’approche IDT. La méta-distribution est la distribution de la probabilité de réussite conditionnelle compte tenu du processus de points. Nous dérivons et comparons l'expression sous forme fermée pour le b-ème moment dans les cas PP H-PPP et non-Poisson. Le calcul direct de la fonction de distribution cumulative complémentaire (CCDF) pour la méta-distribution n'étant pas disponible, nous proposons une méthode numérique simple et précise basée sur l'inversion numérique des transformées de Laplace. L'approche proposée est plus efficace et stable que l'approche conventionnelle utilisant le théorème de Gil-Pelaez. La valeur asymptotique de la CCDF de la méta distribution est calculée dans la nouvelle définition de la probabilité de réussite. En outre, la méthode proposée est comparée à certaines autres approximations et limites, par exemple l’approximation bêta, les bornes de Markov et les liaisons de Paley-Zygmund. Cependant, les autres modèles et limites d'approximation sont comparés pour être moins précis que notre méthode proposée. / In the modeling and performance evaluation of wireless cellular communication, stochastic geometry is widely applied, in order to provide more efficient and accurate solutions. Homogeneous Poisson point process (H-PPP) with identically independently distributed variables, is the most widely used point process to model the spatial locations of base stations (BSs) due to its mathematical tractability and simplicity. For strong spatial correlations between locations of BSs, only point processes (PPs) with spatial inhibitions and attractions can help. However, the long simulation time and weak mathematical tractability make non-Poisson PPs not suitable for system level performance evaluation. Therefore, to overcome mentioned problems, we have the following contributions in this thesis: First, we introduce a new methodology for modeling and analyzing downlink cellular networks, where the base stations constitute a motion-invariant point process that exhibits some degree of interactions among the points. The proposed approach is based on the theory of inhomogeneous Poisson PPs (I-PPPs) and is referred to as inhomogeneous double thinning (IDT) approach. The proposed approach consists of approximating the original motion-invariant PP with an equivalent PP that is made of the superposition of two conditionally independent I-PPPs. The inhomogeneities of both PPs are created from the point of view of the typical user. The inhomogeneities are mathematically modeled through two distance-dependent thinning functions and a tractable expression of the coverage probability is obtained. Sufficient conditions on the parameters of the thinning functions that guarantee better or worse coverage compared with the baseline homogeneous PPP model are identified. The accuracy of the IDT approach is substantiated with the aid of empirical data for the spatial distribution of the BSs. Then, based on the IDT approach, a new tractable analytical expression of mean interference to signal ratio (MISR) of cellular networks where BSs exhibits spatial correlations is introduced.For non-Poisson PPs, we apply proposed IDT approach to approximate the performance of non-Poisson PPs. Taking β-Ginibre point process (β -GPP) as an example, we propose new approximation functions for key parameters in IDT approach to model different degree of spatial inhibition and we successfully prove that MISR for β -GPP is constant under network densification with our proposed approximation functions. We prove that of MISR performance under β-GPP case only depends on the degree of spatial repulsion, i.e., β , regardless of different BS densities. We also prove that with the increase of β or (given fixed γ or β respectively), the corresponding MISR for β-GPP decreases. The new approximation functions and the trends are validated by numerical simulations. Third, we further study meta distribution of the SIR with the help of the IDT approach. Meta distribution is the distribution of the conditional success probability given the point process. We derive and compare the closed-form expression for the b-th moment under H-PPP and non-Poisson PP case. Since the direct computation of the complementary cumulative distribution function (CCDF) for meta distribution is not available, we propose a simple and accurate numerical method based on numerical inversion of Laplace transforms. The proposed approach is more efficient and stable than the conventional approach using Gil-Pelaez theorem. The asymptotic value of CCDF of meta distribution is computed under new definition of success probability. Furthermore, the proposed method is compared with some other approximations and bounds, e.g., beta approximation, Markov bounds and Paley-Zygmund bound. However, the other approximation models and bounds are compared to be less accurate than our proposed method.

Network data rates are growing rapidly. The data rates provided to the customers by their network providers vary from Mbps to Gbps. However, rarely do users get the promised peak throughput. In cellular networks, network conditions change based on obstacles, weather conditions between the client and the base stations, and even the movement of objects and people. As a result of the changes in the radio link, the data transfer rate can change rapidly, hence devices needs to adjust their communications based on the currently available data rate. The Transmission Control Protocol (TCP) is widely used for reliable data transfer over networks. However, TCP was initially designed when link data rates were much lower than the link data rates commonly available today. As a result, TCP does not perform well at high data rates, despite some of the changes that have been made to the protocol to support high data rate links. Moreover, TCP has problems adapting to large changes in link bandwidth (not caused by congestion), resulting in a lower average throughput than the link could potentially deliver. This thesis evaluates two different versions of the TCP protocol (e.g., TCP Reno and Cubic TCP) and proposes a network coding scheme to enhance users’ experience when communicating over unstable radio links. The performance of the two TCP protocols and Random Linear Network Coding (RLNC) scheme were measured in an emulated network environment. The results of these measurements were analyzed and evaluated. The analysis shows that RLNC can provide a higher throughput than TCP over a network with high packet loss. However, RLNC is a UDP based solution and does not implement congestion control algorithms or reliability. A new solution is proposed that increases reliability and implements network adaptation in RLNC solutions. The results obtained in this thesis can be used to develop a new protocol to increases the quality of users’ experience in high loss networks. / Datahastigheter över nätverk ökar drastiskt. Datahastigheterna som ges tillgängliga till användare av deras respektive dataleverantör kan variera från Mbit/s till Gbit/s. Det är dock inte ofta användare får ut vad som har lovats. I mobila nätverk kan nätverkets tillstånd ändras baserat på hinder, väderleksförhållanden mellan en klient och basstationerna, till och med beroende på förflyttning av objekt eller människor. På grund av detta så behöver användares utrustning anpassa dess kommunikation, baserat på den för närvarande tillgängliga datahastigheten. Transmission Control Protocol (TCP) används i stor utsträckning vid behovet av tillförlitlig dataöverföring över nätverk. Däremot så designades TCP när länkdatahastigheterna var mycket lägre än vad som är vanligen tillgängligt idag. På grund av detta så presterar inte TCP över höga datahastigheter, trots ändringar som har gjorts i protokollet för att stödja höghastighets datalänkar. Utöver det så har TCP svårt att anpassa sig efter stora ändringar i länkens bandbredd (som inte är orsakat av stockning), som resulterar i en mindre genomsnitts-dataström än vad länken potentiellt hade kunnat ge. Detta examensarbete utvärderar två olika versioner av TCP (e.g., TCP Reno och Cubic TCP) och föreslår ett sätt att använda network coding för att öka användares upplevelse vid dataöverföring över instabila radio länkar. Prestationerna av de två TCP versionerna och Random Linear Network Coding (RLNC) metoden har blivit mätt i en emulerad nätverksmiljö. Resultaten från dessa mätningar blev analyserade och utvärderade. Analysen visar att RLNC kan ge en högre dataström än TCP över ett nätverk med hög risk för paketförluster. Däremot så är RLNC en User Datagram Protocol (UDP) baserad lösning, och därav inte implementerar trängselkontrolls-algoritmer eller tillförlitlighet. Ett förslag till en ny lösning som ökar tillförlitlighet och implementerar nätverksanpassning till RLNC lösningar har presenterats. Resultaten från detta examensarbete kan användas till att utveckla nya protokoll för att öka kvalitén av användares upplevelse i nätverk med risk för hög paketförlust.