• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.889-900
• /
• 2012

In wireless sensor networks, the positioning scheme using received signal strength (RSS) has been widely considered. Appropriate estimation of path-loss exponent (PLE) between a sensor node and an anchor node plays a key role in reducing position error in this RSS-based positioning scheme. In the conventional researches, a sensor node directly uses the PLEs measured by its nearest anchor node to calculate its position. However, the actual PLE between a sensor node and the anchor node can be different from the PLE measured by its nearest anchor node. Thus, if a sensor node directly uses the PLEs measured by its nearest anchor node, the estimated position is different from the actual position of the sensor node with a high probability. In this paper, we describe the method how a sensor node estimates PLEs from the anchor nodes of interest by itself and calculates its position based on these self-estimated PLEs. Especially, our proposal suggests the mechanism to iteratively calculate the PLEs depending on the estimated distances between a sensor node and anchor nodes. Based on the recalculated PLEs, the sensor node reproduces its position. Through simulations, we show that our proposed positioning scheme outperforms the traditional scheme in terms of position error.

• Journal of Bio-Environment Control
• /
• v.15 no.2
• /
• pp.173-176
• /
• 2006

The relationship between source leaf position and photo-assimilate translocation and distribution was characterized for tomato (Lycopersicon esculentum Mill) grown in the greenhouse. Three different positions of source leaf on the stem (first node above or below the first fruit cluster and $5^{th}$ node above the first fruit cluster) were tested for their influence on $^{14}CO_2$ assimilation and transfer to different parts of the plant. The leaves at the $5^{th}$ node above the first fruit cluster transferred the highest (57%) proportion of $C^{14}$ to other plant parts, followed by leaves home on the first node below the first fruit cluster (50%), and the first node above the first fruit cluster (39%). In all treatments, fruits served as the strongest sink for $C^{14}$, followed by stem, leaf, and root tissues. The leaf home on the $5^{th}$ node above the first fruit cluster transferred the largest amount of $C^{14}$ to the second fruit cluster.

• Proceedings of the Korean Society for Bio-Environment Control Conference
• /
• 2001.04b
• /
• pp.79-80
• /
• 2001

This study was conducted to estimate rooting and shooting in single-node cuttings (SNC) of roses 'Rote Rose' and 'Teresa' to several conditions: growth stage, node position, and leaf area of cutting, so that single-stemmed roses (SSR) could be used in rose factory system. There was no effects of growth stage of flowering shoots far cutting on the rooting and shooting of SNC in both of the two cultivars. However, the node position and leaf area of cuttings significantly affected the rooting and shooting of SNC: the speed was accelerated with larger leaf area and upper node cuttings, but the rate showed little difference as above 95%. Based on above results, rooting and shooting in SNC was forced by leaf area mainly, followed by node positions. On the other hand, flowering rate of shoots from SNC was improved mainly with larger leaf area in cuttings. Shoots of 45cm-longer, qualified for rose factory system, increased with lower node and larger leaf area significantly. Therefore, it could be said that the potential growth of shoots from SNC would be influenced mainly by leaf area, followed by node position on cutting.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.2
• /
• pp.35-43
• /
• 2018

In this paper, we propose a grid-based efficient routing protocol for a mobile sink in wireless sensor networks. In the proposed protocol, the network is partitioned into grids and each grid has a grid head. For the efficient routing to a mobile sink, the proposed protocol uses a mobile sink representative node to send the data to a mobile sink and grid heads are used as a mobile sink representative node. Furthermore, the proposed protocol uses nodes in the boundary of the center grid as position storage nodes. The position storage nodes store the position of a mobile sink representative node and provide source nodes with it for data delivery. With these features, the proposed protocol can reduce a lot of overhead to update the position information and improve the delay of data delivery to a mobile sink. The proposed protocol performs better than other protocols in terms of the delay and the energy consumption per node in the performance evaluation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.364-367
• /
• 2007

We combined CC2431(Chipcon, Norway), as the platform for the Indoor Location Tracking, which follows Zigbee/IEEE802.15.4 standards in RSSI (Received Signal Strength Indicator) and Base Station Node and then, embodied Indoor Location Tracking System. CC2431 is composed of the Reference Node that transfer its current position at the designated place and the Blind Node. The Blind node receives the current position(X and Y coordinates) of the Reference Node fields which are being contiguous and also, calculates its current position and transfers it to the Base Station Node. The base station node is used for receiving the current position of blind node and passing its data to the PC as a gateway. We can make sure where is the Blind Node not only from the out-of-the-way place of the server side but from the outside in a real-time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.495-512
• /
• 2006

Recently, researches on a future position prediction of moving objects have been progressed as the importance of the future position retrieval increases. New index structures are required to efficiently retrieve the consecutive positions of moving objects. Existing index structures significantly degrade the search performance of the moving objects because the search operation makes the unnecessary extension of the node in the index structure. To solve this problem, we propose a space partition based index structure considering the mobility of moving objects. To deal with the overflow of a node, our index structure first merges it and the sibling node. If it is impossible to merge them, our method splits the overflow node in which moving properties of objects are considered. Our index structure is always partitioned into overlap free subregions when a node is split. Our split strategy chooses the split position by considering the parameters such as velocities, the escape time of the objects, and the update time of a node. In the internal node, the split position Is determined from preventing the cascading split of the child node. We perform various experiments to show that our index structure outperforms the existing index structures in terms of retrieval performance. Our experimental results show that our proposed index structure achieves about $17%{\sim}264%$ performance gains on current position retrieval and about $107%{\sim}19l%$ on future position retrieval over the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1388-1403
• /
• 2011

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4971-4987
• /
• 2019

Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.3
• /
• pp.268-274
• /
• 2013

In this paper, the performance analysis of optics-based sensor node localization using ToF (Time of Flight) scheme is conducted. Generally, the position of the sensor node is calculated on the base station. And the base station scans neighboring sensor nodes with a laser. The laser which is reflected from one sensor node, however, can be reached to the base station at different angles according to the scanning resolution. This means that the error of the reached angle can increase and one node may be recognized as different nodes. Also the power of laser can decrease because the laser signal spread. Thus the sensor node which is located at a long distance from the base station cannot be detected. In order to overcome these problems which can be occurred in localization using ToF, the beam spot, the scanning resolution, the size of reflector and the power of laser at the sensor node were analyzed. It can be expected that the consequence of analysis can be provided in acquisition of accurate position of sensor node and construction of optics-based sensor node localization system.