AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

AI 精读

AI抽取本论文的概要总结


微博一下
DF relay strategy is practically better than AF strategy under the proposed transmission protocol

Optimization framework and graph-based approach for relay-assisted bidirectional OFDMA cellular networks

IEEE Transactions on Wireless Communications, no. 11 (2010): 3490-3500

引用91|浏览31
WOS SCOPUS EI
下载 PDF 全文
引用
微博一下

摘要

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division multiple-access (OFDMA) for both uplink and downlink. The goal is to improve the overall system performance by exploring the full potential of the network in variou...更多

代码

数据

0
简介
  • In wireless cellular networks, deploying a set of relay stations (RSs) between a base station (BS) and mobile stations (MSs) is a cost-effective approach for improving system performance, such as coverage extension, power saving and cell-edge throughput enhancement
  • These advantages are achieved as relay-assisted cooperative transmission exploits the inherent broadcast nature of wireless radio waves and provides cooperative diversity [1]–[3].
  • It is attractive to utilize network coding gain in the form of two-way relaying for more efficient transmission of downlink and uplink traffic in a cooperative cellular network
重点内容
  • The small-scale fading is modeled by Rayleigh fading process, where the power delay profile is exponentially decaying with maximum delay spread of 5 μs and maximum Doppler spread of 30 Hz
  • In this paper, we proposed a novel three-time-slot time-division duplexing transmission protocol for supporting direct transmission, one- and two-way relaying in relay-assisted bidirectional cellular orthogonal frequency-division multiple-access networks
  • After establishing its equivalence to a maximum weighted clique problem in graph theory, we employed an any colony optimization based heuristic algorithm to find the solution in polynomial time
  • About 20-30% improvement on the system average throughput is achieved over the conventional orthogonal frequency-division multiple-access networks without relay
  • DF relay strategy is practically better than AF strategy under the proposed transmission protocol
结果
  • The authors evaluate the performance of the proposed transmission protocol together with the ACO based resource allocation algorithm using simulation.
  • The small-scale fading is modeled by Rayleigh fading process, where the power delay profile is exponentially decaying with maximum delay spread of 5 μs and maximum Doppler spread of 30 Hz. A total of 2000 different channel realizations were used.
  • All RSs have the same maximum power constraints, so do all MSs. The authors consider that the maximum power constraints in dB at BS, RS and MS satisfy PB = PR + 3dB = PM + 5dB.
  • The graph settings in the ACO algorithm are listed in Table II, which have been proved to be efficient in [23]
结论
  • The authors proposed a novel three-time-slot TDD transmission protocol for supporting direct transmission, one- and two-way relaying in relay-assisted bidirectional cellular OFDMA networks.
  • Under this protocol, a complete set of five transmission modes are introduced.
  • DF relay strategy is practically better than AF strategy under the proposed transmission protocol
表格
  • Table1: TRANSMISSION MODE PAIRING
  • Table2: GRAPHICAL SETTINGS
