Abstract
A graph similarity-based optimal deployment algorithm is proposed in this paper to find sensor nodes that can effectively recognize tasks in intelligent wireless sensor networks. A variational graph auto-encoder is used to encode each node as a multivariate normal distribution. Based on the optimal transport, we can transmute the similarity of two graphs into the Wasserstein distance between their learned multivariate normal distribution. We can obtain the importance of nodes for wireless sensor networks by measuring the Wasserstein distance of the standard and perturbed graphs. According to the importance ranking, the optimal sensor nodes can be selected to achieve task recognition. The results tested on CIMIS show that the sensor nodes selected by the proposed algorithm can achieve optimal deployment with high precision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wang W, Zhu Q, Gao H (2022) Drift detection of intelligent sensor networks deployment based on graph stream. IEEE Trans Netw Sci Eng
Kusuma SM, Veena KN, Aparna N (2021) Effective deployment of sensors in a wireless sensor networks using Hebbian machine learning technique. In: 2021 International conference on computing, communication, and intelligent systems (ICCCIS). IEEE, pp 268–274
Nivetha D, Rajesh R, Ramkumar MO (2020) Intelligent fruit fly algorithm for maximization coverage problem in wireless sensor network. In: 2020 7th International conference on smart structures and systems (ICSSS). IEEE, pp 1–6
Gao H, Zhu Q, Wang W (2023) Optimal deployment of large-scale wireless sensor networks based on graph clustering and matrix factorization. EURASIP J Adv Signal Process 2023(1):1–17
Zhou J, Cui G, Hu S et al (2020) Graph neural networks: a review of methods and applications. AI Open 1:57–81
Munikoti S, Das L, Natarajan B (2021) Bayesian graph neural network for fast identification of critical nodes in uncertain complex networks. In: 2021 IEEE international conference on systems, man, and cybernetics (SMC). IEEE, pp 3245–3251
Du G, Zhu F, Liu Q (2022) Vital node searcher: find out critical node measure with deep reinforcement learning. Connect Sci 34(1):1519–1539
Petric Maretic H, El Gheche M, Chierchia G et al (2019) GOT: an optimal transport framework for graph comparison. Adv Neural Inf Process Syst 32
Dong Y, Sawin W (2020) Copt: coordinated optimal transport on graphs. Adv Neural Inf Process Syst 33:19327–19338
“Cimisdata”. http://www.cimis.water.ca.gov
Tsitsvero M, Barbarossa S, Di Lorenzo P (2016) Signals on graphs: uncertainty principle and sampling. IEEE Trans Signal Process 64(18):4845–4860
Chen S, Varma R, Sandryhaila A et al (2015) Discrete signal processing on graphs: sampling theory. IEEE Trans Signal Process 63(24):6510–6523
Shewry MC, Wynn HP (2015) Maximum entropy sampling. J Appl Stats 14(2):165–170
Krause A, Singh A, Guestrin C (2008) Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J Mach Learn Res 9(3):235–284
Acknowledgements
This work is supported by the National Natural Science Foundation of China (No.61731006, 61971310) and the Tian** Research Innovation Project for Postgraduate Students (2022SKY264).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Gao, H., Cui, N., Zhao, J., Wang, W. (2024). Graph Similarity Based on Optimal Transmission for Optimal Deployment of Intelligent Wireless Sensor Networks. In: Wang, W., Mu, J., Liu, X., Na, Z.N. (eds) Artificial Intelligence in China. AIC 2023. Lecture Notes in Electrical Engineering, vol 1043. Springer, Singapore. https://doi.org/10.1007/978-981-99-7545-7_25
Download citation
DOI: https://doi.org/10.1007/978-981-99-7545-7_25
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-7544-0
Online ISBN: 978-981-99-7545-7
eBook Packages: Computer ScienceComputer Science (R0)