• Title/Summary/Keyword: Network Schedule

Search Result 275, Processing Time 0.025 seconds

Sector-based Charging Schedule in Rechargeable Wireless Sensor Networks

  • Alkhalidi, Sadam;Wang, Dong;Al-Marhabi, Zaid A. Ali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4301-4319
    • /
    • 2017
  • Adopting mobile chargers (MC) in rechargeable wireless sensors network (R-WSN) to recharge sensors can increase network efficiency (e.g., reduce MC travel distance per tour, reduce MC effort, and prolong WSN lifetime). In this study, we propose a mechanism to split the sensing field into partitions that may be equally spaced but differ in distance to the base station. Moreover, we focus on minimizing the MC effort by providing a new charging mechanism called the sector-based charging schedule (SBCS), which works to dispatch the MC in charging trips to the sector that sends many charging requests and suggesting an efficient sensor-charging algorithm. Specifically, we first utilize the high ability of the BS to divide the R-WSN field into sectors then it select the cluster head for each sector to reduce the intra-node communication. Second, we formulate the charging productivity as NP-hard problem and then conduct experimental simulations to evaluate the performance of the proposed mechanism. An extensive comparison is performed with other mechanisms. Experimental results demonstrate that the SBCS mechanism can prolong the lifetime of R-WSNs by increasing the charging productivity about 20% and reducing the MC effort by about 30%.

The Design of Distributed Control Algorithm for Mobile Communication Network in the Battle Field (전투지역에서의 이동통신을 위한 분산제어 알고리즘 설계)

  • 이경현;송주석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1167-1178
    • /
    • 1991
  • In this paper, we review the characteristics of battle field, consider required properties of mobile radio network, and design network control architecture proper to battle field network. Also we design distributed algorithm which constructs network control architecture and transmission schedule. For the information of network connectivity and the immediate reconfiguration caused by failure, loss, or movement of nodes, configuration and transmission schedule, algorithms are to be executed periodically and for entire network reliability, algorithms must to be executed fully distributedly. At the time of loss or failure of primary local control node, we suggest the method which diminishes transmission delay. We explain the operation of network with examples. Finally designed algorithms are verified and analized by computer simulation.

  • PDF

CPS: Operating System Architecture for Efficient Network Resource Management with Control-Theoretic Packet Scheduler

  • Jung, Hyung-Soo;Han, Hyuck;Yeom, Heon-Young;Kang, Soo-Yong
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.266-274
    • /
    • 2010
  • The efficient network resource management is one of the important topics in a real-time system. In this paper, we present a practical network resource management framework, control-theoretic packet scheduler (CPS) system. Using our framework, an operating system can schedule both input and output streams accurately and efficiently. Our framework adopts very portable feedback control theory for efficiency and accuracy. The CPS system is able to operate independent of the internal network protocol state, and it is designed to schedule packet streams in fine-grained time intervals to meet the resource requirement. This approach simplifies the design of the CPS system, and leads us to obtain the intended output bandwidth. We implemented our prototype system in Linux, and measured the performance of the network resource management system under various network QoS constraints. The distinctive features of our principles are as follows: It is robust and accurate, and its operation is independent of internal network protocols.

Project Schedule Risk Assessment Based on Bayesian Nets (베이지안넷 기반의 프로젝트 일정리스크 평가)

  • Sung, Hongsuk;Park, Chulsoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.9-16
    • /
    • 2016
  • The project schedule risk in the engineering and facility construction industry is increasingly considered as important management factor because the risks in terms of schedule or deadline may significantly affect the project cost. Especially, the project-based operating companies attempt to find the best estimate of the project completion time for use at their proposals, and therefore, usually have much interest in accurate estimation of the duration of the projects. In general, the management of projects schedule risk is achieved by modeling project schedule with PERT/CPM techniques, and then performing risk assessment with simulation such as Monte-Carlo simulation method. However, since these approaches require the accumulated executional data, which are not usually available in project-based operating company, and, further, they cannot reflect various schedule constraints, which usually are met during the project execution, the project managers have difficulty in preparing for the project risks in advance of their occurrence in the project execution. As these constraints may affect time and cost which role as the crucial evaluation factors to the quality of the project result, they must be identified and described in advance of their occurrence in the project management. This paper proposes a Bayesian Net based methodology for estimating project schedule risk by identifying and enforcing the project risks and its response plan which may occur in storage tank engineering and construction project environment. First, we translated the schedule network with the project risks and its response plan into Bayesian Net. Second, we analyzed the integrated Bayesian Net and suggested an estimate of project schedule risk with simulation approach. Finally, we applied our approach to a storage tank construction project to validate its feasibility.

