• Title/Summary/Keyword: arrival rate

Search Result 388, Processing Time 0.024 seconds

TLSA: A Two Level Scheduling Algorithm for Multiple packets Arrival in TSCH Networks

  • Asuti, Manjunath G.;Basarkod, Prabhugoud I.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3201-3223
    • /
    • 2020
  • Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = eax - 1 and y = 0.5x2 using MATLAB 2017a software for the computation of average and worst ratios of the two levels.

Simulation and Evaluation of Redistribution Algorithms In Fault-Tolerant Distributed System (결함허용 분산시스템의 재분배 알고리즘의 시뮬레이션과 평가)

  • 최병갑;이천희
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.8
    • /
    • pp.1-10
    • /
    • 1994
  • In this paper load redistribution algorithm to allow fault-tolerance by redistributing the workload of n failure nodes to the remaining good nodes in distributed systems are investigated. To evaluate the efficiency of the algorithms a simulation model of algorithms is developed using SLAM II simulation language. The job arrival rate service rate failure and repair rate of nodes and communication delay time due to load migraion are used as parameters. The result of the simulation shows that the job arrival rate failure and repair rate of nodes do not affected on the relative efficiency of algorithms. If the communication delay time is greater than average job processing time algorithm B is better. Otherwise algorithm C is superior to the others.

  • PDF

Two Techniques of Angle-of-Arrival Estimation for Low-Data-Rate UWB Wireless Positioning (저속 초광대역 방식의 무선 측위에 알맞은 신호 도착 방향 추정 기법 두 가지)

  • Lee, Yong-Up;Lim, Kyeong-Sun;Park, Joo-Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3A
    • /
    • pp.163-171
    • /
    • 2012
  • The signal model and weighted-average based estimation techniques are proposed to estimate the angle-of-arrival (AOA) parameters of multiple clusters for a low data rate ultrawide band (LR-UWB) based wireless positioning system. It is observed that the weighted-average based AOA estimation technique gives an optimal AOA estimate under few clusters condition, and the average based AOA estimation technique gives a correct AOA estimate under many clusters condition through computer simulation. Also, we can observe that the variance estimation error decreases as SNR increases, and the proposed techniques are superior to the conventional technique from the viewpoint of performance.

Busy Period Analysis of the Geo/Geo/1/K Queue with a Single Vacation (단일 휴가형 Geo/Geo/1/K 대기행렬의 바쁜 기간 분석)

  • Kim, Kilhwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.4
    • /
    • pp.91-105
    • /
    • 2019
  • Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1 ≤ n ≤ K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

Modeling and Evaluation of Wireless Communication System using CSMA inthe Distributed Packet Radio Network (분산 무선망에서 CSMA를 사용한 무선 통신 시스템의 모델링 및 성능 분석)

  • 조병록;최형진;박병철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.10
    • /
    • pp.1508-1517
    • /
    • 1993
  • In this paper, we propose the modeling of a wireless communication system using CSMA protocol, present analytical evalution and simulation as a function of arrival rate and mean END-to-END delay in the distributed packet radio network. Asynchronous 1-persistent CSMA protocol is used in wireless communication system with half duplex. We assume that all terminals are to be in the close range of each other, suitably located in the local area. The traffic presented to a common channel is assumed to be poisson distribution. Analytical model is based on a M/D/1 with breakdown. In conclusion for wireless network model proposed in this paper is suitable for packet arrival rate of 2 packet/sec with mean packet delay time less than 2 times the packet transmission time.

  • PDF

A Study on the Reduction of Patient's Exposure Dose according to the Arrival Time of Contrast Media in Abdominal CT Scan using Bolus Tracking Technique (Bolus tracking 기법을 이용한 복부 CT 검사 시 조영제 도달시간에 따른 환자 피폭선량 감소에 관한 연구)

  • Lee, Seung yong;Han, Dong kyoon
    • Journal of the Korean Society of Radiology
    • /
    • v.15 no.2
    • /
    • pp.93-100
    • /
    • 2021
  • The purpose of this study is to find out the factors that affect the patient's exposure dose during the abdominal CT scan using the bolus tracking technique, and reducing the radiation exposure to the patient during the abdominal CT scan using the bolus tracking technique by adjusting the delay time according to the corresponding factor. The experiment was divided into two parts, and the first experiment was conducted with 300 patients There were 188 males and 112 females, and their average age was 58±12.18(19~85). In the second experiment, 150 subjects (100 males and 50 females) who were undergoing their follow-up examination among the first experiment subjects, and the difference in dose before and after was compared by applying the delay time according to the influencing factor. As a result of the first experiment, there was a relationship between the arrival time of the contrast media and the heart rate, and it was found that the arrival time decreased as the heart rate increased for both men and women. As a result of the second experiment, the average dose of CTDIvol and DLP before/after applying the delay time according to the heart rate decreased 4.98 mGy and 5.33 mGy·cm in the male group, and 3.54 mGy and 3.88 mGy·cm in the female group. By applying proper delay time according to the patient's heart rate during abdominal CT scan with the bolus tracking technique, the radiation exposure dose of the patient can be reduced.

Energy Efficient Sequential Sensing in Multi-User Cognitive Ad Hoc Networks: A Consideration of an ADC Device

  • Gan, Xiaoying;Xu, Miao;Li, He
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.188-194
    • /
    • 2012
  • Cognitive networks (CNs) are capable of enabling dynamic spectrum allocation, and thus constitute a promising technology for future wireless communication. Whereas, the implementation of CN will lead to the requirement of an increased energy-arrival rate, which is a significant parameter in energy harvesting design of a cognitive user (CU) device. A well-designed spectrum-sensing scheme will lower the energy-arrival rate that is required and enable CNs to self-sustain, which will also help alleviate global warming. In this paper, spectrum sensing in a multi-user cognitive ad hoc network with a wide-band spectrum is considered. Based on the prospective spectrum sensing, we classify CN operation into two modes: Distributed and centralized. In a distributed network, each CU conducts spectrum sensing for its own data transmission, while in a centralized network, there is only one cognitive cluster header which performs spectrum sensing and broadcasts its sensing results to other CUs. Thus, a wide-band spectrum that is divided into multiple sub-channels can be sensed simultaneously in a distributed manner or sequentially in a centralized manner. We consider the energy consumption for spectrum sensing only of an analog-to-digital convertor (ADC). By formulating energy consumption for spectrum sensing in terms of the sub-channel sampling rate and whole-band sensing time, the sampling rate and whole-band sensing time that are optimal for minimizing the total energy consumption within sensing reliability constraints are obtained. A power dissipation model of an ADC, which plays an important role in formulating the energy efficiency problem, is presented. Using AD9051 as an ADC example, our numerical results show that the optimal sensing parameters will achieve a reduction in the energy-arrival rate of up to 97.7% and 50% in a distributed and a centralized network, respectively, when comparing the optimal and worst-case energy consumption for given system settings.

Exact Asymptotics in a Multi-class M/G/1 Queue

  • Lee, Ji-Yeon;Dabrowski, Andre;McDonald, David R.
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.43-47
    • /
    • 2006
  • Consider a multitype queue where queued customers arc served in their order of arrival at a rate which depends on the customer type. Here we calculate the sharp asymptotics of the probability the total number of customers in the queue reaches a high level before emptying. The natural state space to describe this queue is a tree whose branches increase in length as the number of customers in the queue grows. Consequently it is difficult to prove a large deviation principle. Moreover, since service rates depend on the customer type the stationary distribution is not of product form so there is no simple expression for the stationary distribution. Instead, we use a change of measure technique which increases the arrival rate of customers and decreases the departure rate thus making large deviations common.

  • PDF

Forecasting and Deciding When to Shutdown a Nuclear Power Plant to Prevent a Severe Accident (원자력 발전소 사고 예측 및 발전소 운행중지 정책 결정에 관한 연구)

  • Yang, Hee-Joong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.55
    • /
    • pp.25-31
    • /
    • 2000
  • To make a better decision about when to shutdown a nuclear power plant, we build a decision model using influence diagrams. We proceed the analysis adopting a bayesian approach. Firstly, an accident arrival rate is assumed to be known and this assumption is relaxed later. We perform our analysis on the cases of exponential time to accidents, and gamma distribution for the arrival rate. An optimal shutdown time is obtained considering the trade-off between the costs incurred by an accident due to late shutdown and the possible loss of revenues due to the early shutdown. We also derive the upper bound of the failure rate where we may operate the plant.

  • PDF

Development of a Simulation-based DSS for the Management Strategy Analysis of Inchon Port (인천내항의 전략수립과 분석을 위한 시뮬레이션 기반 의사결정시스템 개발)

  • 김동희
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.10a
    • /
    • pp.17-20
    • /
    • 1998
  • The purpose of this paper is to develop a port simulation program for Inchon Port. The arrival and departure data from Inchon Port are analyzed, several probability density functions for the interval time and service time are estimated, and the berthing rules are constructed based on experts experiences. The port simulation program is written in visual basic considering the interarrival p.d.f., service rate p.d.f., berthing rules, and dual-dock system, and is used to analyze the effects of the changes in ship arrival rate and service rate upon the demurrage. It is expected that we can use the simulation results in order to prepare proper service level and to evaluate the appropriate investment strategy to be planned.

  • PDF