一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名
郵箱
手機號碼
標題
留言內容
驗證碼

基于時延優(yōu)化的蜂窩D2D通信聯合用戶關聯及內容部署算法

柴蓉 王令 陳明龍 陳前斌

柴蓉, 王令, 陳明龍, 陳前斌. 基于時延優(yōu)化的蜂窩D2D通信聯合用戶關聯及內容部署算法[J]. 電子與信息學報, 2019, 41(11): 2565-2570. doi: 10.11999/JEIT180408
引用本文: 柴蓉, 王令, 陳明龍, 陳前斌. 基于時延優(yōu)化的蜂窩D2D通信聯合用戶關聯及內容部署算法[J]. 電子與信息學報, 2019, 41(11): 2565-2570. doi: 10.11999/JEIT180408
Rong CHAI, Ling WANG, Minglong CHEN, Qianbin CHEN. Joint Clustering and Content Deployment Algorithm for Cellular D2D Communication Based on Delay Optimization[J]. Journal of Electronics & Information Technology, 2019, 41(11): 2565-2570. doi: 10.11999/JEIT180408
Citation: Rong CHAI, Ling WANG, Minglong CHEN, Qianbin CHEN. Joint Clustering and Content Deployment Algorithm for Cellular D2D Communication Based on Delay Optimization[J]. Journal of Electronics & Information Technology, 2019, 41(11): 2565-2570. doi: 10.11999/JEIT180408

基于時延優(yōu)化的蜂窩D2D通信聯合用戶關聯及內容部署算法

doi: 10.11999/JEIT180408
基金項目: 國家自然科學基金(61571073),國家科技重大專項(2016ZX03001010-004)
詳細信息
    作者簡介:

    柴蓉:女,1974年生,教授,研究方向為通信網絡架構及關鍵技術、無線資源管理及移動性管理技術等

    王令:女,1993年生,碩士生,研究方向為無線通信、無線資源管理及網絡虛擬化等

    陳明龍:男,1993年生,碩士生,研究方向為無線資源管理、網絡虛擬化及內容緩存等

    陳前斌:男,1967年生,教授,研究方向為無線通信、通信網絡理論、軟件定義網絡、多媒體技術等

    通訊作者:

    柴蓉 chairong@cqupt.edu.cn

  • 中圖分類號: TN915

Joint Clustering and Content Deployment Algorithm for Cellular D2D Communication Based on Delay Optimization

