Distributed drone base station positioning for emergency cellular networks using reinforcement learning

Due to the unpredictability of natural disasters, whenever a catastrophe happens, it is vital that not only emergency rescue teams are prepared, but also that there is a functional communication network infrastructure. Hence, in order to prevent additional losses of human lives, it is crucial that network operators are able to deploy an emergency infrastructure as fast as possible. In this sense, the deployment of an intelligent, mobile, and adaptable network, through the usage of drones—unmanned aerial vehicles—is being considered as one possible alternative for emergency situations. In this paper, an intelligent solution based on reinforcement learning is proposed in order to find the best position of multiple drone small cells (DSCs) in an emergency scenario. The proposed solution’s main goal is to maximize the amount of users covered by the system, while drones are limited by both backhaul and radio access network constraints. Results show that the proposed Q-learning solution largely outperforms all other approaches with respect to all metrics considered. Hence, intelligent DSCs are considered a good alternative in order to enable the rapid and efficient deployment of an emergency communication network

Emergency logistics for wildfire suppression based on forecasted disaster evolution

This paper aims to develop a two-layer emergency logistics system with a single depot and multiple demand sites for wildfire suppression and disaster relief. For the first layer, a fire propagation model is first built using both the flame-igniting attributes of wildfires and the factors affecting wildfire propagation and patterns. Second, based on the forecasted propagation behavior, the emergency levels of fire sites in terms of demand on suppression resources are evaluated and prioritized. For the second layer, considering the prioritized fire sites, the corresponding resource allocation problem and vehicle routing problem (VRP) are investigated and addressed. The former is approached using a model that can minimize the total forest loss (from multiple sites) and suppression costs incurred accordingly. This model is constructed and solved using principles of calculus. To address the latter, a multi-objective VRP model is developed to minimize both the travel time and cost of the resource delivery vehicles. A heuristic algorithm is designed to provide the associated solutions of the VRP model. As a result, this paper provides useful insights into effective wildfire suppression by rationalizing resources regarding different fire propagation rates. The supporting models can also be generalized and tailored to tackle logistics resource optimization issues in dynamic operational environments, particularly those sharing the same feature of single supply and multiple demands in logistics planning and operations (e.g., allocation of ambulances and police forces). © 2017 The Author(s

Planning UAV Activities for Efficient User Coverage in Disaster Areas

Climate changes brought about by global warming as well as man-made environmental changes are often the cause of sever natural disasters. ICT, which is itself responsible for global warming due to its high carbon footprint, can play a role in alleviating the consequences of such hazards by providing reliable, resilient means of communication during a disaster crisis. In this paper, we explore the provision of wireless coverage through UAVs (Unmanned Aerial Vehicles) to complement, or replace, the traditional communication infrastructure. The use of UAVs is indeed crucial in emergency scenarios, as they allow for the quick and easy deployment of micro and pico cellular base stations where needed. We characterize the movements of UAVs and define an optimization problem to determine the best UAV coverage that maximizes the user throughput, while maintaining fairness across the different parts of the geographical area that has been affected by the disaster. To evaluate our strategy, we simulate a flooding in San Francisco and the car traffic resulting from people seeking safety on higher ground

Complex network statistics to the design of fire breaks for the control of fire spreading

A computational approach for identifying efficient fuel breaks partitions for the containment of fire incidents in forests is proposed. The approach is based on the complex networks statistics, namely the centrality measures and cellular automata modeling. The efficiency of various centrality statistics, such as betweenness, closeness, Bonacich and eigenvalue centrality to select fuel breaks partitions vs. the random-based distribution is demonstrated. Two examples of increasing complexity are considered: (a) an artificial forest of randomly distributed density of vegetation, and (b) a patch from the area of Vesuvio, National Park of Campania, Italy. Both cases assume flat terrain and single type of vegetation. Simulation results over an ensemble of lattice realizations and runs show that the proposed approach appears very promising as it produces statistically significant better outcomes when compared to the random distribution approach

Optimal logistics scheduling with dynamic information in emergency response: case studies for humanitarian objectives

The mathematical model of infectious disease is a typical problem in mathematical modeling, and the common infectious disease models include the susceptible-infected (SI) model, the susceptible-infected-recovered model (SIR), the susceptible-infected-recovered-susceptible model (SIRS) and the susceptible-exposed-infected-recovered (SEIR) model. These models can be used to predict the impact of regional return to work after the epidemic. In this paper, we use the SEIR model to solve the dynamic medicine demand information in humanitarian relief phase. A multistage mixed integer programming model for the humanitarian logistics and transport resource is proposed. The objective functions of the model include delay cost and minimum running time in the time-space network. The model describes that how to distribute and deliver medicine resources from supply locations to demand locations with an efficient and lower-cost way through a transportation network. The linear programming problem is solved by the proposed Benders decomposition algorithm. Finally, we use two cases to calculate model and algorithm. The results of the case prove the validity of the model and algorithm

Multi-objective performance optimization of a probabilistic similarity/dissimilarity-based broadcasting scheme for mobile ad hoc networks in disaster response scenarios

Communications among crewmembers in rescue teams and among victims are crucial to relief the consequences and damages of a disaster situation. A common communication system for establishing real time communications between the elements (victims, crewmem-bers, people living in the vicinity of the disaster scenario, among others) involved in a disaster scenario is required. Ad hoc networks have been envisioned for years as a possible solution. They allow users to establish decentralized communications quickly and using common devices like mobile phones. Broadcasting is the main mechanism used to dissemi-nate information in all-to-all fashion in ad hoc networks. The objective of this paper is to optimize a broadcasting scheme based on similari-ty/dissimilarity coefficient designed for disaster response scenarios through a multi-objective optimization problem in which several per-formance metrics such as reachability, number of retransmissions and delay are optimized simultaneously