{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:13:09Z","timestamp":1750824789236,"version":"3.41.0"},"reference-count":26,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T00:00:00Z","timestamp":1736035200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Outstanding Doctoral Dissertation Support Fund of Air Force Engineering University","award":["081021011"],"award-info":[{"award-number":["081021011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Airborne tactical networks are complex networks that connect various aircraft platforms via datalink systems. In the fierce battlefield, airborne tactical networks are under the risk of hostile node attack, causing route failures and packet losses. Reliable communication in airborne tactical networks is thus calling for an efficient node protection scheme design for routing strategies. Due to the inherent uncertainty of war, the enemy\u2019s node attack is unpredictable, making it intractable to select the optimal node set to deploy defense countermeasures under limited resource. To hedge against such uncertainty, we propose an Attack-Oblivious Node Protection Strategy (AONPS) for survivable routing in airborne tactical networks. Through a crafty-designed randomized algorithm, AONPS can select an appropriate node set to protect. Both theoretical derivation and simulation experiments demonstrate that the proposed AONPS can significantly enhance routing survival rate without accurate knowledge of the targeted attack nodes of the enemy, and achieve performance comparable to that of the ideal node protection strategy.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae140","type":"journal-article","created":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T07:16:48Z","timestamp":1736147808000},"page":"675-683","source":"Crossref","is-referenced-by-count":0,"title":["Attack-Oblivious Node Protection Strategy for survivable routing in airborne tactical networks under uncertainty"],"prefix":"10.1093","volume":"68","author":[{"given":"Ying","family":"Pan","sequence":"first","affiliation":[{"name":"Academy of Military Science , Xianghongqi No.1, Haidian Distinct, Beijing 100091 ,","place":["China"]}]},{"given":"Na","family":"Lyu","sequence":"additional","affiliation":[{"name":"Information and Navigation School, Air Force Engineering University , Fenghao Road East No.1, Xi\u2019an 710077, Shaanxi Province ,","place":["China"]}]}],"member":"286","published-online":{"date-parts":[[2025,1,5]]},"reference":[{"key":"2025062421182448700_ref1","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/MCOM.2014.6815904","article-title":"Design considerations for next-generation airborne tactical networks","volume":"52","author":"Cheng","year":"2014","journal-title":"IEEE Commun Mag"},{"key":"2025062421182448700_ref2","doi-asserted-by":"publisher","first-page":"103074","DOI":"10.1016\/j.adhoc.2022.103074","article-title":"Oblivious neighbor discovery algorithms in airborne networks with directional multi-antenna","volume":"141","author":"Xinyu","year":"2023","journal-title":"Ad Hoc Netw"},{"key":"2025062421182448700_ref3","doi-asserted-by":"publisher","first-page":"103509","DOI":"10.1016\/j.jnca.2022.103509","article-title":"GOR: group-oblivious multicast routing in airborne tactical networks under uncertainty","volume":"207","author":"Pan","year":"2022","journal-title":"J Netw Comput Appl"},{"key":"2025062421182448700_ref4","doi-asserted-by":"publisher","first-page":"19662","DOI":"10.1109\/ACCESS.2017.2736598","article-title":"A novel statistical multi-channel busy recognition mechanism in the MAC layer for airborne tactical networks","volume":"5","author":"Fang","year":"2017","journal-title":"IEEE Access"},{"key":"2025062421182448700_ref5","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.23919\/JSEE.2021.000116","article-title":"A highly reliable embedding algorithm for airborne tactical network virtualization","volume":"32","author":"Jingcheng","year":"2021","journal-title":"J Syst Eng Electron"},{"key":"2025062421182448700_ref6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.3390\/fi15060204","article-title":"Avoiding detection by hostile nodes in airborne tactical networks","volume":"15","author":"Ilie","year":"2023","journal-title":"Future Internet"},{"key":"2025062421182448700_ref7","doi-asserted-by":"publisher","first-page":"056109","DOI":"10.1103\/PhysRevE.65.056109","article-title":"Attack vulnerability of complex networks","volume":"65","author":"Holme","year":"2002","journal-title":"Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics"},{"key":"2025062421182448700_ref8","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"key":"2025062421182448700_ref9","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/S0378-4371(02)01545-5","article-title":"Efficiency of scale-free networks: error and attack tolerance","volume":"320","author":"Crucitti","year":"2002","journal-title":"Phys A - Stat Mech Appl"},{"key":"2025062421182448700_ref10","doi-asserted-by":"publisher","first-page":"022805","DOI":"10.1103\/PhysRevE.91.022805","article-title":"Sequential defense against random and intentional attacks in complex networks","volume":"91","author":"Chen","year":"2015","journal-title":"Phys Rev E Stat Nonlinear Soft Matter Phys"},{"key":"2025062421182448700_ref11","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","article-title":"Mitigation of malicious attacks on networks","volume":"108","author":"Schneider","year":"2011","journal-title":"Proc Natl Acad Sci U S A"},{"key":"2025062421182448700_ref12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MCAS.2023.3236659","article-title":"Structural robustness of complex networks: a survey of a posteriori measures","volume":"23","author":"Lou","year":"2023","journal-title":"IEEE Circuits Syst Mag"},{"volume-title":"On War","year":"2008","author":"Clausewitz","key":"2025062421182448700_ref13"},{"key":"2025062421182448700_ref14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev"},{"key":"2025062421182448700_ref15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev Mod Phys"},{"key":"2025062421182448700_ref16","doi-asserted-by":"publisher","first-page":"14812","DOI":"10.1073\/pnas.1918901117","article-title":"Power-law distribution of degree\u2013degree distance: a better representation of the scale-free property of complex networks","volume":"117","author":"Zhou","year":"2020","journal-title":"Proc Natl Acad Sci"},{"key":"2025062421182448700_ref17","doi-asserted-by":"publisher","first-page":"027105","DOI":"10.1103\/PhysRevE.75.027105","article-title":"Generalizations of the clustering coefficient to weighted complex networks","volume":"75","author":"Saram\u00e4ki","year":"2007","journal-title":"Phys Rev E"},{"key":"2025062421182448700_ref18","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1049\/iet-com.2008.0503","article-title":"Application of complex-network theories to the design of short-length low-density-parity-check codes","volume":"3","author":"Zheng","year":"2009","journal-title":"IET Commun"},{"key":"2025062421182448700_ref19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MCAS.2003.1228503","article-title":"Complex networks: small-world, scale-free and beyond","volume":"3","author":"Wang","year":"2003","journal-title":"IEEE Circuits Syst Mag"},{"key":"2025062421182448700_ref20","doi-asserted-by":"publisher","first-page":"2769","DOI":"10.3390\/math9212769","article-title":"Quantifying the robustness of complex networks with heterogeneous nodes","volume":"9","author":"Ratnayake","year":"2021","journal-title":"Mathematics"},{"key":"2025062421182448700_ref21","doi-asserted-by":"publisher","first-page":"088903","DOI":"10.1088\/1674-1056\/ab969f","article-title":"Influential nodes identification in complex networks based on global and local information","volume":"29","author":"Yang","year":"2020","journal-title":"Chin Phys B"},{"key":"2025062421182448700_ref22","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.physa.2018.02.016","article-title":"Identifying influential spreaders in complex networks based on K\u2013shell hybrid method","volume":"499","author":"Namtirtha","year":"2018","journal-title":"Phys A: Stat Mech Appl"},{"key":"2025062421182448700_ref23","doi-asserted-by":"publisher","first-page":"16124","DOI":"10.1038\/s41598-020-72771-4","article-title":"Mitigation of cascading failures in complex networks","volume":"10","author":"Smolyak","year":"2020","journal-title":"Sci Rep"},{"key":"2025062421182448700_ref24","first-page":"7","article-title":"Finding vital node by node importance evaluation matrix in complex networks","volume":"61","author":"Zhou","year":"2012","journal-title":"Acta Phys Sin"},{"key":"2025062421182448700_ref25","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1038\/s42256-020-0177-2","article-title":"Finding key players in complex networks through deep reinforcement learning","volume":"2","author":"Fan","year":"2020","journal-title":"Nat Mach Intell"},{"key":"2025062421182448700_ref26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1093\/nsr\/nwaa229","article-title":"Efficient network immunization under limited knowledge","volume":"8","author":"Liu","year":"2020","journal-title":"Natl Sci Rev"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/6\/675\/61330929\/bxae140.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/6\/675\/61330929\/bxae140.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T01:18:29Z","timestamp":1750814309000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/6\/675\/7942796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,5]]},"references-count":26,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,1,5]]},"published-print":{"date-parts":[[2025,6,12]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae140","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2025,6]]},"published":{"date-parts":[[2025,1,5]]}}}