• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1294-1300
• /
• 2010

In an environment where all nodes move, the sensor node receives anchor node's position information within communication radius and modifies the received anchor node's position information by one's traveled distance and direction in saving in one's memory, where if there at least 3, one's position is determined by performing localization through trilateration. The proposed localization mechanisms have been simulated in the Matlab. In an environment where certain distance is maintained and nodes move towards the same direction, the probability for the sensor node to meet at least 3 anchor nodes with absolute coordinates within 1 hub range is remote. Even if the sensor node has estimated its position with at least 3 beacon information, the angle ${\theta}$ error of accelerator and digital compass will continuously apply by the passage of time in enlarging the error tolerance and its estimated position not being relied. Dead reckoning technology is used as a supplementary position tracking navigation technology in places where GPS doesn't operate, where one's position can be estimated by knowing the distance and direction the node has traveled with acceleration sensor and digital compass. The localization algorithm to be explained is a localization technique that uses Dead reckoning where all nodes are loaded with omnidirectional antenna, and assumes that one's traveling distance and direction can be known with accelerator and digital compass. The simulation results show that our scheme performed better than other mechanisms (e.g. MCL, DV-distance).

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.8
• /
• pp.750-757
• /
• 2011

Wireless Sensor Network is composed of a lot of sensor nodes that are densely deployed in a field. So generally this sensor nodes are spreaded using Helicopter or Fixed wing. Each node delivers own location and acquired information to user when it detects specific events. In this paper, we propose localization algorithm without range information in wireless sensor network using helicopter. Helicopter broadcasts periodically beacon signal for sensor nodes. Sensor nodes stored own memory this beacon signal until to find another beacon point(satisfied special condition). This paper develops a localization mechanism using the geometry conjecture(perpendicular bisector of a chord) to know own location. And the simulation results demonstrate that our localization scheme outperforms Centroid, APIT in terms of a higher location accuracy.

• Journal of Digital Convergence
• /
• v.13 no.7
• /
• pp.207-212
• /
• 2015

The sensor network that is component of the Internet of Things require a lot of research to select the best route to send information to the anchor node, to collect a number of environment and cost efficient for communication between the sensor life. On the sensor network in one of the components of IOT's environment, sensor nodes are an extension device with low power low capacity. For routing method for data transmission between the sensor nodes, the connection between the anchor and the node must be accurate with in adjacent areas relatively. Localization CA (Centroid Algorithm) is often used although an error frequently occurs. In this paper, we propose a range-free localization method between sensor nodes based on the Radical Line in order to solve this problem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.864-866
• /
• 2009

무선 센서 네트워크에 대한 연구에서 노드의 위치는 매우 중요하다. 본 논문에서는 무선 센서 네트워크에서 노드 간의 연결성 정보와 신호 세기를 이용한 거리를 이용해서 해당 노드의 위치를 추정하는 기법을 제안한다. 이 기법을 사용하면 앵커 노드를 기준으로 미지 노드들의 상대적인 위치를 찾아서 전체적인 맵을 구성할 수도 있고 노드가 이동하는 경우에도 쉽게 노드의 위치를 찾을 수 있다. 시뮬레이션으로 이 방법의 정확성과 효율성을 검증하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.65-75
• /
• 2009

In Wireless Sensor Network, the sensor node localization is important issue for information tracking, event detection, routing. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning system, then all the other nodes are approximately localized using various algorithms based on a coordinate system of anchor DV-Hop is a localized, distributed, hop by hop positioning algorithm in wireless sensor network where only a limited fraction of nodes have self positioning capability. However, instead of uniformly distributed network, in anisotropic network with possible holes, DV-Hop's performance is very low. To address this issue, we propose Group based DV-Hop (GDV-Hop) algorithm. Best contribution of GDV-Hop is that it performs localization with reduced error compared with DV-Hop in anisotropic network.

• The KIPS Transactions:PartB
• /
• v.14B no.3 s.113
• /
• pp.183-190
• /
• 2007

VoiceXML is new markup language which is designed for web resource navigation via voice based on XML. An application using VoiceXML is classified into mutual-controlled and machine-controlled form dialog structure. Such dialog structures can't construct service which provide free navigation of web resource by user because a scenario is decided by application developer. In this paper, we propose VoiceXML application structure using user-controlled form dialog system which decide service scenario according to user's intention. The proposed application automatically detects recognition candidates from requested information by user, and then system uses recognition candidate as voice-anchor. Also, system connects each voice-anchor with new voice-node. An example of proposed system, we implement news service with IT term dictionary, and we confirm detection and registration of voice-anchor and make an estimate of hit rate about measurement of an successive offer from information according to user's intention and response speed. As the experiment result, we confirmed possibility which is more freely navigation of web resource than existing VoiceXML form dialog systems.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.123-129
• /
• 2009

It is important to locate nodes in the research of wireless sensor network. In this paper, we propose a method that estimates the positions of nodes by using adjacent node information and signal strength in wireless sensor network. With this method, we can find positions of nodes easily because we use Information that nodes have. And we can make a map for all the nodes because we can measure a relative position for an node whose position is not known based on anchor nodes whose positions are already known. In addition, we can confirm whether nodes are placed appropriately. We confirmed that we can locate positions of unknown nodes with small error through verifying the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.650-662
• /
• 2005

A robust repositioning method is required for annotations to always maintain proper positions when original documents were modified. Robust anchoring in the XML document provides better anchoring results when it includes features of structured documents as well as annotated texts. This paper proposes robust annotation anchoring method in XML document. To do this, this work presents annotation information as logical structure trees, and creates candidate anchors by analyzing matching relations between the annotation and document trees. To select the appropriate candidate anchor among many candidate anchors, this work presents several anchoring criteria based on the textual and label context of anchor nodes in the logical structure trees. As a result, robust anchoring is realized even after various modifications of contexts in the structured document.

• 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 Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1436-1449
• /
• 2009

The value of sensing information is decided according to positions of sensor nodes, which are very important in sensor networks. In this paper, we propose a method that estimates positions of nodes by using adjacent node information and received signal strength in a sensor network. With the proposed method, we can find positions of nodes easily because we use information that nodes have. Moreover, we can find distribution easily for all the nodes because we can measure a relative position for a node whose position is not known based on anchor nodes whose positions are already known. We utilized Use case diagram, activity diagram and State machine diagram among several diagrams of UML to implement proposed method in sensor networks that is dynamic system. We can understand exact flow for each function of the proposed method in node position estimation system can be implemented easily. And we can be confirmed that the position of estimated nodes has a little error.