ISSN 0253-2778

CN 34-1054/N

Open AccessOpen Access JUSTC

Joint routing and scheduling interactively in wireless mesh backbone networks

Cite this:
  • Received Date: 20 May 2009
  • Rev Recd Date: 24 July 2009
  • Publish Date: 31 October 2009
  • The problem of jointing routing and scheduling in TDMA based wireless mesh backhaul networks is studied. The objective is to maximize the spectrum efficiency. A novel routing algorithm is proposed, which jointly considers the traffic of nodes, the average capacity of paths, and the interference of links. Based on the correlation of the maximal clique at the bottleneck area, a novel link scheduling algorithm for the traffic pattern of Internet access is proposed. The joint optimization problem is solved by interactive feedback between two modules. Simulation results show that the proposed algorithms can significantly improve the system performance under various interference scenarios and save energy for effective communication.
    The problem of jointing routing and scheduling in TDMA based wireless mesh backhaul networks is studied. The objective is to maximize the spectrum efficiency. A novel routing algorithm is proposed, which jointly considers the traffic of nodes, the average capacity of paths, and the interference of links. Based on the correlation of the maximal clique at the bottleneck area, a novel link scheduling algorithm for the traffic pattern of Internet access is proposed. The joint optimization problem is solved by interactive feedback between two modules. Simulation results show that the proposed algorithms can significantly improve the system performance under various interference scenarios and save energy for effective communication.
  • loading
  • 加载中

Catalog

    Article Metrics

    Article views (188) PDF downloads(120)
    Proportional views

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return