• Title/Summary/Keyword: stochastic simulation.

Search Result 785, Processing Time 0.025 seconds

Improved AntHocNet with Bidirectional Path Setup and Loop Avoidance (양방향 경로 설정 및 루프 방지를 통한 개선된 AntHocNet)

  • Rahman, Shams ur;Nam, Jae-Choong;Khan, Ajmal;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.64-76
    • /
    • 2017
  • Routing in mobile ad hoc networks (MANETs) is highly challenging because of the dynamic nature of network topology. AntHocNet is a bio-inspired routing protocol for MANETs that mimics the foraging behavior of ants. However, unlike many other MANET routing protocols, the paths constructed in AntHocNet are unidirectional, which requires a separate path setup if a route in the reverse direction is also required. Because most communication sessions are bidirectional, this unidirectional path setup approach is often inefficient. Moreover, AntHocNet suffers from looping problems because of its property of multiple paths and stochastic data routing. In this paper, we propose a modified path setup procedure that constructs bidirectional paths. We also propose solutions to some of the looping problems in AntHocNet. Simulation results show that performance is significantly enhanced in terms of overhead, end-to-end delay, and delivery ratio when loops are prevented. Performance is further improved, in terms of overhead, when bidirectional paths setup is employed.

A Comparison of Three Fixed-Length Sequence Generators of Synthetic Self-Similar Network Traffic (Synthetic Self-Similar 네트워크 Traffic의 세 가지 고정길이 Sequence 생성기에 대한 비교)

  • Jeong, Hae-Duck J.;Lee, Jong-Suk R.
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.899-914
    • /
    • 2003
  • It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

Algorithmic Generation of Self-Similar Network Traffic Based on SRA (SRA 알고리즘을 이용한 Self-Similar 네트워크 Traffic의 생성)

  • Jeong HaeDuck J.;Lee JongSuk R.
    • The KIPS Transactions:PartC
    • /
    • v.12C no.2 s.98
    • /
    • pp.281-288
    • /
    • 2005
  • It is generally accepted that self-similar (or fractal) Processes may provide better models for teletraffic in modem computer networks than Poisson processes. f this is not taken into account, it can lead to inaccurate conclusions about performance of computer networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A generator of pseudo-random self similar sequences, based on the SRA (successive random addition) method, is implemented and analysed in this paper. Properties of this generator were experimentally studied in the sense of its statistical accuracy and the time required to produce sequences of a given (long) length. This generator shows acceptable level of accuracy of the output data (in the sense of relative accuracy of the Hurst parameter) and is fast. The theoretical algorithmic complexity is O(n).

Fluid Flow and Solute Transport in a Discrete Fracture Network Model with Nonlinear Hydromechanical Effect (비선형 hydromechanic 효과를 고려한 이산 균열망 모형에서의 유체흐름과 오염물질 이송에 관한 수치모의 실험)

  • Jeong, U-Chang
    • Journal of Korea Water Resources Association
    • /
    • v.31 no.3
    • /
    • pp.347-360
    • /
    • 1998
  • Numerical simulations for fluid flow and solute transport in a fracture rock masses are performed by using a transient flow model, which is based on the three-dimensional stochastic and discrete fracture network model (DFN model) and is coupled hydraulic model with mechanical model. In the numerical simulations of the solute transport, we used to the particle following algorithm which is similar to an advective biased random walk. The purpose of this study is to predict the response of the tracer test between two deep bore holes (GPK1 and GPK2) implanted at Soultz sous Foret in France, in the context of the geothermal researches.l The data sets used are obtained from in situcirculating experiments during 1995. As the result of the transport simulation, the mean transit time for the non reactive particles is about 5 days between two bore holes.

  • PDF

Fast Self-Similar Network Traffic Generation Based on FGN and Daubechies Wavelets (FGN과 Daubechies Wavelets을 이용한 빠른 Self-Similar 네트워크 Traffic의 생성)

  • Jeong, Hae-Duck;Lee, Jong-Suk
    • The KIPS Transactions:PartC
    • /
    • v.11C no.5
    • /
    • pp.621-632
    • /
    • 2004
  • Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).

Blind Adaptive Receiver based on Constant Modulus for Downlink MC-CDMA Systems (하향링크 MC-CDMA 시스템을 위한 CM 기반의 블라인드 적응 수신기)

  • Seo, Bangwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.47-54
    • /
    • 2019
  • In this paper, we consider a constant modulus (CM) based blind adaptive receiver design for downlink multi-carrier code-division multiple access (MC-CDMA) systems employing simple space-time block coding (STBC). In the paper, filter weight vectors used for the detection of the transmitted symbols are partitioned into its subvectors and then, special relations among the optimal subvectors minimizing the CM metric are derived. Using the special relations, we present a modified CM metric and propose a new blind adaptive stochastic-gradient CM algorithm (SG-CMA) by minimizing the modified CM metric. The proposed blind adaptive SG-CMA has faster convergence rate than the conventional SG-CMA because the filter weight vectors of the proposed scheme are updated in the region of satisfying the derived special relations. Computer simulation results are given to verify the superiority of the proposed SG-CMA.

