Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks

Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base stations, feature high-bandwidth connection to the core network, while relay base stations are connected wirelessly. To reduce cost and increase flexibility, wireless backhauling is needed to connect both macro to relay as well as relay to relay base stations. The characteristics of mmWave communication mandates new paradigms for routing and scheduling. The paper investigates scheduling algorithms under different interference models. To showcase the scheduling methods, we study the maximum throughput fair scheduling problem. Yet the proposed algorithms can be easily extended to other problems. For a full-duplex network under the no interference model, we propose an efficient polynomial-time scheduling method, the {\em schedule-oriented optimization}. Further, we prove that the problem is NP-hard if we assume pairwise link interference model or half-duplex radios. Fractional weighted coloring based approximation algorithms are proposed for these NP-hard cases. Moreover, the approximation algorithm parallel data stream scheduling is proposed for the case of half-duplex network under the no interference model. It has better approximation ratio than the fractional weighted coloring based algorithms and even attains the optimal solution for the special case of uniform orthogonal backhaul networks.Comment: accepted for publish in the IEEE/ACM Transactions on Networkin

Vehicle Scheduling Optimization considering the Passenger Waiting Cost

In the operational planning process of public transport, the time a passenger spends on waiting is a very critical element for judging passenger service. Schedule synchronization is a useful strategy for reducing bus waiting time and improving service connectivity. This paper develops an extended vehicle scheduling model, taking into account the interests of passengers and operators in attaining optimization of timetable synchronization integrated with vehicle scheduling and considering the passenger waiting cost. Deficit functions at terminals are formulated. Deadheading (DH), shifting departure time (SDT), and network flow technique are used for vehicle scheduling with the consideration of passenger waiting times. An experimental study in Beijing is conducted and three important bus lines are selected as a regional bus network to demonstrate the methodology developed. Results show that both the fleet size of bus operators and the waiting cost of passengers are minimized. For example, the minimum fleet size can be reduced from 28 vehicles to 24 ones while the passenger times are less than 20 minutes in this multidepot network. Document type: Articl

Fundamental Limits of Energy-Efficient Resource Sharing, Power Control and Discontinuous Transmission

The achievable gains via power-optimal scheduling are investigated. Under the QoS constraint of a guaranteed link rate, the overall power consumed by a cellular BS is minimized. Available alternatives for the minimization of transmit power consumption are presented. The transmit power is derived for the two-user downlink situation. The analysis is extended to incorporate a BS power model (which maps transmit power to supply power consumption) and the use of DTX in a BS. Overall potential gains are evaluated by comparison of a conventional SOTA BS with one that employs DTX exclusively, a power control scheme and an optimal combined DTX and power control scheme. Fundamental limits of the achievable savings are found to be at 5.5 dB under low load and 2 dB under high load when comparing the SOTA consumption with optimal allocation under the chosen power model.Comment: 12 pages, ISBN 978-1-4577-0928-9. In Future Network & Mobile Summit (FutureNetw), 201

Design and Optimization of Scheduling and Non-orthogonal Multiple Access Algorithms with Imperfect Channel State Information

Non-orthogonal multiple access (NOMA) is a promising candidate technology for 5G cellular systems. In this paper, design and optimization of scheduling and NOMA algorithms is investigated. First, the impact of power allocation for NOMA systems with round-robin scheduling is analyzed. A statistic model is developed for network performance analysis of joint scheduling of spectrum resource and power for NOMA algorithms. Then, proportional fairness (PF) scheduling for NOMA algorithms is proposed with a two-step approach, with its objectives to ensure low computational complexity, high throughput, and user fairness. In the first step, an optimal power allocation strategy is developed with an objective maximizing weighted sum rate. In the second step, three fast and scalable scheduling and user pairing algorithms with QoS guarantee are proposed, in which only a few user pairs are checked for NOMA multiplex. The algorithms are extended to the cases with imperfect channel state estimation and more than two users being multiplexed over one resource block. Numerical results show that the proposed algorithms are significantly faster and more scalable than the existing algorithms, and can maintain a higher throughput gain than orthogonal multiple access

Port Rail Shunting Optimization Problems

openThe work focuses on a particular section of the intermodal chain of freight transportation, which is the link between rail and sea transportation modes and happens in the maritime port area. Among this field, the study deals with the management of rail operations, called here rail shunting operations, that have to be performed in the port area. Two optimization problems arises in this context. The first concerns the scheduling of the rail shunting operations, here called Port Rail Shunting Scheduling Problem (PRSSP). The second deals with the re-scheduling of the same operations in case of unpredictable events, here called Port Rail Shunting Re-Scheduling Problem (PRSRP). After a literature overview on the concerning studies, we concentrate on an innovative way to use the well known space-time networks as solution approach structure for both the above mentioned problems. The innovative structure has been called operation-time-space network and is deeply analyzed in a dedicated chapter. A network flow model based on an operation-time-space network for solving PRSSP has been developed. It has been tested using random generated instances providing good results. The same model has been extended in order to solve PRSRP and it has been tested giving good results as well. Finally, the models have been used to solve the real case of a port area located in Italy in order to test the applicability of the developed models to a real context. The tests have been executed using real data and provided good results confirming the possibility to apply the proposed approach in similar real problems.openXXXIII CICLO - LOGISTICA E TRASPORTIAsta, Veronic