|
|
An Algorithm of Optimizing Throughput in Multi-relay Cooperativ Networks |
LI Qian-Wen, JIANG Ling-Ge, HE Chen, ZHAN Ao |
(School of Electronic, Information and Electrical Engineering, Shanghai Jiaotong University, Shanghai 200240, China) |
|
|
Abstract This paper considers a wireless network with single sourcedestination 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 nondeterministic polynomial complete (NPC ) problem. Secondly, a suboptimal distributed greedy algorithm is proposed, which synthetically considess the chosen relay’s uplink and downlink 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.
|
Received: 16 December 2009
Published: 30 March 2011
|
|
|
|
|
No related articles found! |
|
|
|
|