华南理工大学学报(自然科学版) ›› 2012, Vol. 40 ›› Issue (6): 22-28.

• 电子、通信与自动控制 • 上一篇    下一篇

基于无线随机接入代价函数的协作速率分配

刘娇蛟 曹燕   

  1. 华南理工大学 电子与信息学院,广东 广州 510640
  • 收稿日期:2011-12-26 修回日期:2012-03-12 出版日期:2012-06-25 发布日期:2012-05-03
  • 通信作者: 刘娇蛟(1976-) ,女,讲师,主要从事无线协作传输研究. E-mail:jjliu@scut.edu.cn
  • 作者简介:刘娇蛟(1976-) ,女,讲师,主要从事无线协作传输研究.
  • 基金资助:

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

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

中图分类号: