• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.1-8
• /
• 2008

With growing interest in location-based service (LBS), there is increasing necessity for nearest neighbor (NN) search through query while the user is moving. NN search in such a dynamic environment has been performed through the repeated applicaton of the NN method to the search segment, but this increases search cost because of unnecessary redundant calculation. We propose slabbed continuous nearest neighbor (Slabbed_CNN) search, which is a new method that searches CNN in the search segment while moving, Slabbed_CNN reduces calculation costs and provides faster services than existing CNN by reducing the search area and calculation cost of the existing CNN method through reducing the search segment using slabs.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.492-504
• /
• 2004

Recently, as growing of interest for LBS(location-based services) techniques, lots of works on moving objects that continuously change their information over time, have been performed briskly. Also, researches for NN(nearest neighbor) query which has often been used in LBS, are progressed variously However, the results of conventional NN Query processing techniques may be invalidated as the query and data objects move. Therefore, they are usually meaningless in moving object management system such as LBS. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet accurate and continuous query processing for moving objects. Our techniques include an Approximate CTNN(ACTNN) technique, which has quick response time, and an Exact CTNN(ECTNN) technique, which makes it possible to search nearest neighbor objects accurately. In order to evaluate the proposed techniques, we experimented with various datasets. Experimental results showed that the ECTNN technique has high accuracy, but has a little low performance for response time. Also the ACTNN technique has low accuracy comparing with the ECTNN, but has quick response time The proposed techniques can be applied to navigation system, traffic control system, distribution information system, etc., and specially are most suitable when both data and query are moving objects and when we already know their trajectory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.411-417
• /
• 2008

This paper proposes BSFP (Bluetooth Scatternet Formation Protocol), which establishes a multi-hop bluetooth scatternet. BSFP independently operates on each bluetooth device, does not require any information on neighbor devices at the very beginning, and can establish a scatternet even though all the devices are spreaded beyond the bluetooth transmission range. BSFP is composed of the following three stages; 1) Init stage to investigate neighbor nodes, 2) Ready stage to establish a scatternet using gathered local information at each node, and 3) Complete stage to use the determined scatternet links. In BSFP, the scatternet formation time does not significantly affected by the number of bluetooth devices and a robust mobile ad hoc network is formed because BSFP formulates a scatternet with many adjacent links to neighbor devices.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.44-53
• /
• 2006

In this paper, we propose a new Active Channel Scanning scheme by scanning active channels employed by neighbor APs' with the handover counts and non overlap channel information for fast handover. Under the proposed scheme, the mobile which has finished handover to connect a new APsends the neighbor AP's channel information learned by itself during handover to the new AP. And then, the new AP relays the neighbor channel information to the old AP. It decides a priority by handover counts and non overlap channel information for building a Neighbor Channel Table(NCT), and also sends the table information to its associated mobile nodes, periodically. As a result each mobile can scan only active neighbor APs' channels when performs handover based on the referring to NCT information. Using NS-2 Simulator, we applied to supposed ACS that the result of simulation decides to sort by handover counts and non overlap channel information. we evaluate our proposed ACS scheme based on NCT along with the full scanning scheme and the selective scanning scheme. From simulation results, we show that the proposed scheme is advantageous over the other two schemes in terms of the number of scanning channels and the scanning latency.

• Journal of Digital Convergence
• /
• v.11 no.4
• /
• pp.243-249
• /
• 2013

In this paper, GPS(Global Positioning System) that can be used outdoors and GPS(Global Positioning System) is not available for indoor Wi-Fi(Wireless Fidelity) using the Android-based location information system has been designed and implemented. Pedestrians in a room in order to estimate the location of the pedestrian's position, regardless of need to obtain the absolute position and relative position, depending on the movement of pedestrians in a row it is necessary to estimate. In order to estimate the initial position of the pedestrian Wi-Fi Fingerprinting was used. Most existing Wi-Fi Fingerprinting position error small WKNN(Weighted K Nearest Neighbor) algorithm shortcoming EWKNN (Enhanced Weighted K Nearest Neighbor) using the algorithm raised the accuracy of the position. And in order to estimate the relative position of the pedestrian, the smart phone is mounted on the IMUInertial Measurement Unit) because the use did not require additional equipment.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.191-200
• /
• 2009

Location based services (LBSs) have drawn huge attention as the growing number mobile devices and wireless technology demand more pervasive information access. In LBSs, Constraint nearest neighbor queries are one of the important queries of human to fulfill his desired quickly through wireless technology. We propose new query processing of constrained nearest neighbor query on the air to support mobile clients which demand optimal uses of wireless broadcast channel and using minimum battery power of client. First we proposed NN query processing with constrained region and then explain the novel NN query processing with various types of constraints. We have proposed novel algorithms to support Constrained Nearest Neighbor queries on the air based on Distributed Spatial Index and Bitmap-based Spatial Index.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.69-76
• /
• 2022

The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.977-991
• /
• 2008

This study is about the k-nearest neighbor-based approach for the estimation of mutual information when the type of target variable is categorical and continuous. The results of Monte-Carlo simulation and experiments with real-world data show that k=1 is preferable. In practical application with real world data, our study shows that jittering and bootstrapping is needed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4889-4902
• /
• 2018

It is a challenging issue to improve the energy efficiency of neighbor discovery in WSNs. This paper proposes an optimal discovery model (ODM) for the first time. Based on the model, we investigate the influence of the relative size of two unequal active slots on the energy efficiency. ODM provides the energy optimal value of the length of the larger active slot at a given duty cycle. Other than existing methods, the worst-case latency bound of ODM is only one period. This is a subversive conclusion, because almost all other related methods are based on a wake-up schedule that contains several periods. We theoretically deduce that ODM can reduce worst-case discovery latency by 43.89% compared to Searchlight-Trim when their duty cycles are the same. The simulations verify the advantage of ODM.

• Journal of the Korean Society of Safety
• /
• v.15 no.2
• /
• pp.1-7
• /
• 2000

This paper presents the approach involving fault detection and diagnosis of gears using pattern recognition and Wavelet transform. It describes result of the comparison between KDI (Kullback Discrimination Information) with the nearest neighbor classification rule as one of pattern recognition methods and Wavelet transform to know a way to detect and diagnosis of gear damages experimentally. To model the damages 1) Normal (no defect), 2) one tooth is worn out, 3) All teeth faces are worn out 4) One tooth is broken. The vibration sensor was attached on the bearing housing. This produced the total time history data that is 20 pieces of each condition. We chose the standard data and measure distance between standard and tested data. In Wavelet transform analysis method, the time series data of magnitude in specified frequency (rotary and mesh frequency) were earned. As a result, the monitoring system using Wavelet transform method and KDI with nearest neighbor classification rule successfully detected and classified the damages from the experimental data.