车路通信中信道接入的拍卖机制

K. Akkarajitsakul, E. Hossain
{"title":"车路通信中信道接入的拍卖机制","authors":"K. Akkarajitsakul, E. Hossain","doi":"10.1109/ICCW.2009.5208115","DOIUrl":null,"url":null,"abstract":"This paper considers a public transportation system, which offers Internet access services to the commuting passen- gers. Suppose the Internet connection is available at few road- side base stations (RSBs) in a city. Our objective is to solve the bandwidth allocation problem when there are several vehicles connected to an RSB at the same time and the bandwidth of the link to the RSB has to be shared among these vehicles. To solve this bandwidth allocation problem, we propose a game-theoretic model. The main concept of the model is to let each vehicle compete with others in order to obtain the required amount of bandwidth. We formulate this game as an auction game where the vehicles are the bidders and the RSB is the auctioneer. From the performance study, we observe that there is an equilibrium which is a solution in this game. To obtain the solution in a distributed manner, an iterative algorithm is presented.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An Auction Mechanism for Channel Access in Vehicle-to-Roadside Communications\",\"authors\":\"K. Akkarajitsakul, E. Hossain\",\"doi\":\"10.1109/ICCW.2009.5208115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers a public transportation system, which offers Internet access services to the commuting passen- gers. Suppose the Internet connection is available at few road- side base stations (RSBs) in a city. Our objective is to solve the bandwidth allocation problem when there are several vehicles connected to an RSB at the same time and the bandwidth of the link to the RSB has to be shared among these vehicles. To solve this bandwidth allocation problem, we propose a game-theoretic model. The main concept of the model is to let each vehicle compete with others in order to obtain the required amount of bandwidth. We formulate this game as an auction game where the vehicles are the bidders and the RSB is the auctioneer. From the performance study, we observe that there is an equilibrium which is a solution in this game. To obtain the solution in a distributed manner, an iterative algorithm is presented.\",\"PeriodicalId\":271067,\"journal\":{\"name\":\"2009 IEEE International Conference on Communications Workshops\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Communications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2009.5208115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Communications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2009.5208115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文研究了一种为通勤乘客提供互联网接入服务的公共交通系统。假设在一个城市的几个路边基站(rsb)上有互联网连接。我们的目标是解决当多个车辆同时连接到RSB并且这些车辆必须共享到RSB的链路带宽时的带宽分配问题。为了解决这个带宽分配问题,我们提出了一个博弈论模型。该模型的主要概念是让每辆车相互竞争,以获得所需的带宽。我们将这个游戏设计成一个拍卖游戏,其中车辆是竞标者,RSB是拍卖师。从绩效研究中,我们观察到在这个博弈中存在一个均衡,即一个解。为了得到分布式解,提出了一种迭代算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Auction Mechanism for Channel Access in Vehicle-to-Roadside Communications
This paper considers a public transportation system, which offers Internet access services to the commuting passen- gers. Suppose the Internet connection is available at few road- side base stations (RSBs) in a city. Our objective is to solve the bandwidth allocation problem when there are several vehicles connected to an RSB at the same time and the bandwidth of the link to the RSB has to be shared among these vehicles. To solve this bandwidth allocation problem, we propose a game-theoretic model. The main concept of the model is to let each vehicle compete with others in order to obtain the required amount of bandwidth. We formulate this game as an auction game where the vehicles are the bidders and the RSB is the auctioneer. From the performance study, we observe that there is an equilibrium which is a solution in this game. To obtain the solution in a distributed manner, an iterative algorithm is presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信