Managing interference in a network of macrocells underlaid with femtocells presents an important, yet challenging problem. A majority of spatial (frequency time) reuse based approaches partition the users based on coloring the interference graph, which is shown to be suboptimal. Some spatial time reuse based approaches schedule the maximal independent sets (MISs) in a cyclic, (weighted) round-robin fashion, which is inefficient for delay-sensitive applications. Our proposed policies schedule the MISs in a non-cyclic fashion, which aim to optimize any given network performance criterion for delay-sensitive applications while fulfilling minimum throughput requirements of the users. Importantly, we do not take the interference graph as given as in existing works; we propose an optimal construction of the interference graph. We prove that under certain conditions, the proposed policy achieves the optimal network performance. For large networks, we propose a low-complexity algorithm for computing the proposed policy. We show that the policy computed achieves a constant competitive ratio (with respect to the optimal network performance), which is independent of the network size, under wide range of deployment scenarios. The policy can be implemented in a decentralized manner by the users. Compared to the existing policies, our proposed policies can achieve improvement of up to 130 in large-scale deployments.
Some existing works mitigate strong interference by letting different subsets of UEs to transmit in different time slots (spatial time reuse) @cite_30 @cite_29 @cite_0 @cite_40 @cite_41 @cite_15 @cite_33 @cite_21 @cite_13 or in different frequency channels (spatial frequency reuse) @cite_6 @cite_16 @cite_8 @cite_3 @cite_7 @cite_12 @cite_23 . Specifically, they partition UEs into disjoint subsets such that the UEs in the same subset do not interfere with each other. Given the same partition of the UEs, the policies based on spatial time reuse and those based on spatial frequency reuse are equivalent. Hence, we focus on policies based on spatial time reuse hereafter.
@cite_30 @cite_33 @cite_7 @cite_8 @cite_41 @cite_29 @cite_21 @cite_6 @cite_3 @cite_0 @cite_40 @cite_23 @cite_15 @cite_16 @cite_13 @cite_12
2129153304 2045567371 2148562694 2097395379 2127242306 2107505399 2149151217 2106643974 2949343062 1978180069 2157709134 1970103089 2076855206 1997341747 2635604129 2044301459 2162417209 2060243821 2128192883 2079587612
We address interference avoidance by resource partitioning in densely deployed femtocell networks. The main objective is to protect user equipments (UEs) that are located near the cell boundary of two or more femtocells from detrimental downlink interference. The available frequency bands are divided into subbands that are distributed among femtocells in a way that directly adjacent cells do not occupy the same subbands. For this purpose, a novel centrally controlled resource partitioning method is developed based on graph coloring that assigns subbands in terms of resource efficiency. The proposed algorithm strikes a balance between interference protection and spatial frequency reuse of subbands, and is well suited for randomly deployed wireless networks. System-level simulations reveal that cell edge capacities are significantly boosted without causing a degradation in average system throughput. The enormous success of advanced wireless devices is pushing the demand for higher wireless data rates. Denser spectrum reuse through the deployment of more access points (APs) per square mile has the potential to successfully meet such demand. In principle, distributed multiuser multiple-input-multiple-output (MU-MIMO) provides the best approach to infrastructure density increase since several access points are connected to a central server and operate as a large distributed multiantenna access point. This ensures that all transmitted signal power serves the purpose of data transmission, rather than creating interference. In practice, however, a number of implementation difficulties must be addressed, the most significant of which is aligning the phases of all jointly coordinated APs. In this paper, we propose AirSync, a novel scheme that provides timing and phase synchronization accurate enough to enable distributed MU-MIMO. AirSync detects the slot boundary such that all APs are time-synchronous within a cyclic prefix (CP) of the orthogonal frequency-division multiplexing (OFDM) modulation and predicts the instantaneous carrier phase correction along the transmit slot such that all transmitters maintain their coherence, which is necessary for multiuser beamforming. We have implemented AirSync as a digital circuit in the field programmable gate array (FPGA) of the WARP radio platform. Our experimental testbed, comprising four APs and four clients, shows that AirSync is able to achieve timing synchronization within the OFDM CP and carrier phase coherence within a few degrees. For the purpose of demonstration, we have implemented two MU-MIMO precoding schemes, Zero-Forcing Beamforming (ZFBF) and Tomlinson-Harashima Precoding (THP). In both cases, our system approaches the theoretical optimal multiplexing gains. We also discuss aspects related to the MAC and multiuser scheduling design, in relation to the distributed MU-MIMO architecture. To the best of our knowledge, AirSync offers the first realization of the full distributed MU-MIMO multiplexing gain, namely the ability to increase the number of active wireless clients per time-frequency slot linearly with the number of jointly coordinated APs, without reducing the per client rate. This paper considers the joint optimization of frequency reuse and base-station (BS) bias for user association in downlink heterogeneous networks for load balancing and intercell interference management. To make the analysis tractable, we assume that BSs are randomly deployed as point processes in multiple tiers, where BSs in each tier have different transmission powers and spatial densities. A utility maximization framework is formulated based on the user coverage rate, which is a function of the different BS biases for user association and different frequency reuse factors across BS tiers. Compared to previous works where the bias levels are heuristically determined and full reuse is adopted, we quantitatively compute the optimal user association bias and obtain the closed-form solution of the optimal frequency reuse. Interestingly, we find that the optimal bias and the optimal reuse factor of each BS tier have an inversely proportional relationship. Further, we also propose an iterative method for optimizing these two factors. In contrast to system-level optimization solutions based on specific channel realization and network topology, our approach is off-line and is useful for deriving deployment insights. Numerical results show that optimizing user association and frequency reuse for multi-tier heterogeneous networks can effectively improve cell-edge user rate performance and utility. We investigate spatial interference statistics for multigigabit outdoor mesh networks operating in the unlicensed 60-GHz "millimeter (mm) wave" band. The links in such networks are highly directional: Because of the small carrier wavelength (an order of magnitude smaller than those for existing cellular and wireless local area networks), narrow beams are essential for overcoming higher path loss and can be implemented using compact electronically steerable antenna arrays. Directionality drastically reduces interference, but it also leads to "deafness," making implicit coordination using carrier sense infeasible. In this paper, we make a quantitative case for rethinking medium access control (MAC) design in such settings. Unlike existing MAC protocols for omnidirectional networks, where the focus is on interference management, we contend that MAC design for 60-GHz mesh networks can essentially ignore interference and must focus instead on the challenge of scheduling half-duplex transmissions with deaf neighbors. Our main contribution is an analytical framework for estimating the collision probability in such networks as a function of the antenna patterns and the density of simultaneously transmitting nodes. The numerical results from our interference analysis show that highly directional links can indeed be modeled as pseudowired, in that the collision probability is small even with a significant density of transmitters. Furthermore, simulation of a rudimentary directional slotted Aloha protocol shows that packet losses due to failed coordination are an order of magnitude higher than those due to collisions, confirming our analytical results and highlighting the need for more sophisticated coordination mechanisms. In CSMA CA-based, multi-hop, multi-rate wireless networks, spatial reuse can be increased by tuning the carrier-sensing threshold (Tcs) to reduce the carrier sense range (dcs). While reducing dcs enables more concurrent transmissions, the transmission quality suffers from the increased accumulative interference contributed by concurrent transmissions outside dcs. As a result, the data rate at which the transmission can sustain may decrease. How to balance the interplay of spatial reuse and transmission quality (and hence the sustainable data rate) so as to achieve high network capacity is thus an important issue. In this paper, we investigate this issue by extending Cali's model and devising an analytical model that characterizes the transmission activities as governed by IEEE 802.11 DCF in a single-channel, multi-rate, multi-hop wireless network. The systems throughput is derived as a function of Tcs, SINR, beta, and other PHY MAC systems parameters. We incorporate the effect of varying the degree of spatial reuse by tuning the Tcs. Based on the physical radio propagation model, we theoretically estimate the potential accumulated interference contributed by concurrent transmissions and the corresponding SINR. For a given SINR value, we then determine an appropriate data rate at which a transmission can sustain. To the best of our knowledge, this is perhaps the first effort that considers tuning of PHY characteristics (transmit power and data rates) and MAC parameters (contention backoff timer) jointly in an unified framework in order to optimize the overall network throughput. Analytical results indicate that the systems throughput is not a monotonically increasing decreasing function of Tcs, but instead exhibits transitional points where several possible choices of Tcs can be made. In addition, the network capacity can be further improved by choosing the backoff timer values appropriately. In multi-hop ad hoc networks, the efficiency of a medium access control protocol under heavy traffic load depends mainly on its ability to schedule a large number of simultaneous non-interfering transmissions. However, as each node has only a local view of the network, it is difficult to globally synchronize transmission times over the whole network. How does the lack of global coordination affect spatial reuse in multi-hop wireless networks? We show that in a de-centralized network the spatial reuse does not benefit from global clock synchronization. On the contrary, we demonstrate that non-slotted protocols using collision avoidance mechanisms can achieve a higher spatial reuse than the corresponding slotted protocols. By means of a simple backoff mechanism, one can thus favor the spontaneous emergence of spatially dense transmission schedules. The importance of spatial reuse in wireless ad hoc networks has been long recognized as a key to improving the network capacity. In this paper, we show that 1) in the case that the achievable channel rate follows the Shannon capacity, spatial reuse depends only on the ratio of the transmit power to the carrier sense threshold and 2) in the case that only a set of discrete data rates are available, as a control knob for sustaining achievable data rates, tuning the transmit power provides more sophisticated rate control over tuning the carrier sense threshold, provided that there is a sufficient number of power levels available. Based on the findings, we then propose a decentralized power and rate control algorithm to enable each node to adjust, based on its signal interference level, its transmit power and data rate. The transmit power is so determined that the transmitter can sustain a high data rate while keeping the adverse interference effect on the other neighboring concurrent transmissions minimal. Simulation results have shown that compared to existing carrier sense threshold tuning algorithms, the proposed power and rate control algorithm yields higher network capacity. Spatial reuse TDMA is an access scheme for multi-hop radio networks. The idea is to increase capacity by letting several radio terminals use the same time slot when possible. A time slot can be shared when the radio units are geographically separated such that small interference is obtained. STDMA schedules can assign transmission rights to nodes or alternatively assign transmission rights to links, i.e. transmitter receiver pairs. Here we compare these two methods and determine which one is preferable. We show that only the connectivity of the network and the input traffic load of the network is needed in order to determine whether node or link assignment is preferable. In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case is considered and the problem of constructing space-time block codes (STBCs) which optimally tradeoff rate and ML decoding complexity is posed. Recently, sufficient conditions for multi-group ML decodability have been provided in the literature and codes meeting these sufficient conditions were called Clifford Unitary Weight (CUW) STBCs. An algebraic framework based on extended Clifford algebras is proposed to study CUW STBCs and using this framework, the optimal tradeoff between rate and ML decoding complexity of CUW STBCs is obtained for few specific cases. Code constructions meeting this tradeoff optimally are also provided. The paper then focuses on multi-group ML decodable DSTBCs for application in synchronous wireless relay networks and three constructions of four-group ML decodable DSTBCs are provided. Finally, the OFDM based Alamouti space-time coded scheme proposed by Li-Xia for a 2 relay asynchronous relay network is extended to a more general transmission scheme that can achieve full asynchronous cooperative diversity for arbitrary number of relays. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Four-group decodable DSTBCs applicable in the proposed OFDM based transmission scheme are also given. Heterogeneous networks consisting of small cells (e.g. femtocells) are capable of achieving high capacity and improving indoor cellular coverage area, while the fractional frequency reuse (FFR) scheme has been proposed for upcoming and future cellular systems to improve spectral efficiency in cellular OFDM networks. In two-tier networks of macrocells layered with femtocells, the resource allocation will most likely be sharing the same licensed spectrum. In this paper, we formulate a simple femtocells resource allocation strategies that allows a femtocells base station (FBS) to allocate more resources (co-channel) in high usage areas such as commercial FBS (cFBS) and orthogonal resource allocation for randomly deployed home user FBS (hFBS). We analyze our strategy in a multi-cell systems using area spectral efficiency (ASE) in composite fading consisting of Nakagami-m fading, path-loss and log-normal shadowing. Analytical and simulation results show that our simple resource allocation strategies are able to reduce inter-tier interferences and to offer an improvement in the overall spectral efficiency of the two-tier systems. Spatial multiple access holds the promise to boost the capacity of wireless networks when an access point has multiple antennas. Due to the asynchronous and uncontrolled nature of wireless LANs, conventional MIMO technology does not work efficiently when concurrent transmissions from multiple stations are uncoordinated. In this paper, we present the design and implementation of a crosslayer system, called SAM, that addresses the challenges of enabling spatial multiple access for multiple devices in a random access network like WLAN. SAM uses a chain-decoding technique to reliably recover the channel parameters for each device, and iteratively decode concurrent frames with misaligned symbol timings and frequency offsets. We propose a new MAC protocol, called CCMA, to enable concurrent transmissions by different mobile stations while remaining backward compatible with 802.11. Finally, we implement the PHY and MAC layer of SAM using the Sora high-performance software radio platform. Our evaluation results under real wireless conditions show that SAM can improve network uplink throughput by 70 with two antennas over 802.11. The importance of spatial reuse in wireless ad-hoc networks has been long recognized as a key to improving the network capacity. One can increase the level of spatial reuse by either reducing the transmit power or increasing the carrier sense threshold (thereby reducing the carrier sense range). On the other hand, as the transmit power decreases or the carrier sense threshold increases, the SINR decreases as a result of the smaller received signal or the increased interference level. Consequently, the data rate sustained by each transmission may decrease. This leads naturally to the following questions:(1)How can the trade-off between the increased level of spatial reuse and the decreased data rate each node can sustain be quantified? In other words,is there an optimal range of transmit power carrier sense threshold in which the network capacity is maximized? (2)What is the relation between the transmit power and the carrier sense threshold.In this paper, we study both problems, and show that (i)in the case that the achievable channel rate follows the Shannon capacity, spatial reuse depends only on the ratio of the transmit power to the carrier sense threshold; and (ii) in the case that only a set of discrete data rates are available, tuning the transmit power offers several advantages that tuning the carrier sense threshold cannot, provided that there is a sufficient number of power levels available. Based on the findings, we then propose a decentralized power and rate control algorithm to enable each node to adjust, based on its signal interference level, its transmit power and data rate. The transmit power is so determined that the transmitter can sustain a high data rate, while keeping the adverse interference effect on the other neighboring concurrent transmissions minimal. Simulation results have shown that, as compared to existing carrier sense threshold tuning algorithms, the proposed power and rate control algorithm yields higher network capacity. In this paper, we consider the use of fractional frequency reuse (FFR) to mitigate inter-femtocell interference in multi-femtocell environments. The use of universal frequency reuse can be said optimum in terms of the ergodic system spectral efficiency. However, it may cause inter-femtocell interference near the cell edge, making it difficult to serve the whole cell coverage. To alleviate this problem, we adjust the frequency reuse factor with the aid of femtocell location information. The proposed scheme can provide reasonably high ergodic system spectral efficiency, while assuring a desired performance near the cell boundary. Simulation results show that the proposed scheme is quite effective in indoor environments such as residential or office buildings. We introduce a framework to study slotted Aloha with cooperative base stations. Assuming a geographic-proximity communication model, we propose several decoding algorithms with different degrees of base stations' cooperation (non-cooperative, spatial, temporal, and spatio-temporal). With spatial cooperation, neighboring base stations inform each other whenever they collect a user within their coverage overlap; temporal cooperation corresponds to (temporal) successive interference cancellation done locally at each station. We analyze the four decoding algorithms and establish several fundamental results. With all algorithms, the peak throughput (average number of decoded users per slot, across all base stations) increases linearly with the number of base stations. Further, temporal and spatio-temporal cooperations exhibit a threshold behavior with respect to the normalized load (number of users per station, per slot). There exists a positive load @math , such that, below @math , the decoding probability is asymptotically maximal possible, equal the probability that a user is heard by at least one base station; with non-cooperative decoding and spatial cooperation, we show that @math is zero. Finally, with spatio-temporal cooperation, we optimize the degree distribution according to which users transmit their packet replicas; the optimum is in general very different from the corresponding optimal distribution of the single-base station system. This paper characterizes the performance in terms of queueing stability of a network composed of multiple MIMO transmitter-receiver pairs taking into account the dynamic traffic pattern and the probing feedback cost. We adopt a centralized scheduling scheme that selects a number of active pairs in each time-slot. We consider that the transmitters apply interference alignment (IA) technique if two or more pairs are active, whereas in the special case where one pair is active point-to-point MIMO singular value decomposition (SVD) is used. We consider a time-division duplex (TDD) system where transmitters acquire their channel state information (CSI) by decoding the pilot sequences sent by the receivers. Since global CSI knowledge is required for IA, the transmitters have also to exchange their estimated CSIs over a backhaul of limited capacity (i.e. imperfect case). Under this setting, we characterize in this paper the stability region of the system under both the imperfect and perfect (i.e. unlimited backhaul) cases, then we examine the gap between these two resulting regions. Further, under each case we provide a centralized probing policy that achieves the max stability region. These stability regions and scheduling policies are given for the symmetric system, where all the path loss coefficients are equal to each other, as well as for the general system. For the symmetric system, we provide the conditions under which IA yields a queueing stability gain compared to SVD. Under the general system, the adopted scheduling policy is of a high computational complexity for moderate numbers of pairs, consequently we propose an approximate policy that has a reduced complexity but that achieves only a fraction of the system stability region. A characterization of this fraction is provided. In this paper we study the resource allocation problem for the multiuser orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) systems with proportional rate constraints. The mutual interference introduced by primary user (PU) and cognitive radio user (also referred to secondary user, SU) makes the optimization problem of CR systems more complex. Moreover, the interference introduced to PUs must be kept under a given threshold. In this paper, the highest achievable rate of each OFDM subchannel is calculated by jointly considering the channel gain and interference level. First, a subchannel is assigned to the SU with the highest achievable rate. The remaining subchannels are always allocated to the SU that suffers the severest unjustness. Second, an efficient bit allocation algorithm is developed to maximize the sum capacity, which is again based on the highest achievable rate of each subchannel. Finally, an adjustment procedure is designed to maintain proportional fairness. Simulation results show that the proposed algorithm maximizes the sum capacity while keeping the proportional rate constraints satisfied. The algorithm exhibits a good tradeoff between sum capacity maximization and proportional fairness. Furthermore, the proposed algorithm has lower complexity compared with other algorithms, rendering it promising for practical applications. Copyright © 2011 John Wiley & Sons, Ltd. (By jointly considering the channel gain and the interference level of the OFDM-based cognitive radio systems, the highest achievable rate of each subchannel can be calculated, which indicates the ability of carrying bits of the subchannel. Using the normalized cost index list, an efficient algorithm is proposed to maximize the sum capacity of the cognitive OFDM systems while keeping the proportional rate constraints satisfied.) 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. Multi-User MIMO promises to increase the spectral efficiency of next generation wireless systems and is currently being incorporated in future industry standards. Although a significant amount of research has focused on theoretical capacity analysis, little is known about the performance of such systems in practice. In this paper, we present the design and implementation of the first multi-user beamforming system and experimental framework for wireless LANs. Using extensive measurements in an indoor environment, we evaluate the impact of receiver separation distance, outdated channel information due to mobility and environmental variation, and the potential for increasing spatial reuse. For the measured indoor environment, our results reveal that two receivers achieve close to maximum performance with a minimum separation distance of a quarter of a wavelength. We also show that the required channel information update rate is dependent on environmental variation and user mobility as well as a per-link SNR requirement. Assuming that a link can tolerate an SNR decrease of 3 dB, the required channel update rate is equal to 100 and 10 ms for non-mobile receivers and mobile receivers with a pedestrian speed of 3 mph respectively. Our results also show that spatial reuse can be increased by efficiently eliminating interference at any desired location; however, this may come at the expense of a significant drop in the quality of the served users. The capacity and robustness of cellular MIMO systems is very sensitive to other-cell interference which will in practice necessitate network level interference reduction strategies. As an alternative to traditional static frequency reuse patterns, this paper investigates intercell scheduling among neighboring base stations. We show analytically that cooperatively scheduled transmission, which is well within the capability of present systems, can achieve an expanded multiuser diversity gain in terms of ergodic capacity as well as almost the same amount of interference reduction as conventional frequency reuse. This capacity gain over conventional frequency reuse is O (M t square-root of log Ns) for dirty paper coding and O (min (Mr, Mt) square-root of log Ns) for time division, where Ns is the number of cooperating base stations employing opportunistic scheduling in an M t x M r MIMO system. From a theoretical standpoint, an interesting aspect of this analysis comes from an altered view of multiuser diversity in the context of a multi-cell system. Previously, multiuser diversity capacity gain has been known to grow as O(log log K), from selecting the maximum of K exponentially-distributed powers. Because multicell considerations such as the positions of the users, lognormal shadowing, and pathless affect the multiuser diversity gain, we find instead that the gain is O(square-root of 2logic K), from selecting the maximum of a compound Iognormal-exponential distribution. Finding the maximum of such a distribution is an additional contribution of the paper. We consider the interference management problem in a multicell MIMO heterogeneous network. Within each cell there is a large number of distributed micro pico base stations (BSs) that can be potentially coordinated for joint transmission. To reduce coordination overhead, we consider user-centric BS clustering so that each user is served by only a small number of (potentially overlapping) BSs. Thus, given the channel state information, our objective is to jointly design the BS clustering and the linear beamformers for all BSs in the network. In this paper, we formulate this problem from a sparse optimization perspective, and propose an efficient algorithm that is based on iteratively solving a sequence of group LASSO problems. A novel feature of the proposed algorithm is that it performs BS clustering and beamformer design jointly rather than separately as is done in the existing approaches for partial coordinated transmission. Moreover, the cluster size can be controlled by adjusting a single penalty parameter in the nonsmooth regularized utility function. The convergence of the proposed algorithm (to a stationary solution) is guaranteed, and its effectiveness is demonstrated via extensive simulation.