• 제목/요약/키워드: Emergency Scheduling

검색결과 27건 처리시간 0.022초

CDASA-CSMA/CA: Contention Differentiated Adaptive Slot Allocation CSMA-CA for Heterogeneous Data in Wireless Body Area Networks

  • Ullah, Fasee;Abdullah, Abdul Hanan;Abdul-Salaam, Gaddafi;Arshad, Marina Md;Masud, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권12호
    • /
    • pp.5835-5854
    • /
    • 2017
  • The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

가변적 수요에 대한 최적인력의 크기와 휴무계획 결정방법 (Optimal Workforce Size and Day-off Scheduling with Variable Demands)

  • 기재석;강맹규
    • 대한산업공학회지
    • /
    • 제13권2호
    • /
    • pp.9-16
    • /
    • 1987
  • This paper develops an optimal manpower scheduling algorithm that gives an optimal workforce size and day-off scheduling required to satisfy following conditions. First, everyone is to have two consecutive day-off per cycle in a continuous operating environment. Second, everyone is to have at least A weekends off in a cycle of B Weeks. The model addressed is under the circumstance that the demands can vary from day to day in a weekly cycle. The proposed algorithm makes it possible to minimize the maximum workstretch and to maximize the number of weekends off. It is also possible to minimize the variance of idle manpower distribution in order that idle manpower may be utilized in case of emergency.

  • PDF

Service Scheduling in Cloud Computing based on Queuing Game Model

  • Lin, Fuhong;Zhou, Xianwei;Huang, Daochao;Song, Wei;Han, Dongsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권5호
    • /
    • pp.1554-1566
    • /
    • 2014
  • Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.

공동주택에서의 전기자동차 충전기 수용률 설정과 그 제어방법 (Set up a Demand Factor of EV Chargers and Its Control Method in Apartments)

  • 김명수;홍순찬
    • 조명전기설비학회논문지
    • /
    • 제28권8호
    • /
    • pp.98-105
    • /
    • 2014
  • In this paper, we have analyzed the power consumption property of EVs(Electric Vehicles) chargers established in a public place, proposed reasonable demand factors by the number of established EV chargers and its control method in apartments. The optimization of power system and the suppression of the peak load can be controlled through the proposed demand factors and charging scheduling control algorithm. In this paper, electrical design and an case analysis were carried out on a sample apartment complex to prove the effectiveness of the power system. As a result, emergency power transformer capacity has been reduced by approximately 25%, and we have confirmed that the electric rates saving and the control of peak load value is possible.

WBAN을 지원하기 위한 개선된 슈퍼프레임 구조를 가지는 TDMA 기반의 CSMA/CA MAC 프로토콜 (Improved TDMA with Superframe Structure-based CSMA/CA MAC protocol for Wireless Body Area Network)

  • 이재수;안정근;윤찬영
    • 조명전기설비학회논문지
    • /
    • 제26권1호
    • /
    • pp.87-93
    • /
    • 2012
  • Due to the development of information and communication, there is a rising interest on WBAN(Wireless Body Area Network) that maintain and check the human being health. According to the application of different quality of service and a special mechanism for transferring medical data are required in WBAN environment. In this paper, we proposed the new formed superframe that has CSMA/CA based TDMA scheduling and CSMA/CA used IEEE 802.15.4 in order to process emergency data and on-demand data in WBAN environment. We estimated performance of the proposed MAC protocol by compared performance of other MAC protocols that are IEEE 802.15.4 MAC protocl and Z-MAC protocol has contention access period based TDMA scheduling.

Emergency 데이터 및 네트워크 환경 기반 노드 우선순위 선정 모델 연구 (A Study on Node Estimation Method to Assign Priority based on Emergency data and Network Environment)

  • 김세준;임환희;김경태;윤희용
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2018년도 제57차 동계학술대회논문집 26권1호
    • /
    • pp.87-88
    • /
    • 2018
  • 본 논문에서는 IIoT 환경에서 중요한 비정상적 데이터 수집을 위한 노드 우선순위 선정 모델을 제안하였다. 제안하는 모델은 비정상적 데이터 수집과 다른 노드로 부터의 정상 데이터의 수집 격차를 적절히 조절하기 위하여 Fair and Delay-aware Cross-layer(FDRX) 기법과 데이터 Classification 기법을 이용, 데이터의 긴급성과 네트워크 환경을 분석하여 노드를 평가한다. 이를 통하여 IIoT 환경에서의 데이터 분석에 중요한 비정상적 데이터를 원활하게 수집하면서도 다른 노드와의 전송 격차를 줄일 수 있을 것으로 기대된다.

  • PDF

불확실한 도로 네트워크에서의 응급차량 배차 (Emergency Vehicle Dispatching on Unreliable Road Networks)

  • 최재영;김홍규
    • 산업경영시스템학회지
    • /
    • 제34권3호
    • /
    • pp.16-23
    • /
    • 2011
  • 이 논문에서는 지진이나 해일과 같은 자연재해가 발생했을 때 생존자의 수를 최대화하기 위한 응급차량의 배차 문제에 대하여 살펴본다. 이 경우에는 도로 네트워크상에서 최단거리에 있으리라 예상되는 환자부터 실어 나르는 스케줄링 규칙을 많이 이용한다. 이 스케줄링 규칙을 SEPT(Shortest Expected Processing Time) 라고 한다. 이 논문에서는 SEPT보다 효율적이라 생각되는 새로운 스케줄링 규칙을 제안한다. 이 스케줄링 규칙은 처리시간과 납기일이 확정적인 경우에 생존자의 수를 최대화시켜주는 스케줄링을 제공하는 Moore의 알고리즘을 처리시간과 납기일이 확률적인 경우로 확장한 것이다. 다음으로 이 스케줄링 규칙을 지진이 많이 발생하는 미국 캘리포니아 주 로스앤젤레스의 한 지역을 대상으로 몇 가지 생존확률 하에서 생존자의 수를 기준으로 SEPT와 비교한다. 그 결과 모든 생존확률 하에서 제안된 스케줄링 규칙이 SEPT보다 평균적으로 생존자의 수를 더 늘려주는 스케줄링을 제공한다. 그리고 많은 경우 제안된 스케줄링 규칙은 최적 스케줄링을 제공한다.

작업의 특성에 종속되는 병렬기계의 일정계획을 위한 발견적 기법 (A Heuristic for parallel Machine Scheduling Depending on Job Characteristics)

  • 이동현;이경근;김재균;박창권;장길상
    • 한국경영과학회지
    • /
    • 제17권1호
    • /
    • pp.41-41
    • /
    • 1992
  • In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

무선 메쉬 네트워크의 군 환경 적용을 위한 효율적인 위치기반 패킷 스케줄링 방식 (An Effective Location-based Packet Scheduling Scheme for Adaptive Tactical Wireless Mesh Network)

  • 김영안;홍충선
    • 한국통신학회논문지
    • /
    • 제32권12B호
    • /
    • pp.719-727
    • /
    • 2007
  • 무선 메쉬 네트워크(Wireless Mesh Network) 기술은 유선을 설치하기 힘든 섬지역이나, 군의 전장지역과 같은 법은 지역에 저렴한 비용으로 인프라를 제공할 수 있다. 그러나 무선 메쉬 네트워크에서는 다중 홉 통신 환경에서 홉 수의 증가로 인한 성능의 급격한 감소는 물론 지연이 급격히 증가되는 결과를 초래하고 있다. 군 환경에 무선 메쉬 네트워크의 적용을 고려할 때 게이트웨이를 통하는 음성이나 동영상과 같은 실시간 데이터 트래픽이 많은 부분을 차지할 것으로 볼 때, 원거리 부대 AP에 연결된 메쉬 단말들은 실시간 서비스 받기가 제한이 된다. 이로 인해 공정성에 대한 문제가 발생하게 된다. 본 논문에서는 이 문제 해결을 위해 각 제대별 AP에 연결된 모든 메쉬 노드에 공정한 QoS를 제공할 수 있고, 군의 특성을 고려한 긴급정보나 Control 패킷에 우선순위(가중치)를 부여할 수 있는 WRR(Weight Round Robin) 방식을 기본으로 동작하는 위치기반 패킷 스케줄링 방식을 제안하여 성능을 검증하였다.

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

  • 문대섭;김동오
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 1999년도 추계학술대회 논문집
    • /
    • 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