{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:39:55Z","timestamp":1754599195669,"version":"3.41.2"},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"content-version":"vor","delay-in-days":200,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671471"],"award-info":[{"award-number":["61671471"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>This paper focuses on the joint optimization of the Age of Information (AoI) and Signal to Interference plus Noise Ratio\u2010 (SINR\u2010) oriented channel access problem under attack in the Wireless Sensor Networks (WSNs). Firstly, to overcome the uncertain, dynamic, and incomplete information constrains, an active probability model and a controlling channel model are proposed for the sensors and the receiving end, respectively. Secondly, to ensure the AoI and SINR of the data generated by the sensors when transmitted under attack, one utility function based on average AoI and SINR is defined. Then, considering the distributed feature of the channel access process, the joint optimization problem is formulated under the game theory structure. Then, a distributed learning algorithm is proposed to reach the Nash Equilibrium (NE) of the game. Finally, simulation results have verified the correctness and effectiveness of the proposed method.<\/jats:p>","DOI":"10.1155\/2021\/2803335","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T21:05:08Z","timestamp":1626815108000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Channel Access\u2010Based Joint Optimization of AoI and SINR under Attack: Game Theory and Distributed Approach"],"prefix":"10.1155","volume":"2021","author":[{"given":"Yaoqi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6181-4441","authenticated-orcid":false,"given":"Xianglin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6580-1349","authenticated-orcid":false,"given":"Laixian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"crossref","unstructured":"BeyturH. B. BaghaeeS. andUysalE. Towards AoI-aware Smart IoT Systems 2020 International Conference on Computing Networking and Communications (ICNC) 2020 Big Island HI USA 353\u2013357.","DOI":"10.1109\/ICNC47757.2020.9049792"},{"key":"e_1_2_9_2_2","doi-asserted-by":"crossref","unstructured":"BedewyA. M. SunY. andShroffN. B. Age-optimal information updates in multihop networks 2017 IEEE International Symposium on Information Theory (ISIT) jan 2017 Aachen Germany 576\u2013580 https:\/\/doi.org\/10.1109\/ISIT.2017.8006593 2-s2.0-85034076231.","DOI":"10.1109\/ISIT.2017.8006593"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511791"},{"key":"e_1_2_9_4_2","doi-asserted-by":"crossref","unstructured":"TalakR. KaramanS. andModianoE. Minimizing age-of-information in multi-hop wireless networks 2017 55th Annual Allerton Conference on Communication Control and Computing (Allerton) oct 2017 Monticello IL 486\u2013493 https:\/\/doi.org\/10.1109\/ALLERTON.2017.8262777 2-s2.0-85047948358.","DOI":"10.1109\/ALLERTON.2017.8262777"},{"key":"e_1_2_9_5_2","doi-asserted-by":"crossref","unstructured":"KamC. KompellaS. NguyenG. D. WieselthierJ. E. andEphremidesA. Age of information with a packet deadline 2016 2016 IEEE International Symposium on Information Theory (ISIT) jul 2016 Barcelona Spain 2564\u20132568 https:\/\/doi.org\/10.1109\/ISIT.2016.7541762 2-s2.0-84985906482.","DOI":"10.1109\/ISIT.2016.7541762"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2021.102000"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2453266"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3084753"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2020.3017695"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2021.102249"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-020-01020-2"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2020.011554"},{"key":"e_1_2_9_13_2","doi-asserted-by":"crossref","unstructured":"WangW.andSuC. Ccbrsn: a system with high embedding capacity for covert communication in bitcoin IFIP International Conference on ICT Systems Security and Privacy Protection 2020 September Maribor Slovenia 324\u2013337 https:\/\/doi.org\/10.1007\/978-3-030-58201-2_22.","DOI":"10.1007\/978-3-030-58201-2_22"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4315"},{"volume-title":"Game Theory: Analysis of Confict","year":"1991","author":"Myerson R. B.","key":"e_1_2_9_15_2"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2366559"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2736520"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3018645"},{"key":"e_1_2_9_19_2","doi-asserted-by":"crossref","unstructured":"GopalS. KaulS. K. ChaturvediR. andRoyS. A non-cooperative multiple access game for timely updates IEEE INFOCOM 2020 - IEEE conference on computer communications workshops (INFOCOM WKSHPS) 2020 Toronto ON Canada 924\u2013929 https:\/\/doi.org\/10.1109\/INFOCOMWKSHPS50562.2020.9162886.","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9162886"},{"key":"e_1_2_9_20_2","doi-asserted-by":"crossref","unstructured":"JellaA.andSabatS. L. Dynamic channel access of secondary users in a heterogeneous network using game theory 2018 10th International Conference on Communication Systems & Networks (COMSNETS) 2018 Bengaluru 425\u2013428 https:\/\/doi.org\/10.1109\/COMSNETS.2018.8328234 2-s2.0-85050909624.","DOI":"10.1109\/COMSNETS.2018.8328234"},{"key":"e_1_2_9_21_2","doi-asserted-by":"crossref","unstructured":"TokaL. SzalayM. HajaD. SzabG. RczS. andTelekM. To boost or not to boost: a stochastic game in wireless access networks ICC 2020 - 2020 IEEE International Conference on Communications (ICC) 2020 Dublin Ireland 1\u20136 https:\/\/doi.org\/10.1109\/ICC40277.2020.9148970.","DOI":"10.1109\/ICC40277.2020.9148970"},{"key":"e_1_2_9_22_2","doi-asserted-by":"crossref","unstructured":"KhodmiA. RejebS. B. AgoulmineN. andChoukairZ. Joint user-channel assignment and power allocation for non-orthogonal multiple access in a 5G heterogeneous ultra-dense networks 2020 International Wireless Communications and Mobile Computing (IWCMC) 2020 Limassol Cyprus 1879\u20131884 https:\/\/doi.org\/10.1109\/IWCMC48107.2020.9148116.","DOI":"10.1109\/IWCMC48107.2020.9148116"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.109"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2019.11.001"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110418"},{"key":"e_1_2_9_26_2","doi-asserted-by":"crossref","unstructured":"KaulS. YatesR. andGruteserM. Real-time status: how often should one update? 2012 Proceedings IEEE INFOCOM mar 2012 Orlando FL USA 2731\u20132735 https:\/\/doi.org\/10.1109\/INFCOM.2012.6195689 2-s2.0-84861617072.","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.1049611"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/21.293490"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/2803335.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/2803335.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/2803335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:39:27Z","timestamp":1723034367000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/2803335"}},"subtitle":[],"editor":[{"given":"Muhammad","family":"Shafiq","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/2803335"],"URL":"https:\/\/doi.org\/10.1155\/2021\/2803335","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-05-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"2803335"}}