| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 98 === In recent years, the technology and the application of wireless network was developed rapidly, and mobile peer-to-peer (MP2P) network plays an important role in them. It includes many kinds of application such as data dissemination, cooperate query and so on. Spatial query, one of these applications, is a major spatial-based query with help of GPS technology. Continuously k nearest neighbor (cKNN) becomes a quite significant issue due to its extensively used in spatial query. The objective of cKNN is to make a query point know the information of the k nearest moving objects to this query point in a future period. the results of query may continuously change because the nodes in MP2P network can move freely. Thus, how to make query points detect it immediately becomes a challenge. On the other hand, due to constraints of the environment of network, the electric power and wireless network bandwidth of mobile nodes are significant indexes that we should take into consideration when solving this problem. This thesis proposes a simple and efficient distributed method to solve the problem of query in cKNN on MP2P network. This method can not only guarantee the correctness of result of query, but also substantially economize the use of electric power and bandwidth. In the last part of this thesis also illustrate by simulation that this method can make 47% increases in efficiency compared with the existing method.
|
|---|
