• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1397-1405
• /
• 2012

Cooperative communications play a important role in increasing frame transmission rate at wireless communication networks where frequency resource is strictly limited. In this paper, we did a research on how to select the helper nodes that are very import in cooperative communications. As a prelude study in this research field, we carried out performance comparison of three helper node selection schemes using computer simulation. The system throughput was used as the performance measure and the random way point mobility model, where every communicating nodes move around within the designated communication range, was used.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.2 s.8
• /
• pp.173-180
• /
• 1996

In a grid based data transformation, the different gridding methods provide different interpretations of scattered data because each method calculate grid node values using a different weighted mathematical algorithms. Therefore, it is necessary to review the interpolated characteristics of some gridding methods according to search distance, search area and search options before determing the best method with a data set. For this, in this paper, six different gridding methods with the same search conditions are applied to a scattered data obtained from sterro-plotter. The interpolated characteristics of the scattered geographic data considered through comparison of coincidence between the data point and the grid node being interpolated. And also, shows the real application of gridding methods through calculating volumes and creating cross sections.

• International Journal of Computer Science & Network Security
• /
• v.22 no.2
• /
• pp.167-174
• /
• 2022

Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

• Steel and Composite Structures
• /
• v.45 no.3
• /
• pp.331-348
• /
• 2022

The main goal of this article is to develop the finite element formulation based on the nonlocal strain gradient and the refined higher-order deformation theory employing a new function f(z) to investigate the static bending and free vibration of functionally graded porous (FGP) nanobeams. The proposed model considers the simultaneous effects of two parameters: nonlocal and strain gradient coefficients. The nanobeam is made by FGP material that exists in un-even and logarithmic-uneven distribution. The governing equation of the nanobeam is established based on Hamilton's principle. The authors use a 2-node beam element, each node with 8 degrees of freedom (DOFs) approximated by the C¹ and C² continuous Hermit functions to obtain the elemental stiffness matrix and mass matrix. The accuracy of the proposed model is tested by comparison with the results of reputable published works. From here, the influences of the parameters: nonlocal elasticity, strain gradient, porosity, and boundary conditions are studied.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.27-36
• /
• 2004

Frequent occurrence of binding update messages may incur high overhead in Mobile IP supporting users mobility. Thus, it needs to develop algorithms to deal with the situation. In this paper, we propose new lifetime assignment schemes for dynamic binding update considering the locality property related with mobile node's movement. Each mobile node maintains a profile which is based on log containing useful information about its visiting subnets. That is, it determines dynamic binding update lifetime for currently visiting subnet by computing past mean resident time recorded in the profile. In addition, we note that the resident time depends on the time when each node enters a subnet and thus, we devise another lifetime assignment algorithm. Extensive experiments are made to compare our schemes with existing Mobile IPv6 where major facts for performance comparison are both the number of binding update messages and the number of binding request messages. From the results, we come to know that our schemes obtain highly considerable performance improvements in terms of communication cost by decreasing the number of those messages.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.133-138
• /
• 2015

In this paper, we propose a method for improving the lifetime of the sensor network SEP through the wireless sensor network divided into two spaces by reducing the transmission distance of the cluster head in the layer in the distance. With reference to the position information of the node, the base station divides the layer based on the midpoint of the nearest node and the furthest distance away from the base station node. And the cluster head in the outer layer far from the base station is transmitted the data to the base station via the cluster head in the inner layer base station to transmit data. That is, we are proposed the layered SEP by reducing the transmission distance of the cluster head in the outer layer for the energy consumption to a minimum. The proposed algorithm is verified by comparison with the existing SEP.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.49 no.1
• /
• pp.69-72
• /
• 2004

Somaclonal variation, defined as phenotypic and genetic variations among regenerated plants from a parental plant, could be caused by changes in chromosome structure, single gene mutation, cytoplasm genetic mutation, insertion of transposable elements, and DNA methylation during plant regeneration. The objective of this study was to evaluate DNA variations among somaclonal variants from the cotyledonary node culture in soybean. A total of 61 soybean somaclones including seven $\textrm{R}_1$ lines and seven $\textrm{R}_2$ lines from Iksannamulkong as well as 27 $\textrm{R}_1$ lines and 20 $\textrm{R}_2$ lines from Jinju 1 were regenerated by organogenesis from the soybean cotyledonary node culture system. Field evaluation revealed no phenotypic difference in major agronomic traits between somaclonal variants and their wild types. AFLP and SSR analyses were performed to detect variations at the DNA level among somaclonal variants of two varieties. Based on AFLP analysis using 36 primer sets, 17 of 892 bands were polymorphic between Iksannamulkong and its somaclonal variants and 11 of 887 bands were polymorphic between Jinju 1 and its somaclonal variants, indicating the presence of DNA sequence change during plant regeneration. Using 36 SSR markers, two polymorphic SSR markers were detected between Iksannamulkong and its somaclonal variants. Sequence comparison amplified with the primers flanking Satt545 showed four additional stretches of ATT repeat in the variant. This suggests that variation at the DNA level between somaclonal variants and their wild types could provide basis for inducing mutation via plant regeneration and broadening crop genetic diversity.