GTR:一种基于博弈论的机会网络路由方案

Yang Qin, Li Li, Hu Liu
{"title":"GTR:一种基于博弈论的机会网络路由方案","authors":"Yang Qin, Li Li, Hu Liu","doi":"10.1109/ICCCHINA.2014.7008381","DOIUrl":null,"url":null,"abstract":"Existing routing schemes in opportunistic networks can be classified two categories: multi-copy based schemes and single-copy based schemes. Multi-copy based schemes can increase the robustness of networks and reduce average delay. However, they consume a large amount of network resources and induce large overhead. Single-copy based schemes can save network resources, but it is difficult to guarantee the transmission delay and packet delivery ratio for these schemes. Hence, how to design an efficient routing scheme which can make a tradeoff between multi-copy schemes and single-copy schemes in opportunistic networks with limited resources is a challenging issue. Inspired by this issue, in this paper, we propose a novel routing scheme based on game theory in opportunistic networks under limited resources, named GTR. In GTR, we map the message transmission to a multi-player bargaining model. By constructing proper utility function, GTR can save the network resources, and achieve better performance in dense opportunistic networks. Our extensive simulation results also demonstrate this point, and GTR performs better compared to some classical routing schemes in terms of packet delivery ratio, average delay, overhead ratio and average hops.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"GTR: A novel routing scheme based on game theory in opportunistic networks\",\"authors\":\"Yang Qin, Li Li, Hu Liu\",\"doi\":\"10.1109/ICCCHINA.2014.7008381\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Existing routing schemes in opportunistic networks can be classified two categories: multi-copy based schemes and single-copy based schemes. Multi-copy based schemes can increase the robustness of networks and reduce average delay. However, they consume a large amount of network resources and induce large overhead. Single-copy based schemes can save network resources, but it is difficult to guarantee the transmission delay and packet delivery ratio for these schemes. Hence, how to design an efficient routing scheme which can make a tradeoff between multi-copy schemes and single-copy schemes in opportunistic networks with limited resources is a challenging issue. Inspired by this issue, in this paper, we propose a novel routing scheme based on game theory in opportunistic networks under limited resources, named GTR. In GTR, we map the message transmission to a multi-player bargaining model. By constructing proper utility function, GTR can save the network resources, and achieve better performance in dense opportunistic networks. Our extensive simulation results also demonstrate this point, and GTR performs better compared to some classical routing schemes in terms of packet delivery ratio, average delay, overhead ratio and average hops.\",\"PeriodicalId\":353402,\"journal\":{\"name\":\"2014 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCHINA.2014.7008381\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2014.7008381","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

机会网络中现有的路由机制可分为两类:基于多副本的路由机制和基于单副本的路由机制。基于多副本的方案可以提高网络的鲁棒性,降低平均时延。但是,它们消耗了大量的网络资源,并且产生了很大的开销。基于单副本的方案可以节省网络资源,但难以保证传输时延和分组分发率。因此,在资源有限的机会网络中,如何设计一种有效的路由方案,在多拷贝和单拷贝方案之间进行权衡是一个具有挑战性的问题。受此问题的启发,本文提出了一种基于博弈论的有限资源条件下机会网络路由方案GTR。在GTR中,我们将消息传输映射到一个多人议价模型。通过构造合适的效用函数,GTR可以节省网络资源,并在密集机会网络中获得更好的性能。我们的大量仿真结果也证明了这一点,GTR在包投递率、平均延迟、开销比和平均跳数方面都优于一些经典路由方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GTR: A novel routing scheme based on game theory in opportunistic networks
Existing routing schemes in opportunistic networks can be classified two categories: multi-copy based schemes and single-copy based schemes. Multi-copy based schemes can increase the robustness of networks and reduce average delay. However, they consume a large amount of network resources and induce large overhead. Single-copy based schemes can save network resources, but it is difficult to guarantee the transmission delay and packet delivery ratio for these schemes. Hence, how to design an efficient routing scheme which can make a tradeoff between multi-copy schemes and single-copy schemes in opportunistic networks with limited resources is a challenging issue. Inspired by this issue, in this paper, we propose a novel routing scheme based on game theory in opportunistic networks under limited resources, named GTR. In GTR, we map the message transmission to a multi-player bargaining model. By constructing proper utility function, GTR can save the network resources, and achieve better performance in dense opportunistic networks. Our extensive simulation results also demonstrate this point, and GTR performs better compared to some classical routing schemes in terms of packet delivery ratio, average delay, overhead ratio and average hops.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信