Network Selection for Group Handover in Multi-Access Networks
Authors:
- X. CaiXCX. Cai
- F. LiuFLF. Liu
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 2164-2168
Abstract
In mobile network, it is likely that many mobile nodes handover at the same time, which is defined as group handover. The problem of network selection arises for group handover since each mobile node will selfishly select the best network based on individual information and consideration which may cause network congestion and performance degradation. In this paper, three network selection algorithms are proposed for group handover. The performance of these algorithms is studied with regard to the concept of social cost introduced in game theory.Keywords
This publication has 8 references indexed in Scilit:
- Modeling and Analysis of Handover Algorithms2007
- Dynamic and User-Centric Network Selection in Heterogeneous Networks2007
- A Seamless and Proactive End-to-End Mobility Solution for Roaming Across Heterogeneous Wireless NetworksIEEE Journal on Selected Areas in Communications, 2004
- Selfish traffic allocation for server farms2002
- Worst-Case Equilibria1999
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Non-Cooperative GamesAnnals of Mathematics, 1951