• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.32-38
• /
• 2012

Each sensor node can know its location in several ways, if the node process the information based on its geographical position in sensor networks. In the localization scheme using GPS, there could be nodes that don't know their locations because the scheme requires line of sight to radio wave. Moreover, this scheme is high costly and consumes a lot of power. The localization scheme without GPS uses a sophisticated mathematical algorithm estimating location of sensor nodes that may be inaccurate. AHLoS(Ad Hoc Localization System) is a hybrid scheme using both GPS and location estimation algorithm. In AHLoS, the GPS node, which can receive its location from GPS, broadcasts its location to adjacent normal nodes which are not GPS devices. Normal nodes can estimate their location by using iterative triangulation algorithms if they receive at least three beacons which contain the position informations of neighbor nodes. But, there are some cases that a normal node receives less than two beacons by geographical conditions, network density, movements of nodes in sensor networks. We propose an indirect localization scheme for low-density sensor nodes which are difficult to receive directly at least three beacons from GPS nodes in wireless network.

• 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 the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.77-85
• /
• 2013

Recently, location information based routing protocol has been studied to estimate end-to-end path in wireless ad-hoc network. This protocol assumes all nodes can get heir location information via GPS devices and floods only limited area with routing message through acquired location information. Therefore, this protocol has advantage that can reduce the number of routing message than the existing IP-based routing protocols. In addition, all nodes enabling this protocol must acquire their own location information to participate in the location-based routing. However, recent because of the miniaturization of sensor node, sensor node without GPS function has been launched. Therefore in case of the sensor node that does not know location information, it is impossible to participate in the ad hoc network configuration and location information based routing. In this paper, a virtual location information based routing scheme is proposed for wireless nodes without GPS function to be able to participate in location information based routing within ad hoc network environments consisting of wireless nodes with GPS function and wireless nodes without GPS function. Therefore, the proposed protocol has the advantage that a wireless node without a GPS function is able to participate in ad hoc network configuration and the location information based routing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.133-140
• /
• 2012

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.4
• /
• pp.1-7
• /
• 2012

This paper proposes a new indoor location recognition system using a ZigBee network and a global positioning system(GPS). The proposed location recognition system applies GPS values that are mainly used for outdoor location recognition, to indoor location recognition; hence the techniques conventionally separated for the indoor and outdoor location recognition are integrated into one location recognition technique. The proposed system recognizes a location using the distance between nodes. Although the distance between nodes can be calculated by measuring the strength of the received ZigBee signals, generally the measured distance is not accurate and has high error rates since the strength of the ZigBee signals is different depending on the distance. In order to reduce the error rate, we have subdivided the output power of the received ZigBee signals into five levels. When a moving node generates a signal, each fixed node transmits the received signal strength and its own GPS information to other nodes, so the moving node can find its own accurate location in terms of the received signals.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.197-203
• /
• 2010

The problem of location awareness in wireless sensor networks where nodes use GPS (Global Positioning System), remains challenging problem, when considering the required large energy consumption during the localization phase. In this paper we designed hardware for GPS based localization and propose a framework, called ELS, to consume low cost energy. In the ELS framework, sensor nodes are equipped with GPS. Because GPS spends large energy for position awareness, conventional localization algorithms cannot use GPS-device. We try to find a solution for efficient energy expenditure of GPS. Finally, we derive optimal transmission power of GPS data and a scheme of localization through experiment and simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.385-390
• /
• 2008

The Study of environment monitoring through huge network of wireless sensor node is worked with activity. The sensor nodes must be very small, light and low cost. The localization which may determine where a given node is physically located in a network is one of the quite important problems for wireless sensor network. But simple localization method is required as excluding the usage of GPS(Global Positioning System) by the limit condition such as the node size, costs, and so on. In this paper, very simple method using connectivity for the outdoor RF communication environment is proposed. The proposed method is demonstrated through simulation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.16 no.3
• /
• pp.1-11
• /
• 2013

This study developed the algorithm of location-based service for supplying the efficient tourism service to traveller using mobile device and applied it to the Jeonju HANOK village. First, the location service was advanced using algorithm coupling with GPS error range and travel speed in single line, and with GPS location and nearest neighbor method to line in multiple one. Also this study developed a program using DuraMap-Xr spatial engine for establishing topology to Node and Link in line automatically. And the foundation was prepared for improving travel convenience by programming location-based service technology to single and multiple lines based on Blackpoint-Xr mobile application engine.

• 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 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.