A server selection algorithm for group mobility
by Namkoo Ha, Byeongjik Lee, Sungho Hwang, Kijun Han
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 4, No. 3, 2010

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.

Online publication date: Wed, 28-Jul-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com