{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:59:08Z","timestamp":1648850348613},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Cognitive radio and cooperative communication are two new network technologies. So, the combination of these two new technologies is a novel solution to solve the problem of spectrum scarcity. Two main challenges exist in the integration of cognitive radio and cooperative communication. First, there is a lack of incentives for the participating wireless devices to serve as relay nodes. Second, there is not an effective relay selection policy. In this paper, we propose an online auction-based relay selection scheme for cooperative communication in cognitive radio (CR) networks. Specifically, we design an auction scheme through adopting stopping theory. The proposed scheme ensures that the primary user (PU) can effectively select a CR relay to transmit its packets in a given time bound. In addition, we have analytically proven the truthfulness and the individual rationality of our online auction scheme. Extensive simulations demonstrate that the proposed relay selection scheme can always successfully and efficiently select a proper relay for a PU and can achieve a higher cooperative communication throughput compared with the conventional schemes.<\/jats:p>","DOI":"10.1186\/s13638-015-0258-9","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T13:01:57Z","timestamp":1422882117000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online auction-based relay selection for cooperative communication in CR networks"],"prefix":"10.1186","volume":"2015","author":[{"given":"Tao","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"issue":"13","key":"258_CR1","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1016\/j.comnet.2006.05.001","volume":"50","author":"IF Akyildiz","year":"2006","unstructured":"IF Akyildiz, WY Lee, MC Vuran, S Mohanty, NeXt generation\/dynamic spectrum access\/cognitive radio wireless networks: a survey. Comput. Networks. 50(13), 2127\u20132159 (2006).","journal-title":"Comput. Networks"},{"issue":"12","key":"258_CR2","doi-asserted-by":"publisher","first-page":"3062","DOI":"10.1109\/TIT.2004.838089","volume":"50","author":"JN Laneman","year":"2004","unstructured":"JN Laneman, DN Tse, GW Wornell, Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Trans. Inf. Theory. 50(12), 3062\u20133080 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"258_CR3","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/JSAC.2008.080919","volume":"26","author":"J Huang","year":"2008","unstructured":"J Huang, Z Han, M Chiang, Poor H, Auction-based resource allocation for cooperative communications. IEEE J. Sel. Areas Commun. 26(7), 1226\u20131237 (2008).","journal-title":"IEEE J. Sel. Areas Commun"},{"key":"258_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.4218\/etrij.09.0208.0330","volume":"31","author":"G Zhang","year":"2009","unstructured":"G Zhang, L Cong, L Zhao, K Yang, H Zhang, Competitive resource sharing based on game theory in cooperative relay networks. ETRI J. 31, 89\u201391 (2009).","journal-title":"ETRI J"},{"key":"258_CR5","doi-asserted-by":"crossref","unstructured":"B Wang, Z Han, KR Liu, in IEEE INFOCOM. Distributed relay selection and power control for multiuser cooperative communication networks using buyer\/seller game (Barcelona, 6\u201312 May 2007), pp. 544\u2013552.","DOI":"10.1109\/INFCOM.2007.70"},{"key":"258_CR6","doi-asserted-by":"crossref","unstructured":"B Caoy, JW Mark, Q Zhang, R Lu, X Lin, XS Shen, in IEEE INFOCOM. On optimal communication strategies for cooperative cognitive radio networking, (2013), pp. 1774\u20131782.","DOI":"10.1109\/INFCOM.2013.6566970"},{"key":"258_CR7","unstructured":"H Roh, C Jung, W Lee, DZ Du, in IEEE ICNC. A Stackelberg game for cooperative cognitive radio network with active SUs, (2013), pp. 911\u2013915."},{"key":"258_CR8","doi-asserted-by":"crossref","unstructured":"H Roh, C Shao, S Lee, W Lee, DZ Du, in IEEE INFOCOM DEMO. Secondary user games with spectrum leasing market in cooperative cognitive radio networks, (2013), pp. 2461\u20132462.","DOI":"10.1109\/INFCOMW.2013.6970752"},{"key":"258_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1257\/0895330027166","volume":"16","author":"P Klemperer","year":"2002","unstructured":"P Klemperer, What really matters in auction design. J. Econ. Perspect. 16, 169\u2013189 (2002).","journal-title":"J. Econ. Perspect"},{"key":"258_CR10","doi-asserted-by":"crossref","unstructured":"H Li, X Cheng, K Li, X Xing, T Jing, in IEEE INFOCOM. Utility-based cooperative spectrum sensing scheduling in cognitive radio networks, (2013), pp. 165\u2013169.","DOI":"10.1109\/INFCOM.2013.6566756"},{"issue":"2","key":"258_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/JSAC.2012.120202","volume":"30","author":"D Yang","year":"2012","unstructured":"D Yang, X Fang, G Xue, HERA: An optimal relay assignment scheme for cooperative networks. IEEE J. Sel. Areas Commun. 30(2), 245\u2013253 (2012).","journal-title":"IEEE J. Sel. Areas Commun"},{"key":"258_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1257\/0895330027166","volume":"16","author":"P Klemperer","year":"2002","unstructured":"P Klemperer, What really matters in auction design. J. Econ. Perspect. 16, 169\u2013189 (2002).","journal-title":"J. Econ. Perspect"},{"issue":"8","key":"258_CR13","first-page":"3114","volume":"6","author":"Y Zhao","year":"2007","unstructured":"Y Zhao, R Adve, TJ Lim, Improving amplify-and-forward relay networks: optimal power allocation versus selection. IEEE Trans. Wireless Commun. 6(8), 3114 (2007).","journal-title":"IEEE Trans. Wireless Commun"},{"key":"258_CR14","unstructured":"TS Ferguson, Optimal stopping and applications. http:\/\/www.math.ucla.edu\/~tom\/Stopping\/Contents.html."},{"key":"258_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"S Kern, SD M\u00fcller, N Hansen, D B\u00fcche, J Ocenasek, P Koumoutsakos, Learning probability distributions in continuous evolutionary algorithms\u2013a comparative review. Nat. Comput. 3, 77\u2013112 (2004).","journal-title":"Nat. Comput"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0258-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-015-0258-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0258-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0258-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T07:54:44Z","timestamp":1630569284000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-015-0258-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["258"],"URL":"https:\/\/doi.org\/10.1186\/s13638-015-0258-9","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]},"assertion":[{"value":"4 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"20"}}