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}
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.