Zeitschriftenartikel: „Low-Latency applications“

1

Gürel, O., und M. U. Çakır. „XMPP Based Applications under Low Bandwidth and High Latency Conditions“. Lecture Notes on Software Engineering 3, Nr. 4 (2015): 314–17. http://dx.doi.org/10.7763/lnse.2015.v3.211.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Brook, Andrew. „Low-latency distributed applications in finance“. Communications of the ACM 58, Nr. 7 (25.06.2015): 42–50. http://dx.doi.org/10.1145/2747303.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Fiati, Patrick, und K. Adu Boahen Opare. „Network Architecture for Ultra Low Latency Applications“. Communications on Applied Electronics 7, Nr. 37 (30.07.2021): 1–4. http://dx.doi.org/10.5120/cae2021652887.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Sowmiyaa P, Saranya P, Sabena M, Saranya R und Subhisha K. „LOW-LATENCY APPROXIMATE ADDERIN FPGA“. international journal of engineering technology and management sciences 9, Nr. 2 (2025): 23–25. https://doi.org/10.46647/ijetms.2025.v09i02.005.

Der volle Inhalt der Quelle

Annotation:

Approximate computing has gained significant attention for applications where absolute precision isnot critical, such as image processing, machine learning, and signal processing. The proposeddesign divides the addition process into two stages: a main sub-adder for high-speed approximatecomputation and an error sub-adder for refining accuracy. By limiting carry propagation in the mainsub-adder, the critical path delay is significantly reduced, achieving low latency. Simultaneously,the error sub-adder operates in parallel to correct errors, ensuring a balance between performanceand precision. Experimental results demonstrate the design’s superior trade-off between speed,accuracy, and energy efficiency compared to conventional adders. The proposed architecture ishighly scalable and suitable for resource-constrained and performance-critical applications, such asreal-time image processing and low-power machine learning accelerators.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Gomes Lobato, Thiago Henrique, Roland Sottek und Michael Vorlaender. „Implementing neural networks in low-latency audio applications“. Journal of the Acoustical Society of America 153, Nr. 3_supplement (01.03.2023): A105. http://dx.doi.org/10.1121/10.0018318.

Der volle Inhalt der Quelle

Annotation:

The use of neural networks is becoming increasingly prevalent due to their ability to represent complex relationships and solve complex problems. However, implementing these models in systems that require low-latency output can be challenging, especially for practitioners who are used to developing their models in controlled environments like Python notebooks. Another issue is the high computational cost of complex models, which limits the minimum possible latency. This paper presents approaches for deploying models in audio applications, discusses the advantages and disadvantages of each approach, and presents strategies to reduce the inference cost of models without significantly sacrificing accuracy, using techniques such as model quantization. To illustrate these methods, example implementations of real-time beamforming deconvolution and real-time music DSP processing are shown.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Kavamahanga, Lambert, Theodette Uwimbabazi und Damascene Uwizeyemungu. „Low-Latency and Ultra-Reliable Communication for Industrial 5G“. Journal of Current Trends in Computer Science Research 3, Nr. 4 (18.07.2024): 01–05. http://dx.doi.org/10.33140/jctcsr.03.04.02.

Der volle Inhalt der Quelle

Annotation:

The Internet of Things(IoT) is a planned Internet extension in which everyday objects are outfitted with circuitry, software, sensors, and internet connectivity is required so that data can be received and sent over the Internet. Emerging applications like factory automation and au- tonomous driving necessitate affordable, dependable, and low- latency communication making wireless architecture It’s more convoluted than before. The study’s goal is to understand existing study issues and solutions in connection with 5G-enabled Industrial IoT based on both sectors’ original goals and commitments. The fifty generation mobile technologies naturally provide these (These are naturally provided by 5G mobile technologies.), making it a strong choice for enabling scenarios for Industrial IoT(IIoT). This article discusses Low Latency and Ultra-Reliable, one of the pillar elements of 5G wireless systems introduced by 3GPP in release 15 and beyond. It focuses on how to allow Low-Latency and Ultra-Reliable by combining metadata and data encoding approaches. Aside from evaluating, current issues and solutions, the study intends to get to a decision about the current research gaps by providing comparisons that are applicable to any of these subjects (in- relation to fifty-generation enabled-IIoT). Finally, it analyzes URLLC difficulties by assessing packet transmission reliability based on the packet time frame and the reliability impairment impacting communication dependability

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Litz, Heiner, Javier Gonzalez, Ana Klimovic und Christos Kozyrakis. „RAIL: Predictable, Low Tail Latency for NVMe Flash“. ACM Transactions on Storage 18, Nr. 1 (28.02.2022): 1–21. http://dx.doi.org/10.1145/3465406.

Der volle Inhalt der Quelle

Annotation:

