By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Chu ; Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin ; Jianpei Zhang ; Jing Yang

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.

Published in:

Internet Computing in Science and Engineering, 2008. ICICSE '08. International Conference on

Date of Conference:

28-29 Jan. 2008