An epidemic game between contents in a wireless network

E. Altman
{"title":"An epidemic game between contents in a wireless network","authors":"E. Altman","doi":"10.1109/ISWCS.2012.6328536","DOIUrl":null,"url":null,"abstract":"Consider a town with N competing sources of content where each one wishes to disseminate its own content and thus to make its content available to as many destination users as possible. A content here may stand for information about some cultural event or the list of hotels in town or the weather report. The dissemination to the potential destination is done through a fleet of M mobile relays. The rate of dissemination of content of a given source to its potential destinations depends on how many relays have a copy of the content. We therefore focus on the problem of competition over the access to relays. Each source has to trade between the access costs and and the availability of his content in the relays. As access cost we consider here the transmission power used by the source. The power used determines the coverage of the transmission and thus the probability of reaching some relay. We model the competition using stochastic game approaches and then obtain the structure of the equilibrium strategies.","PeriodicalId":167119,"journal":{"name":"2012 International Symposium on Wireless Communication Systems (ISWCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2012.6328536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Consider a town with N competing sources of content where each one wishes to disseminate its own content and thus to make its content available to as many destination users as possible. A content here may stand for information about some cultural event or the list of hotels in town or the weather report. The dissemination to the potential destination is done through a fleet of M mobile relays. The rate of dissemination of content of a given source to its potential destinations depends on how many relays have a copy of the content. We therefore focus on the problem of competition over the access to relays. Each source has to trade between the access costs and and the availability of his content in the relays. As access cost we consider here the transmission power used by the source. The power used determines the coverage of the transmission and thus the probability of reaching some relay. We model the competition using stochastic game approaches and then obtain the structure of the equilibrium strategies.
无线网络中内容之间的流行游戏
假设一个城镇有N个相互竞争的内容来源,其中每个来源都希望传播自己的内容,从而使其内容能够提供给尽可能多的目标用户。这里的内容可以表示有关某些文化事件的信息或城镇酒店列表或天气报告。向潜在目的地的传播是通过一个由M个移动中继组成的车队完成的。给定来源的内容向其潜在目的地传播的速度取决于有多少转发者拥有该内容的副本。因此,我们把重点放在接力赛的竞争问题上。每个来源都必须在访问成本和中继中其内容的可用性之间进行交易。作为接入成本,我们考虑的是源所使用的传输功率。所使用的功率决定了传输的覆盖范围,从而决定了到达某个中继的概率。利用随机博弈方法对竞争进行建模,得到了均衡策略的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信