Harmonic Estimation of Power Signal Based on Time-varying Optimal Finite Impulse Response Filter (시변 최적 유한 임펄스 응답 필터 기반 전력 신호 고조파 검출)

  • Kwon, Bo-Kyu
    • The Journal of Korean Institute of Information Technology
    • /
    • v.16 no.11
    • /
    • pp.97-103
    • /
    • 2018
  • In this paper, the estimation method for the power signal harmonics is proposed by using the time-varying optimal finite impulse response (FIR) filter. To estimate the magnitude and phase-angle of the harmonic components, the time-varying optimal FIR filter is designed for the state space representation of the noisy power signal which the magnitude and phase is considered as a stochastic process. Since the time-varying optimal FIR filter used in the proposed method does not use any priori information of the initial condition and has FIR structure, the proposed method could overcome the demerits of Kalman filter based method such as poor estimation and divergence problem. Due to the FIR structure, the proposed method is more robust against to the model uncertainty than the Kalman filter. Moreover, the proposed method gives more general solution than the time-invariant optimal FIR filter based harmonic estimation method. To verify the performance and robustness of the proposed method, the proposed method is compared with time-varying Kalman filter based method through simulation.

Movie Recommendation System based on Latent Factor Model (잠재요인 모델 기반 영화 추천 시스템)

  • Ma, Chen;Kim, Kang-Chul
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.1
    • /
    • pp.125-134
    • /
    • 2021
  • With the rapid development of the film industry, the number of films is significantly increasing and movie recommendation system can help user to predict the preferences of users based on their past behavior or feedback. This paper proposes a movie recommendation system based on the latent factor model with the adjustment of mean and bias in rating. Singular value decomposition is used to decompose the rating matrix and stochastic gradient descent is used to optimize the parameters for least-square loss function. And root mean square error is used to evaluate the performance of the proposed system. We implement the proposed system with Surprise package. The simulation results shows that root mean square error is 0.671 and the proposed system has good performance compared to other papers.

Stochastic simulation of future sub-hourly rainfall using Poisson cluster rainfall model (포아송 클러스터 강우 모형을 이용한 미래 시단위 이하 강우의 추계학적 모의)

  • Jeongha Park;Dongkyun Kim
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.284-284
    • /
    • 2023
  • 도시 침수의 발생과 규모는 도시 유역이 가지는 짧은 도달 시간으로 인하여 주로 시단위 이하의 짧은 지속시간의 강우의 극한 및 변동성에 따라 결정된다. 미래 기간에 대하여 도시 수문 시스템의 적정성을 평가하기 위해서는 기후변화에 따른 시단위 이하 강우의 특성을 살펴보아야한다. 그러나 기후변화 영향 평가 도구로 활용되는 기후 모형들은 대부분 일단위의 결과물을 제공하여 시단위 이하의 미세 규모 강우의 특성을 나타낼 수 없다. 이에 따라 본 연구에서는 기후 모형 모의 결과와 포아송 클러스터 강우 모형을 이용하여 미래 시단위 이하 강우 시계열을 모의하는 방법을 제안한다. 첫째로, 포아송 클러스터 기반 강우 생성 알고리즘과 폭풍우 재배열 알고리즘을 결합한 최신 모형을 선정하였다. 해당 모형은 광범위한 시간 규모에서 관측된 강우량의 주요 통계와 극값을 재현할 수 있는 모형이다. 그 다음 강우 모형에 적합시킬 관측 강우량 통계(평균, 분산, 공분산, 왜도, 우기 비율)를 계산하였다. 둘째, 강우 통계 간의 선형 관계를 도출하였다. 여기서는 클러스터에 있는 모든 관측소의 통계를 사용하여 회귀의 신뢰도를 높였다. 셋째, 강우 평균 조정을 위한 Change Factor는 제어(2000~2019년) 및 미래(2041~2070년) 기간의 기후 모형 자료를 사용하여 계산하였다. 넷째, 조정된 15분 강우 평균은 관측 평균에 Change Factor을 곱하여 계산하고 조정된 강우 평균과 통계 간의 관계를 사용하여 미래 강우 통계 세트를 추정하였다. 여러 통계 세트를 생성한 후 마지막으로 미래 통계에 강우 모형을 적합시켜 최종적으로 미래 시단위 이하 강우 시계열을 모의하였다. 이 방법은 CMIP6에 참여하는 기후 모델의 기후 예측 데이터를 사용하여 용산(415) 및 동래(940) AWS 관측소에 적용되었다. 두 관측소의 미래 강우 모의 결과, 시단위 이하 시간 규모에서 극값이 증가하는 추세를 보였다.

  • PDF

Simulation of the fracture of heterogeneous rock masses based on the enriched numerical manifold method

  • Yuan Wang;Xinyu Liu;Lingfeng Zhou;Qi Dong
    • Geomechanics and Engineering
    • /
    • v.34 no.6
    • /
    • pp.683-696
    • /
    • 2023
  • The destruction and fracture of rock masses are crucial components in engineering and there is an increasing demand for the study of the influence of rock mass heterogeneity on the safety of engineering projects. The numerical manifold method (NMM) has a unified solution format for continuous and discontinuous problems. In most NMM studies, material homogeneity has been assumed and despite this simplification, fracture mechanics remain complex and simulations are inefficient because of the complicated topology updating operations that are needed after crack propagation. These operations become computationally expensive especially in the cases of heterogeneous materials. In this study, a heterogeneous model algorithm based on stochastic theory was developed and introduced into the NMM. A new fracture algorithm was developed to simulate the rupture zone. The algorithm was validated for the examples of the four-point shear beam and semi-circular bend. Results show that the algorithm can efficiently simulate the rupture zone of heterogeneous rock masses. Heterogeneity has a powerful effect on the macroscopic failure characteristics and uniaxial compressive strength of rock masses. The peak strength of homogeneous material (with heterogeneity or standard deviation of 0) is 2.4 times that of heterogeneous material (with heterogeneity of 11.0). Moreover, the local distribution of parameter values can affect the configuration of rupture zones in rock masses. The local distribution also influences the peak value on the stress-strain curve and the residual strength. The post-peak stress-strain curve envelope from 60 random calculations can be used as an estimate of the strength of engineering rock masses.