• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1045-1053
• /
• 2012

Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.116-120
• /
• 2011

In this paper, we have designed and implemented the integrated protocol gateway for the integration of CAN and Profibus networks. To do that, we used the Switched Ethernet as Backbone network, and each fieldbus network is connected by CAN/Ethernet or Profibus/Ethernet gateway, and each gateway perform the translation between fieldbus and Ethernet frames. Futhermore, we realized the real-time features in the environment of the Switched Ethernet by applying the distributed hard real-time scheduling algorithm among each gateways. To implement tht CAN/Ethernet and Profibus/Ethernet gateways, we used the Linux of kernel 2.6.31.12 real-time patched version(PREEMTED_RT), and we could verify successful message translation and real-time features through real implementation.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.51-56
• /
• 2009

Time synchronization algorithm in wireless sensor networks is essential to various applications such as object tracking, data encryption, duplicate detection, and precise TDMA scheduling. This paper describes CDRS that is a time synchronization algorithm using the Clock Drift rate and Reference Signals between two sensor nodes. CDRS is composed of two steps. At first step, the time correction is calculated using offset and the clock drift rate between the two nodes based on the LTS method. Two nodes become a synchronized state and the time variance can be compensated by the clock drift rate. At second step, the synchronization node transmits reference signals periodically. This reference signals are used to calculate the time difference between nodes. When this value exceeds the maximum error tolerance, the first step is performed again for resynchronization. The simulation results on the performance analysis show that the time accuracy of the proposed algorithm is improved, and the energy consumption is reduced 2.5 times compared to the time synchronization algorithm with only LTS, because CDRS reduces the number of message about 50% compared to LTS and reference signals do not use the data space for timestamp.

• Research in Plant Disease
• /
• v.8 no.2
• /
• pp.84-91
• /
• 2002

Disease forecasting in Korea was first studied in the Department of Fundamental Research, in the Central Agricultural Technology Institute in Suwon in 1947, where the dispersal of air-borne conidia of blast and brown spot pathogens in rice was examined. Disease forecasting system in Korea is operated based on information obtained from 200 main forecasting plots scattered around country (rice 150, economic crops 50) and 1,403 supplementary observational plots (rice 1,050, others 353) maintained by Korean government. Total number of target crops and diseases in both forecasting plots amount to 30 crops and 104 diseases. Disease development in the forecasting plots is examined by two extension agents specialized in disease forecasting, working in the national Agricul-tural Technology Service Center(ATSC) founded in each city and prefecture. The data obtained by the extension agents are transferred to a central organization, Rural Development Administration (RDA) through an internet-web system for analysis in a nation-wide forecasting program, and forwarded far the Central Forecasting Council consisted of 12 members from administration, university, research institution, meteorology station, and mass media to discuss present situation of disease development and subsequent progress. The council issues a forecasting information message, as a result of analysis, that is announced in public via mass media to 245 agencies including ATSC, who informs to local administration, the related agencies and farmers for implementation of disease control activity. However, in future successful performance of plant disease forecasting system is thought to be securing of excellent extension agents specialized in disease forecasting, elevation of their forecasting ability through continuous trainings, and furnishing of prominent forecasting equipments. Researches in plant disease forecasting in Korea have been concentrated on rice blast, where much information is available, but are substan-tially limited in other diseases. Most of the forecasting researches failed to achieve the continuity of researches on specialized topic, ignoring steady improvement towards practical use. Since disease forecasting loses its value without practicality, more efforts are needed to improve the practicality of the forecasting method in both spatial and temporal aspects. Since significance of disease forecasting is directly related to economic profit, further fore-casting researches should be planned and propelled in relation to fungicide spray scheduling or decision-making of control activities.