Sciweavers

Share
GLOBECOM
2008
IEEE

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

8 years 8 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—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 ...
Senni Perumal, John S. Baras
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where GLOBECOM
Authors Senni Perumal, John S. Baras
Comments (0)
books