Funds: The National Science Foundation of China (61571073), The National Science and Technology Specific Project of China (2016ZX03001010-004)
  • 摘要: 針對蜂窩網絡傳輸性能及基站(BS)緩存能力受限,多用戶內容請求難以滿足用戶服務質量(QoS)需求等問題,該文提出一種蜂窩終端直通(D2D)通信聯合用戶關聯及內容部署算法。考慮到位于特定區(qū)域的多用戶可能對于相同內容存在內容請求,該文引入成簇思想,提出一種成簇及內容部署機制,通過為各簇頭推送熱點內容,而簇成員基于D2D通信模式關聯簇頭獲取所需內容,可實現高效內容獲取。綜合考慮成簇數量、用戶關聯簇頭、簇頭緩存容量及傳輸速率等限制條件,建立基于用戶總業(yè)務時延最小化的聯合成簇及內容部署優(yōu)化模型。該優(yōu)化問題是一個非凸的混合整數優(yōu)化問題,該文運用拉格朗日部分松弛法,將原優(yōu)化問題等價轉換為3個凸優(yōu)化的子問題,并基于迭代算法及Kuhn-Munkres算法聯合求解各子問題,從而得到聯合成簇及內容部署優(yōu)化策略。最后通過MATLAB仿真驗證所提算法的有效性。
  • 圖  1  蜂窩D2D通信系統場景圖

    圖  2  基于用戶成簇機制的蜂窩D2D系統場景圖

    圖  3  總業(yè)務時延與迭代次數關系圖

    圖  4  總業(yè)務時延與業(yè)務到達速率關系圖(不同服務速率)

    圖  5  總業(yè)務時延與業(yè)務到達速率關系圖(不同最低傳輸速率)

    圖  6  總業(yè)務時延與子信道帶寬關系圖(不同噪聲功率譜密度)

    圖  7  總業(yè)務時延與子信道帶寬關系圖(不同業(yè)務到達速率)

    表  1  聯合用戶關聯及內容部署算法

     (1) 確定L種簇頭組合策略;
     (2) for $l = 1$,針對第$l$種簇頭組合策略;
     (3) 設置最大迭代次數${T^{\ \max }}$和最大容忍值$\varepsilon $;
     (4) 初始化拉格朗日因子${\eta _{i,j,k}},\;{\varphi _{i,j,k}},\;{\theta _{i,j,k}}$;
     (5) 重復主程序;
     (6) 求解用戶關聯子問題得到局部變量值${\delta _{i,j}}$;
      求解內容部署子問題得到局部變量值${\beta _{j,k}}$;
      求解聯合優(yōu)化子問題得到局部變量值${\alpha _{i,j,k}}$;
     (7) 更新拉格朗日因子;
      ${\eta _{i,j,k}}(t + 1) = {\left[ {{\eta _{i,j,k}}(t) - {\omega _1}\left( {{\alpha _{i,j,k}}(t) + 1 - {\delta _{i,j}}(t) - {\beta _{j,k}}(t)} \right)} \right]^ + },$
      ${\varphi _{i,j,k}}(t + 1) = {\left[ {{\varphi _{i,j,k}}(t) - {\omega _2}\left( {{\delta _{i,j}}(t) - {\alpha _{i,j,k}}(t)} \right)} \right]^ + },$
      ${\theta _{i,j,k}}(t + 1) = {\left[ {{\theta _{i,j,k}}(t) - {\omega _3}\left( {{\beta _{j,k}}(t) - {\alpha _{i,j,k}}(t)} \right)} \right]^{\rm{ + }}};$
     (8) 若$ \sum\nolimits_{i = 1}^M \sum\nolimits_{j = 1}^M \sum\nolimits_{k = 1}^K \left[ \left| {{\eta _{i,j,k}}(t + 1) - {\eta _{i,j,k}}(t)} \right| \right. $     $\left.+ \left| {{\varphi _{i,j,k}}(t + 1) - {\varphi _{i,j,k}}(t)} \right| + \left| {{\theta _{i,j,k}}(t + 1) - {\theta _{i,j,k}}(t)} \right| \right] \le \varepsilon $ ;
     (9) 算法收斂;
      返回 $\delta _{i,j}^{\left( l \right) * }{\rm{ = }}{\delta _{i,j}},\beta _{j,k}^{\left( l \right) * }{\rm{ = }}{\beta _{j,k}},\alpha _{i,j,k}^{\left( l \right) * }{\rm{ = }}{\alpha _{i,j,k}};$
     (10) 否則 $t = t + 1$;
     (11) 重復步驟(6)—步驟(10),直到算法收斂或$t = {T^{\ \max }}$;
     (12) $l = l + 1$,重復步驟(5)—步驟(11),得到$\delta _{i,j}^{\left( l \right)*},\;\beta _{j,k}^{\left( l \right) * },\;\alpha _{i,j,k}^{\left( l \right) * }$及${D^{\left( l \right) * }}$,直至$l = L$;
     (13) 比較$L$種簇頭組合下的最優(yōu)業(yè)務時延,選擇最優(yōu)用戶關聯及內容部署優(yōu)化策略,即$\left\{ {\delta _{i,j}^{\left( l \right) * },\beta _{j,k}^{\left( l \right) * },\alpha _{i,j,k}^{\left( l \right) * }} \right\} = \arg \min {D^{\left( l \right) * }}。$
    下載: 導出CSV
  • TEHRANI M N, UYSAL M, and YANIKOMEROGLU H. Device-to-device communication in 5G cellular networks: Challenges, solutions, and future directions[J]. IEEE Communications Magazine, 2014, 52(5): 86–92. doi: 10.1109/MCOM.2014.6815897
    ASADI A, WANG Qing, and MANCUSO V. A survey on device-to-device communication in cellular networks[J]. IEEE Communications Surveys & Tutorials, 2014, 16(4): 1801–1819. doi: 10.1109/COMST.2014.2319555
    FODOR G, DAHLMAN E, MILDH G, et al. Design aspects of network assisted device-to-device communications[J]. IEEE Communications Magazine, 2012, 50(3): 170–177. doi: 10.1109/MCOM.2012.6163598
    ZHU Huiling. Radio resource allocation for OFDMA systems in high speed environments[J]. IEEE Journal on Selected Areas in Communications, 2012, 30(4): 748–759. doi: 10.1109/JSAC.2012.120509
    MA Ruofei, XIA Nian, CHEN H H, et al. Mode selection, radio resource allocation, and power coordination in D2D communications[J]. IEEE Wireless Communications, 2017, 24(3): 112–121. doi: 10.1109/MWC.2017.1500385WC
    WEN Dingzhu, YU Guanding, and XU Lukai. Energy-efficient mode selection and power control for device-to-device communications[C]. Proceedings of 2016 IEEE Wireless Communications and Networking Conference, Doha, Qatar, 2016: 1–7. doi: 10.1109/WCNC.2016.7565099.
    PENDA D D, FU Liqun, and JOHANSSON M. Mode selection for energy efficient D2D communications in dynamic TDD systems[C]. Proceedings of 2015 IEEE International Conference on Communications, London, UK, 2015: 5404–5409. doi: 10.1109/ICC.2015.7249183.
    KLUGEL M and KELLERER W. Leveraging the D2D-gain: Resource efficiency based mode selection for device-to-device communication[C]. Proceedings of 2016 IEEE Global Communications Conference, Washington, USA, 2016: 1–7. doi: 10.1109/GLOCOM.2016.7841953.
    WANG Kan, YU F R, and LI Hongyan. Information-centric virtualized cellular networks with device-to-device communications[J]. IEEE Transactions on Vehicular Technology, 2016, 65(11): 9319–9329. doi: 10.1109/TVT.2016.2518658
    PAN Yijin, PAN Cunhua, ZHU Huiling, et al. On consideration of content preference and sharing willingness in D2D assisted offloading[J]. IEEE Journal on Selected Areas in Communications, 2017, 35(4): 978–993. doi: 10.1109/JSAC.2017.2680938
    LI Xiaoshuai, MA Lin, SHANKARAN R, et al. Joint mode selection and proportional fair scheduling for D2D communication[C]. Proceedings of the 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, Montreal, Canada, 2017: 1–6. doi: 10.1109/PIMRC.2017.8292254.
    LIBERTI L and PANTELIDES C C. An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms[J]. Journal of Global Optimization, 2006, 36(2): 161–189. doi: 10.1007/s10898-006-9005-4
    LEMARéCHAL C. S. Boyd, VANDENBERGHE L. Convex optimization[J]. European Journal of Operational Research, 2006, 170(1): 326–327. doi: 10.1016/j.ejor.2005.02.002.
    HUANG Yifei, NASIR A A, DURRANI S, et al. Mode selection, resource allocation, and power control for D2D-enabled two-tier cellular network[J]. IEEE Transactions on Communications, 2016, 64(8): 3534–3547. doi: 10.1109/TCOMM.2016.2580153
    JIANG Wei, FENG Gang, and QIN Shuang. Optimal cooperative content caching and delivery policy for heterogeneous cellular networks[J]. IEEE Transactions on Mobile Computing, 2017, 16(5): 1382–1393. doi: 10.1109/TMC.2016.2597851
  • 加載中
圖(7) / 表(1)
計量
  • 文章訪問數:  2806
  • HTML全文瀏覽量:  1152
  • PDF下載量:  85
  • 被引次數: 0
出版歷程
  • 收稿日期:  2018-05-02
  • 修回日期:  2019-05-21
  • 網絡出版日期:  2019-07-19
  • 刊出日期:  2019-11-01

目錄

    /

    返回文章
    返回