• Title/Summary/Keyword: Average Delay

Search Result 989, Processing Time 0.027 seconds

A Belay Prevention Algorithm of Cardiac Depolarization Wave Detection for Pacemakers or Automatic Implantable Cardioverter/Defibrillator (AICD) (이식용 심장박동기(Pacemaker) 및 심장 세동제거기 (AICD)를 위한 심장 탈분극파 검출지연 방지 알고리즘)

  • Kim, J.K.;Park, C.K.;Han, S.H.;Cho, B.S.;Huh, W.
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.1063-1066
    • /
    • 1999
  • The delay of cardiac depolarization wave detection in the conventional pacemakers or AICD (automatic implantable cardioverter/ defibrillator, or ICD) has been overlooked. However, it is known that the delay may cause hemodynamic problems and may prevent the proper operation of a new automatic feature, automatic capture verification, that is to be appeared in the near-future devices. In order to reduce the effects of the delay, a delay prevention algorithm was developed and tested by applying three human electrograms. The algorithm set the sensing threshold just above the measured noise level to reduce the detection delay. It is found that the low threshold was able to reduce the delay by 20msec(average) In most cases. The implementation results showed reliability and efficacy of the algorithm, and the algorithm could be applicable to the existing hardware and software of the conventional pacemakers and AICD without any significant modifications.

  • PDF

Buffer Scheme Optimization of Epidemic Routing in Delay Tolerant Networks

  • Shen, Jian;Moh, Sangman;Chung, Ilyong;Sun, Xingming
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.656-666
    • /
    • 2014
  • In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.

Resource scheduling scheme for 5G mmWave CP-OFDM based wireless networks with delay and power allocation optimizations

  • Marcus Vinicius G. Ferreira;Flavio H. T. Vieira;Alisson A. Cardoso
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.45-59
    • /
    • 2023
  • In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.

Schedule Management for Green Building Projects in Singapore: Schedule Delay, Causal Factors and Solutions

  • Hwang, Bon-Gang;Zhao, Xianbo;Leong, Lay Peng
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.527-531
    • /
    • 2015
  • With the mounting concerns over environmental issues, green construction is gaining a place in the global construction industry. However, rare research has been conducted to analyze green construction projects, especially in the aspect of project schedule performance. As a result, this study aims to investigate the degree of project delay in green building construction, analyze the factors affecting schedule delay of green building projects, and finally provide recommendations to improve schedule performance of green building project. To achieve the objectives, a comprehensive literature review was carried out, followed by a survey conducted with 30 companies that provided data from 220 traditional and 96 green building projects. The analysis of the responses identified that 15.9% of the traditional building projects were delayed while 32.3% of the green building projects were completed behind schedule. Furthermore, the amount of the delays in green building projects was an average of 4.8% of their planned schedule. The top 5 critical factors that can cause delay in green building projects were identified as: (1) speed of decision-making by clients; (2) speed of decision-making involving all project teams; (3) communication/coordination between key parties; (4) level of experience of consultants; and (5) difficulties in contractors' project financing. Lastly, a list of recommendations was introduced, aiming to reduce schedule delay in green building construction projects based on the observations. This study will serve as s a base for further research on the enhancement of green building project schedule performance.

  • PDF

Evaluation of Three-Phase Actuated Operation at Diamond Interchanges (다이아몬드 인터체인지의 3현시 감응제어 평가)

  • 이상수
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.2
    • /
    • pp.149-159
    • /
    • 2002
  • The performance of two single-barrier three-phase control systems at diamond interchanges was evaluated for various traffic conditions. To emulate the actuated signal control, hardware-in-the-loop system combined with CORSIM simulation program was used. Two performance measures, average delay and total stops, were used for the evaluation process. Results showed that the two three-phase systems gave similar performance in terms of average delay, but not stops. The delay performance of each phasing system was generally dependent on the traffic pattern and ramp spacing. However, there was a distinct movement preference for each phasing system. The total stops decreased as the spacing increased, and it was the most sensitive variable that can differentiate between the two three-phase systems. It was also shown that the hardware-in-the-loop control could be a good method to overcome the limitations of current simulation technology.

QoS Improvement Analysis Call Admission Control(CAC) Algorithm based on 3GPP PBNM (3GPP 정책기반에서 호 수락 제어(CAC) 알고리즘 적용에 따른 QoS 성능개선)

  • Song, Bok-Sob;Wen, Zheng-Zhu;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.4
    • /
    • pp.69-75
    • /
    • 2012
  • In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

