Handover

About: Handover is a research topic. Over the lifetime, 24219 publications have been published within this topic receiving 296416 citations. The topic is also known as: handoff.

Method and system to support single radio video call continuity during handover

Abstract: A method and system for managing a plurality of network bearers in a wireless communication network is provided. The method includes identifying at least one of an initiation or an update of an instance of an application session. The method then generates an identifier associated with said instance of the application session. Further, the method assigns said identifier to each of the plurality of network bearers established as a result of said identified initiation or identified update of said instance of the application session. In an embodiment, the method uses the said identifier for managing communication during handover from a first communications network to a second communications. The method manages both video bearers and the voice bearers during the handover based on the said identifier.

The study of handover procedure in LTE-based femtocell network

Abstract: Wireless systems have the capability to address broad geographic area without the costly infrastructure deployment. However, the main drawback resides in the bandwidth limitation and the coverage for single access point. The deployment of Femtocell as the promising wireless access technology becomes one of the possible solution. In this paper the handover procedure in femtocell network is studied. The 3GPP LTE based handover is analysed in three scenarios: hand-in, hand-out and inter-FAP. In addition, the reactive and proactive handover strategy is also proposed as the handover decision policy to diminish the very frequent and unnecessary handovers.

Method for performing inter-system handovers in a mobile communication system

Abstract: The invention relates to a method for performing inter-system handovers in a communication system comprising at least a mobile station, a call state control function, a first and a second call control node, a first and a second media gateway and a radio network node. The handover is achieved by way of connecting a call control node to a call state control function. The call control node allocates a media gateway for the session established. The session media bearers are routed via the media gateway. The call control node acts as an anchor node for the handover. As the mobile station moves to a new cell a media bearer is established to the media gateway from the mobile station via the new cell.

Fast AGC setting using RSS (I) measurement procedure

Abstract: In a wireless or cellular telephone system operated, for example, in accordance with the TIA/EIA IS-54 TDMA standard specification and frame structure, wherein RSS measurements in a Mobile Station of scanned communication channels are made in the slot intervals between the RX and TX slots to prepare for determining the gain (AGC) values needed in the receiver for a new channel identified over the current channel communicating with a Base Station, wherein slot interval measurements of the new channel signal strength are used to achieve a shorter handoff time in the Mobile Station and a more accurate initial AGC value in the receiver The new channel signal strength is measured using the existing MAHO measurement procedure according to the IS-54 standard specification, or like procedure, and is performed in three slot intervals The results of these measurements are used to determine the AGC value needed for the new radio channel The handoff acknowledgement message is created, interleaved, and sent on the current channel during or after the measurement period

Improving call admission policies in wireless networks

Abstract: It is well known that the call admission policy can have a big impact on the performance of a wireless network. However, the nonlinear dependence of new calls and handoff calls makes the search for a better call admission policy – in terms of effective utilization – a difficult task. Many studies on optimal policies have not taken the correct dependence into consideration. As a result, the reported gains in those studies cannot be confirmed in a real network. In this paper we develop a solution to the problem of finding better call admission policies. The technique consists of three components. First, we search for the policy in an approximate reduced-complexity model. Second, we modify the Linear Programming technique for the inherently nonlinear policy-search problem. Third, we verify the performance of the found policy in the exact, high-complexity, analytical model. The results shown in the paper clearly demonstrate the effectiveness of the proposed technique.