A Sequential Posted Price Mechanism for D2D Content Sharing Communications

Shiwei Huang, Changyan Yi, Jun Cai
{"title":"A Sequential Posted Price Mechanism for D2D Content Sharing Communications","authors":"Shiwei Huang, Changyan Yi, Jun Cai","doi":"10.1109/GLOCOM.2016.7841547","DOIUrl":null,"url":null,"abstract":"In this paper, the incentive mechanism design issue for device-to-device (D2D) content-sharing communications is discussed. In literature, most of works are based on auction/game theory, where all content owners first report their ask prices/costs towards the base station (BS) which finally decides only one winner from them to transmit data towards the content requester. One disadvantage of these works is that content owners may be frequently activated to provide auction/game information (such as prices/costs), leading to high energy consumption, but finally may not win to gain benefit. To address this, we propose a sequential posted price mechanism where the BS sends offers with posted prices to content owners in sequence and activates only one owner each time. The BS stops sending new offers as long as there is already an owner accepting an offer or when the BS finds the expected cost of sending a new offer is larger than the cost of direct transmission. The optimal posted prices and offer- stopping rule of the BS are derived by the backward principle of dynamic programming. Simulation results show that the proposed mechanism can effectively limit the proportion of content owners being activated while the BS maintains an acceptable expected cost.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2016.7841547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

In this paper, the incentive mechanism design issue for device-to-device (D2D) content-sharing communications is discussed. In literature, most of works are based on auction/game theory, where all content owners first report their ask prices/costs towards the base station (BS) which finally decides only one winner from them to transmit data towards the content requester. One disadvantage of these works is that content owners may be frequently activated to provide auction/game information (such as prices/costs), leading to high energy consumption, but finally may not win to gain benefit. To address this, we propose a sequential posted price mechanism where the BS sends offers with posted prices to content owners in sequence and activates only one owner each time. The BS stops sending new offers as long as there is already an owner accepting an offer or when the BS finds the expected cost of sending a new offer is larger than the cost of direct transmission. The optimal posted prices and offer- stopping rule of the BS are derived by the backward principle of dynamic programming. Simulation results show that the proposed mechanism can effectively limit the proportion of content owners being activated while the BS maintains an acceptable expected cost.
D2D内容共享通信的顺序发布价格机制
本文讨论了设备对设备(D2D)内容共享通信的激励机制设计问题。在文献中,大多数作品都是基于拍卖/博弈论,所有的内容所有者首先向基站(BS)报告他们的要价/成本,基站最终决定他们中只有一个赢家将数据传输给内容请求者。这些作品的一个缺点是,内容所有者可能会频繁被激活,提供拍卖/游戏信息(如价格/成本),导致高能耗,但最终可能无法赢得利益。为了解决这个问题,我们提出了一个顺序发布价格机制,其中BS按顺序向内容所有者发送带有发布价格的报价,并且每次只激活一个所有者。只要已经有所有者接受报价,或者当BS发现发送新报价的预期成本大于直接传输的成本时,BS就会停止发送新的报价。利用逆向动态规划原理,导出了BS的最优发布价格和止损规则。仿真结果表明,所提出的机制可以有效地限制内容所有者被激活的比例,同时使BS保持可接受的预期成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信