Flash-based storage is replacing disk for an increasing number of data center applications, providing orders of magnitude higher throughput and lower average latency. However, applications also require predictable storage latency. Existing Flash devices fail to provide low tail read latency in the presence of write operations. We propose two novel techniques to address SSD read tail latency, including Redundant Array of Independent LUNs (RAIL) which avoids serialization of reads behind user writes as well as latency-aware hot-cold separation (HC) which improves write throughput while maintaining low tail latency. RAIL leverages the internal parallelism of modern Flash devices and allocates data and parity pages to avoid reads getting stuck behind writes. We implement RAIL in the Linux Kernel as part of the LightNVM Flash translation layer and show that it can reduce read tail latency by 7× at the 99.99th percentile, while reducing relative bandwidth by only 33%.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Shih, Yuan-Yao, Wei-Ho Chung, Ai-Chun Pang, Te-Chuan Chiu und Hung-Yu Wei. „Enabling Low-Latency Applications in Fog-Radio Access Networks“. IEEE Network 31, Nr. 1 (Januar 2017): 52–58. http://dx.doi.org/10.1109/mnet.2016.1500279nm.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Brook, Andrew. „Evolution and Practice: Low-latency Distributed Applications in Finance“. Queue 13, Nr. 4 (April 2015): 40–53. http://dx.doi.org/10.1145/2756506.2770868.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Berisa, Tomaz, Kerim Fouli und Martin Maier. „Real-time PON signaling for emerging low-latency applications“. Computer Communications 52 (Oktober 2014): 102–9. http://dx.doi.org/10.1016/j.comcom.2014.06.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Huang, Tao, Jiao Zhang und Yunjie Liu. „A mechanism achieving low latency for wireless datacenter applications“. Computer Science and Information Systems 13, Nr. 2 (2016): 639–58. http://dx.doi.org/10.2298/csis160301020h.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Mountaser, Ghizlane, Toktam Mahmoodi und Osvaldo Simeone. „Reliable and Low-Latency Fronthaul for Tactile Internet Applications“. IEEE Journal on Selected Areas in Communications 36, Nr. 11 (November 2018): 2455–63. http://dx.doi.org/10.1109/jsac.2018.2872299.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Kuang, Shiann-Rong, Jiun-Ping Wang und Hua-Yi Hong. „Variable-Latency Floating-Point Multipliers for Low-Power Applications“. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 18, Nr. 10 (Oktober 2010): 1493–97. http://dx.doi.org/10.1109/tvlsi.2009.2025167.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Wu, Eric Hsiao-Kuang, Ming-I. Hsieh und Hsu-Te Lai. „Low latency and efficient packet scheduling for streaming applications“. Computer Communications 29, Nr. 9 (Mai 2006): 1413–21. http://dx.doi.org/10.1016/j.comcom.2005.09.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Vivek Aby Pothen. „Distributed edge AI architecture for ultra-low latency 5G applications“. World Journal of Advanced Engineering Technology and Sciences 15, Nr. 2 (30.05.2025): 128–36. https://doi.org/10.30574/wjaets.2025.15.2.0520.

Der volle Inhalt der Quelle

Annotation:

The integration of edge computing with 5G networks represents a transformative approach to telecommunications architecture that addresses the stringent latency requirements of next-generation applications. This article shows architectural frameworks for edge-enabled 5G deployments, latency optimization techniques, real-time AI analytics capabilities, and key application domains. The article demonstrates that edge computing significantly reduces latency compared to cloud-centric alternatives while enhancing bandwidth efficiency and computational capabilities at the network edge. Multi-access Edge Computing frameworks provide standardized integration with 5G infrastructure, enabling local data processing and cross-platform interoperability. Advanced optimization techniques, including network slicing, computational offloading, data locality, and hardware acceleration, collectively create an environment capable of supporting ultra-low latency applications. AI analytics optimized for edge deployment enable intelligent decision-making without compromising privacy or performance, while application domains spanning autonomous vehicles, industrial IoT, immersive reality experiences, and predictive maintenance showcase the practical benefits of this architectural approach. These innovations collectively establish a foundation for mission-critical applications requiring deterministic performance and real-time processing capabilities.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Osama, Mohamed, Abdelhamied A. Ateya, Shaimaa Ahmed Elsaid und Ammar Muthanna. „Ultra-Reliable Low-Latency Communications: Unmanned Aerial Vehicles Assisted Systems“. Information 13, Nr. 9 (12.09.2022): 430. http://dx.doi.org/10.3390/info13090430.

Der volle Inhalt der Quelle

Annotation:

Ultra-reliable low-latency communication (uRLLC) is a group of fifth-generation and sixth-generation (5G/6G) cellular applications with special requirements regarding latency, reliability, and availability. Most of the announced 5G/6G applications are uRLLC that require an end-to-end latency of milliseconds and ultra-high reliability of communicated data. Such systems face many challenges since traditional networks cannot meet such requirements. Thus, novel network structures and technologies have been introduced to enable such systems. Since uRLLC is a promising paradigm that covers many applications, this work considers reviewing the current state of the art of the uRLLC. This includes the main applications, specifications, and main requirements of ultra-reliable low-latency (uRLL) applications. The design challenges of uRLLC systems are discussed, and promising solutions are introduced. The virtual and augmented realities (VR/AR) are considered the main use case of uRLLC, and the current proposals for VR and AR are discussed. Moreover, unmanned aerial vehicles (UAVs) are introduced as enablers of uRLLC. The current research directions and the existing proposals are discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Makhija, Deven, Rabindranath Bera und Sourav Dhar. „Low Latency Device to Device Communications for Sustainable Development“. ITM Web of Conferences 65 (2024): 04005. http://dx.doi.org/10.1051/itmconf/20246504005.

Der volle Inhalt der Quelle

Annotation:

The 5G device to device (D2D) communication is being given impetus as technology for achieving sustainable development goals (SDG) in various fields like health, smart city, education, infrastructure and clean energy. The low latency device to device communications are key enablers for achieving the goals and objectives promulgated as SDG. Network virtualisation, software defined networks, beamforming, artificial intelligence and cognitive methods are facilitating roll out of applications enabling achievement of SDG. The interference mitigation, efficient resource allocation, energy efficiency, mobility management, Quality of Service, scalability, standardisation and interoperability are few challenges being addressed to facilitate implementation of technology and its applications. In this paper existing work on D2D communications, its applications and research challenges has been reviewed. The impetus to D2D and mission critical communications by 3GPP frameworks and releases has been summarized. The SDG applications and research challenges have been analysed to highlight its implications on roll out of technology to achieve the SDG objectives and goals. These SDG applications and technology have the prospective to transform varied fields of health, education, infrastructure and industry for achieving goals.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Wadatkar, Prachi V., Rosario G. Garroppo und Gianfranco Nencioni. „5G-MEC Testbeds for V2X Applications“. Future Internet 15, Nr. 5 (09.05.2023): 175. http://dx.doi.org/10.3390/fi15050175.

Der volle Inhalt der Quelle

Annotation:

Fifth-generation (5G) mobile networks fulfill the demands of critical applications, such as Ultra-Reliable Low-Latency Communication (URLLC), particularly in the automotive industry. Vehicular communication requires low latency and high computational capabilities at the network’s edge. To meet these requirements, ETSI standardized Multi-access Edge Computing (MEC), which provides cloud computing capabilities and addresses the need for low latency. This paper presents a generalized overview for implementing a 5G-MEC testbed for Vehicle-to-Everything (V2X) applications, as well as the analysis of some important testbeds and state-of-the-art implementations based on their deployment scenario, 5G use cases, and open source accessibility. The complexity of using the testbeds is also discussed, and the challenges researchers may face while replicating and deploying them are highlighted. Finally, the paper summarizes the tools used to build the testbeds and addresses open issues related to implementing the testbeds.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

S Yadav, Purshotam. „Minimize Downtime: Container Failover with Distributed Locks in Multi - Region Cloud Deployments for Low - Latency Applications“. International Journal of Science and Research (IJSR) 9, Nr. 10 (05.10.2020): 1800–1803. http://dx.doi.org/10.21275/sr24709191432.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Rashid, Muhammad, Sajjad Shaukat Jamal, Sikandar Zulqarnain Khan, Adel R. Alharbi, Amer Aljaedi und Malik Imran. „Elliptic-Curve Crypto Processor for RFID Applications“. Applied Sciences 11, Nr. 15 (31.07.2021): 7079. http://dx.doi.org/10.3390/app11157079.

Der volle Inhalt der Quelle

Annotation:

This work presents an Elliptic-curve Point Multiplication (ECP) architecture with a focus on low latency and low area for radio-frequency-identification (RFID) applications over GF(2163). To achieve low latency, we have reduced the clock cycles by using: (i) three-shift buffers in the datapath to load Elliptic-curve parameters as well as an initial point, (ii) the identical size of input/output interfaces in all building blocks of the architecture. The low area is preserved by using the same hardware resources of squaring and multiplication for inversion computation. Finally, an efficient controller is used to control the inferred logic. The proposed ECP architecture is modeled in Verilog and the synthesis results are given on three different 7-series FPGA (Field Programmable Gate Array) devices, i.e., Kintex-7, Artix-7, and Virtex-7. The performance of the architecture is provided with the integration of a schoolbook multiplier (implemented with two different logic styles, i.e., combinational and sequential). On Kintex-7, the combinational implementation style of a schoolbook multiplier results in power-optimized, i.e., 161 μW, values with an expense of (i) hardware resources, i.e., 3561 look-up-tables and 1527 flip-flops, (ii) clock frequency, i.e., 227 MHz, and (iii) latency, i.e., 11.57 μs. On the same Kintex-7 device, the sequential implementation style of a schoolbook multiplier provides, (i) 2.88 μs latency, (ii) 1786 look-up-tables and 1855 flip-flops, (iii) 647 μW power, and (iv) 909 MHz clock frequency. Therefore, the reported area, latency and power results make the proposed ECP architecture well-suited for RFID applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Santin-Cruz, Carlos Jair, und Gordana Jovanovic Dolecek. „Audio Watermarking System in Real-Time Applications“. Informatics 12, Nr. 1 (25.12.2024): 1. https://doi.org/10.3390/informatics12010001.

Der volle Inhalt der Quelle

Annotation:

Watermarking is widely employed to protect audio files. Previous research has focused on developing systems that balance performance criteria, including robustness, imperceptibility, and capacity. Most existing systems are designed to work with pre-recorded audio signals, where the characteristics of the host signal are known in advance. In such cases, processing time is not a critical factor, as these systems generally do not account for real-time signal acquisition or report tests for real-time signal acquisition nor report the elapsed time between signal acquisition and watermarking output, known as latency. However, the increasing prevalence of audio sharing through real-time streams or video calls is a pressing issue requiring low-latency systems. This work introduces a low-latency watermarking system that utilizes a spread spectrum technique, a method that spreads the signal energy across a wide frequency band while embedding the watermark additively in the time domain to minimize latency. The system’s performance was evaluated by simulating real-time audio streams using two distinct methods. The results demonstrate that the proposed system achieves minimal latency during embedding, addressing the urgent need for such systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Anand, Ravi, Subhadeep Banik, Andrea Caforio, Tatsuya Ishikawa, Takanori Isobe, Fukang Liu, Kazuhiko Minematsu, Mostafizar Rahman und Kosei Sakamoto. „Gleeok: A Family of Low-Latency PRFs and its Applications to Authenticated Encryption“. IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, Nr. 2 (12.03.2024): 545–87. http://dx.doi.org/10.46586/tches.v2024.i2.545-587.

Der volle Inhalt der Quelle

Annotation:

In this paper, we propose a new family of low-latency pseudorandom functions (PRFs), dubbed Gleeok.Gleeok utilizes three 128-bit branches to achieve a 256-bit key size while maintaining low latency. The first two branches are specifically designed to defend against statistical attacks, especially for differential attacks, while the third branch provides resilience against algebraic attacks. This unique design enables Gleeok to offer ultralow latency while supporting 256-bit keys, setting it apart from existing ciphers dedicated to low-latency requirements. In addition, we propose wide-block variants having three 256-bit branches. We also present an application of Gleeok to short-input authenticated encryption which is crucial for memory encryption and various realtime communication applications. Furthermore, we present comprehensive hardware implementation results that establish the capabilities of Gleeok and demonstrate its competitiveness against related schemes in the literature. In particular, Gleeok achieves a minimum latency of roughly 360 ps with the NanGate 15 nm cell library and is thus on par with related low-latency schemes that only feature 128-bit keys while maintaining minimal overhead when equipped in an authenticated mode of operation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Berenberg, Anna, und Brad Calder. „Deployment Archetypes for Cloud Applications“. ACM Computing Surveys 55, Nr. 3 (30.04.2023): 1–48. http://dx.doi.org/10.1145/3498336.

Der volle Inhalt der Quelle

Annotation:

This is a survey article that explores six Cloud-based deployment archetypes for Cloud applications and the tradeoffs between them to achieve high availability, low end-user latency, and acceptable costs. These are (1) Zonal, (2) Regional, (3) Multi-regional, (4) Global, (5) Hybrid, and (6) Multi-cloud deployment archetypes. The goal is to classify cloud applications into a set of deployment archetypes and deployment models that tradeoff their needs around availability, latency, and geographical constraints with a focus on serving applications. This enables application owners to better examine the tradeoffs of each deployment model and what is needed for achieving the availability and latency goals for their application.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Rosing, Matt, und Joel Saltz. „Low Latency Messages on Distributed Memory Multiprocessors“. Scientific Programming 4, Nr. 1 (1995): 35–43. http://dx.doi.org/10.1155/1995/531941.

Der volle Inhalt der Quelle

Annotation:

This article describes many of the issues in developing an efficient interface for communication on distributed memory machines. Although the hardware component of message latency is less than 1 ws on many distributed memory machines, the software latency associated with sending and receiving typed messages is on the order of 50 μs. The reason for this imbalance is that the software interface does not match the hardware. By changing the interface to match the hardware more closely, applications with fine grained communication can be put on these machines. This article describes several tests performed and many of the issues involved in supporting low latency messages on distributed memory machines.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Hurtig, Per, Karl-Johan Grinnemo, Anna Brunstrom, Simone Ferlin, Ozgu Alay und Nicolas Kuhn. „Low-Latency Scheduling in MPTCP“. IEEE/ACM Transactions on Networking 27, Nr. 1 (Februar 2019): 302–15. http://dx.doi.org/10.1109/tnet.2018.2884791.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Vladyko, Andrei, Abdukodir Khakimov, Ammar Muthanna, Abdelhamied A. Ateya und Andrey Koucheryavy. „Distributed Edge Computing to Assist Ultra-Low-Latency VANET Applications“. Future Internet 11, Nr. 6 (04.06.2019): 128. http://dx.doi.org/10.3390/fi11060128.

Der volle Inhalt der Quelle

Annotation:

Vehicular ad hoc networks (VANETs) are a recent class of peer-to-peer wireless networks that are used to organize the communication and interaction between cars (V2V), between cars and infrastructure (V2I), and between cars and other types of nodes (V2X). These networks are based on the dedicated short-range communication (DSRC) IEEE 802.11 standards and are mainly intended to organize the exchange of various types of messages, mainly emergency ones, to prevent road accidents, alert when a road accident occurs, or control the priority of the roadway. Initially, it was assumed that cars would only interact with each other, but later, with the advent of the concept of the Internet of things (IoT), interactions with surrounding devices became a demand. However, there are many challenges associated with the interaction of vehicles and the interaction with the road infrastructure. Among the main challenge is the high density and the dramatic increase of the vehicles’ traffic. To this end, this work provides a novel system based on mobile edge computing (MEC) to solve the problem of high traffic density and provides and offloading path to vehicle’s traffic. The proposed system also reduces the total latency of data communicated between vehicles and stationary roadside units (RSUs). Moreover, a latency-aware offloading algorithm is developed for managing and controlling data offloading from vehicles to edge servers. The system was simulated over a reliable environment for performance evaluation, and a real experiment was conducted to validate the proposed system and the developed offloading method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Ruan, Lihua, Maluge Pubuduni Imali Dias und Elaine Wong. „Machine Learning-Based Bandwidth Prediction for Low-Latency H2M Applications“. IEEE Internet of Things Journal 6, Nr. 2 (April 2019): 3743–52. http://dx.doi.org/10.1109/jiot.2018.2890563.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Arvanitis, Gerasimos, Aris S. Lalos und Konstantinos Moustakas. „Adaptive representation of dynamic 3D meshes for low-latency applications“. Computer Aided Geometric Design 73 (August 2019): 70–85. http://dx.doi.org/10.1016/j.cagd.2019.07.005.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Krishna, Merugumalli Rama, K. Sri Lakshmi, S. Lalitha und C. Amulya. „Low Latency and Efficient LUT Based Multiplier for DSP Applications“. International Journal of Advance Research and Innovation 8, Nr. 2 (2020): 91–96. http://dx.doi.org/10.51976/ijari.822016.

Der volle Inhalt der Quelle

Annotation:

In digital signal processing memory based computation plays a vital role for DSP applications, which has multiplication with a fixed set of coefficient. LUT optimization for memory based multiplication can be done with these three computational techniques like Anti symmetry product coding (APC) and Odd multiple storage (OMS), combined APC-OMS. OMS technique with the modified APC-OMS based LUT multiplier can be discussed in terms of area and delay. These techniques are coded in VHDL language and synthesized in Xilinx ISE design suite 14.7. Thus, this proposes the APC-OMS based LUT multiplier can optimize the LUT size and consumes less area and obtains high speed when compared to other techniques. The proposed LUT based multiplier requires less significant area and less multiplication time than the canonical-signed-digit based multiplier.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Kambala, Gireesh. „Emergent Architectures in Edge Computing for Low-Latency Application“. International Journal of Engineering and Computer Science 13, Nr. 09 (29.09.2024): 26597–607. https://doi.org/10.18535/ijecs.v13i09.4926.

Der volle Inhalt der Quelle

Annotation:

Emerging as a necessary paradigm for meeting the low-latency needs of contemporary real-time applications is edge computing. By distributing computation, storage, and network resources, edge designs reduce data transfer latency and increase system responsiveness. They are indispensible in fields including smart cities, autonomous systems, and healthcare. This study explores evolving architectural paradigms in edge computing—including layered hierarchies, microservices, and serverless computing—as well as their interfaces with technologies including 5G, IoT, and artificial intelligence. Extensive studies reveal how they allow scalable, modular, resource-efficient solutions for activities sensitive to latency. Even in this regard, security, interoperability, and resource allocation demand constant innovation notwithstanding their changing power. The work also looks at innovative ideas addressing these issues and highlights possible opportunities such federated learning and quantum computing. The outcomes highlight how crucial emergent edge computing architectures are in enabling ultra-low-latency applications and redefining operational efficiencies in many industries.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Kambala, Gireesh. „Emergent Architectures in Edge Computing for Low-Latency Application“. International Journal of Scientific Research and Management (IJSRM) 12, Nr. 09 (28.09.2024): 1467–77. https://doi.org/10.18535/ijsrm/v12i09.ec07.

Der volle Inhalt der Quelle

Annotation:

Emerging as a necessary paradigm for meeting the low-latency needs of contemporary real-time applications is edge computing. By distributing computation, storage, and network resources, edge designs reduce data transfer latency and increase system responsiveness. They are indispensible in fields including smart cities, autonomous systems, and healthcare. This study explores evolving architectural paradigms in edge computing—including layered hierarchies, microservices, and serverless computing—as well as their interfaces with technologies including 5G, IoT, and artificial intelligence. Extensive studies reveal how they allow scalable, modular, resource-efficient solutions for activities sensitive to latency. Even in this regard, security, interoperability, and resource allocation demand constant innovation notwithstanding their changing power. The work also looks at innovative ideas addressing these issues and highlights possible opportunities such federated learning and quantum computing. The outcomes highlight how crucial emergent edge computing architectures are in enabling ultra-low-latency applications and redefining operational efficiencies in many industries.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Eaton, Brian, Jeff Stewart, Jon Tedesco und N. Cihan Tas. „Distributed Latency Profiling through Critical Path Tracing“. Queue 20, Nr. 1 (28.02.2022): 40–79. http://dx.doi.org/10.1145/3526967.

Der volle Inhalt der Quelle

Annotation:

Low latency is an important feature for many Google applications such as Search, and latency-analysis tools play a critical role in sustaining low latency at scale. For complex distributed systems that include services that constantly evolve in functionality and data, keeping overall latency to a minimum is a challenging task. In large, real-world distributed systems, existing tools such as RPC telemetry, CPU profiling, and distributed tracing are valuable to understand the subcomponents of the overall system, but are insufficient to perform end-to-end latency analyses in practice. Scalable and accurate fine-grain tracing has made Critical Path Tracing the standard approach for distributed latency analysis for many Google applications, including Google Search.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Erbati, Mohammad Mohammadi, Mohammad Mahdi Tajiki und Gregor Schiele. „Service Function Chaining to Support Ultra-Low Latency Communication in NFV“. Electronics 12, Nr. 18 (11.09.2023): 3843. http://dx.doi.org/10.3390/electronics12183843.

Der volle Inhalt der Quelle

Annotation:

Network function virtualization (NFV) has the potential to fundamentally transform conventional network architecture through the decoupling of software from dedicated hardware. The convergence of virtualization and cloud computing technologies has revolutionized the networking landscape, offering a wide range of advantages, including improved flexibility, manageability, and scalability. The importance of network capability in enabling ultra-low latency applications has been greatly amplified in the current era due to the increased demand for emerging services such as autonomous driving, teleoperated driving, virtual reality, and remote surgery. This paper presents a novel and efficient methodology for service function chaining (SFC) in an NFV-enabled network that aims to minimize latency and optimize the utilization of physical network resources, with a specific focus on ultra-low latency applications. In our proposed methodology, we offer flow prioritization and an adjustable priority coefficient factor (µ) to reserve a portion of physical network resources exclusively for ultra-low latency applications in order to optimize the deployment paths of these applications further. We formulate the SFC deployment problem as an integer linear programming (ILP) optimization model. Furthermore, we propose a set of heuristic algorithms that yield near-optimal solutions with minimal optimality gaps and execution times, making them practical for large-scale network topologies. Performance evaluations demonstrate the effectiveness of our proposed methodology in enabling ultra-low latency applications in an NFV-enabled network. Compared to existing algorithms, our proposed methodology achieves notable enhancements in terms of the end-to-end delay (up to 22 percent), bandwidth utilization (up to 28 percent), and SFC acceptance rate (up to 13 percent).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Wu, Yiliang, Xue Bai, Yendo Hu und Minghong Chen. „A Novel Video Transmission Latency Measurement Method for Intelligent Cloud Computing“. Applied Sciences 12, Nr. 24 (15.12.2022): 12884. http://dx.doi.org/10.3390/app122412884.

Der volle Inhalt der Quelle

Annotation:

Low latency video transmission is gaining importance in time-critical applications using real-time cloud-based systems. Cloud-based Virtual Reality (VR), remote control, and AI response systems are emerging use cases that demand low latency and good reliability. Although there are many video transmission schemes that claim low latency, they vary over different network conditions. Therefore, it is necessary to develop methods that can accurately measure end-to-end latency online, continuously, without any content modification. This research brings these applications one step closer to addressing these next generation use cases. This paper analyzes the cause of end-to-end latency within a video transmission system, and then proposes three methods to measure the latency: timecode, remote online, and lossless remote video online. The corresponding equipment was designed and implemented. The actual measurement of the three methods using related equipment proved that our proposed method can accurately and effectively measure the end-to-end latency of the video transmission system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Losada, Markos, Ainhoa Cortés, Andoni Irizar, Javier Cejudo und Alejandro Pérez. „A Flexible Fog Computing Design for Low-Power Consumption and Low Latency Applications“. Electronics 10, Nr. 1 (31.12.2020): 57. http://dx.doi.org/10.3390/electronics10010057.

Der volle Inhalt der Quelle

Annotation:

In this paper, we propose a flexible Fog Computing architecture in which the main features are that it allows us to select among two different communication links (WiFi and LoRa) on the fly and offers a low-power solution, thanks to the applied power management strategies at hardware and firmware level. The proposed Fog Computing architecture is formed by sensor nodes and an Internet of Things (IoT) gateway. In the case of LoRa, we have the choice of implementing the LoRaWAN and Application servers on the cloud or on the IoT gateway, avoiding, in this case, to send data to the Cloud. Additionally, we have presented an specific setup and methodology with the aim of measuring the sensor node’s power consumption and making sure there is a fair comparison between the different alternatives among the two selected wireless communication links by varying the duty cycle, the size of the payload, and the Spreading Factor (SF). This research work is in the scope of the STARPORTS Interconnecta Project, where we have deployed two sensor nodes in the offshore platform of PLOCAN, which communicate with the IoT gateway located in the PLOCAN premises. In this case, we have used LoRa communications due to the required large distance between the IoT gateway and the nodes in the offshore platform (in the range of kilometers). This deployment demonstrates that the proposed solution operates in a real environment and that it is a low-power and robust approach since it is sending data to the IoT gateway during more than one year and it continues working.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Božilov, Dušan, Miroslav Knežević und Ventzislav Nikov. „Optimized threshold implementations: securing cryptographic accelerators for low-energy and low-latency applications“. Journal of Cryptographic Engineering 12, Nr. 1 (25.11.2021): 15–51. http://dx.doi.org/10.1007/s13389-021-00276-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Amjad, Zubair, Kofi Atta Nsiah, Benoît Hilt, Jean-Philippe Lauffenburger und Axel Sikora. „Latency reduction for narrowband URLLC networks: a performance evaluation“. Wireless Networks 27, Nr. 4 (29.03.2021): 2577–93. http://dx.doi.org/10.1007/s11276-021-02553-x.

Der volle Inhalt der Quelle

Annotation:

AbstractFifth-generation (5G) cellular mobile networks are expected to support mission-critical low latency applications in addition to mobile broadband services, where fourth-generation (4G) cellular networks are unable to support Ultra-Reliable Low Latency Communication (URLLC). However, it might be interesting to understand which latency requirements can be met with both 4G and 5G networks. In this paper, we discuss (1) the components contributing to the latency of cellular networks and (2) evaluate control-plane and user-plane latencies for current-generation narrowband cellular networks and point out the potential improvements to reduce the latency of these networks, (3) present, implement and evaluate latency reduction techniques for latency-critical applications. The two elements we detected, namely the short transmission time interval and the semi-persistent scheduling are very promising as they allow to shorten the delay to processing received information both into the control and data planes. We then analyze the potential of latency reduction techniques for URLLC applications. To this end, we develop these techniques into the long term evolution (LTE) module of ns-3 simulator and then evaluate the performance of the proposed techniques into two different application fields: industrial automation and intelligent transportation systems. Our detailed evaluation results from simulations indicate that LTE can satisfy the low-latency requirements for a large choice of use cases in each field.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Dong, Jialin, Kai Yang und Yuanming Shi. „Blind Demixing for Low-Latency Communication“. IEEE Transactions on Wireless Communications 18, Nr. 2 (Februar 2019): 897–911. http://dx.doi.org/10.1109/twc.2018.2886191.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Le, Duc Hung, Xuan Thuan Nguyen, Trong Tu Bui, Huynh Huu Thuan und Pham Cong Kha. „A FLEXIBLE HIGH-BANDWIDTH LOW-LATENCY MULTI-PORT MEMORY CONTROLLER“. Vietnam Journal of Science and Technology 56, Nr. 3 (11.06.2018): 357. http://dx.doi.org/10.15625/2525-2518/56/3/11103.

Der volle Inhalt der Quelle

Annotation:

Multi-port memory controllers (MPMCs) have become increasingly important in many modern applications due to the tremendous growth in bandwidth requirement. Many approaches so far have focused on improving either the memory access latency or the bandwidth utilization for specific applications. Moreover, the application systems are likely to require certain adjustments to connect with an MPMC, since the MPMC interface is limited to a single-clock and single-data-width domain. In this paper, we propose efficient techniques to improve the flexibility, latency, and bandwidth of an MPMC. Firstly, MPMC interfaces employ a pair of dual-clock dualport FIFOs at each port, so any multi-clock multi-data-width application system can connect to an MPMC without requiring extra resources. Secondly, memory access latency is significantly reduced because parallel FIFOs temporarily keep the data transfer between the application system and memory. Lastly, a proposed arbitration scheme, namely window-based first-come-first-serve, considerably enhances the bandwidth utilization. Depending on the applications, MPMC can be properly configured by updating several internal configuration registers. The experimental results in an Altera Cyclone V FPGA prove that MPMC is fully operational at 150 MHz and supports up to 32 concurrent connections at various clocks and data widths. More significantly, achieved bandwidth utilization is approximately 93.2% of the theoretical bandwidth, and the access latency is minimized as compared to previous designs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Lee, Sunwoo, und Donghyeok An. „Enhanced Flow Control for Low Latency in QUIC“. Energies 15, Nr. 12 (09.06.2022): 4241. http://dx.doi.org/10.3390/en15124241.

Der volle Inhalt der Quelle

Annotation:

Low-latency communication is becoming more popular as applications that demand real-time interaction, such as autonomous mobile vehicles and tactile Internet, have recently gained prominence. In this paper, we propose a fast autotuning algorithm to support low-latency communication in the Quick UDP Internet Connection (QUIC) protocol. The transmission rate is adjusted by the fast autotuning based on the quantity of unused buffers. If the buffer has large free space, the receive window is quickly enlarged to increase the transmission rate and reduce the transmission delay. The fast autotuning is evaluated in this paper through extensive simulations, and the results show that the fast autotuning effectively reduces the transmission latency and increases throughput.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Barman, Ludovic, Italo Dacosta, Mahdi Zamani, Ennan Zhai, Apostolos Pyrgelis, Bryan Ford, Joan Feigenbaum und Jean-Pierre Hubaux. „PriFi: Low-Latency Anonymity for Organizational Networks“. Proceedings on Privacy Enhancing Technologies 2020, Nr. 4 (01.10.2020): 24–47. http://dx.doi.org/10.2478/popets-2020-0061.

Der volle Inhalt der Quelle

Annotation:

