A partition prediction algorithm for group mobility in ad-hoc networks

Authors:
Namkoo Ha;Byeongjik Lee;Kyungjun Kim;Kijun Han
Affiliations:
Department of Computer Engineering, Kyungpook National University, Korea;Department of Computer Engineering, Kyungpook National University, Korea;Department of Computer Engineering, Kyungpook National University, Korea;Department of Computer Engineering, Kyungpook National University, Korea
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 2
Cited 0

A group mobility model for ad hoc wireless networks

MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
ANEJOS: a java based simulator for ad hoc networks

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of important issues associated with group mobility in ad-hoc networks is predicting the partition time. The existing algorithms predict the partition time assuming that the partitioned groups move to opposite direction with the same speed and the same coverage. So, these algorithms could not accurately predict partition time in practical situation. In this paper, we propose a partition prediction algorithm considering network partition in any direction, at any speed, and with different coverage of group. To validate the proposed algorithm, we carried out a simulation study. We observe a sound agreement between numerical results obtained by our algorithm and computer simulation. Our algorithm can predict the partition time more accurately in real situations.