• Title/Summary/Keyword: Idle Time

Search Result 375, Processing Time 0.037 seconds

TASL: A Traffic-Adapted Sleep/Listening MAC Protocol for Wireless Sensor Network

  • Yang, Yuan;Zhen, Fu;Lee, Tae-Seok;Park, Myong-Soon
    • Journal of Information Processing Systems
    • /
    • v.2 no.1
    • /
    • pp.39-43
    • /
    • 2006
  • In this paper, we proposed TASL-MAC, a medium-access control (MAC) protocol for wireless sensor networks. In wireless sensor networks, sensor nodes are usually deployed in a special environment, are assigned with long-term work, and are supported by a limited battery. As such, reducing the energy consumption becomes the primary concern with regard to wireless sensor networks. At the same time, reducing the latency in multi-hop data transmission is also very important. In the existing research, sensor nodes are expected to be switched to the sleep mode in order to reduce energy consumption. However, the existing proposals tended to assign the sensors with a fixed Sleep/Listening schedule, which causes unnecessary idle listening problems and conspicuous transmission latency due to the diversity of the traffic-load in the network. TASL-MAC is designed to dynamically adjust the duty listening time based on traffic load. This protocol enables the node with a proper data transfer rate to satisfy the application's requirements. Meanwhile, it can lead to much greater power efficiency by prolonging the nodes' sleeping time when the traffic. We evaluate our implementation of TASL-MAC in NS-2. The evaluation result indicates that our proposal could explicitly reduce packet delivery latency, and that it could also significantly prolong the lifetime of the entire network when traffic is low.

A Genetic Algorithm Based Task Scheduling for Cloud Computing with Fuzzy logic

  • Singh, Avtar;Dutta, Kamlesh
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.6
    • /
    • pp.367-372
    • /
    • 2013
  • Cloud computing technology has been developing at an increasing expansion rate. Today most of firms are using this technology, making improving the quality of service one of the most important issues. To achieve this, the system must operate efficiently with less idle time and without deteriorating the customer satisfaction. This paper focuses on enhancing the efficiency of a conventional Genetic Algorithm (GA) for task scheduling in cloud computing using Fuzzy Logic (FL). This study collected a group of task schedules and assessed the quality of each task schedule with the user expectation. The work iterates the best scheduling order genetic operations to make the optimal task schedule. General GA takes considerable time to find the correct scheduling order when all the fitness function parameters are the same. GA is an intuitive approach for solving problems because it covers all possible aspects of the problem. When this approach is combined with fuzzy logic (FL), it behaves like a human brain as a problem solver from an existing database (Memory). The present scheme compares GA with and without FL. Using FL, the proposed system at a 100, 400 and 1000 sample size*5 gave 70%, 57% and 47% better improvement in the task time compared to GA.

  • PDF

Design of Automated Negotiation Scheduling System for Medical Services (의료서비스를 위한 자동협상 스케줄링 시스템 설계)

  • Kim, Kyoung-Hwan
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.59-67
    • /
    • 2008
  • New system solves scheduling problem in medical services. The existing scheduling system by FCFS is for a hospital but new system expresses the condition of a hospital and the profit of separate system's parties by the automated negotiation. This system expresses user preference time as a priority number and is designed that the schedule is changed according to the priority number with a negotiation strategy for a patient. And a hospital makes a schedule according to the policy. The system supports customer satisfaction in medical services by considering not only equipment efficiency but also the patent waiting time unlike the existing system considering the idle time for a equipment.

  • PDF

A Study on The Adaptive Control of the Rotational Systems by Means of the Normal Model Tracking Method (규범모델 추종방식에 의한 회전계통의 적응속도제어에 관한 연구)

  • 하주식;송문현
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.19 no.3
    • /
    • pp.77-83
    • /
    • 1995
  • Recently, in the field of industrial servo-systems, several methods have been proposed for tracking the reference input fastly and finely without overshoot. These methods, however, are established under hypothesis that structure and parameters of the plant are known accurately and they are time invariant. In practice, it is difficult to obtain the values of plant's parameters accurately and usually plants change with time and operation conditions. In this paper a method to construct the nominal model tracking adaptive control system is proposed. The system is composed of the nomial model which produces a ideal response and the model tracking system with the fuzzy adaptive controller. If the actual plant is equal to the controlled object in the nominal model, the output of the plant is the same as that of the nominal model and the fuzzy adaptive controller becomes idle. However, when the plant changes, the fuzzy adaptive controller of the tracking system operates in order for the output of the plant to track the ideal response. Through the computer simulations under various conditions, it is confirmed that the proposed model tracking system is very effective.

  • PDF

(r, Q) Policy for Operation of a Multipurpose Facility (단일 범용설비 운영을 위한 (r, Q) 정책)

  • ;Oh, Geun-Tae
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.3
    • /
    • pp.27-46
    • /
    • 1992
  • This paper considers an (r, Q) policy for operation of a multipurpose facility. It is assumed that whenever the inventory level falls below r, the model starts to produce the fixed amount of Q. The facility can be utilized for extra production during idle periods, that is, when the inventory level is still greater than r right after a main production operation is terminated or an extra production operation is finished. But, whenever the facility is in operation for an extra production, the operation can not be terminated for the main production even though the inventory level falls below r. In the model, the demand for the product is assumed to arrive according to a compound Poisson process and the processing time required to produce a product is assumed to follow an arbitary distribution. Similarly, the orders for the extra production is assumed to accur in a Poisson process are the extra production processing time is assumed to follow an arbitrary distribution. It is further assumed that unsatisfied demands are backordered and the expected comulative amount of demands is less than that of production during each production period. Under a cost structure which includes a setup/ production cost, a linear holding cost, a linear backorder cost, a linear extra production lost sale cost, and a linear extra production profit, an expression for the expected cost per unit time for a given (r, Q) policy is obtained, and using a convex property of the cost function, a procedure to find the optimal (r, Q) policy is presented.

  • PDF

