• Title/Summary/Keyword: low latency transmission

Search Result 81, Processing Time 0.024 seconds

Low Latency Uplink Transmission Scheme in Mobile Communication Networks (이동통신망에서 저지연 상향링크 전송 기법)

  • Bae, Duck-Hyun;Lee, Hyun-Suk;Lee, Jang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.77-87
    • /
    • 2017
  • Even though current LTE/LTE-A mobile networks provide enough high data rate and low latency to support conventional wireless services, to support ultra-low delay services, such as virtual reality and remote control, in the next generation mobile communication network, it is required to provide very low delay about several ms. However, in the uplink transmission of the LTE/LTE-A system, the process of scheduling grant is required to obtain uplink resources for uplink transmission from the eNB. The process of granting uplink resources from eNB brings additional fixed latency, which is one of the critical obstacles to achieve low delay in uplink transmissions. Thus, in this paper, we propose a novel uplink transmission scheme called Cut-in uplink transmission, to reduce uplink latency. We provide the performance of the proposed uplink transmission scheme through simulations and show the proposed uplink transmission scheme provides lower uplink transmission delay than conventional uplink transmission scheme in LTE/LTE-A mobile networks.

Cross-Talk: D2D Potentiality Based Resource Borrowing Schema for Ultra-Low Latency Transmission in Cellular Network

  • Sun, Guolin;Dingana, Timothy;Adolphe, Sebakara Samuel Rene;Boateng, Gordon Owusu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2258-2276
    • /
    • 2019
  • Resource sharing is one of the main goals achieved by network virtualization technology to enhance network resource utilization and enable resource customization. Though resource sharing can improve network efficiency by accommodating various users in a network, limited infrastructure capacity is still a challenge to ultra-low latency service operators. In this paper, we propose an inter-slice resource borrowing schema based on the device-to-device (D2D) potentiality especially for ultra-low latency transmission in cellular networks. An extended and modified Kuhn-Munkres bipartite matching algorithm is developed to optimally achieve inter-slice resource borrowing. Simulation results show that, proper D2D user matching can be achieved, satisfying ultra-low latency (ULL) users' quality of service (QoS) requirements and resource utilization in various scenarios.

Dynamic Resource Reservation for Ultra-low Latency IoT Air-Interface Slice

  • Sun, Guolin;Wang, Guohui;Addo, Prince Clement;Liu, Guisong;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3309-3328
    • /
    • 2017
  • The application of Internet of Things (IoT) in the next generation cellular networks imposes a new characteristic on the data traffic, where a massive number of small packets need to be transmitted. In addition, some emerging IoT-based emergency services require a real-time data delivery within a few milliseconds, referring to as ultra-low latency transmission. However, current techniques cannot provide such a low latency in combination with a mice-flow traffic. In this paper, we propose a dynamic resource reservation schema based on an air-interface slicing scheme in the context of a massive number of sensors with emergency flows. The proposed schema can achieve an air-interface latency of a few milliseconds by means of allowing emergency flows to be transported through a dedicated radio connection with guaranteed network resources. In order to schedule the delay-sensitive flows immediately, dynamic resource updating, silence-probability based collision avoidance, and window-based re-transmission are introduced to combine with the frame-slotted Aloha protocol. To evaluate performance of the proposed schema, a probabilistic model is provided to derive the analytical results, which are compared with the numerical results from Monte-Carlo simulations.

An Adaptive Energy-Efficient and Low-Latency MAC Protocol for Wireless Sensor Networks

  • Liu, Hao;Yao, Guoliang;Wu, Jianhui;Shi, Longxing
    • Journal of Communications and Networks
    • /
    • v.12 no.5
    • /
    • pp.510-517
    • /
    • 2010
  • In this paper, an adaptive MAC protocol (variable load adaptive (VLA)-MAC) is proposed for wireless sensor networks. This protocol can achieve high energy efficiency and provide low latency under variable-traffic-load conditions. In the case of VLA-MAC, traffic load is measured online and used for adaptive adjustment. Sensor nodes transmit packets in bursts under high load conditions to alleviate packet accumulation and reduce latency. This also removes unnecessary listen action and decreases energy consumption in low load conditions. Simulation results show that the energy efficiency, latency, and throughput achieved by VLA-MAC are higher than those achieved by some traditional approaches.

Efficient Peer Assignment for Low-Latency Transmission of Scalable Coded Images

  • Su, Xiao;Wang, Tao
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.79-88
    • /
    • 2008
  • In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

Wired and Wileless Dualization Algorithm for Tension Sensing Smart Fence System (스마트 철조망 장력센서를 위한 유무선 이중화 알고리즘)

  • Kim, Jang-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.5
    • /
    • pp.1071-1076
    • /
    • 2015
  • This paper proposed an efficient algorithm for tension sensing smart fence system with wireless sensor transmission module installation and alarming services. The wired transmission system demonstrates high accuracy and low latency, but the cost is expensive and transmission error may occur. For these reasons, this paper presented to use wireless transmission communication using Zigbee module technology in order to decrease delay and latency and solve the battery issues.

A Solution for Reducing Transmission Latency through Distributed Duty Cycling in Wireless Sensor Networks (무선 센서 네트워크에서 수신구간 분산 배치를 통한 전송지연 감소 방안)

  • Kim, Jun-Seok;Kwon, Young-Goo
    • 한국ITS학회:학술대회논문집
    • /
    • v.2007 no.10
    • /
    • pp.225-229
    • /
    • 2007
  • Recently, wireless sensor networks are deployed in various applications range from simple environment monitoring systems to complex systems, which generate large amount of information, like motion monitoring, military, and telematics systems. Although wireless sensor network nodes are operated with low-power 8bit processor to execute simple tasks like environment monitoring, the nodes in these complex systems have to execute more difficult tasks. Generally, MAC protocols for wireless sensor networks attempt to reduce the energy consumption using duty cycling mechanism which means the nodes periodically sleep and wake. However, in the duty cycling mechanism. a node should wait until the target node wakes and the sleep latency increases as the number of hops increases. This sleep latency can be serious problem in complex and sensitive systems which require high speed data transfer like military, wing of airplane, and telematics. In this paper, we propose a solution for reducing transmission latency through distributed duty cycling (DDC) in wireless sensor networks. The proposed algorithm is evaluated with real-deployment experiments using CC2420DBK and the experiment results show that the DDC algorithm reduces the transmission latency significantly and reduces also the energy consumption.

  • PDF

An Efficient Software Defined Data Transmission Scheme based on Mobile Edge Computing for the Massive IoT Environment

  • Kim, EunGyeong;Kim, Seokhoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.974-987
    • /
    • 2018
  • This paper presents a novel and efficient data transmission scheme based on mobile edge computing for the massive IoT environments which should support various type of services and devices. Based on an accurate and precise synchronization process, it maximizes data transmission throughput, and consistently maintains a flow's latency. To this end, the proposed efficient software defined data transmission scheme (ESD-DTS) configures and utilizes synchronization zones in accordance with the 4 usage cases, which are end node-to-end node (EN-EN), end node-to-cloud network (EN-CN), end node-to-Internet node (EN-IN), and edge node-to-core node (EdN-CN); and it transmit the data by the required service attributes, which are divided into 3 groups (low-end group, medium-end group, and high-end group). In addition, the ESD-DTS provides a specific data transmission method, which is operated by a buffer threshold value, for the low-end group, and it effectively accommodates massive IT devices. By doing this, the proposed scheme not only supports a high, medium, and low quality of service, but also is complied with various 5G usage scenarios. The essential difference between the previous and the proposed scheme is that the existing schemes are used to handle each packet only to provide high quality and bandwidth, whereas the proposed scheme introduces synchronization zones for various type of services to manage the efficiency of each service flow. Performance evaluations show that the proposed scheme outperforms the previous schemes in terms of throughput, control message overhead, and latency. Therefore, the proposed ESD-DTS is very suitable for upcoming 5G networks in a variety of massive IoT environments with supporting mobile edge computing (MEC).

Study on Low-Latency overcome of XMDR-DAI based Stock Trading system in Cloud (클라우드 환경에서 XMDR-DAI 기반 주식 체결 시스템의 저지연 극복에 관한 연구)

  • Kim, Keun-Hee;Moon, Seok-Jae;Yoon, Chang-Pyo;Lee, Dae-Sung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.350-353
    • /
    • 2014
  • The large scale of data and operating systems in the trading environment in the cloud. However, technology is not an easy trading system of cloud-based data interoperability. Partially meets the data transfer rate and also the timeliness of the best trading system on the difficulties. Thus various techniques have been introduced for improving the throughput and low latency minimization problem. But the reality is, and the limits of speed improvements like Socket Direct Protocol, Offload Engine with TCP/IP is the hardware, the introduction effect is also low. In this paper, the proposed trading of the cloud XMDR-DAI based stock system. The proposed Safe Proper Time Method for optimal transmission speed and reliability.

  • PDF

Frequency divided group beamforming with sparse space-frequency code for above 6 GHz URLLC systems

  • Chanho Yoon;Woncheol Cho;Kapseok Chang;Young-Jo Ko
    • ETRI Journal
    • /
    • v.44 no.6
    • /
    • pp.925-935
    • /
    • 2022
  • In this study, we propose a limited feedback-based frequency divided group beamforming with sparse space-frequency transmit diversity coded orthogonal frequency division multiplexing (OFDM) system for ultrareliable low latency communication (URLLC) scenario. The proposed scheme has several advantages over the traditional hybrid beamforming approach, including not requiring downlink channel state information for baseband precoding, supporting distributed multipoint transmission structures for diversity, and reducing beam sweeping latency with little uplink overhead. These are all positive aspects of physical layer characteristics intended for URLLC. It is suggested in the system to manage the multipoint transmission structure realized by distributed panels using a power allocation method based on cooperative game theory. Link-level simulations demonstrate that the proposed scheme offers reliability by achieving both higher diversity order and array gain in a nonline-of-sight channel of selectivity and limited spatial scattering.