Planning Solar in Energy-managed Cellular Networks

There has been a lot of interest recently on the energy efficiency and environmental impact of wireless networks. Given that the base stations are the network elements that use most of this energy, much research has dealt with ways to reduce the energy used by the base stations by turning them off during periods of low load. In addition to this, installing a solar harvesting sys- tem composed of solar panels, batteries, charge con- trollers and inverters is another way to further reduce the network environmental impact and some research has been dealing with this for individual base stations. In this paper, we show that both techniques are tightly coupled. We propose a mathematical model that captures the synergy between solar installation over a network and the dynamic operation of energy-managed base stations. We study the interactions between the two methods for networks of hundreds of base stations and show that the order in which each method is intro- duced into the system does make a difference in terms of cost and performance. We also show that installing solar is not always the best solution even when the unit cost of the solar energy is smaller than the grid cost. We conclude that planning the solar installation and energy management of the base stations have to be done jointly

DEVELOPMENT OF A MIXED-FLOW OPTIMIZATION SYSTEM FOR EMERGENCY EVACUATION IN URBAN NETWORKS

In most metropolitan areas, an emergency evacuation may demand a potentially large number of evacuees to use transit systems or to walk over some distance to access their passenger cars. In the process of approaching designated pick-up points for evacuation, the massive number of pedestrians often incurs tremendous burden to vehicles in the roadway network. Hence, one critical issue in a multi-modal evacuation planning is the effective coordination of the vehicle and pedestrian flows by considering their complex interactions. The purpose of this research is to develop an integrated system that is capable of generating the optimal evacuation plan and reflecting the real-world network traffic conditions caused by the conflicts of these two types of flows. The first part of this research is an integer programming model designed to optimize the control plans for massive mixed pedestrian-vehicle flows within the evacuation zone. The proposed model, integrating the pedestrian and vehicle networks, can effectively account for their potential conflicts during the evacuation. The model can generate the optimal routing strategies to guide evacuees moving toward either their pick-up locations or parking areas and can also produce a responsive plan to accommodate the massive pedestrian movements. The second part of this research is a mixed-flow simulation tool that can capture the conflicts between pedestrians, between vehicles, and between pedestrians and vehicles in an evacuation network. The core logic of this simulation model is the Mixed-Cellular Automata (MCA) concept, which, with some embedded components, offers a realistic mechanism to reflect the competing and conflicting interactions between vehicle and pedestrian flows. This study is expected to yield the following contributions * Design of an effective framework for planning a multi-modal evacuation within metropolitan areas; * Development of an integrated mixed-flow optimization model that can overcome various modeling and computing difficulties in capturing the mixed-flow dynamics in urban network evacuation; * Construction and calibration of a new mixed-flow simulation model, based on the Cellular Automaton concept, to reflect various conflicting patterns between vehicle and pedestrian flows in an evacuation network

Modeling, Control, and Impact Analysis of The Next Generation Transportation System

This dissertation aims to develop a systematic tool designated for connected and autonomous vehicles, integrating the simulation of traffic dynamics, traffic control strategies, and impact analysis at the network level. The first part of the dissertation is devoted to the traffic flow modeling of connected vehicles. This task is the foundation step for transportation planning, optimized network design, efficient traffic control strategies, etc, of the next generation transportation system. Chapter 2 proposes a cell-based simulation approach to model the proactive driving behavior of connected vehicles. Firstly, a state variable of connected vehicle is introduced to track the trajectory of connected vehicles. Then the exit flow of cells containing connected vehicles is adjusted to simulate the proactive driving behavior, such that the traffic light is green when the connected vehicle arrives at the signalized intersection. Extensive numerical simulation results consistently show that the presence of connected vehicles contributes significantly to the smoothing of traffic flow and vehicular emission reductions in the network. Chapter 3 proposes an optimal estimation approach to calibrate connected vehicles\u27 car-following behavior in a mixed traffic environment. Particularly, the state-space system dynamics is captured by the simplified car-following model with disturbances, where the trajectory of non-connected vehicles are considered as unknown states and the trajectory of connected vehicles are considered as measurements with errors. Objective of the reformulation is to obtain an optimal estimation of states and model parameters simultaneously. It is shown that the customized state-space model is identifiable with the mild assumption that the disturbance covariance of the state update process is diagonal. Then a modified Expectation-Maximization (EM) algorithm based on Kalman smoother is developed to solve the optimal estimation problem. The second part of the dissertation is on traffic control strategies. This task drives the next generation transportation system to a better performance state in terms of safety, mobility, travel time saving, vehicular emission reduction, etc. Chapter 4 develops a novel reinforcement learning algorithm for the challenging coordinated signal control problem. Traffic signals are modeled as intelligent agents interacting with the stochastic traffic environment. The model is built on the framework of coordinated reinforcement learning. The Junction Tree Algorithm based reinforcement learning is proposed to obtain an exact inference of the best joint actions for all the coordinated intersections. The algorithm is implemented and tested with a network containing 18 signalized intersections from a microscopic traffic simulator. Chapter 5 develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only values in {-1, 0, 1}. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. Further, it shows that traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control. The third part of the dissertation moves on to the impact analysis of connected vehicles and autonomous vehicles at the network level. This task assesses the positive and negative impacts of the system and provides guidance on transportation planning, traffic control, transportation budget spending, etc. In this part, the impact of different penetration rates of connected vehicle and autonomous vehicles is revealed on the network efficiency of a transportation system. Chapter 6 sets out to model an efficient and fair transportation system accounting for both departure time choice and route choice of a general multi OD network within a dynamic traffic assignment environment. Firstly, a bi-level optimization formulation is introduced based on the link-based traffic flow model. The upper level of the formulation minimizes the total system travel time, whereas the lower level captures traffic flow propagation and the user equilibrium constraint. Then the bi-level formulation is relaxed to a linear programming formulation that produces a lower bound of an efficient and fair system state. An efficient iterative algorithm is proposed to obtain the exact solution. It is shown that the number of iterations is bounded, and the output traffic flow solution is efficient and fair. Finally, two numerical cases (including a single OD network and a multi-OD network) are conducted to demonstrate the performance of the algorithm. The results consistently show that the travel time of different departure rates of the same OD pair are identical and the algorithm converges within two iterations across all test scenarios

Performance analysis of channel assignment schemes for coordinated cognitive WLAN networks

Nowadays local wireless networks are very used by an elevated number of people and its use continues rising. This provokes an increase of the interference and as consequence, congestion in the non-licensed band of 2.4GHz, caused by the increase of users in a given zone and thus, the limitation of channels offered by this band. As a solution to this problem, in this project it is studied the possibility of using additional channels from licensed bands used for other radio-communications services. The use of these channels in the local network (named in this context as secondary user of this spectrum) is done in an opportunistic manner, when ever it does not provoke any interference to the users of the service which have the rights to use this spectrum (named primary users in this context), since these ones have priority to access these bands of the spectrum. As a first approximation to the solution of the assignment problem, it is studied the behaviour of a random channel assignment in a scenario with a certain density of local networks that can generate interference between them and where the availability of the primary channel for opportunistic use is not homogeneous. Later, stated the possibility of improving the level of interference even with a random channel assignment, there are proposed two channel assignment methods designed to have in concern the availability of primary channels. The first method is set out through the formulation of an Integer Linear Programming (ILP) problem, which allows obtaining an optimal solution but with an elevated execution time. The other method is an heuristic one based on obtaining a Minimum Spanning Tree (MST) on interference terms, which allows to obtain near-optimal solutions in less time of execution. In the project it is done a detailed comparison of these two methods to contrast the advantages of each one. Finally, there are identified some aspects of the implementation of these methods in a real scenario