Anytime and anywhere network access can be provided by Unmanned Aerial Vehicles (UAV) with air-to-ground and air-to-air communications using directional antennas for targets located on the ground. Deploying these Unmanned Aerial Vehicles to cover targets is a complex problem since each target should be covered, while minimizing (i) the deployment cost and (ii) the UAV altitudes to ensure good communication quality. We also consider connectivity between the UAVs and a base station in order to collect and send information to the targets, which is not considered in many similar studies. In this paper, we provide an efficient optimal program to solve this problem and show the trade-off analysis due to conflicting objectives. We propose a fair trade-off optimal solution and also evaluate the cost of adding connectivity to the UAV deployment.
We propose a theoretical framework for maximizing the LoRaWAN capacity in terms of the number of end nodes, when they all have the same traffic generation process. The model optimally allocates the spreading factor to the nodes so that attenuation and collisions are optimized. We use an accurate propagation model considering Rayleigh channel, and we take into account physical capture and imperfect SF orthogonality while guaranteeing a given transmission success probability to each served node in the network. Numerical results show the effectiveness of our SF allocation policy. Our framework also quantifies the maximum capacity of single cell networks and the gain induced by multiplying the gateways on the covered area. We finally evaluate the impact of physical capture and imperfect SF orthogonality on the SF allocation and network performances.
International audienceSoftware Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility to the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. Indeed, the Ternary Content-Addressable Memory (TCAM) needed by SDN devices has smaller capacities than CAMs used in legacy hardware. In this paper, we investigate compression techniques to maximize the utility of SDN switches forwarding tables. We validate our algorithm, called MINNIE, with intensive simulations for well-known data center topologies, to study its efficiency and compression ratio for a large number of forwarding rules. Our results indicate that MINNIE scales well, being able to deal with around a million of different flows with less than 1000 forwarding entries per SDN switch, requiring negligible computation time. To assess the operational viability of MINNIE in real networks, we deployed a testbed able to emulate a k = 4 Fat-Tree data center topology. We demonstrate on the one hand, that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored, with no packet losses, nor detectable extra delays if routing lookups are done in the Application-Specific Integrated Circuits (ASICs). Hence, both simulations and experimental results suggest that MINNIE can be safely deployed in real networks, providing compression ratios between 70% and 99%
In this paper, we consider the problem of evaluating the capacity of a LoRaWAN cell. Previous analytical studies investigated LoRaWAN performance in terms of the Packet Delivery Ratio (PDR) given a number of devices around a gateway and its range. We improve the model for PDR by taking into consideration that the following two events are dependent: successful capture during a collision and successful frame decoding despite ambient noise. We consider a realistic traic model in which all devices generate packets with the same inter-transmission times corresponding to the duty cycle limitation at the highest SF, regardless of the distance to the gateway. Based on the developed model, we optimize the Spreading Factor (SF) boundaries to even out PDR throughout the cell. We validate the analytical results with simulations, compare our model with previous work, and experimentally validate the hypothesis of Rayleigh fading for the LoRa channel. The important conclusion from our results is that a LoRa cell can handle a relatively large number of devices. We also show that there is practically no inter-SF interference (cross interference between transmissions with diferent SFs): interference from higher SFs comes from nodes located farther away, so they face greater attenuation and thus, they do not interfere with lower SF nodes. CCS CONCEPTS• Networks → Network performance modeling; Very long-range networks; Sensor networks.
Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. In this paper, we investigate compression techniques to reduce the forwarding information base (FIB) of SDN switches. We validate our algorithm, called MINNIE, on a real testbed able to emulate a 20 switches fat tree architecture. We demonstrate that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of all new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored with a limited impact on the packet loss rate. We also evaluate the actual switching and reconfiguration times and the delay introduced by the communications with the controller.
Data collection is an important mechanism for wireless sensor networks to be viable. This paper addresses the Aerial Data Collection Problem (ADCP) from a set of mobile wireless sensors located on the ground, using a fleet of flying devices. The objective is i) to deploy a set of Unmanned Aerial Vehicles (UAVs) in a 3D space to cover and collect data from all the mobile wireless sensors at each time step through a ground-to-air communication, ii) to send these data to a central base station using multi-hop wireless air-to-air communications through the network of UAVs, iii) while minimizing the total deployment cost (communication and deployment) over time. The Aerial Data Collection Problem (ADCP) is a complex time and space coverage, and connectivity problem. We first present a mixed-integer linear program solving ADCP optimally for small instances. Then, we develop a second model solved by column generation for larger instances, with optimal or heuristic pricing programs. Results show that our approach provides very accurate solutions minimizing the data collection cost. Moreover, only a very small number of columns are generated throughout the resolution process, showing the efficiency of our approach.
Lifetime is the main issue of wireless sensors networks. Since the nodes are often placed in inaccessible places, the replacement of their battery is not an easy task. Moreover, the node maintenance is a costly and time consuming operation when the nodes are high in numbers. Energy harvesting technologies have recently been developed to replenish part or all of the required energy that allows a node to function. In this paper, we use dedicated chargers carried by drones that can fly over the network and transmit energy to the nodes using radio-frequency (RF) signals. We formulate and optimally solve the Optimal Drone Placement and Planning Problem (OD3P) by using a given number of flying drones, in order to efficiently recharge wireless sensor nodes. Unlike other works in the literature, we assume that the drones can trade altitude with coverage and recharge power, while each drone can move across different positions in the network to extend coverage. We present a linear program as well as a fast heuristic algorithm to meet the minimum energy demands of the nodes in the shortest possible amount of time. Our simulation results show the effectiveness of our approaches for network scenarios with up to 50 sensors and a 50 × 50m terrain size.
In this work, we address the optimization problem of covering a set of mobile sensors with a fleet of flying devices. The goal is to deploy a connected set of Unmanned Aerial Vehicles (UAVs) continuously monitoring the mobile sensors and reporting information to a fixed base station for efficient data collection. We propose an effective optimization model reducing the number of variables of the problem and solved using column generation. Results show that our model is tractable for large topologies with several hundreds of possible 3D locations for the UAVs deployment and provides integer solutions with the generated columns very close to the optimum. Moreover, the deployment changes among time remains low in terms of number of UAVs and cost, to maintain connectivity and minimize the data collection delay to the base station.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
334 Leonard St
Brooklyn, NY 11211
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.