检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张欢[1] 王文博[1] 刘铁军[1] 彭木根[1]
机构地区:[1]北京邮电大学泛网无线通信教育部重点实验室,北京100876
出 处:《高技术通讯》2009年第8期805-810,共6页Chinese High Technology Letters
基 金:863计划(2006AA01Z257);国家自然科学基金(60572120;60602058)资助项目
摘 要:首先介绍了一种可用于两跳中继网络的时分模式帧结构,然后基于该帧结构提出了一种资源分配算法。该算法包括两个步骤:第一个步骤是第一个时隙上的动态资源分配,第二个步骤是基站与中继站之间的最优化功率分配。两跳中继网络中下行存在三种链路:'基站-中继'链路、'基站-用户'链路和'中继-用户'链路,在系统资源有限的条件下,通过所提算法为这三种链路分配相应的带宽和功率,可以使得系统的吞吐量最大。仿真结果表明所提算法能够有效地提高系统的吞吐量。A frame structure which can be used in two-hop relay networks is proposed first in this paper, and then a resource allocation algorithm is proposed based on it. The proposed algorithm consists of two steps. The first step is the dynamic resource allocation in the first time slot, and the second step is the optimal power allocation between the base station (BS) and the relay station (RS). There are three types of link for downlink in two-hop relay networks: "BS-RS" link, "BS-MS (mobile station)" link and "RS-MS"link. The system throughput can be maximized when using the proposed algorithm to allocate the bandwidth and power to these links under a sum system resource constraint. The simulation results show that the proposed algorithm can enhance the system throughput significantly.
分 类 号:TN925[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.137.102