Green Networking in Cellular HetNets: A Unified Radio Resource Management Framework with Base Station ON/OFF Switching

In this paper, the problem of energy efficiency in cellular heterogeneous networks (HetNets) is investigated using radio resource and power management combined with the base station (BS) ON/OFF switching. The objective is to minimize the total power consumption of the network while satisfying the quality of service (QoS) requirements of each connected user. We consider the case of co-existing macrocell BS, small cell BSs, and private femtocell access points (FAPs). Three different network scenarios are investigated, depending on the status of the FAPs, i.e., HetNets without FAPs, HetNets with closed FAPs, and HetNets with semi-closed FAPs. A unified framework is proposed to simultaneously allocate spectrum resources to users in an energy efficient manner and switch off redundant small cell BSs. The high complexity dual decomposition technique is employed to achieve optimal solutions for the problem. A low complexity iterative algorithm is also proposed and its performances are compared to those of the optimal technique. The particularly interesting case of semi-closed FAPs, in which the FAPs accept to serve external users, achieves the highest energy efficiency due to increased degrees of freedom. In this paper, a cooperation scheme between FAPs and mobile operator is also investigated. The incentives for FAPs, e.g., renewable energy sharing and roaming prices, enabling cooperation are discussed to be considered as a useful guideline for inter-operator agreements.Comment: 15 pages, 9 Figures, IEEE Transactions on Vehicular Technology 201

Location models in the public sector

The past four decades have witnessed an explosive growth in the field of networkbased facility location modeling. This is not at all surprising since location policy is one of the most profitable areas of applied systems analysis in regional science and ample theoretical and applied challenges are offered. Location-allocation models seek the location of facilities and/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or several objectives generally related to the efficiency of the system or to the allocation of resources. This paper concerns the location of facilities or services in discrete space or networks, that are related to the public sector, such as emergency services (ambulances, fire stations, and police units), school systems and postal facilities. The paper is structured as follows: first, we will focus on public facility location models that use some type of coverage criterion, with special emphasis in emergency services. The second section will examine models based on the P-Median problem and some of the issues faced by planners when implementing this formulation in real world locational decisions. Finally, the last section will examine new trends in public sector facility location modeling.Location analysis, public facilities, covering models

Revisiting the Evolution and Application of Assignment Problem: A Brief Overview

The assignment problem (AP) is incredibly challenging that can model many real-life problems. This paper provides a limited review of the recent developments that have appeared in the literature, meaning of assignment problem as well as solving techniques and will provide a review on   a lot of research studies on different types of assignment problem taking place in present day real life situation in order to capture the variations in different types of assignment techniques. Keywords: Assignment problem, Quadratic Assignment, Vehicle Routing, Exact Algorithm, Bound, Heuristic etc

Hierarchical location-allocation models for congested systems

In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served customers are referred to higher level servers. In the first model, the objective is to find the minimum number of servers and their locations that will cover a given region with a distance or time standard. The second model is cast as a Maximal Covering Location formulation. A heuristic procedure is then presented together with computational experience. Finally, some extensions of these models that address other types of spatial configurations are offered.Hierarchical location, congestion, queueing