• Title/Summary/Keyword: placement efficiency

Search Result 164, Processing Time 0.029 seconds

Policy for planned placement of sensor nodes in large scale wireless sensor network

  • Sharma, Vikrant;Patel, R.B;Bhadauria, HS;Prasad, D
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3213-3230
    • /
    • 2016
  • Sensor node (SN) is a crucial part in any remote monitoring system. It is a device designed to monitor the particular changes taking place in its environs. Wireless sensor network (WSN) is a system formed by the set of wirelessly connected SNs placed at different geographical locations within a target region. Precise placement of SNs is appreciated, as it affects the efficiency and effectiveness of any WSN. The manual placement of SNs is only feasible for small scale regions. The task of SN placement becomes tedious, when the size of a target region is extremely large and manually unreachable. In this research article, an automated mechanism for fast and precise deployment of SNs in a large scale target region has been proposed. It uses an assembly of rotating cannons to launch the SNs from a moving carrier helicopter. The entire system is synchronized such that the launched SNs accurately land on the pre-computed desired locations (DLs). Simulation results show that the proposed model offers a simple, time efficient and effective technique to place SNs in a large scale target region.

Two-dimensional concrete meso-modeling research based on pixel matrix and skeleton theory

  • Jingwei Ying;Yujun Jian;Jianzhuang Xiao
    • Computers and Concrete
    • /
    • v.33 no.6
    • /
    • pp.671-688
    • /
    • 2024
  • The modeling efficiency of concrete meso-models close to real concrete is one of the important issues that limit the accuracy of mechanical simulation. In order to improve the modeling efficiency and the closeness of the numerical aggregate shape to the real aggregate, this paper proposes a method for generating a two-dimensional concrete meso-model based on pixel matrix and skeleton theory. First, initial concrete model (a container for placing aggregate) is generated using pixel matrix. Then, the skeleton curve of the residual space that is the model after excluding the existing aggregate is obtained using a thinning algorithm. Finally, the final model is obtained by placing the aggregate according to the curve branching points. Compared with the traditional Monte Carlo placement method, the proposed method greatly reduces the number of overlaps between aggregates by up to 95%, and the placement efficiency does not significantly decrease with increasing aggregate content. The model developed is close to the actual concrete experiments in terms of aggregate gradation, aspect ratio, asymmetry, concavity and convexity, and old-new mortar ratio, cracking form, and stress-strain curve. In addition, the cracking loss process of concrete under uniaxial compression was explained at the mesoscale.

Structure of a Storage System Considering Disk Performance and Placement Policy Considering Video Data Characteristics in VOD Storage Servers (주문형 비디오 저장 서버에서 디스크 성능을 고려한 저장 시스템의 구조와 비디오 데이터의 특성에 따른 배치정책)

  • An, Yu-Jeong;Won, Yu-Heon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1296-1304
    • /
    • 1999
  • 본 논문은 다수의 고객들에게 실시간 재생 서비스를 제공하는 주문형 비디오 서버에서 데이타 검색의 효율을 높이기 위한 저장 시스템의 구조와 그에 따른 배치 정책을 제안한다. 주문형 비디오 저장 서버에서 동시에 보다 많은 고객들에게 그들이 원하는 서비스를 제공하기 위해서는 여러 분야에서의 다양한 정책들이 고려될 수 있으나, 특히 저장 매체들을 어떤 구조로 구성하고 여기에 비디오 객체들을 어떻게 배치할 것인가는 검색 효율과 직접 관계되는 중요한 문제이다. 본 논문에서는 디스크 배열 형태로 구성된 저장 시스템을 디스크 성능을 고려하여 재구성하고, 비디오 객체들을 저장할 때 저장하고자 하는 데이타의 특성들과 저장 구조를 함께 고려하여 검색 효율을 극대화할 수 있는 배치 방법을 제안한다. 마지막으로 제안된 정책의 검색 효율을 검증하기 위해 다양한 실험을 통하여 기존의 배치 정책들과 비교하고 성능을 평가한다.Abstract In this paper, we propose the structure of storage system and a placement policy to provide many clients with real-time playback services efficiently in VOD(video-on-demand) server. Though policies in various areas being considered to provide more clients with services of degree requested by them simultaneously in VOD storage server, it is important how to construct storage media and to place video objects on it for retrieval efficiency. In this paper, we reorganize a large disk array with disks performance and place video objects using the placement policy considering both characteristics of video data and the structure of storage system for maximizing retrieval efficiency. Lastly, we simulate the proposed policy and conventional policies through various environments, compare our policy with others n evaluate the performance of our policy.

A Multi-objective Placement of Phasor Measurement Units Considering Observability and Measurement Redundancy using Firefly Algorithm

  • Arul jeyaraj, K.;Rajasekaran, V.;Nandha kumar, S.K.;Chandrasekaran, K.
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.2
    • /
    • pp.474-486
    • /
    • 2015
  • This paper proposes a multi-objective optimal placement method of Phasor Measurement Units (PMUs) in large electric transmission systems. It is proposed for minimizing the number of PMUs for complete system observability and maximizing measurement redundancy of the buses, simultaneously. The measurement redundancy of the bus indicates that number of times a bus is able to monitor more than once by PMUs set. A high level of measurement redundancy can maximize the system observability and it is required for a reliable power system state estimation. Therefore, simultaneous optimizations of the two conflicting objectives are performed using a binary coded firefly algorithm. The complete observability of the power system is first prepared and then, single line loss contingency condition is added to the main model. The practical measurement limitation of PMUs is also considered. The efficiency of the proposed method is validated on IEEE 14, 30, 57 and 118 bus test systems and a real and large- scale Polish 2383 bus system. The valuable approach of firefly algorithm is demonstrated in finding the optimal number of PMUs and their locations by comparing its performance with earlier works.

A Study on Layout CAD of LSI (LSI의 Layout CAD에 관한 연구 -자동 배치 프로그램 개발-)

  • Lee, Byeong-Ho;Jeong, Jeong-Hwa;Im, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.4
    • /
    • pp.72-77
    • /
    • 1984
  • A placement program in LSI layout is developed and the results of test are discussed in this paper. In order to achieve 100% wiring, this paper introduces, as a virtual routing method, an algorithm which is close to the real routing. This algorithm is reflected to calculate the channel density. An object function is introduced to achieve minimization of total wire length, number of cuts, and maximum channel density simultaneously. The time complexity for the proposed virtual routing algorithm is O(n2). The time required for the algorithm is very short. This algorithm represents the routing state which is close to minimum wire length. So this algorithm is very proper to the application of placement problem. An auto-placement program is developed by the use of this algorithm. The efficiency of the proposed algorithm is shown in the test of the developed program.

  • PDF

Optimal placement of piezoelectric actuator/senor patches pair in sandwich plate by improved genetic algorithm

  • Amini, Amir;Mohammadimehr, Mehdi;Faraji, Alireza
    • Smart Structures and Systems
    • /
    • v.26 no.6
    • /
    • pp.721-733
    • /
    • 2020
  • The present study investigates the employing of piezoelectric patches in active control of a sandwich plate. Indeed, the active control and optimal patch distribution on this structure are presented together. A sandwich plate with honeycomb core and composite reinforced by carbon nanotubes in facesheet layers is considered so that the optimum position of actuator/sensor patches pair is guaranteed to suppress the vibration of sandwich structures. The sandwich panel consists of a search space which is a square of 200 × 200 mm with a numerous number of candidates for the optimum position. Also, different dimension of square and rectangular plates to obtain the optimal placement of piezoelectric actuator/senor patches pair is considered. Based on genetic algorithm and LQR, the optimum position of patches and fitness function is determined, respectively. The present study reveals that the efficiency and performance of LQR control is affected by the optimal placement of the actuator/sensor patches pair to a large extent. It is also shown that an intelligent selection of the parent, repeated genes filtering, and 80% crossover and 20% mutation would increase the convergence of the algorithm. It is noted that a fitness function is achieved by collection actuator/sensor patches pair cost functions in the same position (controllability). It is worth mentioning that the study of the optimal location of actuator/sensor patches pair is carried out for different boundary conditions of a sandwich plate such as simply supported and clamped boundary conditions.

