• 제목/요약/키워드: End-to-end delay

검색결과 761건 처리시간 0.029초

Device to Device Communications Architectures and Cross-Layer Evaluation Frameworks

  • Aldabbagh, Ghadah
    • International Journal of Computer Science & Network Security
    • /
    • 제21권1호
    • /
    • pp.152-161
    • /
    • 2021
  • The paper focuses on Device-to-device (D2D) Architectures evaluation frameworks. D2D communication and discovery can improve spectrum usage efficiency and optimize the tradeoffs between throughput and energy consumption. The target operation modes involve both indirect communication between two nodes via a base station or the direct communication among proximal nodes, enabling use cases that can support communications out of cellular coverage, as well as low end-end delay requirements. The paper will present the architectural evolution of D2D networks within 3GPP standardization and will highlight key network functionalities and signaling protocols. It will also identify key analytical and simulation models that can be used to assess the performance and energy efficiency of resource allocation strategies, and it will present a suitable cross-layer integrated framework.

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권9호
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

Trajectory Planning for Industrial Robot Manipulators Considering Assigned Velocity and Allowance Under Joint Acceleration Limit

  • Munasinghe, S.Rohan;Nakamura, Masatoshi;Goto, Satoru;Kyura, Nobuhiro
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권1호
    • /
    • pp.68-75
    • /
    • 2003
  • This paper presents an effective trajectory planning algorithm for industrial robot manipulators. Given the end-effector trajectory in Cartesian space, together with the relevant constraints and task specifications, the proposed method is capable of planning the optimum end-effector trajectory. The proposed trajectory planning algorithm considers the joint acceleration limit, end-effector velocity limits, and trajectory allowance. A feedforward compensator is also incorporated in the proposed algorithm to counteract the delay in joint dynamics. The algorithm is carefully designed so that it can be directly adopted with the existing industrial manipulators. The proposed algorithm can be easily programmed for various tasks given the specifications and constraints. A three-dimensional test trajectory was planned with the proposed algorithm and tested with the Performer MK3s industrial manipulator. The results verified effective manipulator performance within the constraints.

Salinosporamides A and B Inhibit Proteasome Activity and Delay the Degradation of N-end Rule Model Substrates

  • Shin, Seung Kyun;Bang, Dae In;Choi, Won Hoon;Kim, Seong-Hwan;Oh, Dong-Chan;Lee, Min Jae
    • Bulletin of the Korean Chemical Society
    • /
    • 제34권5호
    • /
    • pp.1425-1428
    • /
    • 2013
  • The proteasome, which is highly evolutionarily conserved, is responsible for the degradation of most short-lived proteins in cells. Small-molecule inhibitors targeting the proteasome's degradative activity have been extensively developed as lead compounds for various human diseases. An exemplified molecule is bortezomib, which was approved by FDA in 2003 for the treatment of multiple myeloma. Here, using transiently and stably expressed N-end rule model substrates in mammalian cells, we evaluated and identified that salinosporamide A and salinosporamide B effectively inhibited the proteasomal degradation. Considering that a variety of proteasome substrates are implicated in the pathogenesis of many diseases, they have the potential to be clinically applicable as therapeutic agents.

버티컬 핸드오버 환경에서 종단간 이동성 관리 및 TCP 흐름 제어기법 (An E2E Mobility Management and TCP Flow Control Scheme in Vertical Handover Environments)

  • 서기남;임재성
    • 한국통신학회논문지
    • /
    • 제30권6B호
    • /
    • pp.387-395
    • /
    • 2005
  • 본 논문에서는 이종망간의 핸드오버 환경에서 MN가 종단간이동성 관리를 하면서 동시에 네트워크의 링크 특성을 고려하여 TCP 흐름 제어를 할 수 있는 새로운 버티컬 핸드오프 기법을 제안한다. MN가 버티컬 핸드오버를 수행할 때 종단간 이동성 관리를 위해서 SIP INFO 메시지를 이용하여 CN에게 새로운 네트워크에서 사용할 자신의 IP 주소를 전달하게 되면 CN는 IP 인캡슐레이션을 통해 MN에게 데이터 패킷을 전달한다. 만약 MN가 WLAN에서 cdma2000망으로 이동하는 상향 핸드오버가 발생하면 RTT의 차이로 TCP 재전송 타임아웃이 발생하게 된다. 그 결과 TCP 혼잡 윈도우 크기가 1로 감소되어 결국 TCP Throughput이 떨어지게 된다. 본 논문에서는 이러한 현상을 방지하기 위해 CN가 probe packet을 전송하여 RTT를 측정하는 방법과 각 네트워크의 전송대역의 비에 따라 재전송 타이머를 조정하는 두 가지 방법을 제안한다. 제안하는 버티컬 핸드오버 기법의 성능을 NS-2 시뮬레이션을 통해 비교 분석하였다.

