Journal of South China University of Technology(Natural Science Edition) ›› 2012, Vol. 40 ›› Issue (6): 22-28.

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Rate Allocation Based on Pricing Function of Cooperative Access to Wireless Random Networks

Liu Jiao-jiao  Cao Yan   

  1. School of Electronic and Information Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China
  • Received:2011-12-26 Revised:2012-03-12 Online:2012-06-25 Published:2012-05-03
  • Contact: 刘娇蛟(1976-) ,女,讲师,主要从事无线协作传输研究. E-mail:jjliu@scut.edu.cn
  • About author:刘娇蛟(1976-) ,女,讲师,主要从事无线协作传输研究.
  • Supported by:

    NSFC-广东省联合基金资助项目( U1035003) ; 国家“973”计划项目子课题( 2011CB707003)

Abstract:

In wireless random access networks,high-speed cooperative transmission can be implemented via the rate allocation that distributes the traffic flow to heterogeneous networks. However,both the collision probability and the average waiting time may increase with the number of competitive hosts. In order to solve this problem,a rate allocation algorithm based on the pricing function of cooperative access to the network is proposed,which
describes the access time cost with the pricing function based on the channel utilization and models the rate allocation according to the principle of achieving the maximum total network payoff with the minimum access cost. The abovementioned rate allocation problem is proved to be a convex optimization one and the explicit solution to the problem is obtained according to the Lagrange multiplier method. Simulated results show that the proposed algorithm helps to select the access networks and distribute the traffic to networks according to both the network status and the channel
efficiency,and that it makes a trade-off between the access delay and the fairness. Moreover,it avoids the access to heavy-load random access networks,thus increasing the access efficiency.

Key words: cooperative communication, random access, rate allocation, pricing function

CLC Number: