• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.9
• /
• pp.355-362
• /
• 2022

Smart Farm, which combines information and communication technologies with agriculture is moving from simple monitoring of the growth environment toward discovering the optimal environment for crop growth and in the form of self-regulating agriculture. To this end, it is important to collect related data, but it is more important for farmers with cultivation know-how to analyze the collected data from various perspectives and derive useful information for regulating the crop growth environment. In this study, we developed a web service that allows farmers who want to obtain necessary information with data related to crop growth to easily analyze data. Web-based data analysis serivice developed uses R language for data analysis and Express web application framework for Node.js. As a result of applying the developed data analysis service together with the growth environment monitoring system in operation, we could perform data analysis what we want just by uploading a CSV file or by entering raw data directly. We confirmed that a service provider could provid various data analysis services easily and could add a new data analysis service by newly adding R script.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.4A
• /
• pp.287-293
• /
• 2011

This paper investigates the applicability of a piezoelectric cantilever for energy supply of wireless sensor node used in structural health monitoring of bridges. By combining the constitutive equation of piezoelectric material and the dynamic equation of cantilever structure, the coupled governing equation for cantilever equipped piezoelectric patches has been addressed in matrix form. Forced excitation tests were carried out to validate the numerical model and to investigate the power output characteristics of the energy harvester. From the numerical simulation based on the measured bridge accelerations under KTX, Saemaul, Mugunghwa trains, the peak powers generated from the device were found to be 28.5 mW, 0.65 mW, 0.51 mW respectively. It is revealed from the results that bridge vibrations caused by moving loads is not a practical source for energy harvesting because of its low acceleration level, low frequency and short duration.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.493-502
• /
• 2007

In this paper, we propose a handoff-aware DiffServ scheduler which intends to guarantee various QoS requirements of multimedia services for mobile nodes in TDD/CDMA based wireless networks. TDD is widely used duplexing mechanism in wireless communications. Unlike FDD, TDD allows a node to symmetrically communicate with a base station by using a single frequency band, resulting in high utilization of wireless resources. DiffServ is regarded as a relatively simple QoS support mechanism and thus it is easy to be extended. This is because DiffServ is not a per-flow based mechanisms and it does not require any signaling protocol. However, previously proposed DiffServ schedulers for wired networks can not be deployed directly into wireless networks since they do not consider properties of wireless networks. As a solution to the problem, DSS(DiffServ Supporting Scheduler) was proposed. DSS uses uplink channel, which is originally used for a node to require a base station to transmit packets, to support QoS efficiently. However, QoS does not consider handoff so that it can not support QoS for moving nodes from one cell to the other cell. Therefor. the proposed handoff support QoS mechanism is necessary for TCC/CDMA networks. The proposed scheme allows a mobile node to achieve seamless service without QoS degradation even for the handoff duration.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• The KIPS Transactions:PartC
• /
• v.18C no.3
• /
• pp.167-178
• /
• 2011

As the growth of ubiquitous services, various types of ad hoc networks have emerged. In particular, wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are widely known ad hoc networks, but there are also other kinds of wireless ad hoc networks in which the characteristics of the aforementioned two network types are mixed together. This paper proposes a variant of the Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol modified to be suitable in such a combined network environment. That is, the proposed routing protocol provides node detection and route discovery/maintenance in a network with a large number of mobile sensor nodes, while preserving node mobility, network connectivity, and energy efficiency. The proposed routing protocol is implemented with a multi-hop multi-path algorithm, a topology reconfiguration technique using node movement estimation and vibration sensors, and an efficient path selection and data transmission technique for a great many moving nodes. In the experiments, the performance of the proposed protocol is demonstrated by comparing it to the conventional LEACH protocol.

• Journal of Life Science
• /
• v.23 no.11
• /
• pp.1409-1414
• /
• 2013

Lymph node (LN) is the sites where mature lymphocytes become stimulated to respond to invading pathogens in the body. Lymphocytes screen the surfaces of pathogen-carrying antigen-presenting cells for cognate antigens, while moving along stromal structural back bone. Fibroblastic reticular cells (FRC) is stromal cell forming the 3 dimensional structure networks of the T cell rich zones in LN, and provide a guidance path for immigrating T lymphocytes. In these cooperative environments, the cell to cell bidirectional interactions between FRC and T cells in LN are therefore essential to the normal functioning of these tissues. Not only do FRCs physically construct LN architecture but they are essential for regulating T cell biology within these domains. FRC interact closely with T lymphocytes, is providing scaffolds, secreting soluble factors including cytokine in which FRCs influence T cell immune response. More recently, FRC have been found to induce peripheral T cell tolerance and regulate the extent to which newly activated T cells proliferate within LN. Thus, FRC-T cell crosstalk has important consequences for regulating immune cell function within LN. In addition, FRC have profound effects on innate immune response by secreting anti-microbial peptides and complement, etc in the inflammatory milieu. In summary, we propose a model in which FRC engage in a bidirectional touch to increase the T cell biological efficiency between FRC and T cells. This collaborative feedback loop may help to maintain tissue function during inflammation response.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3A
• /
• pp.163-172
• /
• 2011

The CFTA girder developed is a concrete filled steel tubular system with arched shape and external post-tensioning (PT) tendons which control the initial camber and the bending stress of the girder. In the present study the effects of the PT tendons on the dynamic behavior of the girder subjected to a moving vehicle load are numerically investigated. Various levels for the tendon quantity and the tendon forces are considered, using the existing FE model of the girder. The vehicle considered is a DB-24 truck and is modeled with two tracks-three axles. Equivalent-load pulse time histories are applied to each node to simulate the moving vehicle, depending on the time of arrival and the discretization. The vehicle speeds are varied from 40 km/hr to 100 km/hr with increment of 20 km/hr. The analysis results show that the tendon forces do not produce any influences on the dynamic responses of the girder. However the dymamic deflection of the girder increases when a smaller amount of tendons is used. The Dynamic Amplification Factors (DAF) are evaluated based on the static and dynamic responses. Much lower values of the DAF are obtained, even no tendons applied, than those provided by the design criteria of the AASHTO LRFD and the Korea Highway Standard Specification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.271-280
• /
• 2014

In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.451-462
• /
• 2008

Recently, with the advent of applications using locations of moving objects, it becomes crucial to develop efficient index schemes for spatio-temporal databases. The $TPR^*$-tree is most popularly accepted as an index structure for processing future-time queries. In the $TPR^*$-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a new method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers both the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original $TPR^*$-tree significantly.