청각장애인을 위한 음성인식 기반 메시지 전송 시스템 (Speech Recognition based Message Transmission System for the Hearing Impaired Persons)

  • 김성진;조경우;오창헌
    • 한국정보통신학회논문지
    • /
    • 제22권12호
    • /
    • pp.1604-1610
    • /
    • 2018
  • 음성인식 서비스는 청각장애인에게 화자의 음성을 텍스트로 변환하여 시각화함으로써 의사소통의 보조적인 수단으로 사용되고 있다. 하지만 강의실 및 회의실과 같은 개방된 환경에서는 다수의 청각장애인에게 음성인식 서비스를 제공하기 힘들다. 이를 위해 주변 환경에 따라 음성 인식 서비스를 효율적으로 제공하기 위한 방법이 필요하다. 본 논문에서는 화자의 음성을 인식하여 변환된 텍스트를 다수의 청각장애인에게 메시지로 전달하는 시스템을 제안한다. 제안하는 시스템은 다수의 사용자에게 동시에 메시지를 전달하기 위해 MQTT 프로토콜을 사용한다. MQTT 프로토콜의 QoS level 설정에 따른 제안 시스템의 서비스 지연을 확인하기 위해 종단 간 지연을 측정하였다. 측정 결과 가장 신뢰성이 높은 QoS level 2와 0간의 지연이 111ms로 대화 인식에 큰 영향을 끼치지 않음을 확인하였다.

A Noncoherent UWB Communication System for Low Power Applications

  • Yang, Suck-Chel;Park, Jung-Wan;Moon, Yong;Lee, Won-Cheol;Shin, Yo-An
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제4권3호
    • /
    • pp.210-216
    • /
    • 2004
  • In this paper, we propose a noncoherent On-Off Keying (OOK) Ultra Wide Band (UWB) system based on power detection with noise power calibration for low power applications. The proposed UWB system achieves good bit error rate performance which is favorably comparable to that of the system using the ideal adaptive threshold, while maintaining simple receiver structure, In addition, low power Analog Front-End (AFE) blocks for the proposed noncoherent UWB transceiver are proposed and verified using CMOS technology. Simulation results on the pulse generator, delay time generator and 1-bit Analog-to-Digital (AID) converter show feasibility of the proposed UWB AFE system.

스파크 점화 기관의 노크 모델에 관한 연구 (A study on knock model in spark ignition engine)

  • 장종관;이종태;이성열
    • 오토저널
    • /
    • 제14권5호
    • /
    • pp.30-40
    • /
    • 1992
  • Spark knock obstructs any improvement in the efficiency and performance of an engine. As the knock mechanism of spark ignition engine, the detonation and the autoignition theory have been offered. In this paper, the knock model was established, which was able to predict the onset of knock and knock timing of spark ignition engine by the basis of autoignition theory. This model was a function of engine speed and equivalent air-fuel ratio. When this established knock model was tested from 1000rpm to 3000rpm of engine speed data, maximum error was crank angle 2 degrees between measured and predicted knock time. And the main results were as follows by the experimental analysis of spark knock in spark ignition engine. 1) Knock frequency was increased as engine speed increased. 2) Knock amplitude was increased as mass of end gas increased. 3) Knock frequency was occured above minimum 18% mass fraction of end gas.

  • PDF

Implementation of Node Transition Probability based Routing Algorithm for MANET and Performance Analysis using Different Mobility Models

  • Radha, Sankararajan;Shanmugavel, Sethu
    • Journal of Communications and Networks
    • /
    • 제5권3호
    • /
    • pp.202-214
    • /
    • 2003
  • The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

An Algorithm for Energy Efficient Cooperative Communication in Wireless Sensor Networks

  • Kumar, K. Senthil;Amutha, R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권7호
    • /
    • pp.3080-3099
    • /
    • 2016
  • In this paper, we propose an algorithm for energy efficient cooperative communication in wireless sensor network (WSN). The algorithm computes the appropriate transmission distance corresponding to optimal broadcast bit error probability, while taking the circuit energy consumption and the number of cooperating nodes into consideration. The algorithm guarantees minimum energy consumption by choosing higher value of bit error probability for cooperative phase and lower value of bit error probability for broadcast phase while maintaining the required end-to-end reliability. The simulation results show that the proposed algorithm provides significant energy saving gain when compared with traditional fixed distance schemes and is suitable for applications demanding energy efficiency with high quality of reception.