论认知无线电网络中自私与利他联盟的形成

Z. Khan, Janne J. Lehtomäki, M. Latva-aho, L. Dasilva
{"title":"论认知无线电网络中自私与利他联盟的形成","authors":"Z. Khan, Janne J. Lehtomäki, M. Latva-aho, L. Dasilva","doi":"10.4108/ICST.CROWNCOM2010.9208","DOIUrl":null,"url":null,"abstract":"We formulate the sensing-throughput tradeoff problem for distributed cognitive radio (CR) networks as a coalition formation game. Formation of coalitions enables the CRs to increase their achievable throughput, under the detection probability constraint, while also taking into account the overhead in sensing reports combining. In the proposed game, CRs form coalitions either to increase their individual gains (selfish coalition formation) or to maximize the overall gains of the group (altruistic coalition formation). We find that the altruistic coalition formation solution yields significant gains in terms of reduced average false alarm probability and increased average throughput per CR as compared to the selfish and non-cooperative solutions. Given a target detection probability for a coalition, we also propose an SNR dependent target detection probability for individual CRs in a coalition and analyze its impact on the average throughput per CR. Finally, we also analyze the impact of the cost of distributed cooperative sensing on the cooperative strategies of CRs.","PeriodicalId":193648,"journal":{"name":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"On selfish and altruistic coalition formation in cognitive radio networks\",\"authors\":\"Z. Khan, Janne J. Lehtomäki, M. Latva-aho, L. Dasilva\",\"doi\":\"10.4108/ICST.CROWNCOM2010.9208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We formulate the sensing-throughput tradeoff problem for distributed cognitive radio (CR) networks as a coalition formation game. Formation of coalitions enables the CRs to increase their achievable throughput, under the detection probability constraint, while also taking into account the overhead in sensing reports combining. In the proposed game, CRs form coalitions either to increase their individual gains (selfish coalition formation) or to maximize the overall gains of the group (altruistic coalition formation). We find that the altruistic coalition formation solution yields significant gains in terms of reduced average false alarm probability and increased average throughput per CR as compared to the selfish and non-cooperative solutions. Given a target detection probability for a coalition, we also propose an SNR dependent target detection probability for individual CRs in a coalition and analyze its impact on the average throughput per CR. Finally, we also analyze the impact of the cost of distributed cooperative sensing on the cooperative strategies of CRs.\",\"PeriodicalId\":193648,\"journal\":{\"name\":\"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/ICST.CROWNCOM2010.9208\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Proceedings of the Fifth International Conference on Cognitive Radio Oriented Wireless Networks and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/ICST.CROWNCOM2010.9208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

我们将分布式认知无线电(CR)网络的感知吞吐量权衡问题表述为一个联盟形成博弈。联盟的形成使CRs能够在检测概率约束下提高其可实现的吞吐量,同时也考虑到感知报告组合的开销。在本文提出的博弈中,CRs形成联盟,要么是为了增加个人收益(自私联盟形成),要么是为了最大化群体整体收益(利他联盟形成)。我们发现,与自私和非合作的解决方案相比,利他的联盟形成方案在降低平均虚警概率和增加每CR的平均吞吐量方面取得了显著的收益。在给定联盟目标检测概率的基础上,提出了联盟中单个CR的目标检测概率依赖于信噪比,并分析了其对每个CR平均吞吐量的影响,最后分析了分布式协同感知成本对CR合作策略的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On selfish and altruistic coalition formation in cognitive radio networks
We formulate the sensing-throughput tradeoff problem for distributed cognitive radio (CR) networks as a coalition formation game. Formation of coalitions enables the CRs to increase their achievable throughput, under the detection probability constraint, while also taking into account the overhead in sensing reports combining. In the proposed game, CRs form coalitions either to increase their individual gains (selfish coalition formation) or to maximize the overall gains of the group (altruistic coalition formation). We find that the altruistic coalition formation solution yields significant gains in terms of reduced average false alarm probability and increased average throughput per CR as compared to the selfish and non-cooperative solutions. Given a target detection probability for a coalition, we also propose an SNR dependent target detection probability for individual CRs in a coalition and analyze its impact on the average throughput per CR. Finally, we also analyze the impact of the cost of distributed cooperative sensing on the cooperative strategies of CRs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信