• Journal of information and communication convergence engineering
• /
• v.20 no.1
• /
• pp.22-30
• /
• 2022

The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.786-792
• /
• 2022

In the cloud computing environment, there has been a lot of research into the Fog/Edge Computing (FEC) paradigm for securing user proximity of application services and computation offloading to alleviate service delay difficulties. The method of predicting dynamic location change patterns of edge devices (moving objects) requesting application services is critical in this FEC environment for efficient computing resource distribution and deployment. This paper proposes an optimal moving pattern extraction algorithm in which variable weights (distance, time, congestion) are applied to selected paths in addition to a support factor threshold for frequency patterns (moving objects) of edge devices. The proposed algorithm is compared to the OPE_freq [8] algorithm, which just applies frequency, as well as the A^* and Dijkstra algorithms, and it can be shown that the execution time and number of nodes accessed are reduced, and a more accurate path is extracted through experiments.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.170-170
• /
• 2023

Providing safe and readily available water is vital to maintain public health. One of the most prevalent methods to prevent the spread of waterborne diseases is applying chlorine injection to the treated water before distribution. During the water transmission and distribution, the chlorine will experience a reduction, which can imply potential risks for human health if it falls below the minimum threshold. The ability to determine the appropriate initial intensity of chlorine at the source would be significant to prevent such problems. This study proposes two methods that integrate hydraulic and water quality modeling to determine the suitable intensity of chlorine to be injected into the source water to maintain the minimum chlorine concentration (e.g., 0.2 mg/l) at each demand node. The water quality modeling employs the first-order decay to estimate the rate of chlorine reduction in the water. The first method utilizes a backtracking algorithm to trace the path of water from the demand node to the source during each time step, which helps to accurately determine the travel time through each pipe and node and facilitate the computation of time-dependent chlorine decay in the water delivery process. However, as a backtracking algorithm is computationally intensive, this study also explores an alternative approach using a water age. This approach estimates the elapsed time of water delivery from the source to the demand node and calculate the time-dependent reduction of chlorine in the water. Finally, this study compares the outcomes of two approaches and determines the suitable and effective method for calculating the chlorine intensity at the source to maintain the minimum chlorine level at demand nodes.

• Journal of Korean Society for Atmospheric Environment
• /
• v.17 no.5
• /
• pp.395-405
• /
• 2001

