Abstract

The advances of mobile computing technologies in recent years contributes to the growing of mobile information services. Consequently, we need to give special attentions to producing correct answers of those requests, considering the scope of queries and user locations. In this paper, we propose an approach of mobile query processing when the users location moves from one Base Station to another and the queries cross multi-cells. The efficiency of our proposed approach is presented by giving some examples and performance evaluations.

Highlights

  • Location-Dependent Information Service (LDIS) is one type of applications to generate query results based on location of users issuing the queries [1,2,14,15,17]

  • We have some assumptions to simplify our discussion which are as follows: users are moving with steady velocities and directions; every Base Station (BS) has knowledge about its neighbours and the expected time to leave current BS; the predicted locations are known before receiving query results; and there are no errors in all partial data retrieved

  • When BS1 knows that the query scope is crossing its boundary, it processes the query within its area and gets partial about information of the query result from BS2 by forwarding the remaining query scope information from BS1 to BS2

Read more

Summary

Introduction

Location-Dependent Information Service (LDIS) is one type of applications to generate query results based on location of users issuing the queries [1,2,14,15,17]. One study in [9] discussed the issues of how to retrieve query results within one BS It divides a query scope into four regions and searches only certain regions based on the users movement. Taniar / Data retrieval for location-dependent queries in a multi-cell wireless environment changes the coverage area of a cellular system [1,11]. We have some assumptions to simplify our discussion which are as follows: users are moving with steady velocities and directions; every BS has knowledge about its neighbours and the expected time to leave current BS; the predicted locations are known before receiving query results; and there are no errors in all partial data retrieved. The handover time is ignored since it does not make any change towards the prediction of users locations

Related work
Background
Proposed Algorithm
Examples
Performance evaluation
Uniform area size multi-BS and various size of query scopes
Various area size multi-BS and uniform size query scopes
Base Statons
Conclusion and future work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call