无线多信道中继网络的中继选择性机会调度

赵传信1;3， 王汝传2;3， 黄海平2， 孙力娟2

doi:10.3969/j.issn.0255-8297.2011.04.002

应用科学学报 >

2011 , Vol. 29 >Issue 4: 340 - 346

DOI: https://doi.org/10.3969/j.issn.0255-8297.2011.04.002

通信工程

无线多信道中继网络的中继选择性机会调度

展开

1. 安徽师范大学数学计算机科学学院，安徽芜湖241000
2. 南京邮电大学计算机学院，南京210003
3. 苏州大学计算机科学与技术学院，江苏苏州215006

赵传信，博士生，研究方向：无线多跳网络，E-mail: zcxonline@126.com；王汝传，教授，博导，研究方向：计算机软件、计算机网络和网格、对等计算、信息安全、无线传感器网络、移动代理等，E-mail: wangrc@njupt.edu.cn

收稿日期: 2010-11-03

修回日期: 2011-04-24

网络出版日期: 2011-07-30

基金资助

国家自然科学基金(No.60973139, No.61003039, No.61003236)；江苏省科技支撑计划项目基金(No.BE2010197,
No.BE2010198)；国家和江苏省博士后基金(No.20100480048, No.20100471353, No.20100480701, No.1001006B)；江苏
高校科技创新计划项目基金(No.CX10B_197Z, No.CX10B-198Z, No.CX10B-199Z, No.CX10B-200Z )；安徽省高校自然科学
研究基金(No.KJ2011Z137)资助

收起

Opportunistic Scheduling with Relay Selection in Wireless Multi-channel Relay Network

Expand

1. College of Mathematics and Computer Sciences, Anhui Normal University, Wuhu 241000,
Anhui Province, China
2. College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
3. Institude of Computer Science and Technology, Soochow University, Suzhou 215006, Jiangsu Province, China

Received date: 2010-11-03

Revised date: 2011-04-24

Online published: 2011-07-30

Supported by

Fold

摘要

为了有效利用OFDMA网络中多点中继协作以提高系统吞吐量，提出了考虑中继选择的调度优化模型.模型以提高系统吞吐量和兼顾用户公平性为目的，以信道无干扰分配为约束条件来进行机会调度. 提出了从路径多样性和链路多样性角度设计新的机会调度算法，算法结合信道分配和中继选择建立用户最优路径，然后机会选择用户. 仿真结果表明了中继选择的机会调度可以明显提升网络吞吐量，也保障了用户公平性.

关键词： 协作中继；OFMDA；机会调度；中继选择

本文引用格式

赵传信1;3，王汝传2;3，黄海平2，孙力娟2 . 无线多信道中继网络的中继选择性机会调度[J]. 应用科学学报, 2011 , 29(4) : 340 -346 . DOI: 10.3969/j.issn.0255-8297.2011.04.002

Abstract

Abstract: In this paper we study scheduling for selecting multiple relay nodes in orthogonal frequency division
multiple access (OFDMA) relay network to enhance the system throughput. We propose an opportunistic
scheduling model with relay nodes selection. The aim is to compromise between system throughput and
user fairness with the constraint of channel assignment without interference. We propose two opportunistic
scheduling algorithms in view of route diversity and link diversity, which combine relay selection and channel
assignment to establish user route and optimally select user. Simulations show that the two algorithms can
improve network throughput significantly and ensure user fairness.

Key words： cooperative relaying; orthogonal frequency division multiple access (OFDMA); diversity schedule; relay node selection

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract