scispace - formally typeset
Proceedings ArticleDOI

Providing full connectivity in large ad-hoc networks by dynamic placement of aerial platforms

Reads0
Chats0
TLDR
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 that are designed to work with existing MANET routing protocols are described.
Abstract
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.

read more

Citations
More filters
Journal ArticleDOI

Unmanned aerial vehicle-aided communications system for disaster recovery

TL;DR: The results of the field tests and the simulation studies show that the proposed system can be successfully used in case of disasters to establish an emergency communications system.
Journal ArticleDOI

Coordination Between Unmanned Aerial and Ground Vehicles: A Taxonomy and Optimization Perspective

TL;DR: It is shown how different types of UAGVSs can be built to realize the goal of a common task, that is target tracking, and how optimization problems can be formulated for a UAG VS to perform specific tasks.
Journal ArticleDOI

Unmanned air/ground vehicles heterogeneous cooperative techniques: Current status and prospects

TL;DR: Key issues in multiple unmanned air/ground vehicles heterogeneous cooperation, including heterogeneous flocking, formation control, formation stability, network control, and actual applications are focused on.
Journal ArticleDOI

Resource Allocation and Basestation Placement in Downlink Cellular Networks Assisted by Multiple Wireless Powered UAVs

TL;DR: The proposed solution outperforms a baseline strategy leveraged from an existing work, especially with favorable channel condition and sufficient frequency resources, and can be always enhanced by deploying more UAVs due to non-negligible tradeoff between energy/communication sources and co-channel interference.
Journal ArticleDOI

Connectivity management in mobile ad hoc networks using particle swarm optimization

TL;DR: In this paper, the authors proposed a dynamic mobile ad hoc network (MANET) management system to improve network connectivity by using controlled network nodes, called agents, which have predefined wireless communication capabilities similar to the other nodes in the MANET, however their movements and thus their locations are dynamically determined to optimize network connectivity.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI

Greedy strikes back: improved facility location algorithms

TL;DR: It is shown that a simple greedy heuristic combined with the algorithm by Shmoys, Tardos, and Aardal, can be used to obtain an approximation guarantee of 2.408, and a lower bound of 1.463 is proved on the best possible approximation ratio.
Journal ArticleDOI

The Minimum Covering Sphere Problem

TL;DR: A finite decomposition algorithm, based on the Simplex method of quadratic programming, is developed for which computer storage requirements are independent of the number of points and computing time is approximately linear in the numberof points.
Related Papers (5)