构建面向激励的移动点对点网络覆盖

Feng Hong, Yuan Feng, Minglu Li, Zhongwen Guo
{"title":"构建面向激励的移动点对点网络覆盖","authors":"Feng Hong, Yuan Feng, Minglu Li, Zhongwen Guo","doi":"10.1109/ICPPW.2007.29","DOIUrl":null,"url":null,"abstract":"In mobile peer-to-peer networks, the incentive mechanism has to be provided for peers' participation as both resource suppliers and intermediaries (routers). In this paper we propose our solution to the incentive problem for intermediaries of message routing. We provide the domination- set-based peer-to-peer searching algorithm with economic models, which achieves motivating peers' corporation in the whole overlay. Simulation results prove the functionality of our solution.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Constructing Incentive Oriented Overlay on Mobile Peer-to-Peer Networks\",\"authors\":\"Feng Hong, Yuan Feng, Minglu Li, Zhongwen Guo\",\"doi\":\"10.1109/ICPPW.2007.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In mobile peer-to-peer networks, the incentive mechanism has to be provided for peers' participation as both resource suppliers and intermediaries (routers). In this paper we propose our solution to the incentive problem for intermediaries of message routing. We provide the domination- set-based peer-to-peer searching algorithm with economic models, which achieves motivating peers' corporation in the whole overlay. Simulation results prove the functionality of our solution.\",\"PeriodicalId\":367703,\"journal\":{\"name\":\"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2007.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2007.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在移动对等网络中,必须为作为资源提供者和中介(路由器)的对等体的参与提供激励机制。本文提出了一种解决消息路由中介体激励问题的方法。提出了一种基于控制集的点对点搜索算法,并建立了经济模型,实现了激励节点在整个覆盖层上的合作。仿真结果证明了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Constructing Incentive Oriented Overlay on Mobile Peer-to-Peer Networks
In mobile peer-to-peer networks, the incentive mechanism has to be provided for peers' participation as both resource suppliers and intermediaries (routers). In this paper we propose our solution to the incentive problem for intermediaries of message routing. We provide the domination- set-based peer-to-peer searching algorithm with economic models, which achieves motivating peers' corporation in the whole overlay. Simulation results prove the functionality of our solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信