• Title/Summary/Keyword: iterative schemes

Search Result 170, Processing Time 0.022 seconds

Increasing Secrecy Capacity via Joint Design of Cooperative Beamforming and Jamming

  • Guan, Xinrong;Cai, Yueming;Yang, Weiwei;Cheng, Yunpeng;Hu, Junquan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1041-1062
    • /
    • 2012
  • In this paper, we propose a hybrid cooperative scheme to improve the secrecy rate for a cooperative network in presence of multiple relays. Each relay node transmits the mixed signal consisting of weighted source signal and intentional noise. The problem of power allocation, the joint design of beamforming and jamming weights are investigated, and an iterative scheme is proposed. It is demonstrated by the numerical results that the proposed hybrid scheme further improves secrecy rate, as compared to traditional cooperative schemes.

Intervenient Stackelberg Game based Bandwidth Allocation Scheme for Hierarchical Wireless Networks

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4293-4304
    • /
    • 2014
  • In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.

A new algorithm for power system stability calculations (전력계통안정도 계산앨고리즘의 개선에 관한 연구)

  • 박영문
    • 전기의세계
    • /
    • v.29 no.3
    • /
    • pp.193-200
    • /
    • 1980
  • A new algorithm for power system stability calculations is developed which considers the nonlinear state equations of 8 state variables for each generator dynamics, expollential load models in respect to bus voltages for nonlinear loads, network equations expressed in terms of bus-injected current sources, various kinds of generator and transmission line outages, abrupt changes in loads, and operations of various kinds of portective relaying systems such as distance relaying, reclosing load shedding by under-frequency relays. In the algorithm are included efficient and reliable schemes for solving network equations by means of the Newton-Raphson iterative method and the Optimally-Ordered Triangular Factorization Technique, and simple procedures for determining fault-point negative and zero sequence impedances for unbalanced line faults. An application of the Optimally-Ordered Triangular Factorization Techniques results in remarkable savings in computing time and memory requirements.

  • PDF

Improved Concurrent Subspace Optimization Using Automatic Differentiation (자동미분을 이용한 분리시스템동시최적화기법의 개선)

  • 이종수;박창규
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.10a
    • /
    • pp.359-369
    • /
    • 1999
  • The paper describes the study of concurrent subspace optimization(CSSO) for coupled multidisciplinary design optimization (MDO) techniques in mechanical systems. This method is a solution to large scale coupled multidisciplinary system, wherein the original problem is decomposed into a set of smaller, more tractable subproblems. Key elements in CSSO are consisted of global sensitivity equation(GSE), subspace optimization (SSO), optimum sensitivity analysis(OSA), and coordination optimization problem(COP) so as to inquiry valanced design solutions finally, Automatic differentiation has an ability to provide a robust sensitivity solution, and have shown the numerical numerical effectiveness over finite difference schemes wherein the perturbed step size in design variable is required. The present paper will develop the automatic differentiation based concurrent subspace optimization(AD-CSSO) in MDO. An automatic differentiation tool in FORTRAN(ADIFOR) will be employed to evaluate sensitivities. The use of exact function derivatives in GSE, OSA and COP makes Possible to enhance the numerical accuracy during the iterative design process. The paper discusses how much influence on final optimal design compared with traditional all-in-one approach, finite difference based CSSO and AD-CSSO applying coupled design variables.

  • PDF

Cognitive Radio Anti-Jamming Scheme for Security Provisioning IoT Communications

  • Kim, Sungwook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4177-4190
    • /
    • 2015
  • Current research on Internet of Things (IoT) has primarily addressed the means to enhancing smart resource allocation, automatic network operation, and secure service provisioning. In particular, providing satisfactory security service in IoT systems is indispensable to its mission critical applications. However, limited resources prevent full security coverage at all times. Therefore, these limited resources must be deployed intelligently by considering differences in priorities of targets that require security coverage. In this study, we have developed a new application of Cognitive Radio (CR) technology for IoT systems and provide an appropriate security solution that will enable IoT to be more affordable and applicable than it is currently. To resolve the security-related resource allocation problem, game theory is a suitable and effective tool. Based on the Blotto game model, we propose a new strategic power allocation scheme to ensure secure CR communications. A simulation shows that our proposed scheme can effectively respond to current system conditions and perform more effectively than other existing schemes in dynamically changeable IoT environments.

