• Title/Summary/Keyword: Time-Efficiency of Algorithm

Search Result 1,626, Processing Time 0.029 seconds

A New LEACH Algorithm for the Data Aggregation to Improve the Energy Efficiency in WSN

  • Subedi, Sagun;Lee, Sangil;Lee, Jaehee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.68-73
    • /
    • 2018
  • In recent years, the utilization of the WSN have been rapid. Energy consumption of these networks must be as low as possible. LEACH algorithm is one of the clustering technique. We modify the traditional LEACH algorithm in such way that it will be capable to self-organize large number of nodes and for saving communication resources such as processing time and initiation time. The efficiency of the network highly depends on how the algorithm divides cluster area and selects cluster head. The proposed algorithm can be evaluated through the extensive simulation the result we obtained shows that the life time of a network is increased when energy load is distributed equally among the sensor.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

Algorithm for Improving the Efficiency of Storing Electricity using Experiments of Charging Characteristics for Industrial Lead-Acid Battery (산업용 연축전지의 충전특성실험에 근거한 축전효율 개선 알고리즘)

  • Park, Yun-Ho;Jeon, Sun-Yong;Seo, Bo-Hyeok
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.8
    • /
    • pp.432-441
    • /
    • 2000
  • It is difficult to analyze the charging characteristics of the lead-acid battery, because of the influences by various non-linear and time-variant parameters. In this study, the charging characteristics of high capacity industrial lead-acid battery 630 Ah was investigated through experiments with respect to the variations of temperature and the aged state of battery during the charging process. The database of those characteristics is established from the results of experiments, and the fuzzy logic charging algorithm is suggested using them. The results of experiment shows that the industrial lead-acid batteries can be always fully charged within the saved charging time by the proposed charging control algorithm adapting to the variations of charging condition. This new charging concept will be useful for developing the advanced battery charger improving the efficiency of storing electricity.

  • PDF

AN EFFICIENT LINE-DRAWING ALGORITHM USING MST

  • Min, Yong-Sik
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.2
    • /
    • pp.629-640
    • /
    • 2000
  • this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

A David Star Magic Square Algorithm for Efficient LED Control (효율적인 LED 제어를 위한 다윗 스타 마방진 알고리즘)

  • Lee, Kyung-Min;Lin, Chi-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.109-113
    • /
    • 2016
  • In this paper, we propose efficient LED lighting control algorithm using a David star magic square. Such algorithms increases the power reduction, the heat efficiency and LED life cycle and the efficiency of the LED lighting control consumption. Lighting system using existing Magic square algorithm could be reduced to increase the heat efficiency of the LED because the LED lighting time of the reduced cross-lighting. but it has a limit to the lighting control. If should apply the this proposed algorithm, can reduces power consumption and increases LED life-cycle, heat efficiency of LED lighting module and efficiency of the lighting control of the LED. This paper proposed that algorithm is by using a David star magic square on the LED Matrix. Divided into twelve areas to move the pattern in constant time interval, to perform the cross rotation and inversion techniques to thereby light up. In this paper proposed algorithm of this paper was compared with existing Magic square approach. As a result, power consumption and heat-value and luminous flux was reduced as the conventional lighting system. And, the LED lighting control increase the efficiency.

Improving Efficiency of Timeslot Assignment for Non-realtime Data in a DVB-RCS Return Link: Modeling and Algorithm

  • Lee, Ki-Dong;Cho, Yong-Hoon;Lee, Ho-Jin;Oh, Deock-Gil
    • ETRI Journal
    • /
    • v.25 no.4
    • /
    • pp.211-218
    • /
    • 2003
  • This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

  • PDF

Development of Distributed Rainfall-Runoff Model Using Multi-Directional Flow Allocation and Real-Time Updating Algorithm (I) - Theory - (다방향 흐름 분배와 실시간 보정 알고리듬을 이용한 분포형 강우-유출 모형 개발(I) - 이론 -)

  • Kim, Keuk-Soo;Han, Kun-Yeun;Kim, Gwang-Seob
    • Journal of Korea Water Resources Association
    • /
    • v.42 no.3
    • /
    • pp.247-257
    • /
    • 2009
  • In this study, a distributed rainfall-runoff model is developed using a multi-directional flow allocation algorithm and the real-time runoff updating algorithm. The developed model consists of relatively simple governing equations of hydrologic processes in order to apply developed algorithms and to enhance the efficiency of computational time which is drawback of distributed model application. The variability of topographic characteristics and flow direction according to various spatial resolution were analyzed using DEM(Digital Elevation Model) data. As a preliminary process using fine resolution DEM data, a multi-directional flow allocation algorithm was developed to maintain detail flow information in distributed rainfall-runoff simulation which has strong advantage in computation efficiency and accuracy. Also, a real-time updating algorithm was developed to update current watershed condition. The developed model is able to hold the information of actual behavior of runoff process in low resolution simulation. Therefore it is expected the improvement of forecasting accuracy and computational efficiency.

Time-varying modal parameters identification of large flexible spacecraft using a recursive algorithm

  • Ni, Zhiyu;Wu, Zhigang;Wu, Shunan
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.2
    • /
    • pp.184-194
    • /
    • 2016
  • In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

Real-Time Batch Size Determination in The Production Line (생산 라인에서의 실시간 배치 크기 결정)

  • Na, Kihyun;Kim, Minje;Lee, Jonghwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.1
    • /
    • pp.55-63
    • /
    • 2019
  • This paper develops an algorithm to determine the batch size of the batch process in real time for improving production and efficient control of production system with multiple processes and batch processes. It is so important to find the batch size of the batch process, because the variability arising from the batch process in the production system affects the capacity of the production. Specifically, batch size could change system efficiency such as throughput, WIP (Work In Process) in production system, batch formation time and so on. In order to improve the system variability and productivity, real time batch size determined by considering the preparation time and batch formation time according to the number of operation of the batch process. The purpose of the study is to control the WIP by applying CONWIP production system method in the production line and implements an algorithm for a real time batch size decision in a batch process that requires long work preparation time and affects system efficiency. In order to verify the efficiency of the developed algorithm that determine the batch size in a real time, an existed production system with fixed the batch size will be implemented first and determines that batch size in real time considering WIP in queue and average lead time in the current system. To comparing the efficiency of a system with a fixed batch size and a system that determines a batch size in real time, the results are analyzed using three evaluation indexes of lead time, throughput, and average WIP of the queue.

Time Utility and Channel State based Wireless Downlink Packet Scheduling Algorithm for OFDMA System (OFDMA 무선 시스템에서의 시간-효용과 채널 상태 기반의 하향 링크 패킷 스케줄링)

  • Ryu, Seung-Wan;Seo, Hyun-Hwa;Chung, Soo-Jung;Lim, Soon-Yong;Park, Sei-Kwon
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.111-121
    • /
    • 2004
  • In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.