• Journal of the Society of Naval Architects of Korea
• /
• v.28 no.1
• /
• pp.12-18
• /
• 1991

Three-dimensional nonlinear sloshing effects due to tank motions are simulated by solving boundary value problem using the panel method based on boundary integral technique. While Shinkai used boundary elements on which source strengths vary linearly between nodes, the source of constant strength is distributed on each triangular panel in the present study. The source strength at each time step is determined by solving the Fredholm integral equation of the second kind obtained from Green's theorem. To avoid cumulative numerical errors as time elapses, Adam-Bashforth-Moulton method is employed. Numerical examples for the case of partially filled spherical tank on board oscillating in harmonic sway mode or pitch mode are solved. The elevation of the free surface is compared with the result by Shinkai and confirmed in good agreement during early time. The input and the output energy are comparatively evaluated to check the overall accuracy of the present numerical scheme. Although some leakage of energy are found as time marches, it is plausible when we take into account nonlinearities of the problem and the number of panels of the model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.50-59
• /
• 2006

The new communication paradigm is rapidly shifted from wireless mobile networks to an All-IP(Internet Protocol) network, led by service industry leaders and communication manufacturers. In this paradigm, providing authentication and session keys of a subscriber becomes one of the critical tasks because of IP open accessibility among heterogeneous networks. In this paper, we introduce authentication process procedure of heterogeneous wireless mobile networks and develop so-called IMAS(Integrated Mobile Authentication Server) which can securely inter-work among all mobile networks and support the legacy networks with backward compatibility. Especially, in designing IMAS, mobile authentication inter-working mechanism, key management technique, and other issues to be overcome are presented. We analyze and evaluate the performance of authentication algorithm which creates session key. A simulation environment of IMAS is established, and a performance(TPS; Transaction Per Second) result is analyzed and evaluated. It turned out that IMAS works among heterogeneous wireless mobile networks without compensating efficiency and functionalities of the legacy networks and decrease the entropy of data redundancy and data inconsistency among networks because of the integrity of the distributed Data Base(DB).

• Journal of the Korean Solar Energy Society
• /
• v.28 no.2
• /
• pp.64-69
• /
• 2008

As the grid-connected photovoltaic power conditioning systems (PVPCS) are installed in many residential areas, these have raised potential problems of network protection on electrical power system. One of the numerous problems is an Islanding phenomenon. There has been an argument that it may be a non-issue in practice because the probability of islanding is extremely low. However, there are three counter-arguments: First, the low probability of islanding is based on the assumption of 100% power matching between the PVPCS and the islanded local loads. In fact, an islanding can be easily formed even without 100% power matching (the power mismatch could be up to 30% if only traditional protections are used, e.g. under/over voltage/frequency). The 30% power-mismatch condition will drastically increase the islanding probability. Second, even with a larger power mismatch, the time for voltage or frequency to deviate sufficiently to cause a trip, plus the time required to execute a trip (particularly if conventional switchgear is required to operate), can easily be greater than the typical re-close time on the distribution circuit. Third, the low-probability argument is based on the study of PVPCS. Especially, if the output power of PVPCS equals to power consumption of local loads, it is very difficult for the PVPCS to sustain the voltage and frequency in an islanding. Unintentional islanding of PVPCS may result in power-quality issues, interference to grid-protection devices, equipment damage, and even personnel safety hazards. Therefore the verification of anti-islanding performance is strongly needed. In this paper, improved RPV method is proposed through considering power quality and anti-islanding capacity of grid-connected single-phase PVPCS in IEEE Std 1547 ("Standard for Interconnecting Distributed Resources to Electric Power Systems"). And the simulation results are verified.

• Journal of Korea Water Resources Association
• /
• v.53 no.11
• /
• pp.999-1013
• /
• 2020

Weather modification research has been actively performed worldwide, but a technology that can more quantitatively prove the research effects are needed. In this study, the seeding effect, the efficiency of precipitation enhancement in weather modification experiment, was verified using the radar data. Also, the effects of seeding material on hydrometeor change was analyzed. For this, radar data, weather conditions, and numerical simulation data for diffusion were applied. First, a method to analyze the seeding effect in three steps was proposed: before seeding, during seeding, and after seeding. The proposed method was applied to three cases of weather modification experiments conducted in Gangwon-do and the West Sea regions. As a result, when there is no natural precipitation, the radar reflectivity detected in the area where precipitation change is expected was determined as the seeding effect. When natural precipitation occurs, the seeding effect was determined by excluding the effect of natural precipitation from the maximum reflectivity detected. For the application results, it was found that the precipitation intensity increased by 0.1 mm/h through the seeding effect. In addition, it was confirmed that ice crystals, supercooled water droplets, and mixed-phase precipitation were distributed in the seeding cloud. The results of these weather modification research can be used to secure water resources as well as for future study of cloud physics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.360-370
• /
• 2013

When best-effort traffic users are supported in a downlink small-cell network, conventional schemes assign the channels experiencing low co-channel interference at each base station and provide a better downlink performance to the user near its serving base station, so that conventional schemes are not suitable to fairly support all users. In this paper, we propose a decentralized frequency reuse scheme for a small-cell network, where each basestation chooses a set of channels to fairly support the best-effort traffic users regardless of the distances to their serving basestation. After performing the conventional scheme that each basestation selects the channels which are not used in its adjacent basestations, it updates assigned channels improving the performance of low throughput users in a fully distributed manner with mitigating the overall throughput performance loss. The computer simulation demonstrates that the average throughput performance of the 10th percentile throughput users is improved up to 15% in some case compared to that of the conventional scheme, while allowing the overall throughput loss around 3%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.349-358
• /
• 2005

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover. the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in a page-based DSM system, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose call-site tracing-based shared memory allocator. shortly CSTallocator. CSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So CSTailocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our CSTallocator. Our observations show that by using CSTallocator a considerable amount of false sharing misses can be additionally reduced in comparison with the existing techniques.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.631-640
• /
• 2003

Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.409-414
• /
• 2010

The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

• Journal of Korea Water Resources Association
• /
• v.46 no.5
• /
• pp.559-568
• /
• 2013

Surface compaction significantly impacts runoff and soil erosion under rainfall since it leads to changes of soil physical characteristics such as increase of bulk density and shear stress, change of microporosity, and decrease of hydraulic conductivity. This study addressed surface compaction effects on runoff and soil loss from bare and disturbed soils that are commonly distributed on construction sites. Thirty-six rainfall simulations from three replicates of each involving rainfall intensities (68.5 mm/hr, 95.6 mm/hr) and plot gradients ($5^{\circ}$, $12.5^{\circ}$, $20^{\circ}$) were conducted to measure runoff and soil loss for two different soil surface treatments (compacted surface, non-compacted surface). Compacted surface increased significantly soil bulk density and soil strength. However, the effect of surface treatments on runoff changed with rainfall intensity and plot gradient. Rainfall intensity and plot gradient had a positive effect on mean soil loss. In addition, the effect of surface treatments on soil loss responded differently with rainfall intensity and plot gradient. Compacted surfaces increased soil loss at gentle slope ($5^{\circ}$) while they decreased soil loss at steep slope ($20^{\circ}$). These results indicate that there exists transitional slope range ($10{\sim}15^{\circ}$) between gentle and steep slope by surface compaction effects on soil loss under disturbed bare soils and simulated rainfalls.