• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• Interaction and multiscale mechanics
• /
• v.4 no.4
• /
• pp.273-289
• /
• 2011

The vibration response of the bridges under the moving vehicular load is of importance for engineers to estimate the serviceability of existing bridges and to design new bridges. This paper deals with the three dimensional vibration analysis of prestressed concrete bridges under moving vehicles. The prestressed bridges are modeled by four-node isoparametric flat shell elements with the transverse shearing deformation taken into account. The usual five degrees-of-freedom (DOFs) per node of the element are appended with a drilling DOF to accommodate the transformation of the local stiffness and mass matrices to the global coordinates. The vehicle is modeled as a single or two-DOF system. A single-span prestressed Tee beam and two-span prestressed box-girder bridge are studied as the two numerical examples. The effects of prestress forces on the natural frequencies and dynamic responses of the bridges are investigated.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.19-29
• /
• 2004

Recently, studies have been performed to improve the cache performance of the R-Tree in main memory. A general mothed to improve the cache performance of the R-Tree is to reduce size of an entry so that a node can store more entries and fanout of it can increase. However, this method generally requites additional process to reduce information of entries and do not support incremental updates. In addition, the cache miss always occurs on moving between a parent node and a child node. To solve these problems efficiently, this paper proposes and evaluates the PR-Tree that is an extended R-Tree indexing method using prefetching in main memory. The PR-Tree can produce a wider node to optimize prefetching without additional modifications on the R-Tree. Moreover, the PR-Tree reduces cache miss rates that occur in moving between a parent node and a child node. In our simulation, the search performance, the update performance, and the node split performance of the PR-Tree improve up to 38%. 30%, and 67% respectively, compared with the original R-Tree.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.188-198
• /
• 2002

In this paper, we propose an active network to support reliable data transmission in the mobile ad-hoc network. The active network uses DSR(Dynamic Source Routing) protocol as its basic routing protocol, and uses source and destination nodes as key active nodes. For reliable improvement the source node is changed to source active node to add function that its buffer to store the last data with the flow control for data transmission per destination node. The destination node is changed to destination active node to add function that it requests the re-transmission for data that was not previously received by the destination active node with the flow control for data reception per source active node As the result of evaluation. we found the proposed active network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 95% data reception rate, which is improvement of 3.5737% reception rate compared with none active network, for continuously fast moving mobile ad-hoc network.

• Journal of IKEEE
• /
• v.7 no.1 s.12
• /
• pp.63-71
• /
• 2003

In this paper, we propose an DSR(Dynamic Source Routing) protocol to support QoS for reliable data transmission in the mobile ad-hoc network. The proposed algorithm uses DSR protocol to support QoS as its basic routing protocol, and uses the nodes which are between source and destination nodes as key QoS support. Because of moving nodes there is some problem that is restricted reliable data transmission. For solve this problem, source node set up the QoS link with destination node. The nodes that are located at QoS link and find out loss of transmission path save the transmitting data packets. Those search a new transmission path to destination node and transmit the saved data packet to destination node. As the result of evaluation, we found the proposed QoS network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 96% data reception rate, which is improvement of 3.7737% reception rate compared with none QoS network, for continuously fast moving mobile ad-hoc network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.703-712
• /
• 2015

This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm in the UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is moving in the direction where a destination node is located, but also the node that has the highest density. The TGF algorithm using a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms), and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

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

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.852-860
• /
• 2019

In this paper, we proposed a new trilateration technique based on exponential moving average (EMA) filter with adaptive signal model which enhances accuracy of positioning system even if the RSSI changes randomly due to movement of obstacles or blind node in indoor environment. In the proposed scheme, three fixed transmitters sent out the signal to blind node. The transmitter decides the location of the blind node based on RSSI and it estimates the cause of RSSI fluctuation which is interference of obstacle or movement of blind node. When the path between blind node and transmitter has become NLOS path because of obstacles, the transmitter ignores the measured RSSI in NLOS path and replace estimated RSSI in LOS environment. In the other case, the transmitter updated the new RSSI to represent of movement of blind node. The proposed scheme has been verified on a ZigBee testbed and we proved the improved positioning accuracy compared to the existing indoor position system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1828-1834
• /
• 2004

With the rapid development of wireless communications and mobile technologies, requirements of various services based on moving objects like location-based services and mobile applications services have been increased. In this paper, we propose an index structure which can improve the performance on trajectory-based query especially, one of the various query types for moving objects in mobile applications. It maintains link table(L-Table) to obtain good efficiency on retrieval and insertion performance of the existing TB(Trajectory Bundle)-tree proposed for trajectory-based query of moving objects. The L-Table contains page number in disk and memory pointers pointing the leaf node with the first and last line segment of moving objects in order to directly access preceding node. In addition, we design to reside a part of whole index in main memory by preserving a fixed size of buffer in case of being restricted by available main memory. Finally, experimental results with various data sets show that the proposed technique is superior to the existing index structures with respect to insertion and trajectory-based query.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.156-162
• /
• 2020

Wireless Sensor Network (WSN) field is mainly studied to monitor and characterize large-scale physical environments to track various environmental or physical conditions, such as temperature, pressure, wind speed and humidity. WSN can be used in various applications such as wild surveillance, military target tracking and monitoring, dangerous environmental exploration and natural disaster relief. We design probabilistic mobile models that apply to mobile ad hoc network mobile environments. A probabilistic shift model proposed by dividing the number of moving nodes and the distance of travel into two categories to express node movement characteristics. The proposed model of movement through simulation was compared with the existing random movement model, ensuring that the width and variation rate of the first node node node node (FND) was stable regardless of the node movement rate. In addition, when the proposed mobile model is applied to the routing protocol, the superiority of network life can be verified from measured FND values. We overcame the limitations of the existing random movement model, showing excellent characteristics in terms of energy efficiency and stable in terms of changes in node movement.