14,355 research outputs found

    Optimal channel allocation with dynamic power control in cellular networks

    Full text link
    Techniques for channel allocation in cellular networks have been an area of intense research interest for many years. An efficient channel allocation scheme can significantly reduce call-blocking and calldropping probabilities. Another important issue is to effectively manage the power requirements for communication. An efficient power control strategy leads to reduced power consumption and improved signal quality. In this paper, we present a novel integer linear program (ILP) formulation that jointly optimizes channel allocation and power control for incoming calls, based on the carrier-to-interference ratio (CIR). In our approach we use a hybrid channel assignment scheme, where an incoming call is admitted only if a suitable channel is found such that the CIR of all ongoing calls on that channel, as well as that of the new call, will be above a specified value. Our formulation also guarantees that the overall power requirement for the selected channel will be minimized as much as possible and that no ongoing calls will be dropped as a result of admitting the new call. We have run simulations on a benchmark 49 cell environment with 70 channels to investigate the effect of different parameters such as the desired CIR. The results indicate that our approach leads to significant improvements over existing techniques.Comment: 11 page

    Partially-Distributed Resource Allocation in Small-Cell Networks

    Full text link
    We propose a four-stage hierarchical resource allocation scheme for the downlink of a large-scale small-cell network in the context of orthogonal frequency-division multiple access (OFDMA). Since interference limits the capabilities of such networks, resource allocation and interference management are crucial. However, obtaining the globally optimum resource allocation is exponentially complex and mathematically intractable. Here, we develop a partially decentralized algorithm to obtain an effective solution. The three major advantages of our work are: 1) as opposed to a fixed resource allocation, we consider load demand at each access point (AP) when allocating spectrum; 2) to prevent overloaded APs, our scheme is dynamic in the sense that as the users move from one AP to the other, so do the allocated resources, if necessary, and such considerations generally result in huge computational complexity, which brings us to the third advantage: 3) we tackle complexity by introducing a hierarchical scheme comprising four phases: user association, load estimation, interference management via graph coloring, and scheduling. We provide mathematical analysis for the first three steps modeling the user and AP locations as Poisson point processes. Finally, we provide results of numerical simulations to illustrate the efficacy of our scheme.Comment: Accepted on May 15, 2014 for publication in the IEEE Transactions on Wireless Communication

    Spectrum Trading: An Abstracted Bibliography

    Full text link
    This document contains a bibliographic list of major papers on spectrum trading and their abstracts. The aim of the list is to offer researchers entering this field a fast panorama of the current literature. The list is continually updated on the webpage \url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers suggested for inclusion may be pointed out to the authors through e-mail (\textit{[email protected]})
    • …
    corecore