海市蜃楼:传感器试验台的微观经济资源分配系统

Brent N. Chun, P. Buonadonna, Alvin AuYoung, Chaki Ng, D. Parkes, Jeffrey Shneidman, A. Snoeren, Amin Vahdat
{"title":"海市蜃楼:传感器试验台的微观经济资源分配系统","authors":"Brent N. Chun, P. Buonadonna, Alvin AuYoung, Chaki Ng, D. Parkes, Jeffrey Shneidman, A. Snoeren, Amin Vahdat","doi":"10.1109/EMNETS.2005.1469095","DOIUrl":null,"url":null,"abstract":"In this paper, we argue that a microeconomic resource allocation scheme, specifically the combinatorial auction, is well suited to testbed resource management. To demonstrate this, we present the Mirage resource allocation system. In Mirage, testbed resources are allocated using a repeated combinatorial auction within a closed virtual currency environment. Users compete for testbed resources by submitting bids which specify resource combinations of interest in space/time (e.g., \"any 32 MICA2 motes for 8 hours anytime in the next three days\") along with a maximum value amount the user is willing to pay. A combinatorial auction is then periodically run to determine the winning bids based on supply and demand while maximizing aggregate utility delivered to users. We have implemented a fully functional and secure prototype of Mirage and have been operating it in daily use for approximately four months on Intel Research Berkeley's 148-mote sensornet testbed.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"167 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"202","resultStr":"{\"title\":\"Mirage: a microeconomic resource allocation system for sensornet testbeds\",\"authors\":\"Brent N. Chun, P. Buonadonna, Alvin AuYoung, Chaki Ng, D. Parkes, Jeffrey Shneidman, A. Snoeren, Amin Vahdat\",\"doi\":\"10.1109/EMNETS.2005.1469095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we argue that a microeconomic resource allocation scheme, specifically the combinatorial auction, is well suited to testbed resource management. To demonstrate this, we present the Mirage resource allocation system. In Mirage, testbed resources are allocated using a repeated combinatorial auction within a closed virtual currency environment. Users compete for testbed resources by submitting bids which specify resource combinations of interest in space/time (e.g., \\\"any 32 MICA2 motes for 8 hours anytime in the next three days\\\") along with a maximum value amount the user is willing to pay. A combinatorial auction is then periodically run to determine the winning bids based on supply and demand while maximizing aggregate utility delivered to users. We have implemented a fully functional and secure prototype of Mirage and have been operating it in daily use for approximately four months on Intel Research Berkeley's 148-mote sensornet testbed.\",\"PeriodicalId\":371563,\"journal\":{\"name\":\"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.\",\"volume\":\"167 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"202\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMNETS.2005.1469095\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMNETS.2005.1469095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 202

摘要

本文提出了一种微观资源分配方案,特别是组合拍卖方案,非常适合于试验台资源管理。为了证明这一点,我们提出了Mirage资源分配系统。在Mirage中,测试平台的资源是在封闭的虚拟货币环境中使用重复的组合拍卖来分配的。用户通过提交标书来争夺试验台资源,标书指定了在空间/时间上感兴趣的资源组合(例如,“在未来三天的任何时候,8小时内任何32个MICA2笔记”)以及用户愿意支付的最大值。然后定期进行组合拍卖,以根据供需情况确定中标,同时最大限度地提高交付给用户的总效用。我们已经实现了一个功能齐全、安全的Mirage原型机,并在英特尔伯克利研究中心的148个远程传感器测试台上进行了大约四个月的日常使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mirage: a microeconomic resource allocation system for sensornet testbeds
In this paper, we argue that a microeconomic resource allocation scheme, specifically the combinatorial auction, is well suited to testbed resource management. To demonstrate this, we present the Mirage resource allocation system. In Mirage, testbed resources are allocated using a repeated combinatorial auction within a closed virtual currency environment. Users compete for testbed resources by submitting bids which specify resource combinations of interest in space/time (e.g., "any 32 MICA2 motes for 8 hours anytime in the next three days") along with a maximum value amount the user is willing to pay. A combinatorial auction is then periodically run to determine the winning bids based on supply and demand while maximizing aggregate utility delivered to users. We have implemented a fully functional and secure prototype of Mirage and have been operating it in daily use for approximately four months on Intel Research Berkeley's 148-mote sensornet testbed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信