Download tables as Excel
引用论文
  • J. N. Laneman and G. W. Wornell, “Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks,” IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2415–2425, Oct. 2003.
    Google ScholarLocate open access versionFindings
  • N. J. Laneman, D. N. C. Tse, and G.W.Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062–3080, Dec. 2004.
    Google ScholarLocate open access versionFindings
  • A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity - Part I: System description,” IEEE Trans. Commun., vol. 51, no. 11, pp. 1927–1938, Nov. 2003.
    Google ScholarLocate open access versionFindings
  • R. Ahlswede, N. Cai, S.-Y. R. Li, and R. Yeung, “Network information flow,” IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204–1216, Jul. 2000.
    Google ScholarLocate open access versionFindings
  • S. Zhang, S. C. Liew, and P. P. Lam, “Physical-layer network coding,” in Proc. ACM MobiCom, Sept. 2006, pp. 358–365.
    Google ScholarLocate open access versionFindings
  • B. Rankov and A. Wittneben, “Spectral efficient protocols for halfduplex fading relay channels,” IEEE J. Sel. Areas Commun., vol. 25, no. 2, pp. 379–389, Feb. 2007.
    Google ScholarLocate open access versionFindings
  • P. Popovski and H. Yomo, “Physical network coding in two-way wireless relay channels,” in Proc. IEEE ICC, Jun. 2007, pp. 707–712.
    Google ScholarLocate open access versionFindings
  • S. J. Kim, P. Mitran, and V. Tarokh, “Performance bounds for bi-directional coded cooperation protocols,” IEEE Trans. Inf. Theory, vol. 54, no. 11, pp. 5253–5241, Aug. 2008.
    Google ScholarLocate open access versionFindings
  • G. Song and Y. G. Li, “Cross-layer optimization for OFDM wireless networks - Part I: Theoretical framework,” IEEE Trans. Wireless Commun., vol. 4, no. 2, pp. 614–624, Mar. 2005. [10] ——, “Cross-layer optimization for OFDM wireless networks - Part II: Algorithm development,” IEEE Trans. Wireless
    Google ScholarLocate open access versionFindings
  • Commun., vol. 4, no. 2, pp. 625–634, Mar. 2005.
    Google ScholarFindings
  • J. Tang and X. Zhang, “Cross-layer resource allocation over wireless relay networks for quality of service provisioning,” IEEE J. Sel. Areas Commun., vol. 25, no. 4, pp. 645–656, May 2007.
    Google ScholarLocate open access versionFindings
  • S.-J. Kim, X. Wang, and M. Madihian, “Optimal resource allocation in multi-hop OFDMA wireless networks with cooperative relay,” IEEE Trans. Wireless Commun., vol. 7, no. 5, pp. 1833–1838, May 2008.
    Google ScholarLocate open access versionFindings
  • M. Tao, Y. C. Liang, and F. Zhang, “Resource allocation for delay differentiated traffic in multiuser OFDM systems,” IEEE Trans. Wireless Commun., vol. 7, no. 6, pp. 2190–2210, Jun. 2008.
    Google ScholarLocate open access versionFindings
  • IEEE J. Sel. Areas Commun., vol. 25, no. 2, pp. 328–339, Feb. 2007.
    Google ScholarLocate open access versionFindings
  • K. Jitvanichphaibool, R. Zhang, and Y. C. Liang, “Optimal resource allocation for two-way relay-assisted OFDMA,” IEEE Trans. Veh. Technol., vol. 58, no. 7, pp. 3311–3321, Sept. 2009.
    Google ScholarLocate open access versionFindings
  • H. Xu and B. Li, “XOR-assisted cooperative diversity in OFDMA wireless networks: Optimization framework and approximation algorithms,” in Proc. IEEE INFOCOM, Apr. 2009, pp. 2141–2149.
    Google ScholarLocate open access versionFindings
  • I. Hammerstrom and A. Wittneben, “On the optimal power allocation for nonregenerative OFDM relay links,” in Proc. IEEE ICC, Jun. 2006, pp. 4463–4468.
    Google ScholarLocate open access versionFindings
  • W. Dang, M. Tao, H. Mu, and J. Huang, “Subcarrier-pair based resource allocation for cooperative multi-relay OFDM systems,” to appear in IEEE Trans. Wireless Commun., 2010.
    Google ScholarLocate open access versionFindings
  • C. K. Ho, R. Zhang, and Y. C. Liang, “Two-way relaying over OFDM: optimized tone permutation and power allocation,” in Proc. IEEE ICC, May 2008, pp. 3908–3912.
    Google ScholarLocate open access versionFindings
  • T. J. Oechtering and H. Boche, “Stability region of an optimized bidirectional regenerative half-duplex relaying protocol,” IEEE Trans. Commun., vol. 56, no. 9, pp. 1519–1529, Sept. 2008.
    Google ScholarLocate open access versionFindings
  • C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
    Google ScholarFindings
  • M. Dorigo and T. Sttzle, Ant Colony Optimization. Cambridge: MIT Press, 2004.
    Google ScholarFindings
  • C. Solnon and S. Fenet, “A study of ACO capabilities for solving the maximum clique problem,” J. Heuristics, vol. 12, no. 3, pp. 1572–9397, May 2006.
    Google ScholarLocate open access versionFindings
  • E. Balas and J. Xue, “Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs,” SIAM J. Comput., vol. 20, no. 2, pp. 209–221, Apr. 1991.
    Google ScholarLocate open access versionFindings
  • E. Balas and W. Niehaus, “Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems,” J. Heuristics, vol. 4, no. 2, pp. 107–122, Jul. 1998.
    Google ScholarLocate open access versionFindings
  • V. Erceg, L. Greenstein, S. Tjandra, S. Parkoff, A. Gupta, B. Kulic, A. Julius, and R. Jastrzab, “An empirically based path loss model for wireless channels in suburban environments,” IEEE J. Sel. Areas Commun., vol. 17, no. 7, pp. 1205–1211, Jul. 1999.
    Google ScholarLocate open access versionFindings
  • M. Yu and J. Li, “Is amplify-and-forward practically better than decode-and-forward or vice versa?” in Proc. IEEE ICASSP, Mar. 2005, pp. 365–368.
    Google ScholarLocate open access versionFindings
0
您的评分 :

暂无评分

标签
评论
avatar
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn