Title: A server selection algorithm for group mobility

Authors: Namkoo Ha, Byeongjik Lee, Sungho Hwang, Kijun Han

Addresses: EO/IR Research and Development Lab, LIG Nex1, Yongin-City, Republic of Korea. ' Department of Computer Engineering, Kyungpook National University, 1370 Sankyuk-dong, Book-gu, Daegu 702-701, Republic of Korea. ' Department of Computer Engineering, Kyungpook National University, 1370 Sankyuk-dong, Book-gu, Daegu 702-701, Republic of Korea. ' Department of Computer Engineering, Kyungpook National University, 1370 Sankyuk-dong, Book-gu, Daegu 702-701, Republic of Korea

Abstract: 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.

Keywords: wireless ad-hoc networks; group mobility; partition time; server selection; QoS; quality of service; simulation; wireless networks.

DOI: 10.1504/IJWMC.2010.034218

International Journal of Wireless and Mobile Computing, 2010 Vol.4 No.3, pp.196 - 202

Published online: 28 Jul 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article