Efficient discovery technique of distributed KML data in mobile ad hoc network

The research topics of mobile ad hoc network are drawing attention for flexibly exchanging any data between local users. If we can apply the nature of ad hoc network to LBS systems, exchanging spatial data like KML between local users, we can easily retrieve data about any locations at any time. To realize such environment, we have to invent a more efficient query routing technique than conventional P2P ones. In this paper, we propose a novel routing method that utilizes R-Tree structure for arranging routing tables for users´ queries. Using the tables, we can share KML data with low overheads.