Eliminating the boundary effect of a large-scale personal communication service network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
IEEE Transactions on Parallel and Distributed Systems
Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
SIP Multicast-Based Mobile Quality-of-Service Support over Heterogeneous IP Multimedia Subsystems
IEEE Transactions on Mobile Computing
Delay aware link scheduling for multi-hop TDMA wireless networks
IEEE/ACM Transactions on Networking (TON)
An efficient scheduling algorithm for maximizing throughput in WiMAX mesh networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Fairness-aware radio resource management in downlink OFDMA cellular relay networks
IEEE Transactions on Wireless Communications
Channel Assignment for Multihop Cellular Networks: Minimum Delay
IEEE Transactions on Mobile Computing
A reversible hierarchical scheme for microcellular systems with overlaying macrocells
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A mobility management strategy for GPRS
IEEE Transactions on Wireless Communications
Repacking on demand for two-tier wireless local loop
IEEE Transactions on Wireless Communications
Broadband wireless access with WiMax/802.16: current performance benchmarks and future potential
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Performance modeling for mobile telephone networks
IEEE Network: The Magazine of Global Internetworking
Modeling VoIP Call Holding Times for Telecommunications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The IEEE 802.16j standard has been proposed to triumph over the shadow fading and path attenuation problems in IEEE 802.16e networks by employing the multihop relay (MR) technology. Taking path selection and spatial reuse into account, numerous dynamic/heuristic scheduling algorithms have been presented for MR networks. Unfortunately, although these scheduling schemes can achieve high efficiency of resource utilization, almost all of their low time complexities considerably rely on expensive operations and sophisticated data structures. To maintain the simplicity and low time complexity of fixed-assignment scheduling while guaranteeing high resource utilization, this paper proposes a repacking and borrowing-based resource scheduling algorithm, RBRS, for IEEE 802.16j MR networks. In the repacking phase, a connection that is served via a direct path can be handed off to a cooperative path to release a part of its allocated base station (BS) resources. Since BS resources are shared by all connections within the BS coverage, repacking can increase the amount of available BS resources to serve the connection attempts that arrive at relay stations (RSs) currently under resource starvation. To complement repacking and further enhance the performance of RBRS, borrowing is applied. In the borrowing phase, over-loaded RSs are capable of borrowing resources from under-loaded RSs, further improving the resource utilization. Our main contributions are twofold: (1) to the best of our knowledge, this paper is the first effort in the literature to investigate the performance enhancement of repacking and borrowing operations for MR networks (including IEEE 802.16j); (2) both analytic and simulation models are developed to validate against each other and to study the performance of RBRS. The simulation results indicate that RBRS requires a low computational time which is comparable to that of fixed-assignment scheduling. Furthermore, by increasing available BS resources and balancing RS resources, RBRS shows near-optimal system capacity and throughput performance at the same time.