By Topic

Vertex-based Shared Data Allocation in a Mobile Computing System

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
$33 $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

4 Author(s)

In mobile environments, mobile users transfer and access a great deal of data. In order to enhance user's access speed in a mobile network, replicated servers can be of great help. But usually a limited number of such servers are deployed in a network due to the cost factor. Thus available replicated servers should be located appropriately; they should be placed at the cells where many users visit frequently. In this paper we propose two vertex-based algorithms that calculate the cumulative numbers of shared data accesses by mobile users at the cells and allocates replicated severs at the cell with the largest numbers of accesses. The proposed algorithms exploit users' moving patterns and data access patterns for locating replicated servers in order to maximize the local access hit ratio of users. The experimental results show that the proposed algorithms improve the system performance over a typical algorithm.

Published in:

Information Networking, 2008. ICOIN 2008. International Conference on

Date of Conference:

23-25 Jan. 2008