2005 · 47 citations · 8 references
ComputingAerospace EngineeringComputer SystemsComputer NetworksUnmanned Aircraft SystemsWireless CommunicationsAd Hoc Mobile NetworksMobile Ad Hoc NetworksMobile NetworksRoutingRouting AlgorithmsRouting ProtocolsAd Hoc NetworksAerial Relay NetworksCommunication ArchitectureCommunication Network ArchitectureDynamic Communication NetworksDynamic PlacementPlacementRouting Protocols For Wireless Networks
In this paper we address the problem of providing full connectivity to disconnected ground MANET nodes by dynamically placing unmanned aerial vehicles (UAVs) to act as relay nodes. We provide a heuristic algorithm to find the minimal number of such aerial vehicles required to provide fall connectivity and find the corresponding locations for these aerial platforms (UAVs). We also track the movement of the ground nodes and update the location of the UAVs. We describe a communication framework that enables the ground nodes to communicate with its peer ground nodes as well as the UAVs that act as relay nodes. The communication architecture is designed to work with existing MANET routing protocols.
8
Greedy strikes back: Improved Facility Location Algorithms
1998 · 526 citations
The Minimum Covering Sphere Problem
D. Jack Elzinga, Donald W. Hearn · Management Science · 1972 · 184 citations