A study on a schedule-cost analysis model for defense R&D project planning (국방 R&D프로젝트의 일정-비용분석모델의 연구)

  • 황홍석;류정철;정덕길
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.213-216
    • /
    • 1996
  • R'||'&'||'D project management is a process of decisions concerned with the achievement of goals of objectives. Especially, defense R'||'&'||'D project planning is the key in the successfull management of defense development. The defense project managers are constantly having to perform "what if\ulcorner" exercise, such as what if the project is extended out for an additional cost\ulcorner In this reserch, we developed a schedule-cost analysis model based upon Critical Path Method(CPM) and Venture Evaluation and Review Technique(VERT) for schedule-cost trade off analysis defense R'||'&'||'D projects. In the first step, a deterministic model is developed as a heuristic which deterministic model is developed as a heuristic which determines the schedule extension and reduction cost as a function desired schedule. In the second step, a stochastic network simulation model is developed to analyse the project risk (sucess and failure). The expected time and cost can be determined for desired schedule under the assumptions of stochastic arc data (time and cost) with a various precedence relationships. This model provides the defense R'||'&'||'D managers with an estimated and expected cost for curtailing or extending a project a given amount of time. The effectiveness and efficiency of the proposed methods, a heuristic and stochastic networks simulations, have been demonstrated through examples.

  • PDF

Time Management Status of Small Contractors and Suggestions on Education for Time Management in Colleges (소규모 건설회사의 공정관리 현황과 대학의 공정관리 교육방안)

  • Jang, Myung-Houn;Yi, Yong-Kyu
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.6 no.3
    • /
    • pp.413-422
    • /
    • 2016
  • A construction manager tries to complete a construction project within its duration and budget using available resources. Schedule networks such as Bar-chart and CPM(critical path method) are used to finish the project within the duration. A survey shows that small contractors prefer Microsoft Excel to commercial time management softwares to manage construction time in their fields, because the Excel is useful to control cost with schedule and few time management experts works in the small contractors. A college produces talented graduates who are able to manage time of a construction project. But the quality and quantity of college eduction for time management is insufficient. Another survey shows that majors in Architectural engineering of local national universities have the curriculum for time management, and teach mainly the theory of network scheduling and how to make the network schedule. The several majors have classes for the theory and exercise of commercial time management softwares in several majors. It is necessary to educate time management experts able to use Bar-chart and commercial time management softwares for the small contractors.

Evaluating Schedule Uncertainty in Unit-Based Repetitive Building Projects

  • Okmen, Onder
    • Journal of Construction Engineering and Project Management
    • /
    • v.3 no.2
    • /
    • pp.21-34
    • /
    • 2013
  • Various risk factors affect construction projects. Due to the uncertainties created by risk factors, actual activity durations frequently deviate from the estimated durations in either favorable or adverse direction. For this reason, evaluation of schedule uncertainty is required to make decisions accurately when managing construction projects. In this regard, this paper presents a new computer simulation model - the Repetitive Schedule Risk Analysis Model (RSRAM) - to evaluate unit-based repetitive building project schedules under uncertainty when activity durations and risk factors are correlated. The proposed model utilizes Monte Carlo Simulation and a Critical Path Method based repetitive scheduling procedure. This new procedure concurrently provides the utilization of resources without interruption and the maintenance of network logic through successive units. Furthermore, it enables assigning variable production rates to the activities from one unit to another and any kind of relationship type with or without lag time. Details of the model are described and an example application is presented. The findings show that the model produces realistic results regarding the extent of uncertainty inherent in the schedule.

Analysis of Boundary Conditions for Activities' Relationships in Linear Scheduling Model (선형 공정계획 모델의 액티비티 관계의 경계조건 분석)

  • Ryu, Han-Guk;Kim, Tae-Hui
    • Korean Journal of Construction Engineering and Management
    • /
    • v.12 no.1
    • /
    • pp.23-32
    • /
    • 2011
  • Domestic leading construction companies has been establishing and performing TACT scheduling method, similar to linear scheduling model such as line of balance and repetitive schedule, and etc. in which repetitive construction works are involved like high-rise building. Linear scheduling model has been researched as a visual scheduling method presenting the work space and time information. Likewise scheduling constraints of CPM network such as finish-to-finish, start-to-start, finish-to-start, start-to-start, linear scheduling model also has the relationships constraints, namely boundary conditions, between activities. It is especially necessary to define the boundary conditions of the activities' relationships in order to apply the linear scheduling model to be compatible with the network schedule. Therefore, this research considers the boundary conditions between activities for establishing the linear scheduling model. This paper also applies the proposed boundary conditions to TACT schedule and then deduces the main considerations in order to establish and perform TACT schedule.

Optimization of Planning-Level Locomotive Scheduling at KNR and Development of Its Implementation Prototype Program (한국철도에서의 계획단계 동력차 스케줄링 최적화 및 전문가 지원시스템의 프로토타입 프로그램 개발에 관한 연구)

  • 문대섭;김동오
    • Proceedings of the KSR Conference
    • /
    • 1999.11a
    • /
    • pp.46-53
    • /
    • 1999
  • As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

  • PDF

A Study on the Method of Preliminary Works Management for a Schedule Performance Management (공정이행관리를 위한 선행작업관리 시안)

  • Park, Hong-Tae;Song, Young-Sun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.3
    • /
    • pp.757-764
    • /
    • 2008
  • It is important to know the activities itself exactly and to control the activities correctly so as to assure timely progress and the quality of any project. In order to progress smoothly in accordance with construction schedule, it is important to systematize the preliminary arrangements necessary for each process and then manage them. In this study, in order to progress smoothly the qualify and schedule management of the construction, We can make systematically preliminary works in accordance with construction schedule by the architecture construction items of the apartment house construction. We suggested important preliminary control item by the workers through experiential method of construction engineers in accordance with network schedule. should not use "we" in technical sentence.