Optimal configuration of active and backup servers for augmented reality cooperative games

Interactive applications as online games and mobile devices have become more and more popular in recent years. From their combination, new and interesting cooperative services could be generated. For instance, gamers endowed with Augmented Reality (AR) visors connected as wireless nodes in an ad-hoc network, can interact with each other while immersed in the game. To enable this vision, we discuss here a hybrid architecture enabling game play in ad-hoc mode instead of the traditional client-server setting. In our architecture, one of the player nodes also acts as the server of the game, whereas other backup server nodes are ready to become active servers in case of disconnection of the network i.e. due to low energy level of the currently active server. This allows to have a longer gaming session before incurring in disconnections or energy exhaustion. In this context, the server election strategy with the aim of maximizing network lifetime is not so straightforward. To this end, we have hence analyzed this issue through a Mixed Integer Linear Programming (MILP) model and both numerical and simulation-based analysis shows that the backup servers solution fulfills its design objective

Multi-layer Utilization of Beamforming in Millimeter Wave MIMO Systems

mmWave frequencies ranging between (30-300GHz) have been considered the perfect solution to the scarcity of bandwidth in the traditional sub-6GHz band and to the ever increasing demand of many emerging applications in today\u27s era. 5G and beyond standards are all considering the mmWave as an essential part of there networks. Beamforming is one of the most important enabling technologies for the mmWave to compensate for the huge propagation lose of these frequencies compared to the sub-6GHz frequencies and to ensure better spatial and spectral utilization of the mmWave channel space. In this work, we tried to develop different techniques to improve the performance of the systems that use mmWave. In the physical layer, we suggested several hybrid beamforming architectures that both are relatively simple and spectrally efficient by achieving fully digital like spectral efficiency (bits/sec/Hz). For the mobility management, we derived the expected degradation that can affect the performance of a special type of beamforming that is called the Random Beamforming (RBF) and optimized the tunable parameters for such systems when working in different environments. Finally, in the networking layer, we first studied the effect of using mmWave frequencies on the routing performance comparing to the performance achieved when using sub-6 GHz frequencies. Then we developed a novel opportunistic routing protocol for Mobile Ad-Hoc Networks (MANET) that uses a modified version of the Random Beamforming (RBF) to achieve better end to end performance and to reduce the overall delay in delivering data from transmitting nodes to the intended receiving nodes. From all these designs and studies, we conclude that mmWave frequencies and their enabling technologies (i.e. Beamforming, massive MIMO, ...etc.) are indeed the future of wireless communicatons in a high demanding world of Internet of Things (IoT), Augmented Reality (AR), Virtual Reality (VR), and self driving cars

Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications

abstract: Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). Previous research has made a number of important contributions to the challenging pickup and delivery problem along different formulation or solution approaches. However, there are a number of modeling and algorithmic challenges for a large-scale deployment of a vehicle routing and scheduling algorithm, especially for regional networks with various road capacity and traffic delay constraints on freeway bottlenecks and signal timing on urban streets. The main thrust of this research is constructing hyper-networks to implicitly impose complicated constraints of a vehicle routing problem (VRP) into the model within the network construction. This research introduces a new methodology based on hyper-networks to solve the very important vehicle routing problem for the case of generic ride-sharing problem. Then, the idea of hyper-networks is applied for (1) solving the pickup and delivery problem with synchronized transfers, (2) computing resource hyper-prisms for sustainable transportation planning in the field of time-geography, and (3) providing an integrated framework that fully captures the interactions between supply and demand dimensions of travel to model the implications of advanced technologies and mobility services on traveler behavior.Dissertation/ThesisDoctoral Dissertation Civil, Environmental and Sustainable Engineering 201

Analysis of algorithms for online routing and scheduling in networks

We study situations in which an algorithm must make decisions about how to best route and schedule data transfer requests in a communication network before each transfer leaves its source. For some situations, such as those requiring quality of service guarantees, this is essential. For other situations, doing work in advance can simplify decisions in transit and increase the speed of the network. In order to reflect realistic scenarios, we require that our algorithms be online, or make their decisions without knowing future requests. We measure the efficiency of an online algorithm by its competitive ratio, which is the maximum ratio, over all request sequences, of the cost of the online algorithm\u27s solution to that of an optimal solution constructed by knowing all the requests in advance.;We identify and study two distinct variations of this general problem. In the first, data transfer requests are permanent virtual circuit requests in a circuit-switched network and the goal is to minimize the network congestion caused by the route assignment. In the second variation, data transfer requests are packets in a packet-switched network and the goal is to minimize the makespan of the schedule, or the time that the last packet reaches its destination. We present new lower bounds on the competitive ratio of any online algorithm with respect to both network congestion and makespan.;We consider two greedy online algorithms for permanent virtual circuit routing on arbitrary networks with unit capacity links, and prove both lower and upper bounds on their competitive ratios. While these greedy algorithms are not optimal, they can be expected to perform well in many circumstances and require less time to make a decision, when compared to a previously discovered asymptotically optimal online algorithm. For the online packet routing and scheduling problem, we consider an algorithm which simply assigns to each packet a priority based upon its arrival time. No packet is delayed by another packet with a lower priority. We analyze the competitive ratio of this algorithm on linear array, tree, and ring networks

Combinatorial Optimization

This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. Th