Cellular traffic offloading through opportunistic communications: a case study

CHANTS '10 Pub Date : 2010-09-24 DOI:10.1145/1859934.1859943
B. Han, Pan Hui, V. S. A. Kumar, M. Marathe, Guanhong Pei, A. Srinivasan
{"title":"Cellular traffic offloading through opportunistic communications: a case study","authors":"B. Han, Pan Hui, V. S. A. Kumar, M. Marathe, Guanhong Pei, A. Srinivasan","doi":"10.1145/1859934.1859943","DOIUrl":null,"url":null,"abstract":"Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic.\n In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then through opportunistic communications, target-users will further propagate the information among all the subscribed users. Finally, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. The simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload cellular traffic by up to 73.66% for a real-world mobility trace.","PeriodicalId":404958,"journal":{"name":"CHANTS '10","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"302","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CHANTS '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1859934.1859943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 302

Abstract

Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic. In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then through opportunistic communications, target-users will further propagate the information among all the subscribed users. Finally, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. The simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload cellular traffic by up to 73.66% for a real-world mobility trace.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过机会通信的蜂窝流量卸载:一个案例研究
由于各种智能手机应用的日益普及,3G网络目前被移动数据流量过载。通过机会性通信来卸载蜂窝通信是一种很有希望的解决方案,可以部分解决这个问题,因为它不需要金钱成本。作为案例研究,我们研究了新兴移动社交网络(MoSoNets)中信息传递的目标集选择问题。我们建议利用机会通信来促进信息传播,从而减少蜂窝通信量。特别是,我们研究了如何选择只有k个用户的目标集,从而使蜂窝数据流量最小化。在此场景中,最初内容服务提供者通过蜂窝网络仅向目标集中的用户传递信息。然后,通过机会通信,目标用户将进一步在所有订阅用户之间传播信息。最后,服务提供者将把信息发送给未能在交付截止日期(即延迟容忍阈值)之前接收到的用户。针对这个问题,我们提出了三种算法,称为贪婪、启发式和随机,并通过广泛的跟踪驱动模拟研究来评估它们的性能。仿真结果验证了这些算法对合成和实际移动轨迹的有效性。例如,启发式算法可以卸载蜂窝流量高达73.66%的现实世界的移动跟踪。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Achieving anycast in DTNs by enhancing existing unicast protocols Dynamic, non-interactive key management for the bundle protocol Making bundle protocol into a game The state of DTN evaluation DTN routing in urban public transport systems
×
引用
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