• Title/Summary/Keyword: multiple chains

Search Result 99, Processing Time 0.022 seconds

A time-cost tradeoff problem with multiple interim assessments under the precedence graph with two chains in parallel

  • Choi, Byung-Cheon;Min, Yunhong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.3
    • /
    • pp.85-92
    • /
    • 2018
  • We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

Energy Efficient Routing Protocol Based on PEGASIS in WSN Environment (WSN 환경에서 PEGASIS 기반 에너지 효율적 라우팅 프로토콜)

  • Byoung-Choul Baek;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.579-586
    • /
    • 2023
  • A wireless sensor network (WSN) has limited battery power because it is used wirelessly using low-cost small sensors. Since the battery cannot be replaced, the lifespan of the sensor node is directly related to the lifespan of the battery, so power must be used efficiently to maximize the lifespan of the network. In this study, based on PEGASIS, a representative energy-efficient routing protocol, we propose a protocol that classifies layers according to the distance from the sink node and configures multiple chains rather than one chain. The proposed protocol can increase network lifespan by reducing the transmission distance between nodes to prevent unnecessary energy consumption.

Performance Evaluation of Analog-digital Beamforming for Uplink Multi-User Millimeter Wave Systems (다수 사용자를 지원하는 상향링크 밀리미터 파 시스템을 위한 아날로그-디지털 빔포밍의 성능 평가)

  • Kim, Seong Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.29-34
    • /
    • 2017
  • This paper considers hybrid beamforming for millimeter wave system in uplink transmission where multiple users send their data streams simultaneously. Hybrid beamforming has low-cost and low power consumption features compared to conventional digital beamforming schemes. We assume that each user uses one transmit antenna and sends one data stream, while the base station has multiple receive antennas and multiple radio frequency chains. Therefore, hybrid beamforming is performed only at the base station. We also assume that each user does not know instantaneous channel side information (CSI), while the base station is able to estimate the CSI from all users accurately. Under this channel assumption, the outage probability is not zero. We evaluate the outage probability of the considered hybrid beamforming as a performance metric through computer simulations. We show that the outage probability of hybrid beamforming approaches that of digital beamforming in some cases.

Low-complexity Joint Transmit/Receive Antenna Selection Algorithm for Multi-Antenna Systems (다중 안테나 시스템을 위한 낮은 복잡도의 송/수신안테나 선택 알고리즘)

  • Son, Jun-Ho;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10A
    • /
    • pp.943-951
    • /
    • 2006
  • Multi-input-multi-output (MIMO) systems are considered to improve the capacity and reliability of next generation mobile communication. However, the multiple RF chains associated with multiple antennas are costly in terms of size, power and hardware. Antenna selection is a low-cost low-complexity alternative to capture many of the advantages of MIMO systems. We proposed new joint Tx/Rx antenna selection algorithm with low complexity. The proposed algorithm is a method selects $L_R{\times}L_T$ channel matrix out of $L_R{\times}L_T$ entire channel gain matrix where $L_R{\times}L_T$ matrix selects alternate Tx antenna with Rx antenna which have the largest channel gain to maximize Frobenius norm. The feature of this algorithm is very low complexity compare with Exhaustive search which have optimum capacity. In case of $4{\times}4$ antennas selection out of $8{\times}8$ antennas, the capacity decreases $0.5{\sim}2dB$ but the complexity also decreases about 1/10,000 than optimum exhaustive search.

A Multi-Service MAC Protocol in a Multi-Channel CSMA/CA for IEEE 802.11 Networks

  • Ben-Othman, Jalel;Castel, Hind;Mokdad, Lynda
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.287-296
    • /
    • 2008
  • The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

Energy Efficient Wireless Sensor Networks Using Linear-Programming Optimization of the Communication Schedule

  • Tabus, Vlad;Moltchanov, Dmitri;Koucheryavy, Yevgeni;Tabus, Ioan;Astola, Jaakko
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.184-197
    • /
    • 2015
  • This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

Electrical and rheological properties of chitosan malonate suspension

  • Ko, Young-Gun;Choi, Ung-Su
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 2002.10b
    • /
    • pp.345-346
    • /
    • 2002
  • The electrical and rheological properties of a chitosan malonate suspension in silicone oil was investigated by varying the electric fields, volume fractions of particles, and shear rates, respectively. The chitosan malonate susepnsion showed a typical electrorheological (ER) response caused by the polarizability of an amide polar group and shear yield stress due to the formation of multiple chains upon application of an electric field. The shear stress for the suspension exhibited a linear dependence on the volume fraction and an electric field power of 1.88. On the basis of the results, the newly synthesized chitosan malonate suspension was found to be an anhydrous ER fluid.

  • PDF

Explicit integration algorithm for fully flexible unit cell simulation with recursive thermostat chains (순환적으로 결합되는 정온기들을 갖는 $N{\sigma}T$ 분자동역학 전산모사에 적용한 외연적 적분기법)

  • Jung, Kwang-Sub;Cho, Maeng-Hyo
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.512-517
    • /
    • 2007
  • In the previous development of the recursive thermostat chained fully flexible cell molecular dynamics simulation, implicit time integration method such as generalized leapfrog integration is used. The implicit algorithm is very much complicated and not easy to show time reversibility because it is solved by the nonlinear iterative procedure. Thus we develop simple, explicit symplectic time integration formula for the recursive thermostat chained fully flexible unit cell simulation. Uniaxial tension test is performed to verify the present explicit algorithm. We check that the present simulation satisfies the ergodic hypothesis for various values of fictitious mass and coefficient of multiple thermostat system. The proposed method should be helpful to predict mechanical and thermal behavior of nano-scale structure.

  • PDF

Cooperative effect in space-dependent Parrondo games (공간의존 파론도 게임의 협력 효과)

  • Lee, Jiyeon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.4
    • /
    • pp.745-753
    • /
    • 2014
  • Parrondo paradox is the counter-intuitive situation where individually losing games can combine to win or individually winning games can combine to lose. In this paper, we compare the history-dependent Parrondo games and the space-dependent Parrondo games played cooperatively by the multiple players. We show that there is a probability region where the history-dependent Parrondo game is a losing game whereas the space-dependent Parrondo game is a winning game.

Design and Tracking Control of 4-DOF Motion Platform for Bicycle Simulator (자전거 시뮬레이터용 4자유도 운동판의 설계 및 추적 제어)

  • 성지원;신재철;이종원
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2001.11a
    • /
    • pp.235-240
    • /
    • 2001
  • A four degrees of freedom (dof) motion platform for bicycle simulator is developed. The motion platform, capable of the vertical linear and three angular motions, is designed based on analysis of the typical motion characteristics revealed by the existing six dof bicycle simulator. The platform essentially consists of two parts: the three dof parallel manipulator, consisting of a moving platform, a fixed base and three actuators, and the turntable to generate the yaw motion. The nonlinear kinematics and dynamics of the three dof parallel manipulator with multiple closed loop chains are analyzed for tracking control of the motion platform. The tracking performances of the three control schemes are experimentally compared: the computed torque method (CTM), the sliding mode control (SMC) and the PD control. The CTM and SMC, incorporated with the system dynamics model, are found to be equally better in performance than the PD controller, irrespective of the presence of external disturbance.

  • PDF