A Weighted Sliding-Frame Strategy for Distributed Location Management in Wireless Mobile Networks

This paper proposes a distributed location management strategy called weighted sliding-frame strategy for wireless mobile networks in which the processing speeds of the location information databases (LIDs) are heterogeneous. In the proposed strategy, a number of consecutively numbered location information databases are arranged into a frame. A frame of location information databases overlaps with the next frame except one database. Each frame is assigned a weight which is used to distribute the location information of the mobile hosts among the frames. The number of mobile hosts whose location information are stored in a frame is proportional to the weight assigned the frame. A nonlinear convex programming problem is formulated and solved numerically in order to find the set of weights that minimize the average database response time. Our numerical results show that the proposed weighted sliding-frame strategy is able to properly distribute the location information of the mobile hosts among the frames such that the average database response time is significantly lower than that of the sliding-frame strategy proposed in our previous work.