• Title/Summary/Keyword: PS algorithm

Search Result 87, Processing Time 0.03 seconds

An Advanced Resource Allocation Algorithm for PON-LTE Converged Networks

  • Abhishek Gaur;Vibhakar Shrimali
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.16-22
    • /
    • 2023
  • Enhanced radio access technologies (RAT) are deployed in Next Generation Convergence Networks by the service providers so as to satisfy the basic requirements of end-users for e.g. QoS. Whenever the available resources are being shared simultaneously and dynamically by multiple users or distribution of allocated channels randomly, the deficiency of spectral resources and dynamic behavior of Network traffic in real time Networking, we may have problem. In order to evaluate the performance of our proposed algorithm, computer simulation has been performed on NS-2 simulator and a comparison with the existing algorithms has been made.

Particle Swarm Optimization for Redundancy Allocation of Multi-level System considering Alternative Units (대안 부품을 고려한 다계층 시스템의 중복 할당을 위한 입자 군집 최적화)

  • Chung, Il Han
    • Journal of Korean Society for Quality Management
    • /
    • v.47 no.4
    • /
    • pp.701-711
    • /
    • 2019
  • Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

A Development Study on an Engine Control Module of an Electronic Marine Diesel Engine (전자식 선박디젤엔진의 엔진제어기 개발/연구)

  • Sim, Han-Sub;Lee, Min-Kwang;Lee, Kang-Yoon
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.14 no.5
    • /
    • pp.134-140
    • /
    • 2015
  • A control program of an engine control module (ECM) was developed, and its control performance was verified on a 750Ps marine diesel engine. The control method was designed for an engine rotational speed control system. For ECM hardware, the commercial rapid control prototype (RCP) ECM was used. The programming tool for control algorithm development was the MatLab/Simulink. The main control algorithm assembled many control models as engine cranking, run, and stall. Each model has sub-models to input/output control signals. The target engine speed was input signal from a speed control lever, and control output signal of the ECM was sent to the unit-injectors for fuel injection. The engine test was performed under various conditions of engine rotational speeds and dynamometer loads. The test results show that the control function of the ECM is suitable for electrical marine diesel engines.

Energy Efficiency Maximization for Energy Harvesting Bidirectional Cooperative Sensor Networks with AF Mode

  • Xu, Siyang;Song, Xin;Xia, Lin;Xie, Zhigang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2686-2708
    • /
    • 2020
  • This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

A Development of Optimal Algorithms for N/M/D/F/Fmax Scheduling Problems (N/M/D/F/Fmax 일정계획 문제에서 최적 알고리듬의 개발)

  • 최성운
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.21
    • /
    • pp.91-100
    • /
    • 1990
  • This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

  • PDF

An Uplink Scheduling Algorithm for VoIP in IEEE 802.16d Systems (IEEE 802.160에서 상향링크 VoIP 스케줄링 알고리즘 방식 연구)

  • Kang, Min-Seok;Jang, Jae-Shin
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.3
    • /
    • pp.87-91
    • /
    • 2006
  • With the growth of the internet, the number of wireless internet users has increased continuously up to date. However, mobile communications could not support high speed transmission rate with cheap communication fee and wireless LAN has problems in providing terminal mobility and wide area connectivity, respectively. So the WMAN standard has been newly designed to make up for these limits. The initial 802.16 specification effectively offers a solution for providing fixed users with high speed wireless communication but it does not offer terminal mobility. So the 802.16d and 802.16e have been developed as the next generation solution that can support various PHY layer (SC, SCa, OFDM, OFDMA) and offer the terminal mobility. In this paper, we propose an effective uplink scheduling algorithm for VoIP with using UGS, and we show that our proposed algorithm is superior in view of average delay and management of uplink bandwidth to conventional rtPS algorithm and the scheme in reference, with using NS-2 network simulator.

  • PDF

