• Title/Summary/Keyword: power scaling law

Search Result 48, Processing Time 0.031 seconds

Sum rate and Energy Efficiency of Massive MIMO Downlink with Channel Aging in Time Varying Ricean Fading Channel

  • Yang, Lihua;Yang, Longxiang;Zhu, Hongbo;Liang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1098-1112
    • /
    • 2018
  • Achievable sum rate and energy efficiency (EE) are investigated for the massive multiple-input multiple-output (Massive MIMO) downlink with channel aging in the time varying Ricean fading channel. Specifically, the expression of the achievable sum rate of the system for the maximum ratio transmission (MRT) precoder with aged channel state information (CSI) in the time varying Ricean fading channel is first presented. Based on the expression, the effect of both channel aging and the Ricean factor on the power scaling law are studied. It is found that the transmit power of base station (BS) is scaled down by $1/{\sqrt{M}}$(where M is the number of the BS antennas) when the Ricean factor K is equal to zero (i.e., time varying Rayleigh fading channel), indicating that aged CSI does not affect the power scaling law. However, the transmit power of the BS is scaled down by 1/M for the time varying Ricean fading channel (where $K{\neq}0$) indicating that the Ricean factor affects the power scaling law and sum rate, and channel aging only leads to a reduction of the sum rate. Second, the EE of the system is analyzed based on the general power consumption model. Both the theoretical analysis and the simulations show that the channel aging could degrade the sum rate and the EE of the system, and it does not affect the power scaling law.

Estimation of the neutron production of KSTAR based on empirical scaling law of the fast ion stored energy and ion density under NBI power and machine size upgrade

  • Kwak, Jong-Gu;Hong, S.C.
    • Nuclear Engineering and Technology
    • /
    • v.54 no.6
    • /
    • pp.2334-2337
    • /
    • 2022
  • Deuterium-tritium reaction is the most promising one in term of the highest nuclear fusion cross-section for the reactor. So it is one of urgent issues to develop materials and components that are simultaneously resistant to high heat flux and high energy neutron flux in realization of the fusion energy. 2.45 MeV neutron production was reported in D-D reaction in KSTAR and regarded as beam-target is the dominant process. The feasibility study of KSTAR to wide area neutron source facility is done in term of D-D and D-T reactions from the empirical scaling law from the mixed fast and thermal stored energy and its projection to cases of heating power upgrade and DT reaction is done.

A Genetic Algorithm for the Chinese Postman Problem on the Mixed Networks (유전자 알고리즘을 이용한 혼합 네트워크에서의 Chinese Postman Problem 해법)

  • Jun Byung Hyun;Kang Myung Ju;Han Chi Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.181-188
    • /
    • 2005
  • Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

  • PDF

Identification of vulnerable region susceptible to soil losses by using the relationship between local slope and drainage area in Choyang creek basin, Yanbian China (중국 연변 조양하 유역의 국부경사와 배수면적의 관계를 이용한 토사유실 우심지역 추출)

  • Kim, Joo-Cheol;Cui, Feng Xue;Jung, Kwan Sue
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.3
    • /
    • pp.235-246
    • /
    • 2018
  • The main purpose of this study is to suggest a methodology for identifying vulnerable region in Choyang creek basin susceptible to soil losses based on runoff aggregation structure and energy expenditure pattern of natural river basin within the framework of power law distribution. To this end geomorphologic factors of every point in the basin of interest are extracted by using GIS, which define tractive force and stream power as well as drainage area, and then their complementary cumulative distributions are graphically analyzed through fitting them to power law distribution to identify the sensitive points within the basin susceptible to soil losses with respect to scaling regimes of tractive force and stream power. It is observed that the range of vulnerable region by scaling regime of tractive force is much narrower than by scaling regime of stream power. This result seems to be due to the tractive force is a kind of scale dependent factor which does not follow power law distribution and does not adequately reflect energy expenditure pattern of river basins. Therefore, stream power is preferred to be a more reasonable factor for the evaluation of soil losses. The methodology proposed in this study can be validated by visualizing the path of soil losses, which is generated from hill-slope process characterized by local slope, to the valley through fluvial process characterized by drainage area as well as local slope.

