TD / GSM History of Adjacent Areas to Optimize Selection Algorithm

Abstract:

In the current neighborhood switching algorithm, the mobile device to the adjacent areas of all measured signals, switching delay resulting connection may be lost, adjacent areas of rapid change as a key commercial TD. Adjacent areas based on the choice of optimization algorithm to switch at some stage in the database area of the district the highest success rate statistics, and dynamically adjust the priority of the cell sorting to select the optimal cell handoff history. The algorithm can reduce the search time measured adjacent areas, thereby reducing the overall process of switching delay.

• Periodical: Advanced Materials Research (Volumes 403-408)
• Pages: 2713-2716
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.403-408.2713
• Online since: November 2011
• Authors: Zhuo Yuan Xiang, Ying Li, Zhi Tao Tang
• Keywords: 3A Event, Neighborhood Switching, Optimization Selection Algorithm

References

[1] Zhao Liangbi, Yu Zhiwen; Re-election analysis in 2G/3G interoperability switch ; Telecom Telecom; 2009. 2, P48.

[2] Cortes-Rodriguez, F.; Munoz-Rodriguez, D.; Soto, R: Position location assisted multi-valued logic handover algorithm. Vehicular Telecom Conference， (1999).

DOI: 10.1109/vetecf.1999.798434

[3] Thong and S. S. Rappaport, Traffic model and performance analysis for cellular mobile radio telephone Systems with prioritized and no prioritized handover procedures, IEEE Trans. Veh. Technol., vol. 35, p.77–92, Aug. (1986).

DOI: 10.1109/t-vt.1986.24076

[4] Choy Hyun-Ho, Song Osaka, Cho Dong-Hon. Seamless handover scheme for UMTS- WLAN interlocking [J]. IEEE Communications Society Globe COM, 2004: 1559-1564.

DOI: 10.1109/glocom.2004.1378244