Handover Scheme Considering Moving Velocity and Traffic Characteristics in IMT-2000 Networks (IMT-2000망에서 이동체의 속도와 트래픽 특성을 고려한 핸드오버 기법)

  • Han, Jeong-An;Park, Sang-Jun;Jo, Jae-Jun;Kim, Byeong-Gi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.12
    • /
    • pp.1504-1515
    • /
    • 1999
  • 무선 이동 통신망은 기존의 음성위주로 제공되던 단일 미디어 서비스의 제공으로부터 발전되어 2000년대 초까지 이동 사용자에게 고품질의 멀티미디어 데이타 서비스를 제공하고, 장소에 제한을 받지 않고 서비스를 제공받을 수 있도록 하는 IMT-2000을 실현을 목표로 발전하고 있다. 또한 다수의 서비스 사용자와 광대역의 데이타를 전송하기 위해서 셀의 반경은 점차로 축소되고 있다. 이에 따라서, 사용자의 위치등록과 핸드오버와 같은 처리에 대한 부하가 커지게 되었다. 그러므로 무선 이동통신에서 서비스 이용자에게 일정 수준 이상의 QoS를 보장해 주기 위해서 효율적인 핸드오버 알고리즘의 도입은 매우 중요한 문제가 되고 있다. 본 논문에서는 IMT-2000환경에서 보다 효율적인 QoS를 서비스 사용자에게 제공해 줄 수 있도록 하기 위해 다양한 이동체의 속도와 멀티미디어 트래픽 특성을 동시에 고려하여 신뢰성 있는 핸드오버를 제공하는 H-PS(Hybrid-Priority Scheme)알고리즘을 제안하고 시뮬레이션을 통해 성능을 분석한다.Abstract Wireless mobile communications is developed from the only single voice traffic sevice to multimedia sevices. And mobile communications will evolve IMT-2000, which is provide users with high quality multimedia services. A radius of cell is gradually reduced to accept many service users and transport the multimedia traffics. Therefore, a overhead of location tracking and handover processing are increased. Then to guarantee high QoS to service users in wireless mobile communications, efficient handover algorithm is very important issue.In this study, we propose a H-PS(Hybrid-Priority Scheme) handover scheme considering mobility and traffic characteristics in IMT-2000 networks. And performance evaluate using simulation.

Electromagnetic Susceptibility Analysis of Phase Noise in VCOs (위상 잡음 이론을 적용한 전압 제어 발진기의 전자파 내성 분석)

  • Hwang, Jisoo;Kim, SoYoung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.5
    • /
    • pp.492-498
    • /
    • 2015
  • As the integration of circuit components increases steadily, various EMS(Electromagnetic Susceptibility) problems have emerged from integrated circuits and electrical systems. The electromagnetic susceptibility of VCOs(Voltage Controlled Oscillator) is especially critical in RF systems. Therefore, in this paper, through the phase noise theory that models electrical oscillators as linear time variant systems, the EMS characteristics of representative VCO -ring VCO and LC VCO- with 1.2 GHz of reference oscillating frequency are analyzed under the existence of the electromagnetic noise coupled in power supply. An simulation algorithm is developed to extract impulse response function based on the phase noise theory. When there is no supply noise, the magnitude of the jitter of two oscillators were similar to around 2.1 ps, but in presence of supply noise, the jitter was significantly lower in LC VCOs than ring VCOs.

Iterative Pre-Whitening Projection Statistics for Improving Multi-Target Detection Performance in Non-Homogeneous Clutter (불균일 클러터 환경에서 다중 표적탐지 성능 향상을 위한 반복 백색화 투영 통계 기법)

  • Park, Hyuck;Kang, Jin-Whan;Kim, Sang-Hyo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.4
    • /
    • pp.120-128
    • /
    • 2012
  • In this paper, we propose a modified iterative pre-whitening projection statistics (MIPPS) scheme for improving multi-target detection performance in non-homogeneous clutter environments. As a non-homogeneity detection (NHD) technique of space-time adaptive processing algorithm for airborne radar, the MIPPS scheme improves the average detection probability of weak target when multiple targets with different reflection signal intensities are located in close range. Numerical results show that the conventional NHD schemes suffers from the masking effect by strong targets and clutters and the proposed MIPPS scheme outperforms the conventional schemes with respect to the average detection probability of the weak target at low signal-to-clutter ratio.

A Study on Shape Variability in Canonical Correlation Biplot with Missing Values (결측값이 있는 정준상관 행렬도의 형상변동 연구)

  • Hong, Hyun-Uk;Choi, Yong-Seok;Shin, Sang-Min;Ka, Chang-Wan
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.5
    • /
    • pp.955-966
    • /
    • 2010
  • Canonical correlation biplot is a useful biplot for giving a graphical description of the data matrix which consists of the association between two sets of variables, for detecting patterns and displaying results found by more formal methods of analysis. Nevertheless, when some values are missing in data, most biplots are not directly applicable. To solve this problem, we estimate the missing data using the median, mean, EM algorithm and MCMC imputation methods according to missing rates. Even though we estimate the missing values of biplot of incomplete data, we have different shapes of biplots according to the imputation methods and missing rates. Therefore we use a RMS(root mean square) which was proposed by Shin et al. (2007) and PS(procrustes statistic) for measuring and comparing the shape variability between the original biplots and the estimated biplots.