Search

IP flow mobility (IFOM) enables a user equipment to offload data traffic at the IP flow level. Although the procedure of IFOM-based flow offloading has been specified by 3GPP, how many IP flows should be offloaded and when offloading should be performed are not defined. Consequently, IP flows may be routed to a target access network that has a strong signal strength but with backhaul congestion or insufficient access capability. In this paper, we propose two algorithms, referred to as proportional offloading (PO) and proportional and preemption-enabled offloading (PPO), respectively, for IP flow offloading in hybrid cellular and wireless local area networks. The PO algorithm decides an optimal proportion of IP flows, which could be offloaded by considering available resources at the target access network. In the PPO algorithm, both service continuity and network utilization are taken into consideration. Furthermore, a detailed analytical model is developed in order to evaluate the behavior of the proposed algorithms. The analytical model is validated through extensive simulations. The results show that by dynamically adjusting the percentage of traffic flows to be offloaded, PO can reduce blocking probability and increase resource utilization. PPO further improves the performance at the cost of slightly higher offloading overhead. [ABSTRACT FROM AUTHOR]

In evolved multimedia broadcast/multicast service (eMBMS), service continuity enables users move from one cell to another without interrupting eMBMS service. Unlike traditional handover in unicast transmission, an user equipment can receive eMBMS service in either unicast or multicast mode. In this paper, we point out a new handover failure problem in eMBMS due to the miss of rekeying information. We first take a close look at the new handover scenarios. We then investigate the problem by using comprehensive mathematical models. Our models provide insights on the new handover problem and introduce theoretical guidelines for mobile operators to design and optimize their networks without wide deployment to save cost and time. Moreover, we propose a solution to combat against the handover failure. Both the simulation and analytical results demonstrate that the impacts of the eMBMS handover failure are reduced significantly. In this paper, we present a systematic way to investigate the handover failure problem in eMBMS. [ABSTRACT FROM AUTHOR]

It is essential to model channel holding time (CHT), cell residence time (CRT), and handoff rate for performance analysis and algorithm evaluation in mobile cellular networks. The problem has been extensively studied in the past for circuit-switched (CS) cellular networks. However, little research has been done on packet-switched (PS) cellular networks. Unlike that a call occupies a dedicated channel during its whole lifetime in CS networks, an active session in PS networks occupies and releases channels iteratively due to discontinuous reception (DRX) mechanism. In this paper, we investigate the key quantities in PS cellular networks. We present a set of comprehensive new models to characterize the quantities and their relationship in PS networks. The models shed light on the relationship between CHT and CRT and handoff rate. The analytical results enable wide applicability in various scenarios and therefore have important theoretical significance. Moreover, the analytical results provide a quick way to evaluate traffic performance and system design in PS cellular networks without wide deployment, which can save cost and time. [ABSTRACT FROM AUTHOR]

This paper studies how to efficiently apply device-to-device (D2D) communications underlaying a cellular system to support vehicle-to-vehicle (V2V) connection (termed D2D-V). By considering the geographic features of the D2D-V system, we propose a D2D-V grouping, reuse channel selection (RS), and power control (PC) framework to achieve the optimal performance of the D2D-V system, in terms of either maximized sum rate or maximized minimally achievable rate. First, in a full channel state information (CSI) scenario, we apply difference of two convex functions (D.C.) programming to obtain the optimal PC. However, because the CSI between some terminals is hard to obtain and some interference can be appropriately inhibited by taking advantage of the vehicles' geographic features, we make a series of simplifications to the PC problem to reduce the requirement of full CSI, the dependence of centralized control, and the computational complexity. The suitable conditions of each simplification are elaborated. Each step of our simplifications are shown as a certain tradeoff between performance and complexity. Furthermore, we provide an investigation into the service quality that one vehicle can achieve when it passes through the covered segment of the highway and propose the location–service curve to portray this. We use numerical simulations to verify the accuracy and feasibility of each step of our suboptimal PC and specific features embedded in the location–service curve. [ABSTRACT FROM PUBLISHER]