延迟容忍网络中固定奖励激励机制的平均域极限

T. Nguyen, O. Brun, B. Prabhu
{"title":"延迟容忍网络中固定奖励激励机制的平均域极限","authors":"T. Nguyen, O. Brun, B. Prabhu","doi":"10.23919/WIOPT.2018.8362810","DOIUrl":null,"url":null,"abstract":"We investigate the asymptotic performance of a reward incentive Delay Tolerant Network based on mean field limit. We consider a two-hop network with one source and one destination and N relays. The source is backlogged and sends messages to the destination by forwarding to the relays it meets. For each message, there is a promised reward for the first one who successfully transmits it to the destination. It was shown in a previous work, the optimal policy for the relays is of thresholds type (a relay will accept a message until certain time and drop it after a second threshold). When the second threshold in infinite, we give the mean-field ODE and show that all the messages have the same probability of success. When the second threshold is finite we only give an ODE approximation since the dynamics are not Markovian.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Mean-field limit of the fixed-reward incentive mechanism in delay tolerant networks\",\"authors\":\"T. Nguyen, O. Brun, B. Prabhu\",\"doi\":\"10.23919/WIOPT.2018.8362810\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the asymptotic performance of a reward incentive Delay Tolerant Network based on mean field limit. We consider a two-hop network with one source and one destination and N relays. The source is backlogged and sends messages to the destination by forwarding to the relays it meets. For each message, there is a promised reward for the first one who successfully transmits it to the destination. It was shown in a previous work, the optimal policy for the relays is of thresholds type (a relay will accept a message until certain time and drop it after a second threshold). When the second threshold in infinite, we give the mean-field ODE and show that all the messages have the same probability of success. When the second threshold is finite we only give an ODE approximation since the dynamics are not Markovian.\",\"PeriodicalId\":231395,\"journal\":{\"name\":\"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":\"2013 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/WIOPT.2018.8362810\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2018.8362810","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

研究了基于平均域极限的奖励激励延迟容忍网络的渐近性能。我们考虑一个有一个源一个目的和N个中继的两跳网络。源被积压,通过转发到它遇到的中继将消息发送到目的。对于每条消息,第一个成功将其传输到目的地的人将获得承诺的奖励。如前所述,继电器的最佳策略是阈值类型(继电器将在一定时间内接受消息,并在第二个阈值后丢弃消息)。当第二个阈值为无穷大时,我们给出了平均域ODE,并证明了所有消息都具有相同的成功概率。当第二个阈值是有限时,我们只给出ODE近似,因为动力学不是马尔可夫的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mean-field limit of the fixed-reward incentive mechanism in delay tolerant networks
We investigate the asymptotic performance of a reward incentive Delay Tolerant Network based on mean field limit. We consider a two-hop network with one source and one destination and N relays. The source is backlogged and sends messages to the destination by forwarding to the relays it meets. For each message, there is a promised reward for the first one who successfully transmits it to the destination. It was shown in a previous work, the optimal policy for the relays is of thresholds type (a relay will accept a message until certain time and drop it after a second threshold). When the second threshold in infinite, we give the mean-field ODE and show that all the messages have the same probability of success. When the second threshold is finite we only give an ODE approximation since the dynamics are not Markovian.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic resource allocation in radio-over-fiber enabled dense cellular networks Energy efficient scheduling for IoT applications with offloading, user association and BS sleeping in ultra dense networks Asymmetric regenerating codes for heterogeneous distributed storage systems Trekking based distributed algorithm for opportunistic spectrum access in infrastructure-less network Speed scaling under QoS constraints with finite buffer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1