保密保证了在小型蜂窝网络中通过双连接实现最佳流量分流

Yuan Wu, Jianchao Zheng, Kuanyang Guo, L. Qian, Xuemin Shen, Yueming Cai
{"title":"保密保证了在小型蜂窝网络中通过双连接实现最佳流量分流","authors":"Yuan Wu, Jianchao Zheng, Kuanyang Guo, L. Qian, Xuemin Shen, Yueming Cai","doi":"10.1109/WCSP.2016.7752634","DOIUrl":null,"url":null,"abstract":"We investigate mobile user's (MU's) uplink traffic offloading based on the new paradigm of small-cell dual-connectivity (DC) that allows a MU to simultaneously offload traffic to a small-cell base station (sBS) and send data to a macro base station (mBS). In spite of the benefit of reducing the MU's power consumption, traffic offloading via DC leads to a security issue, i.e., a malicious node close to the sBS might intentionally eavesdrop the MU's offloaded data by receiving the MU's radio signal. Therefore, we formulate an optimization problem that jointly determines the MU's traffic scheduling and transmit-powers to the sBS and mBS, with the objective of minimizing the MU's total power consumption, while guaranteeing both the MU's secrecy requirement and traffic demand requirement. To solve the formulated joint optimization problem, we propose an effective layered-algorithm (which exploits the hidden convexity of the problem) to solve it and compute the MU's optimal offloading solution. Numerical results validate the efficiency of our algorithm and the significant influences of the MU's secrecy requirement.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Secrecy guaranteed optimal traffic offloading via dual-connectivity in small cell networks\",\"authors\":\"Yuan Wu, Jianchao Zheng, Kuanyang Guo, L. Qian, Xuemin Shen, Yueming Cai\",\"doi\":\"10.1109/WCSP.2016.7752634\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate mobile user's (MU's) uplink traffic offloading based on the new paradigm of small-cell dual-connectivity (DC) that allows a MU to simultaneously offload traffic to a small-cell base station (sBS) and send data to a macro base station (mBS). In spite of the benefit of reducing the MU's power consumption, traffic offloading via DC leads to a security issue, i.e., a malicious node close to the sBS might intentionally eavesdrop the MU's offloaded data by receiving the MU's radio signal. Therefore, we formulate an optimization problem that jointly determines the MU's traffic scheduling and transmit-powers to the sBS and mBS, with the objective of minimizing the MU's total power consumption, while guaranteeing both the MU's secrecy requirement and traffic demand requirement. To solve the formulated joint optimization problem, we propose an effective layered-algorithm (which exploits the hidden convexity of the problem) to solve it and compute the MU's optimal offloading solution. Numerical results validate the efficiency of our algorithm and the significant influences of the MU's secrecy requirement.\",\"PeriodicalId\":158117,\"journal\":{\"name\":\"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2016.7752634\",\"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 8th International Conference on Wireless Communications & Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2016.7752634","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们研究了基于小蜂窝双连接(DC)新范式的移动用户(MU)上行流量卸载,该范式允许MU同时将流量卸载到小蜂窝基站(sBS)并将数据发送到宏基站(mBS)。尽管减少MU的功耗有好处,但通过DC进行流量卸载会导致安全问题,即靠近sBS的恶意节点可能会通过接收MU的无线电信号故意窃听MU的卸载数据。因此,我们制定了一个优化问题,共同确定MU的流量调度和向sBS和mBS发送功率,以最小化MU的总功耗为目标,同时保证MU的保密要求和流量需求要求。为了解决公式化的联合优化问题,我们提出了一种有效的分层算法(该算法利用了问题的隐凸性)来求解该问题并计算MU的最优卸载解。数值结果验证了算法的有效性和MU保密要求的显著影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secrecy guaranteed optimal traffic offloading via dual-connectivity in small cell networks
We investigate mobile user's (MU's) uplink traffic offloading based on the new paradigm of small-cell dual-connectivity (DC) that allows a MU to simultaneously offload traffic to a small-cell base station (sBS) and send data to a macro base station (mBS). In spite of the benefit of reducing the MU's power consumption, traffic offloading via DC leads to a security issue, i.e., a malicious node close to the sBS might intentionally eavesdrop the MU's offloaded data by receiving the MU's radio signal. Therefore, we formulate an optimization problem that jointly determines the MU's traffic scheduling and transmit-powers to the sBS and mBS, with the objective of minimizing the MU's total power consumption, while guaranteeing both the MU's secrecy requirement and traffic demand requirement. To solve the formulated joint optimization problem, we propose an effective layered-algorithm (which exploits the hidden convexity of the problem) to solve it and compute the MU's optimal offloading solution. Numerical results validate the efficiency of our algorithm and the significant influences of the MU's secrecy requirement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信