J4 ›› 2013, Vol. 40 ›› Issue (3): 212-220.doi: 10.3969/j.issn.1001-2400.2013.03.032

• Original Articles • Previous Articles    

Maximizing system benefits and fast convergence relay selection  algorithms in multi-source multi-relay networks

HU Jie;ZHAO Zuoxi   

  1. (Engineering College, South China Agricultural Univ., Guangzhou  510642, China)
  • Received:2012-12-06 Online:2013-06-20 Published:2013-07-29
  • Contact: HU Jie E-mail:hjgz79@scau.edu.cn

Abstract:

Two kinds of distributed relay selection algorithm APARS and HARS are designed to achieve maximum system benefits with a fast convergence speed in multi-user multi-relay wireless networks. Based on auction mechanism, APARS is a kind of ascending price auction taken by users, while HARS is a hybrid auction of ascending price by users and descending price by relays; bids are set as the difference between maximum payoff and second largest payoff of bidders, and the basic price increment is introduced to ensure the convergence of the algorithms. Theoretical analysis and simulation results both prove that APARS with the 0 initial price and HARS with an arbitrary initial price can achieve near optimal system benefits, converge quickly and avoid a price war. When the number of users is larger than that of the relays, HARS is superior in convergence speed.

Key words: multi-source multi-relay, relay selection, price war

CLC Number: 

  • TN929