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

Authors:
Tadanobu Tsunoda;Kaoru Sezaki
Affiliations:
Institute of Industrial Science, University of Tokyo, Tokyo, Japan and CREST, Japan Science and Technology Agency;Center for Spatial Information Science, University of Tokyo, Tokyo, Japan and CREST, Japan Science and Technology Agency
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Year:
2009

Citing 6
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
GHT: a geographic hash table for data-centric storage

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.