Skip to Main Content
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.