Effect of cell residence time variance on the performance of an advanced paging algorithm

The use of advanced sequential paging algorithms has been suggested as a means to reduce the signaling cost in future mobile cellular networks. In a proposed algorithm (Koukoutsidis and Theologou, 2003), the system can use the additional information of the last interaction cell combined with a mobility model to predict the short-term location probabilities at the time of an incoming call arrival. The short-term location probabilities reduce the uncertainty in mobile user position and thus greatly improve the search. In this paper, an analytical model is derived that allows for a general distribution of cell residence times. By considering a Gamma distribution, we study the effect of the variance of cell residence times and derive useful results on the performance of the algorithm.Comment: 8 pages, 3 figure

Modeling and Analysis of an Energy-Efficient Mobility Management Scheme in IP-Based Wireless Networks†

An energy-efficient mobility management scheme in IP-based wireless networks is proposed to reduce the battery power consumption of mobile hosts (MHs). The proposed scheme manages seven MH states, including transmitting, receiving, attention/cell-connected, attention/paging area(PA)-connected, idle, off/attached, and detached states, to efficiently manage battery power, radio resources, and network load. We derive the stationary probabilities and steady state probabilities of the seven MH states for the proposed scheme in IP-based wireless networks in compact form. The effects of various input parameters on MH steady state probabilities and power consumption are investigated in the proposed scheme compared to the conventional scheme. Network costs such as cell updates, PA updates, binding-lifetime-based registrations, and paging messages are analyzed in the proposed and conventional schemes. The optimal values of PA size and registration interval are derived to minimize the network cost of the proposed scheme. The combined network and power costs are investigated for the proposed and conventional schemes. The results provide guidelines to select the proper system parameters in IP-based wireless networks

Location Management Techniques in Cellular Network: a Novel Approach

Communication had become the necessity of our lives. It is no longer just a way to communicate with each other. It is now a part of our life. Most of this changes are the result of the rapid growth in mobile industry. The number of subscribers are increasing in an exponential manner. At current stage the number of mobile devices had already crossed the total human population of our planet. But this high paced increase in number of subscribers had brought in some new and challenging problems into the eld also. Particularly the problem of ccommodating this huge number of subscribers into the limited amount of spectrum, withoutcompromising the Grade of Service. In this thesis we had tried to address this issue by reducing the spectrum utilization in the location management. Location management are the set of techniques that are used by the telecom provider to determine the current location of the user (location update) and to inform the user regarding an incoming call (paging). Both of this process consumes a huge portion of the available spectrum. This thesis presents a dynamic pro le based location management technique that optimizes both these technology. When simulated using actual user data, the algorithm shows it is 3 times more ecient than the conventional paging and 2 times more ecient compared to other intelligent paging algorithms. Similarly in case of location update, the algorithm shows an improvement of 17% compared to the conventional technique. The thesis also includes a comparison between sequential paging and concurrent paging based on parameters like probability of channel being busy,average waiting time per user etc.The novelty of this work is that it uses CDR (Call Data Record) to pro le the users. And the algorithm is implemented on actual user data rather than any theoretically predicted data. The optimization is done at individual user level. So the optimization achieved through the proposed algorithm is greater compared to other algorithms. The final output shows promising result specically in terms of bandwidth conservatio

Location Management Techniques in Cellular Network: a Novel Approach

Communication had become the necessity of our lives. It is no longer just a way to communicate with each other. It is now a part of our life. Most of this changes are the result of the rapid growth in mobile industry. The number of subscribers are increasing in an exponential manner. At current stage the number of mobile devices had already crossed the total human population of our planet. But this high paced increase in number of subscribers had brought in some new and challenging problems into the eld also. Particularly the problem of ccommodating this huge number of subscribers into the limited amount of spectrum, withoutcompromising the Grade of Service. In this thesis we had tried to address this issue by reducing the spectrum utilization in the location management. Location management are the set of techniques that are used by the telecom provider to determine the current location of the user (location update) and to inform the user regarding an incoming call (paging). Both of this process consumes a huge portion of the available spectrum. This thesis presents a dynamic pro le based location management technique that optimizes both these technology. When simulated using actual user data, the algorithm shows it is 3 times more ecient than the conventional paging and 2 times more ecient compared to other intelligent paging algorithms. Similarly in case of location update, the algorithm shows an improvement of 17% compared to the conventional technique. The thesis also includes a comparison between sequential paging and concurrent paging based on parameters like probability of channel being busy,average waiting time per user etc.The novelty of this work is that it uses CDR (Call Data Record) to pro le the users. And the algorithm is implemented on actual user data rather than any theoretically predicted data. The optimization is done at individual user level. So the optimization achieved through the proposed algorithm is greater compared to other algorithms. The final output shows promising result specically in terms of bandwidth conservatio

