.png){kind=icon}
返回
Opportunistic Sensing in Task-Oriented Wireless Sensor Network Based on Graph Compressed Sensing
.png){kind=icon}
PRE
AI
DOI：10.1109/TNSE.2024.3427129.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As artificial intelligence and modern signal processing technologies progress, sensor networks often necessitate not collecting information from all nodes in order to effectively perceive and monitor target areas in practical applications. Such progress sets the foundation for Opportunistic Sensing (OS) which is a method engineered to automatically discover and select sensor nodes for efficient data gathering. In this paper, we propose a novel OS algorithm for optimizing node deployment in task-oriented wireless sensor networks. It can efficiently fuse sensed information by partitioning the network into multiple subnetworks and integrating graph compressed sensing with Restricted Boltzmann Machine techniques. Moreover, we employ the Kullback-Leibler divergence to quantify information distortion induced by OS. We also introduce the brainstorm optimization algorithm to improve sensor selection strategy. Experiments demonstrate that the proposed algorithm can efficiently diminish reconstruction errors and enhance network performance compared with classical and recent baseline methods.
Keyword:
Wireless sensor networks
Task analysis
Sensors
Optimization
Compressed sensing
Clustering algorithms
Monitoring
Opportunistic sensing
topological potential pool
graph compressed sensing
restricted Boltzmann machine
brainstorm optimization
期刊
I
IF:
7.9
论文数:
2.5K
被引数:
10.0K
机构
引用论文
.png){kind=icon}
Hierarchical Adaptive Pooling by Capturing High-Order Dependency for Graph Representation Learning通过捕获图表示学习的高阶依赖来实现分层自适应池化
OAAI
OAAI分享收藏Electrodeposited Nanoflakes of RuOx·nH2O on Three-dimensional Graphene for Flexible SupercapacitorsOAAI
OAAI分享收藏
查看更多内容