Journal of Shanghai Jiaotong University ›› 2011, Vol. 45 ›› Issue (03): 363-0367.

• Radiao Electronics, Telecommunication Technology • Previous Articles     Next Articles

An Algorithm of Optimizing Throughput in Multi-relay Cooperativ Networks

 LI  Qian-Wen, JIANG  Ling-Ge, HE  Chen, ZHAN  Ao   

  1. (School of Electronic, Information and Electrical Engineering, Shanghai Jiaotong University, Shanghai 200240, China)
  • Received:2009-12-16 Online:2011-03-30 Published:2011-03-30

Abstract:  This paper considers a wireless network with single sourcedestination pair and multiple potential relays, in which each node accumulates the received information to recover source information, then based on dynamic decode and for ward(DDF) protocol, a relay selection and transmission algorithm is proposed. Firstly, a corresponding mathematical problem of minimizing information’s transmission time is exactly formulated. Moreover, it is proved to be a nondeterministic polynomial complete (NPC ) problem. Secondly, a suboptimal distributed greedy algorithm is proposed, which synthetically considess the chosen relay’s uplink and downlink gains. Not only the chosen relay is ensured to estimate the source information easily but also the network terminal is guaranteed to receive more effective decoding information. Finally, simulation results show that the proposed algorithm almost achieves the optimal network performance. Meanwhile its distributed implement decreases system overhead efficiently.

Key words: relay, greedy algorithm, halfduplex,  dynamic decode and forward(DDF), nondeterministic polynomial complete (NPC) problem

CLC Number: