• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.11-17
• /
• 2008

This paper proposes the USN node location recognition method with low power, which is the modified centroid method. The conventional Zigbee node location recognition is used to the three RSSI values from three beacons, respectively. When a person move with node, the moving speed of USN node doesn't fast. Therefore, one among three positions used to the value that it is a previous value. This method doesn't large the error in terms of the exact position. Using hand-off method, we get about 30% power advantage than the conventional centroid method. And Our monitoring system add the function that it is possible to search for the node region by color.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.55-62
• /
• 2017

In this paper, we proposes a multi-ring based mobile sink location scheme for solar-powered wireless sensor network (WSN). The proposed scheme maintains the multi-rings in which nodes keep the current location of sink node. With the help of nodes in multi-rings, each node can locate the sink node efficiently with low-overhead. Moreover, because our scheme utilizes only surplus energy of a node, it can maintain multiple rings without degrading any performance of each node. Experimental results show that the proposed scheme shows much better latency and scalability with lower energy-consumption than the existing single-ring based scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.89-97
• /
• 2015

In this paper, we propose a handoff method supporting LBS (Location Based Services) Information in mobile clouding environment. In mobile clouding computing, handoff delay and re-authentication is occurred. A mobile node needs re-authentication procedure from cloud server whenever it arrives new AP. But Using of location information of node enables to reduce delay time due to re-authentication. To reduce re-authentication delay time, proposed method stores location information of APs on WiFi based location server to complement. GPS-based technology which can't receive satellite signal in indoor and then node collects location information of AP at handoff time. And also enables to process LBS without increasing handoff delay by splitting the process of handoff from process of requesting location information. For analysis of proposed method, We analyze handoff delay and location information process time and have compared previous handoff method in cloud environment. We confirmed that proposed method shows lower delay time without increasing LBS process time than previous method because node receives location information from location information server when handoff is occurred.

• The KIPS Transactions:PartD
• /
• v.18D no.4
• /
• pp.225-236
• /
• 2011

Various applications of LBS (Location Based Services) are being developed to provide the customized service depending on user's location with progress of wireless communication technology and miniaturization of personalized device. To effectively process an amount of vehicles' location data, LBS requires the techniques such as vehicle observation, data communication, data insertion and search, and user query processing. In this paper, we propose the historical location index, GIP-FB (Group Insertion tree with Flexible Buffer Node) and the flexible buffer node technique to adjust the cost of data insertion and search. the designed GIP+ based index employs the buffer node and the projection storage to cut the cost of insertion and search. Besides, it adjusts the cost of insertion and search by changing the number of line segments of the buffer node with user defined time interval. In the experiment, the buffer node size influences the performance of GIP-FB by changing the number of non-leaf node of the index. the proposed flexible buffer node is used to adjust the performance of the historical location index depending on the applications of LBS.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1529-1532
• /
• 2004

A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.339-345
• /
• 2014

This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.

• Journal of Information Processing Systems
• /
• v.6 no.2
• /
• pp.147-162
• /
• 2010

In this paper, we present a fine-grained localization algorithm for wireless sensor networks using a mobile beacon node. The algorithm is based on distance measurement using RSSI. The beacon node is equipped with a GPS sender and RF (radio frequency) transmitter. Each stationary sensor node is equipped with a RF. The beacon node periodically broadcasts its location information, and stationary sensor nodes perceive their positions as beacon points. A sensor node's location is computed by measuring the distance to the beacon point using RSSI. Our proposed localization scheme is evaluated using OPNET 8.1 and compared with Ssu's and Yu's localization schemes. The results show that our localization scheme outperforms the other two schemes in terms of energy efficiency (overhead) and accuracy.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.757-766
• /
• 2007

Location services are used in mobile ad hoc and hybrid networks to locate either the geographic position of a given node in the network or a data item. One of the main usages of position location services is presented in location based routing algorithms. In particular, geographic routing protocols can route messages more efficiently to their destinations based on the destination node's geographic position, which is provided by a location service. In this paper, we propose an adaptive location service on the basis of fuzzy logic called FHLS (Fuzzy Hierarchical Location Service) for mobile ad hoc networks. The adaptive location update scheme using the fuzzy logic on the basis of the mobility and the call preference of mobile nodes is used by the FHLS. The performance of the FHLS is to be evaluated by a simulation, and compared with that of existing HLS scheme.