To make an assessment of the compatibility between DOAS and conventional point monitoring system (MCSAM-2: MS2), we investigated the concentrations of three criteria pollutants which include S $O_2$, N $O_2$, and $O_3$from a national monitoring station in Seoul during the periods of June 1999~August 2000. The average concentration values for the whole study period derived from hourly concentration data sets of those three species indicated that the mean differences between the two methods can be approximated as 18%. When the bias structure of two systems was evaluated through the computation of percent difference(PD) between the two such as ( $C_{DOAS}$- $C_{conventional}$ $C_{DOAS}$*100, differences between the two systems appeared to be quite systematic among different compounds. While the mode of bias peaked at 0~20% or 20~40% in terms of PD values, the cause of such positive bias mainly arised from generally enhanced concentration values of DOAS system. The structure of bias among different species was further assessed through linear regression analysis. Results of the analysis indicated that the dominant portions of differences observed from two monitoring systems can be accounted for by the systematic differences in their spanning and zeroing systems. S $O_2$(MS2)=0.6385 S $O_2$(DOAS)+2.0985($r^2$=0.7894) N $O_2$(MS2)=0.6548 N $O_2$(DOAS)+7.437($r^2$=0.7687) $O_3$(MS2)=1.0359 $O_3$(DOAS)-7.7885($r^2$=0.7944) The findings of slope values at around 0.64~0.65 from two species suggest that DOAS should respond more sensitively in upper bound concentration range. The offset values apart from zero indicate that more deliberate comparison needs to be made between these monitoring systems. However, based on the existence of strong correlations from at least 8,000 data points for each species of comparison, we were able to conclude that the compatibility of two monitoring systems is highly significant. With the improvement of calibration techniques for the DOAS system. its applicability for routine monitoring of airborne pollutant species is expected to be quite extendable.

• Proceedings of the KSRS Conference
• /
• 2006.03a
• /
• pp.341-343
• /
• 2006

The current spectral shape matching method (SSMM), developed by Ahn and Shanmugam (2004), relies on the assumption that the path radiance resulting from scattered photons due to air molecules and aerosols and possibly direct-reflected light from the air-sea interface is spatially homogeneous over the sub-scene of interest, enabling the retrieval of water-leaving radiances ($L_w$) from the satellite ocean color image data. This assumption remains valid for the clear atmospheric conditions, but when the distribution of aerosol loadings varies dramatically the above postulation of spatial homogeneity will be violated. In this study, we present the second version of SSMM which will take into account the horizontal variations of aerosol loading in the correction of atmospheric effects in SeaWiFS ocean color image data. The new version includes models for the correction of the effects of aerosols and Raleigh particles and a method fur computation of diffuse transmittance ($t_{os}$) as similar to SeaWiFS. We tested this method over the different optical environments and compared its effectiveness with the results of standard atmospheric correction (SAC) algorithm (Gordon and Wang, 1994) and those from in-situ observations. Findings revealed that the SAC algorithm appeared to distort the spectral shape of water-leaving radiance spectra in suspended sediments (SS) and algal bloom dominated-areas and frequently yielded underestimated or often negative values in the lower green and blue part of the electromagnetic spectrum. Retrieval of water-leaving radiances in coastal waters with very high sediments, for instance = > 8g $m^{-3}$, was not possible with the SAC algorithm. As the current SAC algorithm does not include models for the Asian aerosols, the water-leaving radiances over the aerosol-dominated areas could not be retrieved from the image and large errors often resulted from an inappropriate extrapolation of the estimated aerosol radiance from two IR bands to visible spectrum. In contrast to the above results, the new SSMM enabled accurate retrieval of water-leaving radiances in a various range of turbid waters with SS concentrations from 1 to 100 g $m^{-3}$ that closely matched with those from the in-situ observations. Regardless of the spectral band, the RMS error deviation was minimum of 0.003 and maximum of 0.46, in contrast with those of 0.26 and 0.81, respectively, for SAC algorithm. The new SSMM also remove all aerosol effects excluding areas for which the signal-to-noise ratio is much lower than the water signal.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.5
• /
• pp.337-343
• /
• 2014

This paper presents a continuum-based shape design sensitivity analysis(DSA) method for crack propagation problems using a reproducing kernel method(RKM), which facilitates the remeshing problem required for finite element analysis(FEA) and provides the higher order shape functions by increasing the continuity of the kernel functions. A linear elasticity is considered to obtain the required stress field around the crack tip for the evaluation of J-integral. The sensitivity of displacement field and stress intensity factor(SIF) with respect to shape design variables are derived using a material derivative approach. For efficient computation of design sensitivity, an adjoint variable method is employed tather than the direct differentiation method. Through numerical examples, The mesh-free and the DSA methods show excellent agreement with finite difference results. The DSA results are further extended to a shape optimization of crack propagation problems to control the propagation path.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.62-70
• /
• 2016

Ensuring walkability in a city where pedestrians and vehicles coexist is an issue of critical importance. The relative relationship between vehicle transit and walkability improvements complicates the evaluation of walkability, which thus necessitates the formation of a quantitative standard by which a methodological measurement of walkability can be achieved inside the pedestrian network. Therefore, a model is determined whereby quantitative indices such as, but not limited to, experiences of accessibility, mobility, and convenience within the network are estimated. This research proposes the integration of space syntax theory and the logit path choice model in the evaluation of walkability. Space syntax theory assesses adequacy of the constructed pedestrian network through calculation of the link integration value, while the logit model estimates its safety, mobility, and accessibility using probability. The advantage of the integrated model hence lies in its ability to sufficiently reflect such evaluation measures as the integration value, mobility convenience, accessibility potential, and safety experienced by the demand in a quantitative manner through probability computation. In this research, the Dial Algorithm is used to arrive at a solution to the logit model. This process requires that the physical distance of the pedestrian network and the perceptive distance of space syntax theory be made equivalent. In this, the research makes use of network expansion to reflect wait times. The evaluation index calculated through the integrated model is reviewed and using the results of this sample network, the applicability of the model is assessed.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.4
• /
• pp.31-37
• /
• 2008

Conventional cooperative communications can attain gain of spatial diversity and path loss reduction because destination node independently received same signal from source node and relay node located between source node and destination node. However, these techniques bring about decreased spectral efficiency with relay node and increased complexity of receiver by using maximal ratio combining (MRC). This paper has proposed cooperative ARQ protocol that can improve the above problems and can get the better performance. This method can increase the spectral efficiency than conventional cooperative communication because if the received signal from source node is satisfied by the destination preferentially, the destination transmits ACK message to both relay node and source node and then recovers the received signal. In addition, if ARQ message indicates NACK relay node operates selective retransmission and we can increase reliability of system compared with that of general ARQ protocol in which source node retransmits data. In the proposed protocol, the selective retransmission and ARQ message are to be determined by comparing log-likelihood ratio (LLR) computation of received signal from source node with predetermined threshold values. Therefore, this protocol don't waste redundant bandwidth with CRC code and can reduce complexity of receiver without MRC. We verified spectral efficiency and BER performance for the proposed protocol through Monte-Carlo simulation over Rayleigh fading plus AWGN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1452-1460
• /
• 2000

A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.