LTE 네트워크에서 비디오 전달 서비스의 성능 향상

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 2. 권태경.LTE includes an enhanced multimedia broadcast/multicast service(eMBMS)but delay-sensitive real-time video streaming requires the combination of efficient handling of wireless link bandwidth and reduced handover delays, which remains a challenge. The 3GPP standard introduces a Multimedia Broadcast and multicast service over a Single Frequency Network (MBSFN) area which is a group of base stations broadcasting the same multicast packets. It can reduce the handover delay within MBSFN areas, but raises the traffic load on LTE networks. In this dissertation, we first presents an MBSFN architecture based on location management areas (LMAs) which can increase the sizes of MBSFN areas to reduce the average handover delay without too much bandwidth waste. An analytical model is developed to quantify service disruption time, bandwidth usage, and blocking probability for different sizes of MBSFN areas and LMAs while considering user mobility, user distribution, and eMBMS session popularity. Using this model, we also propose how to determine the best sizes of MBSFN areas and LMAs along with performance guarantees. Analytical and simulation results demonstrate that our LMA-based MBSFN scheme can achieve bandwidth-efficient multicast delivery while retaining an acceptable service disruption time. We next propose to transmit the real-time video streaming packets of eMBMSs proactively and probabilistically, so that the average handover delay perceived by a user is stochastically guaranteed. To quantify the tradeoff between the perceived handover delay and the bandwidth overhead of proactive transmissions, we develop an analytical model considering user mobility, user distribution, and session popularity. Comprehensive simulation is carried out to verify the analysis. On the other hand, hypertext transfer protocol (HTTP) based adaptive streaming (HAS) is expected to be a dominant technique for non-real-time video delivery in LTE networks. In this dissertation, we first analyze the root causes of the problems of the existing HAS techniques. Based on the insights gained from our analysis, we propose a network-side HAS solution to provide a fair, efficient, and stable video streaming service. The key characteristics of our solution are: (i) unification of video- and data-users into a single utility framework, (ii) direct rate control conveying the assigned rates to the video client through overwritten HTTP Response messages, and (iii) rate allocation for stability by a stateful approach. By the experiments conducted in a real LTE femtocell network, we compare the proposed solution with state-of-the-art HAS solutions. We reveal that our solution (i) enhances the average video bitrates, (ii) achieves the stability of video quality, and (iii) supports the control of the balance between video- and data-users.Abstract i I. Introduction 1 II. Performance Improvements on Real-time Multicast Video Delivery 4 2.1 Introduction 4 2.2 Related Work 7 2.3 Location Management Area Based MBSFN 9 2.3.1 Location Management Area (LMA) 10 2.3.2 Handover Delays 12 2.3.3 LMA-based MBSFN Area Planning 12 2.4 Performance Analysis 14 2.4.1 Disruption Time 17 2.4.2 Bandwidth Usage 20 2.4.3 Blocking Probability 21 2.5 Numerical Results 23 2.5.1 Effect of NZ and NL 24 2.5.2 Deciding NZ and NL 27 2.5.3 Effects of v and rho* 31 2.5.4 Effect of alpha 32 2.6 Simulation Results 35 2.7 Conclusion 37 III. Proactive Approach for LMA-based MBSFN 39 3.1 Introduction 39 3.2 Network and MBSFN Modeling 41 3.3 Proactive LMA-based MBSFN 44 3.3.1 Problem Formulation 45 3.3.2 Overall procedure 47 3.4 Performance Evaluation 48 3.4.1 Simulation Setup 48 3.4.2 Computation of pi 50 3.4.3 Simulation Results 51 3.5 Conclusions 53 IV. Performance Improvements on HTTP Adaptive Video Streaming 55 4.1 Introduction 55 4.2 Related Work 57 4.3 Problem Definition 59 4.4 Utility-aware Network-side Streaming Approach 62 4.4.1 Streaming Proxy (SP) 63 4.4.2 Message Flows 65 4.4.3 Characteristics 67 4.5 Bitrate Assignment 68 4.5.1 Bitrate Calculation 69 4.5.2 Enhancing Stability 70 4.5.3 Algorithm for Continuous Bitrates 71 4.5.4 Handling the Bottleneck of Wired Networks 71 4.6 Simulation 73 4.6.1 Static Scenario 73 4.6.2 Mobile Scenarios 75 4.6.3 Algorithm for Continuous Bitrates 77 4.7 Experiments 78 4.7.1 Implementation of DASH Player 79 4.7.2 Implementation of eNB 80 4.7.3 Implementation of Streaming Proxy 83 4.7.4 Experimental Results 83 4.8 Conclusion 87 V. Summary & FutureWork 89 Bibliography 92Docto

