{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:39:59Z","timestamp":1760888399552,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T00:00:00Z","timestamp":1253836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2009,9,25]]},"abstract":"<jats:p>Dynamic spectrum access has been studied to exploit instantaneous spectrum availability by opening licensed spectrum to secondary users. To achieve high spectrum efficiency, secondary unlicensed users need to continuously sense spectrum to detect the presence of primary licensed users. Cooperative spectrum sensing has been recognized as a powerful solution to improve spectrum sensing performance, which requires nearby wireless nodes to share sensing results with each other. However, information sharing is achieved through broadcasting in wireless networks, which can provide free-riding opportunity for selfish nodes. Selfish nodes can benefit from receiving the sensing results from its neighbors by free without sharing. Therefore, appropriate strategies are essential to enforce and sustain the cooperation among neighboring nodes. In this paper we model cooperative spectrum sensing as an N-player horizontal infinite game, and study varies strategies for it. In wireless networks, the frequently occurred collisions make the cooperation enforcement problem quite challenging as it is hard to tell whether the information lost is due to nodes' selfishness or wireless collision. In this paper, we prove that Grim Trigger strategy, a classical strategy to stimulate cooperation in an infinite game, can result in poor performance due to random errors. We then propose a strategy basing on Carrot-and-Stick strategy, which can recover cooperation among multiple players from deviation. We prove that if nodes are sufficiently far-sight, or equivalently the entire system runs sufficiently long, the Nash Equilibrium of the proposed strategy for spectrum sensing game is still mutual cooperation, even under collision situation. We also prove that the proposed strategy is robust to collisions and colluding cheat.<\/jats:p>","DOI":"10.1145\/1621076.1621079","type":"journal-article","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T18:18:59Z","timestamp":1254853139000},"page":"14-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Achieving cooperative spectrum sensing in wireless cognitive radio networks"],"prefix":"10.1145","volume":"13","author":[{"given":"Chengqi","family":"Song","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,9,25]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"\"Spectrum Policy Task Force \" Nov. 2002.  \"Spectrum Policy Task Force \" Nov. 2002."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/98.788210"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.839380"},{"key":"e_1_2_1_4_1","first-page":"131","volume-title":"2005 First IEEE International Symposium on","author":"Ghasemi A.","year":"2005"},{"volume-title":"ICC '06. IEEE International Conference on","year":"2006","author":"Mishra S.M.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","first-page":"137","volume-title":"2005 First IEEE International Symposium on","author":"Ganesan G.","year":"2005"},{"key":"e_1_2_1_7_1","unstructured":"S.J. Brams \"Negotiation Games: Applying Game Theory to Bargaining and Arbitration \" Routledge 2003.  S.J. Brams \"Negotiation Games: Applying Game Theory to Bargaining and Arbitration \" Routledge 2003."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2006.1648988"},{"key":"e_1_2_1_9_1","unstructured":"K. Letaief and W. Zhang \"Cooperative spectrum sensing \" Cognitive Wireless Communication Networks 2007.  K. Letaief and W. Zhang \"Cooperative spectrum sensing \" Cognitive Wireless Communication Networks 2007."},{"key":"e_1_2_1_10_1","first-page":"110","volume-title":"SDR '06.1st IEEE Workshop on","author":"Chen Ruiliang","year":"2006"},{"key":"e_1_2_1_11_1","first-page":"3432","volume-title":"ICC '08. IEEE International Conference on","author":"Song Chengqi","year":"2008"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190195.1190197"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Chengqi Song and Qian Zhang \"Omh - suppressing selfish behavior in ad hoc networks with one more hop \" In ICST QShine 2008.   Chengqi Song and Qian Zhang \"Omh - suppressing selfish behavior in ad hoc networks with one more hop \" In ICST QShine 2008.","DOI":"10.4108\/ICST.QSHINE2008.4256"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322157142"},{"key":"e_1_2_1_15_1","unstructured":"A. Leon-Garcia and I. Widjaja \"Communication networks: fundamental concepts and key architectures \" McGraw-Hill School Education Group 1999.   A. Leon-Garcia and I. Widjaja \"Communication networks: fundamental concepts and key architectures \" McGraw-Hill School Education Group 1999."},{"key":"e_1_2_1_16_1","unstructured":"D. Fudenberg and J. Tirole \"Game Theory \" Mit Press 1991.  D. Fudenberg and J. Tirole \"Game Theory \" Mit Press 1991."},{"volume-title":"Australian National University - Department of Economics","year":"1998","author":"Kline J.J.","key":"e_1_2_1_17_1"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1621076.1621079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1621076.1621079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:45Z","timestamp":1750249065000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1621076.1621079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,25]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,9,25]]}},"alternative-id":["10.1145\/1621076.1621079"],"URL":"https:\/\/doi.org\/10.1145\/1621076.1621079","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2009,9,25]]},"assertion":[{"value":"2009-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}