Joint optimization of beamforming and power allocation for DAJ-based untrusted relay networks

  • Yao, Rugui;Lu, Yanan;Mekkawy, Tamer;Xu, Fei;Zuo, Xiaoya
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.714-725
    • /
    • 2018
  • Destination-assisted jamming (DAJ) is usually used to protect confidential information against untrusted relays and eavesdroppers in wireless networks. In this paper, a DAJ-based untrusted relay network with multiple antennas installed is presented. To increase the secrecy, a joint optimization of beamforming and power allocation at the source and destination is studied. A matched-filter precoder is introduced to maximize the cooperative jamming signal by directing cooperative jamming signals toward untrusted relays. Then, based on generalized singular-value decomposition (GSVD), a novel transmitted precoder for confidential signals is devised to align the signal into the subspace corresponding to the confidential transmission channel. To decouple the precoder design and optimal power allocation, an iterative algorithm is proposed to jointly optimize the above parameters. Numerical results validate the effectiveness of the proposed scheme. Compared with other schemes, the proposed scheme shows significant improvement in terms of security performance.

NUMERICAL SOLUTIONS OF NONLINEAR VOLTERRA-FREDHOLM INTEGRO-DIFFERENTIAL EQUATIONS BY USING MADM AND VIM

  • Abed, Ayoob M.;Younis, Muhammed F.;Hamoud, Ahmed A.
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.1
    • /
    • pp.189-201
    • /
    • 2022
  • The aim of the current work is to investigate the numerical study of a nonlinear Volterra-Fredholm integro-differential equation with initial conditions. Our approximation techniques modified adomian decomposition method (MADM) and variational iteration method (VIM) are based on the product integration methods in conjunction with iterative schemes. The convergence of the proposed methods have been proved. We conclude the paper with numerical examples to illustrate the effectiveness of our methods.

A NEW ITERATION METHOD FOR FIXED POINT OF NONEXPANSIVE MAPPING IN UNIFORMLY CONVEX BANACH SPACE

  • Omprakash, Sahu;Amitabh, Banerjee;Niyati, Gurudwan
    • Korean Journal of Mathematics
    • /
    • v.30 no.4
    • /
    • pp.665-678
    • /
    • 2022
  • The aim of this paper is to introduce a new iterative process and show that our iteration scheme is faster than other existing iteration schemes with the help of numerical examples. Next, we have established convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some convergence results for the approximation of the fixed points of a nonexpansive mapping.

An Efficient Iterative Decoding Stop Criterion Algorithm using Error Probability Variance Value of Turbo Code (터보부호의 오류확률 분산값을 이용한 효율적인 반복중단 알고리즘)

  • Jeong Dae ho;Shim Byoung sup;Lim Soon Ja;Kim Tae hyung;Kim Hwan yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1387-1394
    • /
    • 2004
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication systems. And it is well known about the fact that turbo code has better the BER performance as the number of decoding iterations increases in the AWGN channel environment. However, as the number of decoding iterations is increased under the several channel environments, any further iteration results in very little improvement, and it requires much delay, computation and power consumption in proportion to the number of decoding iterations. In this paper, it proposes the efficient iterative decoding stop criterion algorithm which can largely reduce the average number of decoding iterations of turbo code. Through simulations, it is verifying that the proposed algorithm can efficiently stop the iterative decoding by using the variance value of error probability for the soft output value, and can largely reduce the average number of decoding iterations without BER performance degradation. As a result of simulation, the average number of decoding iterations for the proposed algorithm is reduced by about 2.25% ~14.31% and 3.79% ~14.38% respectively compared to conventional schemes, and power consumption is saved in proportion to the number of decoding iterations.

Study on the Efficient Dynamic System Condensation (동적 해석의 효율적 축소기법에 관한 연구)

  • Baek, Seung-Min;Kim, Ki-Ook;Cho, Maeng-Hyo
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.3
    • /
    • pp.347-352
    • /
    • 2007
  • Eigenvalue reduction schemes approximate the lower eigenmodes that represent the global behavior of the structures. In the previous study, we proposed a two-level condensation scheme (TLCS) for the construction of a reduced system. In the first step, the selection of candidate elements by energy estimation, Rayleigh quotient, through Ritz vector calculation. In the second step, the primary degrees of freedom are selected by the sequential elimination method from the degrees of freedom connected to the candidate elements in the first step. In the present study, we propose TLCS combined with iterative improved reduced system (IIRS) to increase accuracy of the higher modes in the intermediate range. Also, it is possible to control the accuracy of the eigenvalues and eigenmodes of the reduced system. Finally, numerical examples demonstrate the performance of the proposed method.