基于声誉和信用的ddn数据中心消息传递激励机制

Himanshu Jethawa, S. Madria
{"title":"基于声誉和信用的ddn数据中心消息传递激励机制","authors":"Himanshu Jethawa, S. Madria","doi":"10.1109/MDM.2018.00038","DOIUrl":null,"url":null,"abstract":"In Delay Tolerant Networks (DTNs), to ensure successful message delivery, contribution of mobile nodes in relaying in an opportunistic fashion is essential. In our proposed data-centric dissemination protocol here, messages (images) are annotated with keywords by the source, and then intermediate nodes are presented with an option of adding keyword-based annotations to create higher content strength messages enroute toward the destination. Therefore, the message contents like images get enriched as the ground situation evolves and learned by these intermediate nodes, such as in a disaster situation, or in a battlefield. Due to limited battery and storage capacity in mobile devices, nodes might turn selfish and do not participate in relaying or improving the quality of messages. Thus, additionally, an incentive mechanism is proposed in this paper which considers factors like message quality, level of interests, battery usage, etc for the calculation of incentives. At the same time, in order to prevent the nodes from turning malicious by adding inappropriate message tags in pursuit of acquiring more incentive, a distributed reputation model (DRM) is developed and integrated with the proposed incentive scheme. DRM takes into account inputs from the intermediate users like ratings of the message quality, relevance of annotations in the message, etc. The proposed scheme thus ensures avoidance of congestion due to uncooperative or selfish nodes in the system. The performance evaluations show that our approach delivers more high priority and quality messages with reduced traffic with a slightly lower message delivery ratio compared to a more recent DTN routing like ChitChat, where a source forwards a message to intermediate nodes, which meet or exceed the matching strength of keyword-based interests.","PeriodicalId":205319,"journal":{"name":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","volume":"08 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Reputation and Credit Based Incentive Mechanism for Data-Centric Message Delivery in DTNs\",\"authors\":\"Himanshu Jethawa, S. Madria\",\"doi\":\"10.1109/MDM.2018.00038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Delay Tolerant Networks (DTNs), to ensure successful message delivery, contribution of mobile nodes in relaying in an opportunistic fashion is essential. In our proposed data-centric dissemination protocol here, messages (images) are annotated with keywords by the source, and then intermediate nodes are presented with an option of adding keyword-based annotations to create higher content strength messages enroute toward the destination. Therefore, the message contents like images get enriched as the ground situation evolves and learned by these intermediate nodes, such as in a disaster situation, or in a battlefield. Due to limited battery and storage capacity in mobile devices, nodes might turn selfish and do not participate in relaying or improving the quality of messages. Thus, additionally, an incentive mechanism is proposed in this paper which considers factors like message quality, level of interests, battery usage, etc for the calculation of incentives. At the same time, in order to prevent the nodes from turning malicious by adding inappropriate message tags in pursuit of acquiring more incentive, a distributed reputation model (DRM) is developed and integrated with the proposed incentive scheme. DRM takes into account inputs from the intermediate users like ratings of the message quality, relevance of annotations in the message, etc. The proposed scheme thus ensures avoidance of congestion due to uncooperative or selfish nodes in the system. The performance evaluations show that our approach delivers more high priority and quality messages with reduced traffic with a slightly lower message delivery ratio compared to a more recent DTN routing like ChitChat, where a source forwards a message to intermediate nodes, which meet or exceed the matching strength of keyword-based interests.\",\"PeriodicalId\":205319,\"journal\":{\"name\":\"2018 19th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"08 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 19th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2018.00038\",\"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 19th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2018.00038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在容忍延迟网络(DTNs)中,为了确保消息的成功传递,移动节点以机会主义的方式在中继中做出贡献是必不可少的。在我们提出的以数据为中心的传播协议中,消息(图像)由源使用关键字进行注释,然后中间节点可以选择添加基于关键字的注释,从而在发送到目的地的途中创建更高内容强度的消息。因此,图像等信息内容随着地面情况的演变和这些中间节点的学习而得到丰富,例如在灾难情况下,或者在战场上。由于移动设备的电池和存储容量有限,节点可能会变得自私,不参与中继或提高消息质量。因此,本文还提出了一种激励机制,该机制考虑了消息质量、兴趣水平、电池使用等因素来计算激励。同时,为了防止节点为了获得更多的激励而添加不适当的消息标签,从而产生恶意行为,开发了分布式声誉模型(DRM),并与所提出的激励方案进行了集成。DRM考虑了来自中间用户的输入,如消息质量的评级、消息中注释的相关性等。因此,所提出的方案可以避免由于系统中不合作或自私节点造成的拥塞。性能评估表明,与最近的DTN路由(如ChitChat)相比,我们的方法以更少的流量和稍低的消息传递率提供了更多高优先级和高质量的消息,其中源将消息转发到中间节点,达到或超过基于关键字的匹配强度兴趣。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reputation and Credit Based Incentive Mechanism for Data-Centric Message Delivery in DTNs
In Delay Tolerant Networks (DTNs), to ensure successful message delivery, contribution of mobile nodes in relaying in an opportunistic fashion is essential. In our proposed data-centric dissemination protocol here, messages (images) are annotated with keywords by the source, and then intermediate nodes are presented with an option of adding keyword-based annotations to create higher content strength messages enroute toward the destination. Therefore, the message contents like images get enriched as the ground situation evolves and learned by these intermediate nodes, such as in a disaster situation, or in a battlefield. Due to limited battery and storage capacity in mobile devices, nodes might turn selfish and do not participate in relaying or improving the quality of messages. Thus, additionally, an incentive mechanism is proposed in this paper which considers factors like message quality, level of interests, battery usage, etc for the calculation of incentives. At the same time, in order to prevent the nodes from turning malicious by adding inappropriate message tags in pursuit of acquiring more incentive, a distributed reputation model (DRM) is developed and integrated with the proposed incentive scheme. DRM takes into account inputs from the intermediate users like ratings of the message quality, relevance of annotations in the message, etc. The proposed scheme thus ensures avoidance of congestion due to uncooperative or selfish nodes in the system. The performance evaluations show that our approach delivers more high priority and quality messages with reduced traffic with a slightly lower message delivery ratio compared to a more recent DTN routing like ChitChat, where a source forwards a message to intermediate nodes, which meet or exceed the matching strength of keyword-based interests.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FMS: Managing Crowdsourced Indoor Signals with the Fingerprint Management Studio Stochastic Shortest Path Finding in Path-Centric Uncertain Road Networks Concept for Evaluation of Techniques for Trajectory Distance Measures VIPTRA: Visualization and Interactive Processing on Big Trajectory Data DCount - A Probabilistic Algorithm for Accurately Disaggregating Building Occupant Counts into Room Counts
×
引用
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