Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1804.00502

Efficient Clear Air Turbulence Avoidance Algorithms using IoT for Commercial Aviation

Amlan Chatterjee·Hugo Flores·Bin Tang·Ashish Mani·Khondker S. Hasan
View original source ↗Read source document ↗Export metadata ↓

Abstract

With the growth of commercial aviation over the last few decades there have been many applications designed to improve the efficiency of flight operations as well as safety and security. A number of these applications are based on the gathered data from flights; the data is usually acquired from the various sensors available on the aircraft. There are numerous sensors among the electrical and electronics devices on an aircraft, most of which are essential for the proper functioning of the same. With the sensors being operational throughout the time of movement of the aircraft, a large amount of data is collected during each flight. Normally, most of the gathered data are stored on a storage device on the aircraft, and are analyzed and studied later off-site for research purposes focusing on improving airline operation and efficiently maintaining the same. In certain cases, when there is data transfer during the flight, it is between the aircraft and an air-traffic-control (ATC) tower, which serves as the base station. The aircraft equipped with all these sensors, which can gather and exchange data, form a framework of Internet of things (IoT). Detecting and avoiding any form of turbulence for an aircraft is vital; it adds to the safety of both passengers and aircraft while reducing the operating cost of the airline. Therefore, in this paper, we study techniques to detect and avoid Clear Air Turbulence (CAT), which is a specific type of turbulence, based on the IoT framework of aircraft. We propose algorithms that consider both direct and indirect communication between aircraft within a specific region. Using simulation results, we show that our proposed techniques of direct communication using the IoT framework is faster than conventional techniques involving radio communication via both single ATC tower and multiple ATC towers.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amlan Chatterjee, Hugo Flores, Bin Tang, Ashish Mani, Khondker S. Hasan. 2018-03-19. Efficient Clear Air Turbulence Avoidance Algorithms using IoT for Commercial Aviation. https://arxiv.org/abs/1804.00502

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI↗
arXiv2026

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI↗
arXiv2026

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI↗