{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:22:24Z","timestamp":1740140544349,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012335","name":"National Defense Basic Scientific Research Program of China","doi-asserted-by":"publisher","award":["JCKY2019205A003"],"award-info":[{"award-number":["JCKY2019205A003"]}],"id":[{"id":"10.13039\/501100012335","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Fault diagnosis of the aircraft wiring network plays an important role in the intelligent manufacture of the aircraft. Many studies focus on the feature-based machine learning methods. However, these methods are improper in handling the data on heterogeneous graphs. Due to the scatter of the valid feature information, the relevant information between the test nodes is ignored by these methods, which leads to the low accuracy fault diagnosis. Taking the advantage of the 5G technology that can remotely process large-scale graph data, this work proposes a fault diagnosis method named \u201ctopological network-graph transformer network (TN-GTN).\u201d TN-GTN can improve the fault diagnosis accuracy through feature enhancement and classification, which is based on the topological information of heterogeneous graphs. The graph network is able to learn new graph structures by identifying useful meta-paths and multi-hop connections between unconnected nodes on original graphs. Feature-enhanced test nodes are used to classify the final labels by the artificial neural network. Results of the performed experiment showed that TN-GTN reduced the dependence on domain knowledge and achieved an accurate classification of the fault diagnosis on aircraft wiring network.\n<\/jats:p>","DOI":"10.1186\/s13638-022-02148-w","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T10:16:53Z","timestamp":1658139413000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["TN-GTN: fault diagnosis of aircraft wiring network over edge computing"],"prefix":"10.1186","volume":"2022","author":[{"given":"Tian","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gongping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3097-5293","authenticated-orcid":false,"given":"Meng","family":"Chi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanqi","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianming","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,18]]},"reference":[{"issue":"1","key":"2148_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1186\/s13638-020-01794-2","volume":"2020","author":"S Xu","year":"2020","unstructured":"S. Xu et al., A collaborative cloud-edge computing framework in distributed neural network. EURASIP J. Wirel. Commun. Netw. 2020(1), 211 (2020)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"2148_CR2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3163144","author":"H Gao","year":"2022","unstructured":"H. Gao et al., TSMAE: a novel anomaly detection approach for internet of things time series data using memory-augmented autoencoder. IEEE Trans. Netw. Sci. Eng. (2022). https:\/\/doi.org\/10.1109\/TNSE.2022.3163144","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"6","key":"2148_CR3","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1007\/s11036-021-01846-x","volume":"26","author":"H Gao","year":"2021","unstructured":"H. Gao et al., SDTIOA: modeling the timed privacy requirements of IoT service composition: a user interaction perspective for automatic transformation from BPEL to timed automata. Mob. Netw. Appl. 26(6), 2272\u20132297 (2021)","journal-title":"Mob. Netw. Appl."},{"issue":"4","key":"2148_CR4","doi-asserted-by":"publisher","first-page":"4002","DOI":"10.1109\/TNSM.2021.3125395","volume":"18","author":"X Ma","year":"2021","unstructured":"X. Ma et al., Real-time multiple-workflow scheduling in cloud environments. IEEE eTrans. Netw. Serv. Manag. 18(4), 4002\u20134018 (2021)","journal-title":"IEEE eTrans. Netw. Serv. Manag."},{"issue":"4","key":"2148_CR5","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1109\/TCCN.2020.3027681","volume":"6","author":"Y Yin","year":"2020","unstructured":"Y. Yin et al., QoS prediction for service recommendation with features learning in mobile edge computing environment. IEEE Trans. Cognit. Commun. Netw. 6(4), 1136\u20131145 (2020)","journal-title":"IEEE Trans. Cognit. Commun. Netw."},{"key":"2148_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3169421","author":"H Gao","year":"2022","unstructured":"H. Gao et al., PPO2: location privacy-oriented task offloading to edge computing using reinforcement learning for intelligent autonomous transport systems. IEEE Trans. Intell. Trans. Syst. (2022). https:\/\/doi.org\/10.1109\/TITS.2022.3169421","journal-title":"IEEE Trans. Intell. Trans. Syst."},{"issue":"9","key":"2148_CR7","doi-asserted-by":"publisher","first-page":"6153","DOI":"10.1109\/TII.2020.3039500","volume":"17","author":"Y Yin","year":"2021","unstructured":"Y. Yin et al., Personalized APIs recommendation with cognitive knowledge mining for industrial systems. IEEE Trans. Ind. Inf. 17(9), 6153\u20136161 (2021)","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"6","key":"2148_CR8","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1109\/19.746713","volume":"47","author":"NG Paulter","year":"1998","unstructured":"N.G. Paulter, Long-term repeatability of a TDR-based printed wiring board dielectric constant measurement system. IEEE Trans. Instrum. Meas. 47(6), 1469\u20131473 (1998)","journal-title":"IEEE Trans. Instrum. Meas."},{"issue":"8","key":"2148_CR9","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1109\/TIM.2014.2386918","volume":"64","author":"Q Shi","year":"2015","unstructured":"Q. Shi, O. Kanoun, Wire fault diagnosis in the frequency domain by impedance spectroscopy. IEEE Trans. Instrum. Meas. 64(8), 2179\u20132187 (2015)","journal-title":"IEEE Trans. Instrum. Meas."},{"issue":"1","key":"2148_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/JSEN.2006.886866","volume":"7","author":"CR Sharma","year":"2007","unstructured":"C.R. Sharma, C. Furse, R.R. Harrison, Low-power STDR CMOS sensor for locating faults in aging aircraft wiring. IEEE Sens. J. 7(1), 43\u201350 (2007)","journal-title":"IEEE Sens. J."},{"issue":"1","key":"2148_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TEMC.2004.842109","volume":"47","author":"C Lo","year":"2005","unstructured":"C. Lo, C. Furse, Noise-domain reflectometry for locating wiring faults. IEEE Trans. Electromagn. Compat. 47(1), 97\u2013104 (2005)","journal-title":"IEEE Trans. Electromagn. Compat."},{"key":"2148_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.proeng.2011.10.055","volume":"17","author":"J Tao","year":"2011","unstructured":"J. Tao et al., Design of aircraft cable fault diagnose and location system based on aircraft airworthiness requirement. Procedia Eng. 17, 455\u2013464 (2011)","journal-title":"Procedia Eng."},{"key":"2148_CR13","unstructured":"O.D.J. Ku\u017eelka, Markov logic networks for knowledge base completion: a theoretical analysis under the MCAR assumption. In Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI, 2019: p. 427."},{"issue":"1","key":"2148_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-020-01861-8","volume":"2021","author":"Y Zhang","year":"2021","unstructured":"Y. Zhang, W. Huang, Design of intelligent diagnosis system for teaching quality based on wireless sensor network and data mining. EURASIP J. Wirel. Commun. Netw. 2021(1), 1\u201312 (2021)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"1","key":"2148_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-020-01671-y","volume":"2020","author":"SC Chu","year":"2020","unstructured":"S.C. Chu et al., Identifying correctness data scheme for aggregating data in cluster heads of wireless sensor network based on naive Bayes classification. EURASIP J. Wirel. Commun. Netw. 2020(1), 1\u20135 (2020)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"2148_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219947","volume-title":"Large-Scale Learnable Graph Convolutional Networks","author":"H Gao","year":"2018","unstructured":"H. Gao, Z. Wang, S. Ji, Large-Scale Learnable Graph Convolutional Networks (ACM, New York, 2018)"},{"key":"2148_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"Modeling Relational Data with Graph Convolutional Networks","author":"M Schlichtkrull","year":"2018","unstructured":"M. Schlichtkrull et al., Modeling Relational Data with Graph Convolutional Networks (Springer, Cham, 2018)"},{"key":"2148_CR18","volume-title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","author":"D Duvenaud","year":"2015","unstructured":"D. Duvenaud et al., Convolutional Networks on Graphs for Learning Molecular Fingerprints (MIT Press, Cambridge, 2015)"},{"key":"2148_CR19","doi-asserted-by":"crossref","unstructured":"N. Bandinelli, M. Bianchini and F. Scarselli. Learning long-term dependencies using layered graph neural networks. InThe International Joint Conference on Neural Networks. 2010. IEEE","DOI":"10.1109\/IJCNN.2010.5596634"},{"issue":"4","key":"2148_CR20","first-page":"4215","volume":"34","author":"B Hui","year":"2020","unstructured":"B. Hui, P. Zhu, Q. Hu, Collaborative graph convolutional networks: unsupervised learning meets semi-supervised learning. Proc. AAAI Conf. Artif. Intell. 34(4), 4215\u20134222 (2020)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"2148_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3026025","author":"J Liu","year":"2020","unstructured":"J. Liu, G.P. Ong, X.M. Chen, GraphSAGE-based traffic speed forecasting for segment network with sparse data. IEEE Trans. Intell. Trans. Syst. (2020). https:\/\/doi.org\/10.1109\/TITS.2020.3026025","journal-title":"IEEE Trans. Intell. Trans. Syst."},{"key":"2148_CR22","unstructured":"Velikovi, P., et al., Graph attention networks. arXiv preprint arXiv:1710.10903. 2017."},{"key":"2148_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3155486","author":"H Gao","year":"2022","unstructured":"H. Gao et al., A mutually supervised graph attention network for few-shot segmentation: the perspective of fully utilizing limited samples. IEEE Trans. Neural Netw. Learn. Syst. (2022). https:\/\/doi.org\/10.1109\/TNNLS.2022.3155486","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2148_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2878247","author":"RA Rossi","year":"2018","unstructured":"R.A. Rossi, R. Zhou, N. Ahmed, Deep inductive graph representation learning. IEEE Trans. Knowl. Data Eng. (2018). https:\/\/doi.org\/10.1109\/TKDE.2018.2878247","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"2148_CR25","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/S0895480191196812","volume":"8","author":"B Jamison","year":"1992","unstructured":"B. Jamison, S. Olariu, On the homogeneous decomposition of graphs. SIAM J. Discret. Math. 8(3), 448\u2013463 (1992)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"2148_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2016","unstructured":"C. Shi et al., A survey of heterogeneous information network analysis. IEEE Trans. Knowl. Data Eng. 29(1), 17\u201337 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"2148_CR27","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Y. Sun et al., PathSim: Meta path-based Top-K similarity search in heterogeneous information networks. Proc. VLDB Endow. 4(11), 992\u20131003 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"2148_CR28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443","author":"C Shi","year":"2017","unstructured":"C. Shi et al., Heterogeneous information network embedding for recommendation. IEEE Trans. Knowl. Data Eng. (2017). https:\/\/doi.org\/10.1109\/TKDE.2018.2833443","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2148_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymeth.2021.08.003","author":"Y Long","year":"2021","unstructured":"Y. Long et al., Heterogeneous graph attention networks for drug virus association prediction. Methods (2021). https:\/\/doi.org\/10.1016\/j.ymeth.2021.08.003","journal-title":"Methods"},{"key":"2148_CR30","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036","volume-title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","author":"Y Dong","year":"2017","unstructured":"Y. Dong, N.V. Chawla, A. Swami, metapath2vec: Scalable Representation Learning for Heterogeneous Networks (ACM, New York, 2017)"},{"key":"2148_CR31","first-page":"11960","volume":"32","author":"S Yun","year":"2019","unstructured":"S. Yun et al., Graph transformer networks. Adv. Neural Inf. Proc. Syst. 32, 11960\u201311970 (2019)","journal-title":"Adv. Neural Inf. Proc. Syst."},{"issue":"3","key":"2148_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2500492","volume":"7","author":"Y Sun","year":"2012","unstructured":"Y. Sun et al., PathSelClus: integrating Meta-path selection with user-guided object clustering in heterogeneous information networks. ACM Trans. Knowl. Discov. from Data 7(3), 1 (2012)","journal-title":"ACM Trans. Knowl. Discov. from Data"},{"key":"2148_CR33","unstructured":"Kipf, T.N. and M. Welling, Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907. 2016."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02148-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-022-02148-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02148-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T10:24:10Z","timestamp":1658139850000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-022-02148-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2148"],"URL":"https:\/\/doi.org\/10.1186\/s13638-022-02148-w","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2022,7,18]]},"assertion":[{"value":"14 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"62"}}