Handover and Channel Allocation Mechanisms in Mobile Satellite Networks

In this work we study first handover prediction in non-geostationary mobile satellite networks. The ultimate choice of the transition path depends on UT position and signal strength. We investigate the procedure of beam monitoring and propose UT maximum residence as the criterion for path selection. The UT must operate both in full- and half-duplex mode, the latter being desirable when power limitations are imposed. We propose a scheme that achieves this goal and guarantees efficient diversity provision. Constant delay contours on the earth's surface are defined. The problem of reliable time delay acquisition is addressed, in case synchronization is lost. The SBS solves that either by using the known estimate of UT position or by requesting a measurement report by the UT. The problem of channel allocation appears in cellular networks of every kind. Calls arising in the cell overlap area have access to channels of more than one base station and may choose which base station they will use to establish connection. In that case the problems of base station and channel assignment arise jointly. We address the problem in a linear cellular network and aim at the minimumnumber of utilized channels. We present two algorithms: The first one expands Load Balancing in clique populations and is Sequential Clique Load Balancing (SCLB). The second one is named Clique Load Balancing with Inverse Water-Filling (CLB-IWF). In a dynamic environment, we unify SCLB and CLB-IWF into CLB-DA, which comprises Dynamic Allocation. CLB-DA is compared with Least Loaded Routing (LLR) policy and with Random Routing policy. We finally deduce that at light loads CLB-DA outperforms LLR, attaining smaller blocking probability, whereas at heavier loads all three policies converge

MOBILITY SUPPORT ARCHITECTURES FOR NEXT-GENERATION WIRELESS NETWORKS

With the convergence of the wireless networks and the Internet and the booming demand for multimedia applications, the next-generation (beyond the third generation, or B3G) wireless systems are expected to be all IP-based and provide real-time and non-real-time mobile services anywhere and anytime. Powerful and efficient mobility support is thus the key enabler to fulfil such an attractive vision by supporting various mobility scenarios. This thesis contributes to this interesting while challenging topic. After a literature review on mobility support architectures and protocols, the thesis starts presenting our contributions with a generic multi-layer mobility support framework, which provides a general approach to meet the challenges of handling comprehensive mobility issues. The cross-layer design methodology is introduced to coordinate the protocol layers for optimised system design. Particularly, a flexible and efficient cross-layer signalling scheme is proposed for interlayer interactions. The proposed generic framework is then narrowed down with several fundamental building blocks identified to be focused on as follows. As widely adopted, we assume that the IP-based access networks are organised into administrative domains, which are inter-connected through a global IP-based wired core network. For a mobile user who roams from one domain to another, macro (inter-domain) mobility management should be in place for global location tracking and effective handoff support for both real-time and non-real-lime applications. Mobile IP (MIP) and the Session Initiation Protocol (SIP) are being adopted as the two dominant standard-based macro-mobility architectures, each of which has mobility entities and messages in its own right. The work explores the joint optimisations and interactions of MIP and SIP when utilising the complementary power of both protocols. Two distinctive integrated MIP-SIP architectures are designed and evaluated, compared with their hybrid alternatives and other approaches. The overall analytical and simulation results shown significant performance improvements in terms of cost-efficiency, among other metrics. Subsequently, for the micro (intra-domain) mobility scenario where a mobile user moves across IP subnets within a domain, a micro mobility management architecture is needed to support fast handoffs and constrain signalling messaging loads incurred by intra-domain movements within the domain. The Hierarchical MIPv6 (HMIPv6) and the Fast Handovers for MIPv6 (FMIPv6) protocols are selected to fulfil the design requirements. The work proposes enhancements to these protocols and combines them in an optimised way. resulting in notably improved performances in contrast to a number of alternative approaches