A Novel WBAN MAC protocol with Improved Energy Consumption and Data Rate

  • Rezvani, Sanaz;Ghorashi, S. Ali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2302-2322
    • /
    • 2012
  • Wireless Body Area Networks (WBANs) are introduced as an enabling technology in tele-health for patient monitoring. Designing an efficient Medium Access Control (MAC) protocol is the main challenge in WBANs because of their various applications and strict requirements such as low level of energy consumption, low transmission delay, the wide range of data rates and prioritizing emergency data. In this paper, we propose a new MAC protocol to provide different requirements of WBANs targeted for medical applications. The proposed MAC provides an efficient emergency response mechanism by considering the correlation between medical signals. It also reduces the power consumption of nodes by minimizing contention access, reducing the probability of the collision and using an efficient synchronization algorithm. In addition, the proposed MAC protocol increases the data rate of the nodes by allocating the resources according to the condition of the network. Analytical and simulation results show that the proposed MAC protocol outperforms IEEE 802.15.4 MAC protocol in terms of power consumption level as well as the average response delay. Also, the comparison results of the proposed MAC with IEEE 802.15.6 MAC protocol show a tradeoff between average response delay and medical data rate.

Bandwidth-Efficient Live Virtual Reality Streaming Scheme for Reducing View Adaptation Delay

  • Lee, Jongmin;Lee, Joohyung;Lim, Jeongyeon;Kim, Maro
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.291-304
    • /
    • 2019
  • This paper proposes a dynamic-tiling-based bandwidth-efficient (DTBE) virtual reality (VR) streaming scheme. We consider 360-degree VR contents with multiple view points such as the front, back, upper, and bottom sides. At a given time, the focus of a client is always bound to a certain view among multiple view points. By utilizing this perspective, under our proposed scheme, tiles with high encoding rates are selectively assigned to the focused view where multiple view points consist of multiple tiles with different encoding rates. The other tiles with low encoding rates are assigned to the remaining view points. Furthermore, for reducing view adaptation delay, we design a novel rapid view adaptation mechanism that selectively delivers an I-frame during view point updates by using frame indexing. We implement the proposed scheme on a commercial VR test bed where we adopt the MPEG media transport (MMT) standard with high-efficiency video coding (HEVC) tile modes. The measurement-based experiments show that the proposed scheme achieves an average data usage reduction of almost 65.2% as well as average view adaptation delay reduction of almost 57.7%.

Distributed memory access architecture and control for fully disaggregated datacenter network

  • Kyeong-Eun Han;Ji Wook Youn;Jongtae Song;Dae-Ub Kim;Joon Ki Lee
    • ETRI Journal
    • /
    • v.44 no.6
    • /
    • pp.1020-1033
    • /
    • 2022
  • In this paper, we propose novel disaggregated memory module (dMM) architecture and memory access control schemes to solve the collision and contention problems of memory disaggregation, reducing the average memory access time to less than 1 ㎲. In the schemes, the distributed scheduler in each dMM determines the order of memory read/write access based on delay-sensitive priority requests in the disaggregated memory access frame (dMAF). We used the memory-intensive first (MIF) algorithm and priority-based MIF (p-MIF) algorithm that prioritize delay-sensitive and/or memory-intensive (MI) traffic over CPU-intensive (CI) traffic. We evaluated the performance of the proposed schemes through simulation using OPNET and hardware implementation. Our results showed that when the offered load was below 0.7 and the payload of dMAF was 256 bytes, the average round trip time (RTT) was the lowest, ~0.676 ㎲. The dMM scheduling algorithms, MIF and p-MIF, achieved delay less than 1 ㎲ for all MI traffic with less than 10% of transmission overhead.

A Study of Level of Service Criteria for Roundabouts (회전교차로의 서비스수준 기준 정립 연구)

  • Kim, Eung-Cheol;Ji, Min-Gyeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.7-16
    • /
    • 2009
  • Korea Highway Capacity Manual (2001) proposes only LOS(Level of Service) analysis method on non-control and two-way-stop intersections, not dealing with the analysis method on LOS for roundabouts, nor even including the term 'roundabout'. This study selects proper MOEs for roundabouts and criteria the LOS through simulation analysis. To attain this goal, the authors reviewed the methods to select proper MOEs in the first step, criteria the Los. For this study, the MOEs were chosen from existing literature, and used for the criteria. The MOEs to be applied to roundabouts in this research were entry traffic volume, v/c (volume/capacity) ratio, and average vehicle delays. The results showed that the maximum entry traffic volume(LOS F) at local one-lane roundabout was analyzed to be 1,700pcph and average vehicle delay 18 seconds LOS A was analyzed as 700pcph and average vehicle delay 3 seconds and v/c 0.41 in this case Maximum entry traffic volume(LOS F) at local area 2 lane roundabouts was analyzed as 2,900pcph and their average vehicle delay as 31 seconds LOS A was analyzed to be 1.500pcph and average vehicle delay 8 seconds, v/c 0.52.