Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2010, Vol. 27 ›› Issue (4): 530-537.DOI: 10.7523/j.issn.2095-6134.2010.4.015

• Research Articles • Previous Articles     Next Articles

Approximate algorithm for joint routing and scheduling in wireless relay networks

SUN Shao-Feng, WEI Guo   

  1. Wireless Information Network Laboratory, University of Science and Technology of China, Hefei 230027, China
  • Received:2009-12-02 Revised:2010-02-20 Online:2010-07-15

Abstract:

The problem of joint routing and scheduling in 802.16j based wireless relay networks is studied to minimize the traffic time. The routing problem is solved by linear programming method, and the traffic is allocated to links. A novel link scheduling algorithm based on shifting and switching is proposed. Theoretical analysis indicates that the performance of the proposed algorithm is within a factor of 1.5 of that of any optimal algorithm in the worst case. Simulation results show that with the proposed algorithm near-optimal performance can be effectively achieved.

Key words: wireless relay networks, routing, scheduling, approximate algorithm

CLC Number: