• Title/Summary/Keyword: Power Scheduling

Search Result 547, Processing Time 0.023 seconds

Priority Selection of Firearms and Ammunition for the Local Reserve Forces using Dynamic Programming (동적계획법에 기반한 지역예비군 총기, 탄약 분배 우선순위 선정에 관한 연구)

  • Cho, Sangjoon;Ma, Jungmok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.8
    • /
    • pp.67-74
    • /
    • 2020
  • One of the missions of active-duty units in charge of managing reserve forces is providing combat supplies to reserve forces to exercise their combat capabilities quickly when declaring a mobilization order. Rear area active-duty units must support large local reserve forces. On the other hand, military units have difficulties due to a lack of forces and the storage of large quantities of firearms and ammunition. For this reason, local reserve forces should move to an integrated storing place and receive their firearms and ammunition. The existing distribution plan (existing plan) is a first-in-first-out plan that can produce inconsistent distribution orders. The inconsistent distribution orders can increase the complete distribution time, which will affect the combat power of local reserve forces. Therefore, firearms and ammunition should be distributed quickly. Accordingly, this paper proposes the priority selection of firearms and ammunition for local reserve forces with a minimum complete distribution time using Dynamic Programming. To verify the proposed model, the existing plan was compared with the proposed model using real data, and the result showed that the proposed model outperformed the existing plan.

An Analysis of Optimal Operation Strategy of ESS to Minimize Electricity Charge Using Octave (Octave를 이용한 전기 요금 최소화를 위한 ESS 운전 전략 최적화 방법에 대한 분석)

  • Gong, Eun Kyoung;Sohn, Jin-Man
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.4
    • /
    • pp.85-92
    • /
    • 2018
  • Reductions of the electricity charge are achieved by demand management of the load. The demand management method of the load using ESS involves peak shifting, which shifts from a high demand time to low demand time. By shifting the load, the peak load can be lowered and the energy charge can be saved. Electricity charges consist of the energy charge and the basic charge per contracted capacity. The energy charge and peak load are minimized by Linear Programming (LP) and Quadratic Programming (QP), respectively. On the other hand, each optimization method has its advantages and disadvantages. First, the LP cannot separate the efficiency of the ESS. To solve these problems, the charge and discharge efficiency of the ESS was separated by Mixed Integer Linear Programming (MILP). Nevertheless, both methods have the disadvantages that they must assume the reduction ratio of peak load. Therefore, QP was used to solve this problem. The next step was to optimize the formula combination of QP and LP to minimize the electricity charge. On the other hand, these two methods have disadvantages in that the charge and discharge efficiency of the ESS cannot be separated. This paper proposes an optimization method according to the situation by analyzing quantitatively the advantages and disadvantages of each optimization method.

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

A Study on Efficient Cell Queueing and Scheduling Algorithms for Multimedia Support in ATM Switches (ATM 교환기에서 멀티미디어 트래픽 지원을 위한 효율적인 셀 큐잉 및 스케줄링 알고리즘에 관한 연구)

  • Park, Jin-Su;Lee, Sung-Won;Kim, Young-Beom
    • Journal of IKEEE
    • /
    • v.5 no.1 s.8
    • /
    • pp.100-110
    • /
    • 2001
  • In this paper, we investigated several buffer management schemes for the design of shared-memory type ATM switches, which can enhance the utilization of switch resources and can support quality-of-service (QoS) functionalities. Our results show that dynamic threshold (DT) scheme demonstrate a moderate degree of robustness close to pushout(PO) scheme, which is known to be impractical in the perspective of hardware implementation, under various traffic conditions such as traffic loads, burstyness of incoming traffic, and load non-uniformity across output ports. Next, we considered buffer management strategies to support QoS functions, which utilize parameter values obtained via connection admission control (CAC) procedures to set tile threshold values. Through simulations, we showed that the buffer management schemes adopted behave well in the sense that they can protect regulated traffic from unregulated cell traffic in allocating buffer space. In particular, it was observed that dynamic partitioning is superior in terms of QoS support than virtual partitioning.

  • PDF

Time Synchronization Algorithm using the Clock Drift Rate and Reference Signals Between Two Sensor Nodes (클럭 표류율과 기준 신호를 이용한 두 센서 노드간 시간 동기 알고리즘)

  • Kim, Hyoun-Soo;Jeon, Joong-Nam
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.51-56
    • /
    • 2009
  • Time synchronization algorithm in wireless sensor networks is essential to various applications such as object tracking, data encryption, duplicate detection, and precise TDMA scheduling. This paper describes CDRS that is a time synchronization algorithm using the Clock Drift rate and Reference Signals between two sensor nodes. CDRS is composed of two steps. At first step, the time correction is calculated using offset and the clock drift rate between the two nodes based on the LTS method. Two nodes become a synchronized state and the time variance can be compensated by the clock drift rate. At second step, the synchronization node transmits reference signals periodically. This reference signals are used to calculate the time difference between nodes. When this value exceeds the maximum error tolerance, the first step is performed again for resynchronization. The simulation results on the performance analysis show that the time accuracy of the proposed algorithm is improved, and the energy consumption is reduced 2.5 times compared to the time synchronization algorithm with only LTS, because CDRS reduces the number of message about 50% compared to LTS and reference signals do not use the data space for timestamp.

Bit-serial Discrete Wavelet Transform Filter Design (비트 시리얼 이산 웨이블렛 변환 필터 설계)

  • Park Tae geun;Kim Ju young;Noh Jun rye
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4A
    • /
    • pp.336-344
    • /
    • 2005
  • Discrete Wavelet Transform(DWT) is the oncoming generation of compression technique that has been selected for MPEG4 and JEPG2000, because it has no blocking effects and efficiently determines frequency property of temporary time. In this paper, we propose an efficient bit-serial architecture for the low-power and low-complexity DWT filter, employing two-channel QMF(Qudracture Mirror Filter) PR(Perfect Reconstruction) lattice filter. The filter consists of four lattices(filter length=8) and we determine the quantization bit for the coefficients by the fixed-length PSNR(peak-signal-to-noise ratio) analysis and propose the architecture of the bit-serial multiplier with the fixed coefficient. The CSD encoding for the coefficients is adopted to minimize the number of non-zero bits, thus reduces the hardware complexity. The proposed folded 1D DWT architecture processes the other resolution levels during idle periods by decimations and its efficient scheduling is proposed. The proposed architecture requires only flip-flops and full-adders. The proposed architecture has been designed and verified by VerilogHDL and synthesized by Synopsys Design Compiler with a Hynix 0.35$\mu$m STD cell library. The maximum operating frequency is 200MHz and the throughput is 175Mbps with 16 clock latencies.

A Backup Node Based Fault-tolerance Scheme for Coverage Preserving in Wireless Sensor Networks (무선 센서 네트워크에서의 감지범위 보존을 위한 백업 노드 기반 결함 허용 기법)

  • Hahn, Joo-Sun;Ha, Rhan
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.4
    • /
    • pp.339-350
    • /
    • 2009
  • In wireless sensor networks, the limited battery resources of sensor nodes have a direct impact on network lifetime. To reduce unnecessary power consumption, it is often the case that only a minimum number of sensor nodes operate in active mode while the others are kept in sleep mode. In such a case, however, the network service can be easily unreliable if any active node is unable to perform its sensing or communication function because of an unexpected failure. Thus, for achieving reliable sensing, it is important to maintain the sensing level even when some sensor nodes fail. In this paper, we propose a new fault-tolerance scheme, called FCP(Fault-tolerant Coverage Preserving), that gives an efficient way to handle the degradation of the sensing level caused by sensor node failures. In the proposed FCP scheme, a set of backup nodes are pre-designated for each active node to be used to replace the active node in case of its failure. Experimental results show that the FCP scheme provides enhanced performance with reduced overhead in terms of sensing coverage preserving, the number of backup nodes and the amount of control messages. On the average, the percentage of coverage preserving is improved by 87.2% while the additional number of backup nodes and the additional amount of control messages are reduced by 57.6% and 99.5%, respectively, compared with previous fault-tolerance schemes.