Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-hoc Networks

Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-hoc Networks

Title : Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-hoc Networks
Authors :
Perumal, Senni
Baras, John, S.
Conference : IEEE Global Communications Conference (IEEE Globecom 2008) pp. 1-5
Date: November 30 - December 04, 2008

In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground networks by placing a minimum number of advantaged high flying Aerial Platforms (APs) as relay nodes at appropriate places. We formulate the problem of providing both connectivity and required capacity between disconnected ground clusters as a constrained clustering problem with complexity costs. The basic requirement for connectivity between the ground clusters and APs is converted into a summation form distortion function. The additional requirement for connectivity between the various APs is encoded by adding a new (summation form) constraint to the distortion function. In order to satisfy the required capacity out of each cluster to all other clusters, we add a cost function that depends on the assignment probabilities of the APs and relate the source (prior) probabilities of each cluster to the required capacity out of this cluster. The cost function produces solutions which are load balanced, i.e., the capacities supported through each AP are nearly equal. We solve the resultant clustering problem using Deterministic Annealing in order to find (near) globally optimal solutions for the minimum number and locations of the APs to establish full connectivity and provide required traffic capacity between disconnected clusters. We establish the validity of our algorithm by comparing it with optimal exhaustive search algorithms and show that our algorithm is near-optimal for the problem of establishing connectivity and satisfying capacity requirements between disconnected clusters.

Download Full Paper