Adaptive Resource Reuse Scheduling for Multihop Relay Wireless Network Based on Multicoloring.
IEEE Communications Letters 01/2008; 12:176-178. pp.176-178
[show abstract] [hide abstract]
ABSTRACT: Channel estimation in the presence of frequency offsets is developed for cooperative orthogonal frequency-division multiplexing (OFDM) systems. A two-time-slot cooperative channel estimation protocol is proposed. The source broadcasts the training sequence to the relays and the destination (first time slot), and the relays retransmit the training sequence (second time slot). Pilot designs for amplify-and-forward (AF) and decode-and-forward (DF) relays are derived. These designs eliminate interrelay interference (IRI), which occurs due to the simultaneous relay retransmissions, and minimize the mean square error (MSE). Consequently, the number of AF and DF relays is constrained to be less than lfloorN/(2L - 1)rfloor and lfloorN/Lrfloor, respectively, where N is the total number of subcarriers, L is the channel order, and lfloorarfloor is the maximum integer part of alpha. The pairwise error probability (PEP) of orthogonal space-time coding in cooperative OFDM due to both frequency offset and channel-estimation errors is also evaluated. The optimal power allocation ratio between the source and the relays to minimize the PEP is derived for AF and DF relays. When L < 16, DF relays outperform AF relays in terms of PEP. With L = 4 and 16 active relays, the gap is 9 dB for a frequency offset error variance of 10<sup>-3</sup>, and this gap increases to about 11.3 dB when the variance increases to 10<sup>-2</sup>.IEEE Transactions on Vehicular Technology 10/2009; · 1.92 Impact Factor
Article: Performance enhancement of repacking and borrowing mechanisms for IEEE 802.16j multihop resource scheduling.[show abstract] [hide abstract]
ABSTRACT: 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.Computer Networks 01/2011; 55:3886-3903. · 1.20 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.