AbstractOrganizational networks are vulnerable to trafficanalysis attacks that enable adversaries to infer sensitive information fromnetwork traffic—even if encryption is used. Typical anonymous communication networks are tailored to the Internet and are poorly suited for organizational networks.We present PriFi, an anonymous communication protocol for LANs, which protects users against eavesdroppers and provides high-performance traffic-analysis resistance. PriFi builds onDining Cryptographers networks (DC-nets), but reduces the high communication latency of prior designs via a new client/relay/server architecture, in which a client’s packets remain on their usual network path without additional hops, and in which a set of remote servers assist the anonymization process without adding latency. PriFi also solves the challenge of equivocation attacks, which are not addressed by related work, by encrypting traffic based on communication history. Our evaluation shows that PriFi introduces modest latency overhead (≈ 100ms for 100 clients) and is compatible with delay-sensitive applications such as Voice-over-IP.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Mamatha Kotagi, Raghunath und Kavitha N Mudnal. „Low-latency communication protocols for industrial IoT“. World Journal of Advanced Research and Reviews 11, Nr. 3 (30.09.2021): 540–48. https://doi.org/10.30574/wjarr.2021.11.3.0414.

Der volle Inhalt der Quelle

Annotation:

The Industrial Internet of Things (IIoT) requires robust, efficient, and low-latency communication protocols to enable seamless real-time data transmission, ensuring reliability, scalability, and interoperability across industrial environments. This paper provides a comprehensive exploration of various low-latency communication protocols, including Time-Sensitive Networking (TSN), MQTT-SN, OPC UA over TSN, and 5G Ultra-Reliable Low-Latency Communications (URLLC). Each protocol is analyzed in terms of its architecture, performance characteristics, and suitability for industrial applications such as smart manufacturing, predictive maintenance, and industrial automation. Furthermore, this study examines the advantages and limitations of each protocol, addressing key factors such as latency, jitter, bandwidth efficiency, security, and integration challenges. Comparative analyses using figures, tables, and bar charts illustrate the performance of these protocols in different IIoT scenarios. The paper also highlights emerging trends in IIoT communication, including the convergence of edge computing, artificial intelligence, and software-defined networking to further enhance real-time decision-making. Finally, potential research directions and future advancements in IIoT communication protocols are discussed, providing insights into the evolving landscape of industrial networking.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Varunkumar Mishra. „Comprehensive and Effective Techniques Used to Improve Low Latency in 5G Communication“. Communications on Applied Nonlinear Analysis 32, Nr. 5s (23.12.2024): 17–25. https://doi.org/10.52783/cana.v32.2913.

Der volle Inhalt der Quelle

Annotation:

Introduction: The advent of 5G technology is poised to revolutionize a wide range of industries by enabling ultra-low-latency communications. However, reducing latency remains a significant challenge due to the complexities of traditional network infrastructures and the propagation delays associated with long-distance signal transmission. Latency is a critical factor in the performance of applications such as autonomous vehicles, industrial IoT, and real-time communications, where even minimal delays can result in performance degradation. This paper explores innovative techniques to address the challenges associated with reducing latency in 5G networks. Objectives: The primary objective of this paper is to identify and analyze two key approaches for minimizing latency in 5G networks: (1) reducing propagation delay and (2) optimizing network architecture. These objectives are central to achieving the low-latency performance required for next-generation 5G applications. Methods: For network architecture optimization, edge computing is integrated to process data closer to the source, minimizing the time spent in backhaul transmission. Additionally, we advise using Software-Defined Networking (SDN) for dynamic traffic management, which enables real-time adjustments to improve latency, and putting in place effective routing algorithms that minimise packet processing delays. Results: The integration of small cell base stations and mmWave frequency bands is expected to substantially reduce signal propagation delays, as these technologies shorten the transmission distance between the source and destination. The implementation of edge computing contributes to a significant reduction in backhaul latency, while efficient routing algorithms and SDN-based traffic management ensure optimized data flow and minimal processing delays. Preliminary simulations and analysis suggest that these combined techniques can effectively meet the stringent latency requirements of 5G applications, particularly in scenarios demanding high throughput and real-time communication. Conclusions: Achieving low-latency performance in 5G networks is essential for the successful deployment of future technologies that rely on real-time communication. This paper demonstrates that reducing propagation delay and optimizing network architecture through strategies like small cell deployment, mmWave utilization, edge computing, and dynamic traffic management can significantly enhance latency performance. These findings contribute to the ongoing effort to design 5G networks that can support the diverse and demanding applications of the next-generation digital landscape.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Marinšek, Alexander, Daan Delabie, Lieven De Strycker und Liesbet Van der Perre. „Physical Layer Latency Management Mechanisms: A Study for Millimeter-Wave Wi-Fi“. Electronics 10, Nr. 13 (03.07.2021): 1599. http://dx.doi.org/10.3390/electronics10131599.

Der volle Inhalt der Quelle

Annotation:

Emerging applications in fields such as extended reality require both a high throughput and low latency. The millimeter-wave (mmWave) spectrum is considered because of the potential in the large available bandwidth. The present work studies mmWave Wi-Fi physical layer latency management mechanisms, a key factor in providing low-latency communications for time-critical applications. We calculate physical layer latency in an ideal scenario and simulate it using a tailor-made simulation framework, based on the IEEE 802.11ad standard. Assessing data reception quality over a noisy channel yielded latency’s dependency on transmission parameters, channel noise, and digital baseband tuning. Latency in function of the modulation and coding scheme was found to span 0.28–2.71 ms in the ideal scenario, whereas simulation results also revealed its tight bond with the demapping algorithm and the number of low-density parity-check decoder iterations. The findings yielded tuning parameter combinations for reaching Pareto optimality either by constraining the bit error rate and optimizing latency or the other way around. Our assessment shows that trade-offs can and have to be made to provide sufficiently reliable low-latency communication. In good channel conditions, one may benefit from both the very high throughput and low latency; yet, in more adverse situations, lower modulation orders and additional coding overhead are a necessity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Jiang, Zhiyuan, Siyu Fu, Sheng Zhou, Zhisheng Niu, Shunqing Zhang und Shugong Xu. „AI-Assisted Low Information Latency Wireless Networking“. IEEE Wireless Communications 27, Nr. 1 (Februar 2020): 108–15. http://dx.doi.org/10.1109/mwc.001.1900279.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Kilic, Fatih, und Wolfram Hardt. „Low Latency Reliable Data Sharing Mechanism for UAV Swarm Missions“. Embedded Selforganising Systems 9, Nr. 3 (06.12.2022): 62–69. http://dx.doi.org/10.14464/ess.v9i3.551.

Der volle Inhalt der Quelle

Annotation:

The use of Unmanned Aerial Vehicle (UAV) swarms is increasing in many commercial applications as well as military applications (such as reconnaissance missions, search and rescue missions). Autonomous UAV swarm systems rely on multi-node interhost communication, which is used in coordination for complex tasks. Reliability and low latency in data transfer play an important role in the maintenance of UAV coordination for these tasks. In these applications, the control of UAVs is performed by autonomous software and any failure in data reception may have catastrophic consequences. On the other hand, there are lots of factors that affect communication link performance such as path loss, interference, etc. in communication technology (WIFI, 5G, etc.), transport layer protocol, network topology, and so on. Therefore, the necessity of reliable and low latency data sharing mechanisms among UAVs comes into prominence gradually. This paper examines available middleware solutions, transport layer protocols, and data serialization formats. Based on evaluation results, this research proposes a middleware concept for mobile wireless networks like UAV swarm systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Ferreira Neto, Nelson Alves, Marco Ruiz, Marco Reis, Tiago Cajahyba, Davi Oliveira, Ana C. Barreto, Eduardo F. Simas Filho, Wagner L. A. de Oliveira, Leizer Schnitman und Roberto L. S. Monteiro. „Low-latency perception in off-road dynamical low visibility environments“. Expert Systems with Applications 201 (September 2022): 117010. http://dx.doi.org/10.1016/j.eswa.2022.117010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Prapas, Antonios, Konstantinos F. Kantelis, Petros Nicopolitidis und Georgios I. Papadimitriou. „An On-Demand TDMA Approach Optimized for Low-Latency IoT Applications“. Sensors 22, Nr. 17 (27.08.2022): 6461. http://dx.doi.org/10.3390/s22176461.

Der volle Inhalt der Quelle

Annotation:

The never-ending evolution of the Internet of Things ecosystem is reshaping the arena of wireless communications and competing against conventional networking solutions in fields such as battery life, device and deployment cost, coverage, and support for an immense number of devices. Inspired by this phenomenon, this paper presents a novel Medium Access Control protocol utilizing long-range technology, based on a Time Division Multiple Access communication protocol variant, adjusted to make better use of each device’s hardware. Focusing on Low Power Wide Area Network applications, this implementation improves data latency and offers amplified performance due to better network awareness and dynamic time slot rescheduling. Various simulation scenarios were contrived to evaluate the protocol’s performance. The results instate the proposed algorithm as a promising access scheme for the IoT field.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Lu, Donghang, Albert Yu, Aniket Kate und Hemanta Maji. „Polymath: Low-Latency MPC via Secure Polynomial Evaluations and Its Applications“. Proceedings on Privacy Enhancing Technologies 2022, Nr. 1 (20.11.2021): 396–416. http://dx.doi.org/10.2478/popets-2022-0020.

Der volle Inhalt der Quelle

Annotation:

Abstract While the practicality of secure multi-party computation (MPC) has been extensively analyzed and improved over the past decade, we are hitting the limits of efficiency with the traditional approaches of representing the computed functionalities as generic arithmetic or Boolean circuits. This work follows the design principle of identifying and constructing fast and provably-secure MPC protocols to evaluate useful high-level algebraic abstractions; thus, improving the efficiency of all applications relying on them. We present Polymath, a constant-round secure computation protocol suite for the secure evaluation of (multi-variate) polynomials of scalars and matrices, functionalities essential to numerous data-processing applications. Using precise natural precomputation and high-degree of parallelism prevalent in the modern computing environments, Polymath can make latency of secure polynomial evaluations of scalars and matrices independent of polynomial degree and matrix dimensions. We implement our protocols over the HoneyBadgerMPC library and apply it to two prominent secure computation tasks: privacy-preserving evaluation of decision trees and privacy-preserving evaluation of Markov processes. For the decision tree evaluation problem, we demonstrate the feasibility of evaluating high-depth decision tree models in a general n-party setting. For the Markov process application, we demonstrate that Poly-math can compute large powers of transition matrices with better online time and less communication.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Nawaz, Tassadaq, Marco Seminara, Stefano Caputo, Lorenzo Mucchi und Jacopo Catani. „Low-Latency VLC System with Fresnel Receiver for I2V ITS Applications“. Journal of Sensor and Actuator Networks 9, Nr. 3 (22.07.2020): 35. http://dx.doi.org/10.3390/jsan9030035.

Der volle Inhalt der Quelle

Annotation:

This work presents a characterization of a low-cost, low-latency Visible Light Communication (VLC) prototype for infrastructure-to-vehicle (I2V) communication for future Intelligent Transportation Systems (ITS). The system consists of a regular traffic light as a transmitter (the red light is modulated with the information), and a photodetector as a receiver. The latter is equipped with low-cost Fresnel lenses as condensers, namely, 1 ′ ′ Fresnel and 2 ′ ′ Fresnel, to increase the optical gain of the system at the receiver. The system is capable of Active Decode and Relay (ADR) of information to further incoming units. The experimental characterization of amplitude and Packet Error Rate (PER) for the proposed system has been performed for distances up to 50 m. The results show that by incorporating the 2 ′ ′ Fresnel lens in the photodetector, an error free ( PER ≤ 10 − 5 ) I2V communication is established up to 50 m. Furthermore, the prototype can be used for both broadcast and beaconing transmission modes. This low-cost VLC-based system could offer sub-millisecond latency in the full ADR process for distances up to 36 m, which makes it suitable for integration in Cellular-V2X (C-V2X) and 5G platforms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zeitschriftenartikel zum Thema „Low-Latency applications“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an