An Invalidation Cache Model Based on Ant Colony Algorithm in Mobile Databases

Mobile databases are always the core technique of the dynamic data management. Cache technique, as one of the key techniques in mobile databases, is able to reduce the contention of bandwidth and save the power energy. As the character of ant colony algorithm is choice, update, cooperation mechanism, which is accorded with the mobile agent. An invalidation cache model based on ant colony algorithm is proposed. Mobile agents are looked as different ants which are able to divide the work. Thus, the optimum result is received. The experimental results indicate that the enhancement is practical.