Federated Deep Reinforcement Learning Approach for Real-Time Target Coverage in Wireless Sensor Networks

Maximizing target coverage is crucial in wireless sensor networks (WSN), where sensor nodes collect data to monitor events or targets in specific areas. Efficient coverage optimization involves deploying sensors to cover the entire monitored region, addressing the NP-hard nature of the problem. Various algorithms, including learning-based automata, genetic algorithms, and probabilistic approaches, have been employed. Specifically, deep reinforcement learning (DRL), using deep neural network (DNN) as a predictor, has shown promise. However, the DRL models require a large amount of data for training, which may limit their adaptability to the ever-evolving statistics of the underlying environment. Moreover, wireless networks are inherently distributed systems, where centralized DRL approaches would require excessive data exchange, while fully distributed approaches may result in slower convergence rates and performance degradation. To overcome these challenges, we propose a novel federated learning (FL) approach to Deep Q-Network (DQN), called Federated Reinforcement Deep Q-Network (FEDQN), which allows sensors to collaboratively train the DQN by sharing only model weights, not training data. This paper demonstrates how FEDQN maximizes target coverage in a continuous, partially observable visual sensor network environment, simulating traffic flow with mobile targets.

Authors

Institutions

Publication Details

Published
2024-09-23
DOI
https://doi.org/10.1109/mass62177.2024.00102
Citations
3
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
1.05
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Federated Deep Reinforcement Learning Approach for Real-Time Target Coverage in Wireless Sensor Networks

Nazli Siasi, Corey Thomas Glodek
3 citations
Energy Efficient Wireless Sensor Networks
1.05
article

Federated Deep Reinforcement Learning Approach for Real-Time Target Coverage in Wireless Sensor Networks

Nazli Siasi, Corey Thomas Glodek
article en
3 citations

Abstract

Maximizing target coverage is crucial in wireless sensor networks (WSN), where sensor nodes collect data to monitor events or targets in specific areas. Efficient coverage optimization involves deploying sensors to cover the entire monitored region, addressing the NP-hard nature of the problem. Various algorithms, including learning-based automata, genetic algorithms, and probabilistic approaches, have been employed. Specifically, deep reinforcement learning (DRL), using deep neural network (DNN) as a predictor, has shown promise. However, the DRL models require a large amount of data for training, which may limit their adaptability to the ever-evolving statistics of the underlying environment. Moreover, wireless networks are inherently distributed systems, where centralized DRL approaches would require excessive data exchange, while fully distributed approaches may result in slower convergence rates and performance degradation. To overcome these challenges, we propose a novel federated learning (FL) approach to Deep Q-Network (DQN), called Federated Reinforcement Deep Q-Network (FEDQN), which allows sensors to collaboratively train the DQN by sharing only model weights, not training data. This paper demonstrates how FEDQN maximizes target coverage in a continuous, partially observable visual sensor network environment, simulating traffic flow with mobile targets.

DePaul University (US)
Openalex Percentile: Top 21%
Energy Efficient Wireless Sensor Networks
1.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.