检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南理工大学电子与信息学院,广东广州510640
出 处:《华南理工大学学报(自然科学版)》2012年第6期22-28,共7页Journal of South China University of Technology(Natural Science Edition)
基 金:NSFC-广东省联合基金资助项目(U1035003);国家"973"计划项目子课题(2011CB707003)
摘 要:通过速率分配将单数据流拆分到多网络可实现高速协作传输,但对无线随机接入网而言,这相当于增加了竞争传输的用户数,会导致接入碰撞率和平均等待时间增大.为此,文中提出了一种基于无线随机接入代价函数的协作传输速率分配算法,用信道利用率建立的价格函数来描述接入时间代价,按照以最小接入代价换取最大吞吐量收益的原则对速率分配进行数学建模,并证明了该速率分配问题是一个凸优化问题,还根据拉格朗日乘数法推导出了显式解.仿真结果表明:该算法可根据网络状态和信道效率进行网络选择和资源调度,在接入时延和分配公平性上进行了折衷;同时可避免接入重载随机接入网,从而提高接入效率.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 above-mentioned 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.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222