A Partition Prediction Algorithm for Group Mobility in Ad-Hoc Networks

摘要

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.