基于信用的VANET网络编码合作内容分发激励协议

Ing-Chau Chang, Jacky Lo
{"title":"基于信用的VANET网络编码合作内容分发激励协议","authors":"Ing-Chau Chang, Jacky Lo","doi":"10.1109/IMIS.2014.65","DOIUrl":null,"url":null,"abstract":"As the high-speed vehicular node passes the coverage area of a road side unit in the vehicular ad hoc network, it may not be able to receive all content information broadcast by the RSU during the short contact duration with the RSU. Hence, when the vehicular node leaves the coverage area of the RSU, it has to adopt the cooperative content distribution approach to share its received content pieces, which are encoded by the network coding technology, with all neighboring nodes. However, these approaches do not consider that vehicular nodes in reality may have different degrees of selfishness and interests on various types of content information, which in turn hinders those selfish nodes from sharing their contents with others. In this paper, we will propose the Social Code scheme, adopting the content bitmap, for each node to calculate the number of different network-coded content pieces, its corresponding re-broadcast priority and the correct number of re-encoded NC content pieces with all neighbor nodes first. Social Code then classifies vehicular nodes into four types and further integrates corresponding credit-based incentive protocols to stimulate nodes' willingness to re-broadcast their content pieces. Finally simulation results show that Social Code outperforms over traditional NC-based cooperative content distribution schemes, if they adopt the credit-based incentive protocols without considering node selfishness and interests.","PeriodicalId":345694,"journal":{"name":"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Credit-Based Incentive Protocol for Stimulating Network-Coded Cooperative Content Distribution in VANET\",\"authors\":\"Ing-Chau Chang, Jacky Lo\",\"doi\":\"10.1109/IMIS.2014.65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the high-speed vehicular node passes the coverage area of a road side unit in the vehicular ad hoc network, it may not be able to receive all content information broadcast by the RSU during the short contact duration with the RSU. Hence, when the vehicular node leaves the coverage area of the RSU, it has to adopt the cooperative content distribution approach to share its received content pieces, which are encoded by the network coding technology, with all neighboring nodes. However, these approaches do not consider that vehicular nodes in reality may have different degrees of selfishness and interests on various types of content information, which in turn hinders those selfish nodes from sharing their contents with others. In this paper, we will propose the Social Code scheme, adopting the content bitmap, for each node to calculate the number of different network-coded content pieces, its corresponding re-broadcast priority and the correct number of re-encoded NC content pieces with all neighbor nodes first. Social Code then classifies vehicular nodes into four types and further integrates corresponding credit-based incentive protocols to stimulate nodes' willingness to re-broadcast their content pieces. Finally simulation results show that Social Code outperforms over traditional NC-based cooperative content distribution schemes, if they adopt the credit-based incentive protocols without considering node selfishness and interests.\",\"PeriodicalId\":345694,\"journal\":{\"name\":\"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMIS.2014.65\",\"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 Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMIS.2014.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

由于高速车辆节点经过车载自组网中某个路侧单元的覆盖区域,在与RSU短暂的接触时间内,可能无法接收到RSU广播的所有内容信息。因此,当车辆节点离开RSU覆盖区域时,必须采用协作式内容分发方式,将其接收到的经过网络编码技术编码的内容片段共享给所有相邻节点。然而,这些方法没有考虑到现实中的车载节点对各种类型的内容信息可能存在不同程度的自私和利益,从而阻碍了这些自私节点与他人共享其内容。在本文中,我们将提出采用内容位图的Social Code方案,对每个节点计算不同网络编码的内容片段的数量,其对应的重播优先级以及所有相邻节点优先重新编码NC内容片段的正确数量。然后,Social Code将车辆节点分为四种类型,并进一步整合相应的基于信用的激励协议,以刺激节点对其内容片段进行重播的意愿。仿真结果表明,在不考虑节点自利和利益的情况下,采用基于信用的激励协议,社会代码方案优于传统的基于网络的合作内容分发方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Credit-Based Incentive Protocol for Stimulating Network-Coded Cooperative Content Distribution in VANET
As the high-speed vehicular node passes the coverage area of a road side unit in the vehicular ad hoc network, it may not be able to receive all content information broadcast by the RSU during the short contact duration with the RSU. Hence, when the vehicular node leaves the coverage area of the RSU, it has to adopt the cooperative content distribution approach to share its received content pieces, which are encoded by the network coding technology, with all neighboring nodes. However, these approaches do not consider that vehicular nodes in reality may have different degrees of selfishness and interests on various types of content information, which in turn hinders those selfish nodes from sharing their contents with others. In this paper, we will propose the Social Code scheme, adopting the content bitmap, for each node to calculate the number of different network-coded content pieces, its corresponding re-broadcast priority and the correct number of re-encoded NC content pieces with all neighbor nodes first. Social Code then classifies vehicular nodes into four types and further integrates corresponding credit-based incentive protocols to stimulate nodes' willingness to re-broadcast their content pieces. Finally simulation results show that Social Code outperforms over traditional NC-based cooperative content distribution schemes, if they adopt the credit-based incentive protocols without considering node selfishness and interests.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-defense Mechanism against DDoS in SDN Based CDNi Extending the EPCIS with Building Automation Systems: A New Information System for the Internet of Things A Survey of Green, Energy-Aware Security and Some of Its Recent Developments in Networking and Mobile Computing A Dual-Path-Based Data Aggregation Scheme for Grid-Based Wireless Sensor Networks Minimum Cost Content Object Reconstruction in Multi-tier Servers
×
引用
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