{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:10Z","timestamp":1740149050332,"version":"3.37.3"},"reference-count":31,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672298","61873326","61802155","61802201","2018SJZDI142"],"award-info":[{"award-number":["61672298","61873326","61802155","61802201","2018SJZDI142"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002703","name":"Jiangsu University","doi-asserted-by":"publisher","award":["61672298","61873326","61802155","61802201","2018SJZDI142"],"award-info":[{"award-number":["61672298","61873326","61802155","61802201","2018SJZDI142"]}],"id":[{"id":"10.13039\/501100002703","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,11,10]]},"abstract":"<jats:p>The functionalities, such as connectivity and communication capability of complex networks, are related to the number and length of paths between node pairs in the networks. In this paper, we propose a new path connectivity measure by considering the number and length of paths of the network (PCNL) to evaluate network path connectivity. By comparing the PCNL with the typical natural connectivity, we prove the effectiveness of the PCNL to measure the path connectivity of networks. Because of the importance of the shortest paths, we further propose the shortest paths connectivity measure (SPCNL) based on the number and length of the shortest paths. Then, we use edge-betweenness-based malicious attacks to study the relationship between the SPCNL and network topology in five types of networks. The results show that the SPCNLs of the networks have a significant corresponding relationship and similar changing trend with their network topology heterogeneities with the increase of the number of deleted edges. These findings mean that the SPCNL is positively correlated with the heterogeneity of the network topology, which provides a new perspective for designing complex networks with high path connectivity.<\/jats:p>","DOI":"10.1155\/2020\/8836590","type":"journal-article","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T19:35:18Z","timestamp":1605123318000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Methods to Measure the Network Path Connectivity"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1937-2333","authenticated-orcid":true,"given":"Yinwei","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo-Ping","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Automation, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"},{"name":"Jiangsu Engineering Lab for IOT Intelligent Robots (IOTRobot), Nanjing 210023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5827-4413","authenticated-orcid":true,"given":"Yurong","family":"Song","sequence":"additional","affiliation":[{"name":"School of Automation, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"},{"name":"Jiangsu Engineering Lab for IOT Intelligent Robots (IOTRobot), Nanjing 210023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3003004"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.07.052"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.69.025103"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/tits.2019.2909177"},{"key":"5","article-title":"Review of studies on the resilience of urban critical infrastructure networks","volume":"193","author":"W. Liu","year":"2020","journal-title":"Reliability Engineering & System Safety"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1061\/(asce)is.1943-555x.0000212"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-6108-z"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-07878-2"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1009440108"},{"author":"V. H. P. Louzada","key":"11","article-title":"Generating robust and efficient networks under targeted attacks"},{"issue":"6","key":"12","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.85.066130","article-title":"Enhancing network robustness against malicious attacks","volume":"85","author":"A. Zeng","year":"2012","journal-title":"Physical Review E"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-013-9818-7"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208679"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1866739.1866762"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/IMSAA.2010.5729417"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.96.108701"},{"issue":"3","key":"18","first-page":"705","article-title":"Dynamic metric OSPF-based routing protocol for software defined networks","volume":"22","author":"A. Rego","year":"2019","journal-title":"Cluster Computing-The Journal of Networks Software Tools and Applications"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/111\/26006"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8648093"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2004.00476.x"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2010.07.022"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2008.00688.x"},{"issue":"7","key":"25","article-title":"Natural connectivity of complex networks","volume":"27","author":"J. Wu","year":"2010","journal-title":"Chinese Physics Letters"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2010-00219-x"},{"issue":"6","key":"27","article-title":"Effect of eliminating edges on robustness of scale-free networks under intentional attack","volume":"27","author":"Y. Li","year":"2010","journal-title":"Chinese Physics Letters"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"29","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"P. Erd\u0151s","year":"1960","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2009.02.007"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.65.056109"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8836590.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8836590.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8836590.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T19:35:21Z","timestamp":1605123321000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8836590\/"}},"subtitle":[],"editor":[{"given":"Qingyi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,11,10]]},"references-count":31,"alternative-id":["8836590","8836590"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8836590","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2020,11,10]]}}}