We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 28 Issue 2
March  2013
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Kun Xie, Jian-Nong Cao, Ji-Gang Wen. Optimal Relay Assignment and Power Allocation for Cooperative Communications[J]. Journal of Computer Science and Technology, 2013, 28(2): 343-356. DOI: 10.1007/s11390-013-1335-3
Citation: Kun Xie, Jian-Nong Cao, Ji-Gang Wen. Optimal Relay Assignment and Power Allocation for Cooperative Communications[J]. Journal of Computer Science and Technology, 2013, 28(2): 343-356. DOI: 10.1007/s11390-013-1335-3
shu

Optimal Relay Assignment and Power Allocation for Cooperative Communications

  • 1 School of Information Science and Engineering, Hunan University, Changsha 410082, China;
    2 Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China;
    3 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China

Funds: The work is supported by the National Basic Research 973 Program of China under Grant No. 2012CB315801, the National Natural Science Foundation of China under Grant Nos. 61133015, 61003305, 61173167, and the Ph.D. Programs Foundation of Ministry of Education of China under Grant No. 20100161120022.
More Information
  • Received Date: January 14, 2012
  • Revised Date: July 11, 2012
  • Published Date: March 04, 2013
    Abstract
  • Cooperative communication for wireless networks has gained a lot of recent interest due to its ability to mitigate fading with exploration of spatial diversity. In this paper, we study a joint optimization problem of jointly considering transmission mode selection, relay assignment and power allocation to maximize the capacity of the network through cooperative wireless communications. This problem is much more challenging than relay assignment considered in literature work which simply targets to maximize the transmission capacity for a single transmission pair. We formulate the problem as a variation of the maximum weight matching problem where the weight is a function over power values which must meet power constraints (VMWMC). Although VMWMC is a non-convex problem whose complexity increases exponentially with the number of relay nodes, we show that the duality gap of VMWMC is virtual zero. Based on this result, we propose a solution using Lagrange dual decomposition to reduce the computation complexity. We do simulations to evaluate the performance of the proposed solution. The results show that our solution can achieve maximum network capacity with much less computation time compared with exhaustive search, and our solution outperforms existing sub-optimal solutions that can only achieve much lower network capacity.
    • FullText(HTML)
    • References (33)
  • [1]
    Bletsas A, Khisti A, Reed D P, Lippman A. A simple coope-rative diversity method based on network path selection.IEEE Journal on Selected Areas in Communications, 2006,24(3): 659-672.
    [2]
    Bletsas A, Shin H, Win M Z. Outage optimality of oppor-tunistic amplify-and-forward relaying. IEEE Communica-tions Letters, 2007, 11(3): 261-263.
    [3]
    Ibrahim A S, Sadek A K, Su W, Liu K J R. Cooperativecommunications with relay-selection: When to cooperate andwhom to cooperate with. IEEE Transactions on WirelessCommunications, 2008, 7(7): 2814-2827.
    [4]
    Zhao Y, Adve R, Lim T J. Improving amplify-and-forwardrelay networks: Optimal power allocation versus selection.IEEE Transactions on Wireless Communications, 2007, 6(8):3114-3123.
    [5]
    Ikki S S, Ahmed M H. Performance of multiple-relay coope-rative diversity systems with best relay selection over rayleighfading channels. EURASIP J. Adv. Signal Process, 2008: 1-7.
    [6]
    HasnaMO, AlouiniMS. Optimal power allocation for relayedtransmissions over rayleigh-fading channels. IEEE Transac-tions on Wireless Communications, 2004, 3(6): 1999-2004.
    [7]
    Host-Madsen A, Zhang J. Capacity bounds and power allo-cation for wireless relay channels. IEEE Transactions on In-formation Theory, 2005, 51(6): 2020-2040.
    [8]
    Lee K, Yener A. Iterative power allocation algorithmsfor amplify/estimate/compress-and-forward multi-band relaychannels. In Proc. the 40th Annual Conference on Informa-tion Sciences and Systems, March 2006, pp.1318-1323.
    [9]
    Wang B, Han Z, Liu K J R. Distributed relay selection andpower control for multiuser cooperative communication net-works using buyer/seller game. In Proc. the 26th INFOCOM2007, May 2007, pp.544-552.
    [10]
    Simic L, Berber S M, Sowerby K W. Partner choice and powerallocation for energy efficient cooperation in wireless sensornetworks. In Proc. ICC 2008, May 2008, pp.4255-4260.
    [11]
    Zhou Z, Zhou S L, Cui J H, Cui S G. Energy-efficient coope-rative communication based on power control and selectivesingle-relay in wireless sensor networks. IEEE Transactionson Wireless Communications, 2008, 7(8): 3066-3078.
    [12]
    Li Y F, Wang P, D N, Zhuang W. A dynamic relay selectionscheme for mobile users in wireless relay networks. In Proc.INFOCOM 2011, April 2011, pp.256-260.
    [13]
    Shi Y, Sharma S, Hou Y T, Kompella S. Optimal relay as-signment for cooperative communications. In Proc. the 9thMobiHoc, May 2008, pp.3-12
    [14]
    Sharma S, Shi Y, Hou Y T, Kompella S. An optimal algo-rithm for relay node assignment in cooperative ad hoc net-works. Transactions on Networking, 2011, 19: 879-892.
    [15]
    Zhang P, Xu Z G, Wang F R, Xie X, Tu L. A relay assign-ment algorithm with interference mitigation for cooperativecommunication. In Proc. WCNC 2009, April 2009, pp.1286-1291.
    [16]
    Yang D J, Fang X, Xue G L. OPRA: Optimal relay assign-ment for capacity maximization in cooperative networks. InProc. ICC 2011, June 2011, pp.1-6.
    [17]
    Yang D J, Xi F, Xue G L. HERA: An optimal relay assignmentscheme for cooperative networks. IEEE Journal on SelectedAreas in Communications, 2012, 30(2): 245-253.
    [18]
    Xu H L, Huang L S, Wang G, Xu T, Liu G. Joint relay assign-ment and power allocation for cooperative communications.Wireless Networks, 2010, 16(8): 2209-2219.
    [19]
    Cai J, Shen X M, Mark J W, Alfa A S. Semi-distributeduser relaying algorithm for amplify-and-forward wireless relaynetworks. IEEE Transactions on Wireless Communications,2008, 7(4): 1348-1357.
    [20]
    Ng T C Y, Yu W. Joint optimization of relay strategies andresource allocations in cooperative cellular networks. IEEEJournal on Selected Areas in Communications, 2007, 25(2):328-339.
    [21]
    Kadloor S, Adve R. Relay selection and power allocation incooperative cellular networks. IEEE Transactions on Wire-less Communications, 2010, 9(5): 1676-1685.
    [22]
    Ma K, Liu Z X, Guan X P. Joint relay selection and power al-location for cooperative cellular networks. Wireless PersonalCommunications, 2012, 64(2): 305-321.
    [23]
    Phan K T, Nguyen D H N, Le-Ngoc T. Joint power allocationand relay selection in cooperative networks. In Proc. the 28thGLOBECOM, November 2009, pp.1-5.
    [24]
    Xu H L, Huang L S, Wang G, Liu G, Huang H. Joint powerallocation and relay assignment for max-min fairness in coope-rative networks. In Proc. 2010 IEEE Symposium on Com-puters and Communications, June 2010, pp.123-126.
    [25]
    Laneman J N, Tse D N C, Wornell G W. Cooperative di-versity in wireless networks: Efficient protocols and outagebehavior. IEEE Transactions on Information Theory, 2004,50(12): 3062-3080.
    [26]
    Kao M Y, Lam T W, Sung W K, Ting H F. A decompositiontheorem for maximum weight bipartite matchings. SIAM J.Computing, 2001, 31(1): 18-26.
    [27]
    Palomar D P, Chiang M. A tutorial on decomposition meth-ods for network utility maximization. IEEE Journal on Se-lected Areas in Communications, 2006, 24(8): 1439-1451.
    [28]
    Chiang M, Zhang S, Hande P. Distributed rate allocation forinelastic 皁ws: Optimization frameworks, optimality condi-tions, and optimal algorithms. In Proc. INFOCOM 2005,March 2005, pp.2679-2690.
    [29]
    Wei Y, Lui R. Dual methods for nonconvex spectrum op-timization of multicarrier systems. IEEE Transactions onCommunications, 2006, 54(7): 1310-1322.
    [30]
    Seong K, Mohseni M, Cioffi J M. Optimal resource alloca-tion for OFDMA downlink systems. In Proc. 2006 IEEEInternational Symposium on Information Theory, July 2006,pp.1394-1398.
    [31]
    Kuhn H W. The Hungarian method for the assignment prob-lem. Naval Research Logistics Quarterly, 1955, 2(1/2): 83-97.
    [32]
    Munkres J. Algorithms for the assignment and transportationproblems. Journal of the Society for Industrial and AppliedMathematics, 1957, 5(1): 32-38.
    [33]
    Yu W, Cioffi J M. Sum capacity of Gaussian vector broadcastchannels. IEEE Transactions on Information Theory, 2004,50(9): 1875-1892.
    • Relative Articles

  • Related Articles

    [1]Rong Ge, Xizhou Feng, Pengfei Zou, Tyler Allen. The Paradigm of Power Bounded High-Performance Computing[J]. Journal of Computer Science and Technology, 2023, 38(1): 87-102. DOI: 10.1007/s11390-023-2885-7
    [2]Jos&eacute Alberto Fern&aacutendez-Zepeda, Daniel Brubeck-Salcedo, Daniel Fajardo-Delgado, H&eacutector Zatarain-Aceves. A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem[J]. Journal of Computer Science and Technology, 2018, 33(4): 823-837. DOI: 10.1007/s11390-018-1858-8
    [3]Bo-Lei Zhang, Zhu-Zhong Qian, Wen-Zhong Li, Bin Tang, Sang-Lu Lu, Xiaoming Fu. Budget Allocation for Maximizing Viral Advertising in Social Networks[J]. Journal of Computer Science and Technology, 2016, 31(4): 759-775. DOI: 10.1007/s11390-016-1661-3
    [4]Sheng Zhang, Zhu-Zhong Qian, Jie Wu, Sang-Lu Lu. Service-Oriented Resource Allocation in Clouds: Pursuing Flexibility and Efficiency[J]. Journal of Computer Science and Technology, 2015, 30(2): 421-436. DOI: 10.1007/s11390-015-1533-2
    [5]Li Chen, Baochun Li, Bo Li. Allocating Bandwidth in Datacenter Networks: A Survey[J]. Journal of Computer Science and Technology, 2014, 29(5): 910-917. DOI: 10.1007/s11390-014-1478-x
    [6]Lun-Yao Wang, Zhu-Fei Chu, Yin-Shui Xia. Low Power State Assignment Algorithm for FSMs Considering Peak Current Optimization[J]. Journal of Computer Science and Technology, 2013, 28(6): 1054-1062. DOI: 10.1007/s11390-013-1397-2
    [7]Wei Mi, Xiao-Bing Feng, Yao-Cang Jia, Li Chen, Jing-Ling Xue. PARBLO: Page-Allocation-Based DRAM Row Buffer Locality Optimization[J]. Journal of Computer Science and Technology, 2009, 24(6): 1086-1097.
    [8]Tian Zengping, Wang Yujun, Qu Yunyao, Shi Baile. On the Expressive Power of F-Logic Language[J]. Journal of Computer Science and Technology, 1997, 12(6): 510-519.
    [9]Benjamin HAO, David PEARSON, Richard ZIPPEL. Global Register Allocation for SIMD Multiprocessors[J]. Journal of Computer Science and Technology, 1996, 11(3): 222-236.
    [10]Lu Weiming. Two Algorithms for Variable Allocation in an Interpreted Scheme[J]. Journal of Computer Science and Technology, 1987, 2(2): 133-144.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (36) PDF downloads (3019) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return