• 제목/요약/키워드: coverage optimization

검색결과 121건 처리시간 0.026초

스텝 커버리지를 위한 PSG와 기첩처리 공정 조건의 개선 (Optimization of PSG Flowing and Metallization for Step Coverage Improvement)

  • 김도진;이종덕
    • 대한전자공학회논문지
    • /
    • 제19권6호
    • /
    • pp.91-95
    • /
    • 1982
  • LSI나 VLSI 소자의 제조 공정중 금속막이 기존의 스텝 커버리지를 좋게 하는 것은 매우 중요한 일이다. 본 인구에서 얻어진 방법은 8.0∼8.6wt.%의 인을 고함하는 PCG를 증기 (steam) 분위기의 950℃에서 30분간 열처리한 후 250℃에서 1 um의 악루미늄을 증착하는 것이다. One significant problem which arises during the fabrication of LSI and/or VLSI is how to make a good step coverage for aluminum. One way developed in this study is to flow PSG containing 8.0 wt.% - 8.6 wt.% of phosphorus at 950℃ for 30 minutes in steam and to depo3it aluminum of 1 urn thickness at 250℃.

  • PDF

An Optimization Algorithm for the Maximum Lifetime Coverage Problems in Wireless Sensor Network

  • Ahn, Nam-Su;Park, Sung-Soo
    • Management Science and Financial Engineering
    • /
    • 제17권2호
    • /
    • pp.39-62
    • /
    • 2011
  • In wireless sensor network, since each sensor is equipped with a limited power, efficient use of the energy is important. One possible network management scheme is to cluster the sensors into several sets, so that the sensors in each of the sets can completely perform the monitoring task. Then the sensors in one set become active to perform the monitoring task and the rest of the sensors switch to a sleep state to save energy. Therefore, we rotate the roles of the active set among the sensors to maximize the network lifetime. In this paper, we suggest an optimal algorithm for the maximum lifetime coverage problem which maximizes the network lifetime. For comparison, we implemented both the heuristic proposed earlier and our algorithm, and executed computational experiments. Our algorithm outperformed the heuristic concerning the obtained network lifetimes, and it found the solutions in a reasonable amount of time.

法治监督体系中的监察监督及其实现机制研究 (Research on Supervision and its Realization Mechanism in Legal Supervision System)

  • Wang, Jianglian
    • 분석과 대안
    • /
    • 제4권1호
    • /
    • pp.89-103
    • /
    • 2020
  • The "rule of law" decision of the Fourth Plenary Session of the 18th Central Committee of the Communist Party of China proposes to build a strict supervision system of the rule of law. The reform of the national supervision system launched in 2016 can be described as an important measure to build such a system. The supervision and supervision system has gradually become the core system of the rule of law supervision system. Its full coverage of supervision of public officials is conducive to preventing corruption of public power and achieving the ultimate goal of supervision by the rule of law. The supervision mechanism in the supervision system under the rule of law requires systemic thinking to realize the effective supervision of public officials of the state power organs, as well as the constraints and supervision of other supervision systems, including the supervision of the People's Congress; Supervision is a full-coverage supervision, and other rules of law supervision systems are also full-coverage supervision systems within their scope of competence. Therefore, gradually exploring and constructing an external supervision system for supervision will be conducive to the optimization and eventual completion of the rule of law supervision system.

  • PDF

최대 커버리지 센서 배치를 위한 유전 알고리즘 (Genetic Algorithms for Maximizing the Coverage of Sensor Deployment)

  • 윤유림;김용혁
    • 한국지능시스템학회논문지
    • /
    • 제20권3호
    • /
    • pp.406-412
    • /
    • 2010
  • 본 논문에서는 실세계에서 센서를 배치할 때 발생하는 최적화 문제인 최대 커버리지 센서 배치 문제를 정의하고 문제의 해 공간의 특성을 분석하였다. 또한 최대 커버리지 센서 배치 문제의 좋은 해를 얻기 위해 유전 알고리즘을 설계하고 그 우수성을 비교 실험을 통해 보였다. 이 문제에 유전 알고리즘을 적용할 때 중요하게 고려되어야 할 부분은 평가 함수를 어떻게 구현하느냐 인데 몬테카를로법을 통해 해결할 수 있었다. 유전 알고리즘의 몬테카를로법을 이용한 평가 부분에서 샘플 생성 횟수를 조절함으로써 동일한 성능을 내면서 계산 시간을 크게 줄일 수 있었다.

An efficient multi-objective cuckoo search algorithm for design optimization

  • Kaveh, A.;Bakhshpoori, T.
    • Advances in Computational Design
    • /
    • 제1권1호
    • /
    • pp.87-103
    • /
    • 2016
  • This paper adopts and investigates the non-dominated sorting approach for extending the single-objective Cuckoo Search (CS) into a multi-objective framework. The proposed approach uses an archive composed of primary and secondary population to select and keep the non-dominated solutions at each generation instead of pairwise analogy used in the original Multi-objective Cuckoo Search (MOCS). Our simulations show that such a low computational complexity approach can enrich CS to incorporate multi-objective needs instead of considering multiple eggs for cuckoos used in the original MOCS. The proposed MOCS is tested on a set of multi-objective optimization problems and two well-studied engineering design optimization problems. Compared to MOCS and some other available multi-objective algorithms such as NSGA-II, our approach is found to be competitive while benefiting simplicity. Moreover, the proposed approach is simpler and is capable of finding a wide spread of solutions with good coverage and convergence to true Pareto optimal fronts.

Discrete bacterial foraging optimization for resource allocation in macrocell-femtocell networks

  • Lalin, Heng;Mustika, I Wayan;Setiawan, Noor Akhmad
    • ETRI Journal
    • /
    • 제40권6호
    • /
    • pp.726-735
    • /
    • 2018
  • Femtocells are good examples of the ultimate networking technology, offering enhanced indoor coverage and higher data rate. However, the dense deployment of femto base stations (FBSs) and the exploitation of subcarrier reuse between macrocell base stations and FBSs result in significant co-tier and cross-tier interference, thus degrading system performance. Therefore, appropriate resource allocations are required to mitigate the interference. This paper proposes a discrete bacterial foraging optimization (DBFO) algorithm to find the optimal resource allocation in two-tier networks. The simulation results showed that DBFO outperforms the random-resource allocation and discrete particle swarm optimization (DPSO) considering the small number of steps taken by particles and bacteria.

Constrained Relay Node Deployment using an improved multi-objective Artificial Bee Colony in Wireless Sensor Networks

  • Yu, Wenjie;Li, Xunbo;Li, Xiang;Zeng, Zhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권6호
    • /
    • pp.2889-2909
    • /
    • 2017
  • Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

Constellation Multi-Objective Optimization Design Based on QoS and Network Stability in LEO Satellite Broadband Networks

  • Yan, Dawei;You, Peng;Liu, Cong;Yong, Shaowei;Guan, Dongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1260-1283
    • /
    • 2019
  • Low earth orbit (LEO) satellite broadband network is a crucial part of the space information network. LEO satellite constellation design is a top-level design, which plays a decisive role in the overall performance of the LEO satellite network. However, the existing works on constellation design mainly focus on the coverage criterion and rarely take network performance into the design process. In this article, we develop a unified framework for constellation optimization design in LEO satellite broadband networks. Several design criteria including network performance and coverage capability are combined into the design process. Firstly, the quality of service (QoS) metrics is presented to evaluate the performance of the LEO satellite broadband network. Also, we propose a network stability model for the rapid change of the satellite network topology. Besides, a mathematical model of constellation optimization design is formulated by considering the network cost-efficiency and stability. Then, an optimization algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) is provided for the problem of constellation design. Finally, the proposed method is further evaluated through numerical simulations. Simulation results validate the proposed method and show that it is an efficient and effective approach for solving the problem of constellation design in LEO satellite broadband networks.

인도어 무선통신시스템에서 고정적 인도어기지국 선택을 통한 자가치유 알고리즘 (Fixed Indoor-BS Selection Based Self-Healing in Indoor Wireless Communication System)

  • 이호원;이기송
    • 한국정보통신학회논문지
    • /
    • 제18권7호
    • /
    • pp.1540-1546
    • /
    • 2014
  • 인도어 기지국(Indoor BS) 결함으로 인해 발생하는 커버리지홀 문제를 해결하기 위하여, 새로운 프레임 구조와 최적화 기법 기반의 실제적인 알고리즘을 제안한다. 우리의 핵심 공헌은 다음과 같다: 1) 갑작스런 IBS 결함 문제 해결을 위한 힐링(healing) 채널을 가지는 새로운 프레임 구조를 제안하고 2) 최적화 문제의 복잡도 감소를 위한 고정적 IBS 선택에 기반한 효과적인 휴리스틱 자원할당 알고리즘을 제안한다. 시뮬레이션을 통하여 평균 셀 용량과 사용자 공평성 관점에서 기존 알고리즘에 비해 제안 방안이 우수함을 증명한다.

Low-Complexity Energy Efficient Base Station Cooperation Mechanism in LTE Networks

  • Yu, Peng;Feng, Lei;Li, Zifan;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권10호
    • /
    • pp.3921-3944
    • /
    • 2015
  • Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.