Fabric Mapping and Placement of Field Programmable Stateful Logic Array (Field Programmable Stateful Logic Array 패브릭 매핑 및 배치)

  • Kim, Kyosun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.209-218
    • /
    • 2012
  • Recently, the Field Programmable Stateful Logic Array (FPSLA) was proposed as one of the most promising system integration technologies which will extend the life of the Moore's law. This work is the first proposal of the FPSLA design automation flow, and the approaches to logic synthesis, synchronization, physical mapping, and automatic placement of the FPSLA designs. The synchronization at each gate for pipelining determines the x-coordinates of cells, and reduces the placement to 1-dimensional problems. The objective function and its gradients for the non-linear optimization of the net length and placement density have been remodeled for the reduced global placement problem. Also, a recursive algorithm has been proposed to legalize the placement by relaxing the density overflow of bipartite bin groups in a top-down hierarchical fashion. The proposed model and algorithm are implemented, and validated by applying them to the ACM/SIGDA benchmark designs. The output state of a gate in an FPSLA needs to be duplicated so that each fanout gate can be connected to a dedicated copy. This property has been taken into account by merging the duplicated nets into a hyperedge, and then, splitting the hyperedge into edges as the optimization progresses. This yields additional 18.4% of the cell count reduction in the most dense logic stage. The practicality of the FPSLA can be further enhanced primarily by incorporating into the logic synthesis the constraint to avoid the concentrated fains of gates on some logic stages. In addition, an efficient algorithm needs to be devised for the routing problem which is based on a complicated graph. The graph models the nanowire crossbar which is trimmed to be embedded into the FPSLA fabric, and therefore, asymmetric. These CAD tools can be used to evaluate the fabric efficiency during the architecture enhancement as well as automate the design.

Network Optimization in the Inhomogeneous Distribution Using Genetic Algorithm Traffic (유전자 알고리즘을 이용한 비균일 트래픽 환경에서의 셀 최적화 알고리즘)

  • 박병성;한진규;최용석;조민경;박한규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.2B
    • /
    • pp.137-144
    • /
    • 2002
  • In this paper, we optimize the base station placement and transmission power using genetic approach. A new representation describing base station placement and transmit power with real number is proposed, and new genetic operators are introduced. This new representation can describe the locations, powers, and number of base stations, Considering coverage, power and economy efficiency, we also suggest a weighted objective function. Our algorithm is applied to an obvious optimization problem, and then it is verified. Moreover, our approach is tried in inhomogeneous traffic distribution. Simulation result proves that the algorithm enables to fad near optimal solution according to the weighted objective function.

Layout of Garment Patterns for Efficient Fabric Consumption

  • Madarasmi, Suthep;Sirivarothakul, Phoomsith
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1176-1179
    • /
    • 2002
  • This paper presents the use of a Genetic Algorithm to find the optimal layout for the placement of garment patterns on a fabric of fixed width to minimize fabric waste. We developed a program to simulate garment pieces and their layout on a fixed-width fabric. Each piece in the order book is placed with 2 possible orientations: 0 degrees and 180 degrees. The efficiency is measured by the length of fabric used after all the patterns in the order book have been laid out. A comparison is made between the placement using our proposed genetic algorithm to that made by an expert human using our simulation program. The results from our experiments on various pattern designs indicate that our genetic algorithm can effectively be used to obtain highly efficient solutions, comparable to that done by an expert while using a reasonable amount of time. The algorithm can also be adapted for use in other areas related to optimal consumption of sheet material such as metal, paper, and leather.

  • PDF

A Graph-based Model for RSUs Deployment in Vehicular Networks by Considering Urban and Network Limitations and QoS Requirements of Service Advertisement and Discovery

  • Balouchzahi, Nik Mohammad;Fathy, Mahmood;Akbari, Ahmad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1662-1681
    • /
    • 2015
  • The efficient send and receive of information in VANET improves the efficiency of the safety and traffic services advertisment and discovery. However, if the V2V is the only communication system used, the restrictions of the urban environment and network drop the performance of VANET. In order to improve the performance of the network, it is necessary to use V2I communication as well as V2V communication. Therefore, RSUs must be placed in the environment. However due to the high costs of placement, the full coverage of the environment would not be possible. Therefore, it is necessary to optimally install a limited number of RSUs in the environment.