Application of Scaling Theories to Estimate Particle Aggregation in a Colloidal Suspension

  • Park, Soongwan;Koo, Sangkyun
    • Korean Chemical Engineering Research
    • /
    • v.60 no.2
    • /
    • pp.260-266
    • /
    • 2022
  • Average aggregate size in particulate suspensions is estimated with scaling theories based on fractal concept and elasticity of colloidal gel. The scaling theories are used to determine structure parameters of the aggregates, i.e., fractal dimension and power-law exponent for aggregate size reduction with shear stress using scaling behavior of elastic modulus and shear yield stress as a function of particle concentration. The structure parameters are utilized to predict aggregate size which varies with shear stress through rheological modeling. Experimentally rheological measurement is conducted for aqueous suspension of zinc oxide particles with average diameter of 110 nm. The predicted aggregate size is about 1135 nm at 1 s-1 and 739 nm at 1000 s-1 on the average over the particle concentrations. It has been found that the predicted aggregate size near 0.1 s-1 agrees with that the measured one by a dynamic light scattering analyzer operated un-sheared.

Space-Stretch Tradeoff Optimization for Routing in Internet-Like Graphs

  • Tang, Mingdong;Zhang, Guoqiang;Liu, Jianxun
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.546-553
    • /
    • 2012
  • Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

Five layers in turbulent pipe flow (난류 파이프 유동 내 다섯 개의 영역)

  • Ahn, Junsun;Hwang, Jinyul
    • Journal of the Korean Society of Visualization
    • /
    • v.18 no.3
    • /
    • pp.109-115
    • /
    • 2020
  • Five layers in mean flow are proposed by using the direct numerical simulation data of turbulent pipe flow up to Reτ = 3008. Viscous sublayer, buffer layer, mesolayer, log layer and core region are investigated. In the buffer layer, the viscous force is counterbalanced by the turbulent inertia from the streamwise mean momentum balance, and a log law occurs here. The overlap layer is composed of the mesolayer and the log layer. Above the buffer layer, the non-negligible viscous force causes the power law, and this region is the mesolayer, where it is the lower part of the overlap layer. At the upper part of the overlap layer, where the viscous force itself becomes naturally negligible, the log layer will appear due to that the acceleration force of the large-scale motions increases as the Reynolds number increases. In the core region, the velocity-defect form is satisfied with the power-law scaling.

Performance Evaluation of Parallel Opportunistic Multihop Routing

  • Shin, Won-Yong
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.3
    • /
    • pp.135-139
    • /
    • 2014
  • Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

On the System Modeling and Capacity Scaling Law in Underwater Ad Hoc Networks (수중 애드 혹 네트워크에서의 시스템 모델링 및 용량 스케일링 법칙에 대하여)

  • Shin, Won-Yong;Kim, A-Jung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.422-428
    • /
    • 2011
  • In this paper, we introduce system and channel modeling for an underwater ad hoc acoustic network with n regularly located nodes, and then analyze capacity scaling laws based on the model. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize in attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks having unit node density. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal for all the operating regimes expressed as functions of the attenuation parameter.

Katayama Equation Modified on the Basis of Critical-Scaling Theory (임계 축척 이론을 이용한 카타야마 식의 수정)

  • Lim, Kyung-Hee
    • Journal of the Korean Applied Science and Technology
    • /
    • v.23 no.3
    • /
    • pp.185-191
    • /
    • 2006
  • It is desirable to have an accurate expression on the temperature dependence of surface(or interfacial) tension ${\sigma}$, because most of the interfacial thermodynamic functions can be derived from it. There have been proposed several equations on the temperature dependence of the surface tension, ${\sigma}(T)$. Among them $E{\ddot{o}}tv{\ddot{o}}s$ equation and the one modified by Katayama, which is called Katayama equation, for improving accuracies of $E{\ddot{o}}tv{\ddot{o}}s$ equation close to critical points, have been most well-known. In this article Katayama equation is interpreted on the basis of the cell model to understand the nature of the equation. The cell model results in an expression very similar to Katayama equation. This implies that, although $E{\ddot{o}}tv{\ddot{o}}s$ and Katayama equations were obtained on the basis of experimental results, they have a sound theoretical background. The Katayama equation is also modified with the phase volume replaced with a critical scaling expression. The modified Katayama equation becomes a power-law equation with the exponent slightly different from the value obtained by critical-scaling theory. This implies that Katayama equation can be replaced by a critical-scaling equation which is proven to be accurate.