KNN Search Protocols on Road Networks in Wireless Broadcast Environments
碩士 === 國立臺北科技大學 === 資訊工程系研究所 === 103 === In order to cope with the actual applications, many works related to location-based services (LBS) consider the real distance on road networks instead of the Euclidean distance between two data objects. Besides, data broadcast has been considered as an effect...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/frfb8t |
| Summary: | 碩士 === 國立臺北科技大學 === 資訊工程系研究所 === 103 === In order to cope with the actual applications, many works related to location-based services (LBS) consider the real distance on road networks instead of the Euclidean distance between two data objects. Besides, data broadcast has been considered as an effective and secure approach to provide services to a large amount of users simultaneously. In this paper, the network Voronoi diagram used for partitioning the road networks and a tailor-made index are provided for the broadcast, so the tuning time can be effectively reduced. On the client side, we propose the corresponding query processes which use the properties on distance to prune the irrelevant data in order to reduce the tuning time. We then perform the simulation experiments using real data for analysis and discussion on the effectiveness of the proposed protocols. The experimental results show that our methods can have a less tuning time but pay for little longer latency in comparison with the other method.
|
|---|