By Topic

Wireless Communications, IEEE Transactions on

Issue 7 • Date July 2011

Filter Results

Displaying Results 1 - 25 of 45
  • Table of contents

    Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • [Staff list]

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (48 KB)  
    Freely Available from IEEE
  • Adaptive Modulation for Opportunistic Decode-and-Forward Relaying

    Page(s): 2017 - 2022
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (369 KB) |  | HTML iconHTML  

    Orthogonal relay based cooperative communication enjoys distributed spatial diversity gain at the price of spectral efficiency. This work aims at improving the spectral efficiency for orthogonal opportunistic decode-and-forward (DF) relaying through employment of novel adaptive modulation scheme. The proposed scheme allows source and relay to transmit information in different modulation formats, while the MAP receiver is employed at destination for the diversity combining. Given the individual power constraint and target bit-error-rate (BER), the proposed scheme can significantly improve the spectral efficiency in comparison with the non-adaptive DF relaying and adaptive direct transmission. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ICI Suppression Scheme Based on the Correlative Coding for Alamouti SFBC-OFDM System with Phase Noise

    Page(s): 2023 - 2027
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (431 KB) |  | HTML iconHTML  

    Use of the space-frequency block coded orthogonal frequency division multiplexing (SFBC-OFDM) is advantageous in high-mobility broadband wireless system but it is sensitive to the intercarrier interference (ICI) caused by phase noise (PHN). In this letter, the effect of PHN for Alamouti SFBC-OFDM system is analyzed and correlative coding (CC) is used to reduce ICI. Based on the expression of the ICI power for the Alamouti SFBC-OFDM system with CC, the optimal CC coefficients that minimize the ICI power are obtained. Numerical results show that optimum CC can effectively increase the carrier-to-interference ratio (CIR) and improve the bit error rate (BER) performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blockwise Amplify-and-Forward Relaying Strategies for Multipoint-to-Multipoint MIMO Networks

    Page(s): 2028 - 2033
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (343 KB) |  | HTML iconHTML  

    In this letter, we consider a multipoint-to-multipoint transmission system which employs a single relay in wireless networks where all source, destination and relay nodes are equipped with multiple antennas. For amplify-and-forward relay systems, we propose new linear processing strategies for maximizing the sum rate performance by applying a blockwise relaying method combined with convex optimization techniques. To reduce a computational complexity, we first consider a zero-forcing based relay only optimization scheme, which generate a closed-form solution in a non-iterative fashion. In order to further improve the sum rate at low signal-to-noise ratio regimes, we additionally design an enhanced relay filter by exploiting the blockwise relaying method based on a minimum mean-square error criterion. Simulation results show that the proposed relay design strategies outperform the existing conventional schemes in terms of the sum rate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantifying Performance of Cooperative Diversity using the Sampling Property of a Delta Function

    Page(s): 2034 - 2039
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (259 KB) |  | HTML iconHTML  

    In this paper, we present a simple approach to evaluating the performance of amplify-and-forward cooperative diversity. The Q-function can be asymptotically reduced to a delta (impulse) function. We extend the result to cooperative networks in fading channels. The proposed approach introduces a simple technique to evaluate the performance of complex networks by sampling. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Likelihood Frequency Offset Estimation in Multiple Access Time-Hopping UWB

    Page(s): 2040 - 2045
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (341 KB) |  | HTML iconHTML  

    Frequency offset estimation for time-hopping (TH) ultra-wide-band (UWB) is addressed in the literature by relying on an AWGN assumption and by exploiting a periodic preamble appended to each packet. In this paper we generalize these techniques with two aims. First, we identify a solution which does not rely on any periodic structure, but can be implemented with a generic TH format. Second, we identify a solution which is robust to multiple access interference (MAI) by assuming a Gaussian mixture (GM) model for MAI. In fact, GMs have recently been identified as good descriptors of UWB interference, and they provide closed form and limited complexity results. With these ideas in mind, we build a data aided maximum likelihood (ML) estimator. The proposed ML solution shows quasi optimum performance in the Cramer-Rao bound sense, and proves to be robust in meaningful multiple user scenarios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Special Case of Multi-Way Relay Channel: When Beamforming is not Applicable

    Page(s): 2046 - 2051
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (338 KB) |  | HTML iconHTML  

    In this paper, we study a special case of multi-way relaying channel, to which traditional beamforming cannot achieve the best performance due to insufficient antennas. A new transmission protocol is proposed by aligning the messages from the same pair with the help of relay precoding. As a result, inter-pair interference can be avoided and intra-pair interference can be coped with by using network coding. Then analytic results, such as the ergodic sum rate and the outage probability, are developed for the proposed protocol. The numerical results are also provided to demonstrate the performance of our proposed scheme. To improve the diversity gain of the proposed scheme, an optimal scheme is also presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurement Results for Cognitive Spectrum Sharing Based on Cooperative Relaying

    Page(s): 2052 - 2057
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (493 KB) |  | HTML iconHTML  

    Although much research has been devoted to the theoretical performance evaluation of cognitive spectrum sharing (CSS) protocols, there are few measurement results available to demonstrate the practical performance of such protocols. In this paper, we have designed and developed a testbed for proof-of-concept demonstration and performance assessment of our proposed CSS protocol. The packet error rate (PER) for both primary and secondary systems are measured to quantify their respective performance. Spectrum access probability for the secondary system is also measured. Measurement results proved that the proposed CSS protocol is able to assist the primary system to achieve a better PER and at the same time allows spectrum access for the secondary system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Distributed Detection with Total Power Constraint in Large Wireless Sensor Networks

    Page(s): 2058 - 2062
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (214 KB) |  | HTML iconHTML  

    In practical problems of signal detection, it is quite common that the underlying noise distribution is not Gaussian and may vary in a wide range from light- to heavy-tailed forms. To design a robust fusion rule for distributed detection in wireless sensor networks, an asymptotic maximin approach is used by introducing weak signals in the canonical parallel fusion model. Explicit formulas for the detection and false alarm probabilities are derived. The analytic results are written out for the classes of nondegenerate, with a bounded variance and contaminated Gaussian noise distributions. Numerical and simulation results are obtained to justify robustness and asymptotic characteristics of the proposed fusion rule. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Allocation for Two-Way Opportunistic Amplify-and-Forward Relaying over Nakagami-m Channels

    Page(s): 2063 - 2068
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (366 KB) |  | HTML iconHTML  

    We are concerned with transmit power optimization for two-way opportunistic relaying (TWOR) systems in amplify-and-forward (AF) strategy over independent and non-identically distributed (i.ni.d.) Nakagami-m fading channels. With instantaneous squared channel strength known to source nodes before transmitting, we derive an optimum power allocation (OPA) scheme by solving an optimization problem of signal-to-noise ratio (SNR) balancing. While with only statistical channel knowledge, we propose a sub-OPA scheme that minimizes the high-SNR approximation of the system outage probability. Simulation results show that the proposed schemes significantly outperform the equal power allocation (EPA) scheme available in outage probability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outage-Optimal Power Allocation for Hybrid ARQ with Incremental Redundancy

    Page(s): 2069 - 2074
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (245 KB) |  | HTML iconHTML  

    We consider the optimization of power in incremental redundancy (IR) based hybrid automatic repeat request (HARQ) schemes when the maximum number of (re)transmissions is fixed. We formulate two optimization problems: (i) minimizing the packet drop probability (PDP) under a total average transmit power constraint, and (ii) minimizing the average transmit power under a fixed PDP constraint. We consider in detail the special case of only two allowed transmissions, and we prove that the two optimization problems are equivalent. For this special case, we also provide a sub-optimal root-finding solution and compare its performance with the optimal solution obtained through an exhaustive search. The results show that the optimal power allocation can provide significant gains over the equal power solution in terms of average transmit power spent. The performance of the proposed root-finding solution is practically the same as that of the optimal solution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Lower Bounding the Information Capacity of Amplify and Forward Wireless Relay Channels with Channel Estimation Errors

    Page(s): 2075 - 2079
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (180 KB) |  | HTML iconHTML  

    We formulate a capacity lower bound for the dual-hop wireless relay channel which employs an amplify-and-forward (AF) protocol at the relay node. In AF relaying, even when the fading channel in both hops is complex Gaussian distributed, the overall dual-hop channel is non-Gaussian. WPe highlight that there is a fundamental difference between Gaussian and non-Gaussian channels in terms of deriving their capacity lower bound. Specifically for non-Gaussian channels, the channel estimation error variance depends on the received pilot signal and is, in general, different from the average error variance. Whereas for Gaussian distributed channels, which have been predominantly studied in the literature, the channel estimation error variance conditioned on the observed pilot signal coincides with the average error variance. We provide an example using the AF dual-hop channel to exhibit the numerical difference between the true capacity lower bound and that obtained by using the average instead of the conditional error variance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Control and Channel Training for MIMO Channels: A DMT Perspective

    Page(s): 2080 - 2089
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (412 KB) |  | HTML iconHTML  

    The achievable diversity and multiplexing tradeoff (DMT) in MIMO fading channels with channel training is analyzed in this paper. We first consider a typical training scenario, where the transmitter transmits training symbols followed by data symbols, and the receiver performs channel estimation using the training symbols and then uses the imperfect channel estimates to decode the data symbols. From the DMT perspective, our results show that as long as the training power is equal to the data power, the obtained DMT result based on imperfect channel state information at receiver (CSIR) is the same as the original DMT result with perfect CSIR given in Zheng and Tse's seminal work . We extend the analysis to two-way training scenarios, with single and multiple training rounds. Our results show that two-way training together with power control can substantially improve the achievable diversity gain. Specifically, the achievable DMT with multiple training rounds can be described as a single straight line; while in the case of single training round, the achievable DMT is much lower and can be described as a single straight line or a collection of line segments, depending on the underlying training strategy and channel qualities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large-SNR Outage Analysis for the DF Relay Channel with Randomized Space-Time Block Coding

    Page(s): 2090 - 2100
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (473 KB) |  | HTML iconHTML  

    A simple half-duplex decode-and-forward relay channel is presented and analyzed. Relays access the common channel by means of a randomized linear-dispersion space-time block code which is flexible with respect to the number of relays and the coding rate α. When the dimensions of the linear dispersion matrices grow large, but with constant ratio α, the spectral efficiency of the system converges fast to a deterministic quantity. Simulation results show that this asymptotic value is an extremely good approximation of the finite reality, even for not-so-large codes. Then, this asymptotic spectral efficiency is used to characterize the outage probability in the high-SNR regime. With maximum-likelihood reception, the proposed randomized coding scheme is shown to achieve full diversity order L+1, with L the total number of relays. On the contrary, with the sub-optimal LMMSE receiver, relays add diversity to the system only if the coding rate is small enough. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearly Optimal Resource Allocation for Downlink OFDMA in 2-D Cellular Networks

    Page(s): 2101 - 2115
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (546 KB) |  | HTML iconHTML  

    In this paper, we propose a resource allocation algorithm for the downlink of sectorized two-dimensional (2-D) OFDMA cellular networks assuming statistical Channel State Information (CSI) and fractional frequency reuse. The proposed algorithm can be implemented in a distributed fashion without any central controlling units. Its performance is analyzed assuming fast fading Rayleigh channels and Gaussian distributed multicell interference. We show that the transmit power of this simple algorithm tends, as the number of users grows to infinity, to the same limit as the minimal power required to satisfy all users' rate requirements i.e., the proposed resource allocation algorithm is asymptotically optimal. As a byproduct of this asymptotic analysis, we characterize a relevant value of the reuse factor that only depends on an average state of the network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Subcarrier-Chunk Scheduling for Wireless OFDMA Systems

    Page(s): 2116 - 2123
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (715 KB) |  | HTML iconHTML  

    In practical orthogonal frequency division multiple-access (OFDMA) systems, subcarriers are grouped into chunks and a chunk of subcarriers is regarded as the minimum unit for subcarrier allocation. Given that the number of chunks and the number of subcarriers in each chunk are predefined, we consider the optimal chunk allocation that maximizes a utility function of average user rates for a wireless OFDMA system under different power control policies. The relevant optimization problems are formulated as non-convex mixed-integer programs; yet it is shown that the optimal schemes can be obtained through Lagrange dual-based gradient iterations with fast convergence and low computational complexity under conditions. Furthermore, novel low-complexity algorithms are developed to approach the optimal strategies without a-priori knowledge of statistics of the intended wireless channels. Numerical results are provided to gauge the performance of the proposed schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing Diversity-Enabled Power Profiles for Decode-and-Forward Wireless Relay Networks

    Page(s): 2124 - 2134
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (889 KB) |  | HTML iconHTML  

    Wireless relay networks have caught a lot of attention recently due to their potential to enhance performance by combating fading effects. Numerous strategies have been proposed in the literature to enable cooperative diversity. Among them, decode-and-forward protocol has been well adopted because of its low implementation complexity. However, most decode-and-forward based schemes assume that the relay node has perfect error detection or has feedback information from the destination. In this paper, we design power profiles at the relay which enable diversity at the destination without any feedback or coding assumptions at the relay and source. Furthermore, the diversity orders enabled by any general power profile are quantified. We then summarize necessary and sufficient conditions on the power profiles to guarantee full diversity at the destination. The theoretical analysis is corroborated with numerical simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Spectrum Sensing in Cognitive Radio Networks in the Presence of the Primary User Emulation Attack

    Page(s): 2135 - 2141
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (410 KB) |  | HTML iconHTML  

    In recent years, the security issues of the cognitive radio (CR) networks have drawn a lot of research attentions. Primary user emulation attack (PUEA), as one of common attacks, compromises the spectrum sensing, where a malicious user forestalls vacant channels by impersonating the primary user to prevent other secondary users from accessing the idle frequency bands. In this paper, we propose a new cooperative spectrum sensing scheme, considering the existence of PUEA in CR networks. In the proposed scheme, the sensing information of different secondary users is combined at a fusion center and the combining weights are optimized with the objective of maximizing the detection probability of available channels under the constraint of a required false alarm probability. We also investigate the impact of the channel estimation errors on the detection probability. Simulation and numerical results illustrate the effectiveness of the proposed scheme in cooperative spectrum sensing in the presence of PUEA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput-Delay-Reliability Tradeoff with ARQ in Wireless Ad Hoc Networks

    Page(s): 2142 - 2149
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (320 KB) |  | HTML iconHTML  

    Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) on each hop. The delay constraint is modeled by assuming that each packet is allowed at most D retransmissions end-to-end, and the reliability is defined as the probability that the packet is successfully decoded in at most D retransmissions. The throughput of the ad hoc network is characterized by the transmission capacity, where the transmission capacity is defined to be the maximum density of spatial transmissions that can be simultaneously supported in an ad hoc network under quality of service (QoS) constraints (maximum retransmissions and reliability). The transmission capacity captures the T-D-R tradeoff as it incorporates the dependence between the throughput, the maximum delay, and the reliability. Given an end-to-end retransmission constraint of D, the optimal allocation of the number of retransmissions allowed at each hop is derived that maximizes a lower bound on the transmission capacity. Optimizing over the number of hops, single hop transmission is shown to be optimal for maximizing a lower bound on the transmission capacity in the sparse network regime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Cooperative Localization of Wireless Sensor Networks with Convex Hull Constraint

    Page(s): 2150 - 2161
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (377 KB) |  | HTML iconHTML  

    Localization of wireless sensor networks is aimed at determining the positions of all sensors in a network, usually given a few connected anchor nodes' positions and certain relative measurements, where the latter could be pairwise distance measurements among directly connected neighbors as considered in this paper. In this paper we investigate neighborhood collaboration based distributed cooperative localization of all sensors in a particular network with the so-called `convex hull constraint': all nodes in such a network are either position-known anchors or sensors to be localized, and every sensor is inside the convex hull of its neighbors. For such a practically widely seen thus important class of localizable wireless sensor networks, we propose three iterative self-positioning algorithms, for independent implementation at all individual sensors of the considered network. Analysis and simulation study show that when iteratively running at all sensors of the considered network, i) the first one of our proposed iterative self-positioning algorithms leads to global convergence, where the converged solution is the correct positions of all sensors in the absence of measurement error, but might not be optimum if there exist measurement errors; ii) the second algorithm suffers from local convergence, but once correctly converged the converged solution would be the least squares (LS) solution; iii) the third algorithm, a combined version that switches between the former two algorithms' iterations efficiently and independently at individual sensors based on locally collected information, globally converges to the LS solution, as long as the measurement errors are sufficiently small such that the converged solution by the first algorithm is well inside the correctly converging area of the second algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity-Optimized Topology Control for MANETs with Cooperative Communications

    Page(s): 2162 - 2170
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (452 KB) |  | HTML iconHTML  

    Cooperative communications can significantly enhance transmission reliability and bandwidth efficiency in wireless networks. However, many upper layer aspects of cooperative communications merit further research. In this paper, we investigate its impacts on network topology and network capacity, which is determined by considerable aspects, such as physical layer capacity, interference, path length, etc. Since cooperative communications enhance physical layer capacity and relay selection impacts network topology directly, we present a Capacity-Optimized COoperative (COCO) topology control scheme for mobile ad hoc networks (MANETs) with cooperative communications. We consider both upper layer network capacity and physical layer relay selections in the proposed scheme. In addition, only the channel estimate, not the perfect channel status, is assumed to be known in our scheme. The topology control problem in MANETs is then formulated as a discrete stochastic optimization problem, which can be solved using a stochastic approximation approach. Further, an improved COCO is presented to reconfigure network topology to track the changing mobile environment dynamically. Simulation results are presented to show the effectiveness of the proposed scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind Multiuser Detection for Synchronous High Rate Space-Time Block Coded Transmission

    Page(s): 2171 - 2185
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (815 KB) |  | HTML iconHTML  

    We propose a new joint receiver for the blind detection of synchronous co-channel multiuser signals modulated with orthogonal space-time block codes (OSTBC). We exploit the algebraic structure of the orthogonal space-time block codes and the constellation feature of Quadrature Amplitude Modulation (QAM) signals to develop a blind zero-forcing (ZF) detector based on quadratic programming (QP) with desirable convergence properties. Focusing on high rate space-time block codes in synchronous co-channel multiuser systems, we propose a successive processing joint receiver based on the proposed blind detector with low computational complexity and fast convergence. For signal detection in single user MIMO systems, the proposed QP algorithm has performance similar to that of maximum-likelihood receiver with wireless channel information. Unlike many existing techniques, our new receiver is applicable to full-rate orthogonal space-time block codes such as the practically popular Alamouti code. Furthermore, our QP receiver for multiuser detection relaxes stringent conditions on the number of receive antennas of the multi-input-multi-output (MIMO) transceiver systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing Cost of Placement of Multi-Radio and Multi-Power-Level Access Points with Rate Adaptation in Indoor Environment

    Page(s): 2186 - 2195
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (581 KB) |  | HTML iconHTML  

    This paper addresses the AP placement problem in an indoor environment. Given a set of clients (end users) and their locations, each client has a traffic demand for Internet access. An AP can be equipped with one radio, dual radios, or even three radios (all for client access). Each AP can adjust its transmission power according to its local environment. The problem of our concern is to find out the optimal placement of APs such that the total cost of all APs is minimized, subject to the constraint that the traffic demand for each client can be fulfilled. The cost of an AP includes the cost of the AP box and the cost of radios installed on it. We proposed a heuristic algorithm that initially places an AP at each client location and gradually merges two neighboring APs into one AP until no further merging can be made due to bandwidth constraint. Simulation results show the heuristic algorithm can significantly reduce the total APs' cost, compared with other heuristic methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cognitive and Game-Theoretical Radio Resource Management for Autonomous Femtocells with QoS Guarantees

    Page(s): 2196 - 2206
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (541 KB) |  | HTML iconHTML  

    To successfully deploy femtocells overlaying the Macrocell as a two-tier that had been shown greatly benefiting communications quality in various manners, it requires to mitigate cross-tier interference between the Macrocell and femtocells, and intra-tier interference among femtocells, as well as to provide Quality-of-Service (QoS) guarantees. Existing solutions therefore assign orthogonal radio resources in frequency and spatial domains to each network, however, infeasible for dense femtocells deployments. It is also difficult to apply centralized resource managements facing challenges of scalability to the two-tier. Considering the infeasibility of imposing any modification on existing infrastructures, we leverage the cognitive radio technology to propose the cognitive radio resource management scheme for femtocells to mitigate cross-tier interference. Under such cognitive framework, a strategic game is further developed for the intra-tier interference mitigation. Through the concept of effective capacity, proposed radio resource management schemes are appropriately controlled to achieve required statistical delay guarantees while yielding an efficient radio resources utilization in femtocells. Performance evaluation results show that a considerable performance improvement can be generally achieved by our solution, as compared with that of state-of-the-art techniques, to facilitate the deployment of femtocells. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IEEE Transactions on Wireless Communications publishes high-quality manuscripts on advances in the state-of-the-art of wireless communications.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Jeff Andrews
Cullen Trust for Higher Education Endowed Professor of Engineering