A joint optimization method for data offloading in D2D-enabled cellular networks

Guangsheng Feng, Teng Li, Dongdong Su, Haibin Lv, Huiqiang Wang, Hongwu Lv
{"title":"A joint optimization method for data offloading in D2D-enabled cellular networks","authors":"Guangsheng Feng, Teng Li, Dongdong Su, Haibin Lv, Huiqiang Wang, Hongwu Lv","doi":"10.23919/WIOPT.2018.8362883","DOIUrl":null,"url":null,"abstract":"Device-to-device (D2D) communication is a promising technique for traffic offloading in next-generation cellular systems. In this paper, we study the D2D-assisted cellular traffic offloading (DACTO) problem, where Wi-Fi Direct technology is employed in D2D communication in consideration of its wide communication coverage and high transmission rate. Taking into account the user traffic demands and population distributions, we formulate the DACTO problem as a \"Min-Max\" problem, in which the operator energy consumption is minimized and meanwhile the user satisfaction is maximized. The DACTO is proven to be a NP-complete problem and is difficult to tackle with the increasing number of population. To achieve a feasible solution, we convert the DACTO problem into an approximate combination optimization problem, and develop a backpack algorithm combined with an improved Hungarian algorithm to solve it. Simulation results show that the proposed method achieves the near-optimal solution for the DACTO problem.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2018.8362883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Device-to-device (D2D) communication is a promising technique for traffic offloading in next-generation cellular systems. In this paper, we study the D2D-assisted cellular traffic offloading (DACTO) problem, where Wi-Fi Direct technology is employed in D2D communication in consideration of its wide communication coverage and high transmission rate. Taking into account the user traffic demands and population distributions, we formulate the DACTO problem as a "Min-Max" problem, in which the operator energy consumption is minimized and meanwhile the user satisfaction is maximized. The DACTO is proven to be a NP-complete problem and is difficult to tackle with the increasing number of population. To achieve a feasible solution, we convert the DACTO problem into an approximate combination optimization problem, and develop a backpack algorithm combined with an improved Hungarian algorithm to solve it. Simulation results show that the proposed method achieves the near-optimal solution for the DACTO problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种在支持2d的蜂窝网络中用于数据卸载的联合优化方法
设备对设备(D2D)通信是下一代蜂窝系统中一种很有前途的流量分流技术。本文研究了D2D辅助蜂窝流量分流(DACTO)问题,在D2D通信中采用Wi-Fi Direct技术,考虑到其通信覆盖范围广、传输速率高的特点。考虑到用户的流量需求和人口分布,我们将DACTO问题表述为最小化运营商能耗同时最大化用户满意度的“最小-最大”问题。DACTO被证明是np完全问题,随着人口数量的增加而难以解决。为了获得可行解,我们将DACTO问题转化为近似组合优化问题,并结合改进的匈牙利算法开发了一种背包算法来求解。仿真结果表明,所提出的方法达到了DACTO问题的近最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic resource allocation in radio-over-fiber enabled dense cellular networks Energy efficient scheduling for IoT applications with offloading, user association and BS sleeping in ultra dense networks Asymmetric regenerating codes for heterogeneous distributed storage systems Trekking based distributed algorithm for opportunistic spectrum access in infrastructure-less network Speed scaling under QoS constraints with finite buffer
×
引用
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