机会网络上的多媒体共享

Radu Dragan, Radu-Ioan Ciobanu, C. Dobre, C. Mavromoustakis, G. Mastorakis
{"title":"机会网络上的多媒体共享","authors":"Radu Dragan, Radu-Ioan Ciobanu, C. Dobre, C. Mavromoustakis, G. Mastorakis","doi":"10.1109/ICCP.2016.7737181","DOIUrl":null,"url":null,"abstract":"The massive increase in the use of mobile devices lately led to the congestion of the mobile networks. One solution to offload part of the traffic is to send data, whenever possible, through direct phone-to-phone communication. Such opportunistic networks rely on wireless communication to support a decentralized model of communication where nodes can store, carry and forward data directly to others. Up-until-now most work focused on constructing algorithms designed to forward or disseminate data to nodes having a better chance of routing it to its destination. Here, we extend on our previous work, and propose Opportunistic Multimedia Sharing, an algorithm designed to support dissemination of multimedia content over an opportunistic communication model. The algorithm uses the predictability of the node encounters to determine which multimedia files a specific node can deliver closer to the interested nodes. Experimental results show the algorithm can deliver a high success rate (over 80% in same cases), while maintaining a low delivery latency and cost.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multimedia sharing over opportunistic networks\",\"authors\":\"Radu Dragan, Radu-Ioan Ciobanu, C. Dobre, C. Mavromoustakis, G. Mastorakis\",\"doi\":\"10.1109/ICCP.2016.7737181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The massive increase in the use of mobile devices lately led to the congestion of the mobile networks. One solution to offload part of the traffic is to send data, whenever possible, through direct phone-to-phone communication. Such opportunistic networks rely on wireless communication to support a decentralized model of communication where nodes can store, carry and forward data directly to others. Up-until-now most work focused on constructing algorithms designed to forward or disseminate data to nodes having a better chance of routing it to its destination. Here, we extend on our previous work, and propose Opportunistic Multimedia Sharing, an algorithm designed to support dissemination of multimedia content over an opportunistic communication model. The algorithm uses the predictability of the node encounters to determine which multimedia files a specific node can deliver closer to the interested nodes. Experimental results show the algorithm can deliver a high success rate (over 80% in same cases), while maintaining a low delivery latency and cost.\",\"PeriodicalId\":343658,\"journal\":{\"name\":\"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCP.2016.7737181\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2016.7737181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

最近移动设备使用的大量增加导致了移动网络的拥塞。减轻部分流量的一个解决方案是,只要有可能,就通过电话对电话的直接通信发送数据。这种机会主义网络依靠无线通信来支持分散的通信模型,节点可以存储、携带和转发数据给其他节点。到目前为止,大多数工作都集中在构建算法上,这些算法旨在将数据转发或传播到有更好机会将其路由到目的地的节点。在这里,我们扩展了之前的工作,并提出了机会式多媒体共享,这是一种旨在通过机会式通信模型支持多媒体内容传播的算法。该算法使用节点遭遇的可预测性来确定特定节点可以向感兴趣的节点提供哪些多媒体文件。实验结果表明,该算法在保持较低的交付延迟和成本的同时,可以实现较高的交付成功率(在相同情况下超过80%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multimedia sharing over opportunistic networks
The massive increase in the use of mobile devices lately led to the congestion of the mobile networks. One solution to offload part of the traffic is to send data, whenever possible, through direct phone-to-phone communication. Such opportunistic networks rely on wireless communication to support a decentralized model of communication where nodes can store, carry and forward data directly to others. Up-until-now most work focused on constructing algorithms designed to forward or disseminate data to nodes having a better chance of routing it to its destination. Here, we extend on our previous work, and propose Opportunistic Multimedia Sharing, an algorithm designed to support dissemination of multimedia content over an opportunistic communication model. The algorithm uses the predictability of the node encounters to determine which multimedia files a specific node can deliver closer to the interested nodes. Experimental results show the algorithm can deliver a high success rate (over 80% in same cases), while maintaining a low delivery latency and cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信