A Novel Prediction-based Spectrum Allocation Mechanism for Mobile Cognitive Radio Networks

  • Wang, Yao;Zhang, Zhongzhao;Yu, Qiyue;Chen, Jiamei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2101-2119
    • /
    • 2013
  • The spectrum allocation is an attractive issue for mobile cognitive radio (CR) network. However, the time-varying characteristic of the spectrum allocation is not fully investigated. Thus, this paper originally deduces the probabilities of spectrum availability and interference constrain in theory under the mobile environment. Then, we propose a prediction mechanism of the time-varying available spectrum lists and the dynamic interference topologies. By considering the node mobility and primary users' (PUs') activity, the mechanism is capable of overcoming the static shortcomings of traditional model. Based on the mechanism, two prediction-based spectrum allocation algorithms, prediction greedy algorithm (PGA) and prediction fairness algorithm (PFA), are presented to enhance the spectrum utilization and improve the fairness. Moreover, new utility functions are redefined to measure the effectiveness of different schemes in the mobile CR network. Simulation results show that PGA gets more average effective spectrums than the traditional schemes, when the mean idle time of PUs is high. And PFA could achieve good system fairness performance, especially when the speeds of cognitive nodes are high.

Effecient Prefetching Scheme for Hybrid Hard Disk (하이브리드 하드디스크를 위한 효율적인 선반입 기법)

  • Kim, Jeong-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.5
    • /
    • pp.665-671
    • /
    • 2011
  • The Competitiveness of Hybrid hard disk drive(H-HDD) for solid state disk(SSD) comes from both lower power consumption and higher reading speed. This paper suggests a prefetching scheme that can improve the performance of Non-Volatile cache(NVCache) memory installed on the H-HDD through prefetching disk blocks as well as files to the NVCache. The proposed scheme makes the highly used data such as booting files copy to the NVCache as an unit of file and the frequently accessed blocks copy to the NVCache. This prefetching is done on the idle time of disk queue and the priorities of prefetched target blocks are based on both time and spatial locality of blocks. Experiments results show that the suggested method can improve response time of H-HDD and also lower the power consumption.

PM-MAC : An Efficient MAC Protocol for Periodic Traffic Monitoring In Wireless Sensor Networks (무선 센서 네트워크에서 주기적인 트래픽의 효율적인 모니터링을 위한 MAC 프로토콜)

  • Kim, Dong-Min;Kim, Seong-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.7
    • /
    • pp.157-164
    • /
    • 2008
  • In this paper we suggest a scheduling algorithm that transmits periodic traffics efficiently in tree-structured wireless sensor networks (WSNs). The related research[l] showed the problems such as increasing the energy consumption and decreasing the data throughput as the depth of tree increases. To solve these problems. we use idle time slots and avoid the redundancy at data transmission. Also we suggest the algorithm that transmits the control packet when it is similar to a previously measured data. And if emergency data is occurred, our proposed algorithm transits that data in EDP(Emergency Data Period) for reducing the wait time. The proposed algorithm shows more data throughput and less energy consumption than that of the related research.

  • PDF

Optimal N-Policy of M/G/1 with Server Set-up Time under Heterogeneous Arrival Rates (서버상태의존 도착률을 갖는 M/G/l 모형의 최적 제어정책)

  • Paik, Seung-Jin;Hur, Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.43
    • /
    • pp.153-162
    • /
    • 1997
  • M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

  • PDF

Developing an On-line Scheduling System for Increasing Effectiveness of Public Research Facility (공공기관 연구시설장비 효율성 향상을 위한 온라인 일정계획 시스템 개발)

  • Lee, Chae-Yun;Kim, Ki-Hong;Shin, Seung-Jun
    • Journal of the Korea Safety Management & Science
    • /
    • v.19 no.1
    • /
    • pp.181-189
    • /
    • 2017
  • The systematic management of technology infrastructure increasingly becomes critical as it represents the driving power for creating competitive advantage of nations and enterprises. In this sense, public facility and equipment, which is one major asset of technology infrastructure, should be managed effectively, systematically and efficiently to increase its overall equipment effectiveness. However, the manual and off-line communication was the unique way to communicate between the suppliers who provide facilities in the public sector and the customers who utilize the facilities in the industrial sector. This communication way caused invisibility of available usage time and increase of idle time, thereby decreasing the equipment effectiveness. This paper presents an web-based scheduling system that enables real-time collaboration and information sharing for increasing the equipment effectiveness. The designed system performs scheduling, facility management, order management and customer relationship management in an on-line platform, and carries out the processing and storing of relevant information in an integrated database. The paper includes a development approach to identify business process models and standardized system models by using object-modeling technique. The deliverable of the present work will contribute to increasing the equipment effectiveness by enhancing visibility, transparency and predictability by means of the integration with a legacy Enterprise Resource Planning.