142,423 research outputs found

    Generalized Area Spectral Efficiency: An Effective Performance Metric for Green Wireless Communications

    Full text link
    Area spectral efficiency (ASE) was introduced as a metric to quantify the spectral utilization efficiency of cellular systems. Unlike other performance metrics, ASE takes into account the spatial property of cellular systems. In this paper, we generalize the concept of ASE to study arbitrary wireless transmissions. Specifically, we introduce the notion of affected area to characterize the spatial property of arbitrary wireless transmissions. Based on the definition of affected area, we define the performance metric, generalized area spectral efficiency (GASE), to quantify the spatial spectral utilization efficiency as well as the greenness of wireless transmissions. After illustrating its evaluation for point-to-point transmission, we analyze the GASE performance of several different transmission scenarios, including dual-hop relay transmission, three-node cooperative relay transmission and underlay cognitive radio transmission. We derive closed-form expressions for the GASE metric of each transmission scenario under Rayleigh fading environment whenever possible. Through mathematical analysis and numerical examples, we show that the GASE metric provides a new perspective on the design and optimization of wireless transmissions, especially on the transmitting power selection. We also show that introducing relay nodes can greatly improve the spatial utilization efficiency of wireless systems. We illustrate that the GASE metric can help optimize the deployment of underlay cognitive radio systems.Comment: 11 pages, 8 figures, accepted by TCo

    An efficient ant colony system based on receding horizon control for the aircraft arrival sequencing and scheduling problem

    Get PDF
    The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in air traffic control (ATC), which proves to be nondeterministic polynomial (NP) hard. This paper formulates the ASS problem in the form of a permutation problem and proposes a new solution framework that makes the first attempt at using an ant colony system (ACS) algorithm based on the receding horizon control (RHC) to solve it. The resultant RHC-improved ACS algorithm for the ASS problem (termed the RHC-ACS-ASS algorithm) is robust, effective, and efficient, not only due to that the ACS algorithm has a strong global search ability and has been proven to be suitable for these kinds of NP-hard problems but also due to that the RHC technique can divide the problem with receding time windows to reduce the computational burden and enhance the solution's quality. The RHC-ACS-ASS algorithm is extensively tested on the cases from the literatures and the cases randomly generated. Comprehensive investigations are also made for the evaluation of the influences of ACS and RHC parameters on the performance of the algorithm. Moreover, the proposed algorithm is further enhanced by using a two-opt exchange heuristic local search. Experimental results verify that the proposed RHC-ACS-ASS algorithm generally outperforms ordinary ACS without using the RHC technique and genetic algorithms (GAs) in solving the ASS problems and offers high robustness, effectiveness, and efficienc
    corecore