Search arXivSearch

arXiv · 2007.14158

The Role of UAV-IoT Networks in Future Wildfire Detection

Abstract

The challenge of wildfire management and detection is recently gaining increased attention due to the increased severity and frequency of wildfires worldwide. Popular fire detection techniques such as satellite imaging and remote camera-based sensing suffer from late detection and low reliability while early wildfire detection is a key to prevent massive fires. In this paper, we propose a novel wildfire detection solution based on unmanned aerial vehicles assisted Internet of things (UAV-IoT) networks. The main objective is to (1) study the performance and reliability of the UAV-IoT networks for wildfire detection and (2) present a guideline to optimize the UAV-IoT network to improve fire detection probability under limited budgets. We focus on optimizing the IoT devices' density and number of UAVs covering the forest area such that a lower bound of the wildfires detection probability is maximized within a limited time and budget. At any time after the fire ignition, the IoT devices within a limited distance from the fire can detect it. These IoT devices can then report their measurements only when the UAV is nearby. Discrete-time Markov chain (DTMC) analysis is utilized to compute the fire detection probability at discrete time. Before declaring fire detection, a validation state is designed to account for IoT devices' practical limitations such as miss-detection and false alarm probabilities. Numerical results suggest that given enough system budget, the UAV-IoT based fire detection can offer a faster and more reliable wildfire detection solution than the state of the art satellite imaging techniques.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Osama M. Bushnaq, Anas Chaaban, Tareq Y. Al-Naffouri. 2020-07-28. The Role of UAV-IoT Networks in Future Wildfire Detection. https://arxiv.org/abs/2007.14158

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

KEEP EXPLORING

Related papers

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

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

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