TY - JOUR
AU - Han, Kijun
AB - One of the most important issues associated with group mobility predicts the partition time. The existing algorithms predict partition time assuming that the partitioned groups move in opposite direction with the same speed and coverage. Thus, QoS is not guaranteed, since these algorithms could not accurately predict partition time in practical situations. We propose a partition prediction algorithm and server selection algorithm considering network partition in any direction, at any speed and with different coverage of groups. The analytical and simulation results show that our algorithm can predict partition time and select a child server more accurately in real situations.
TI - A server selection algorithm for group mobility
JO - International Journal of Wireless and Mobile Computing
DO - 10.1504/IJWMC.2010.034218
DA - 2010-01-01
UR - https://www.deepdyve.com/lp/inderscience-publishers/a-server-selection-algorithm-for-group-mobility-K56m4j9TO7
SP - 196
EP - 202
VL - 4
IS - 3
DP - DeepDyve
ER -