Dynamic Placement Algorithm for Multiple Classes of Mobile Base Stations in Public Safety Networks

Abstract

As new mobile base stations (mBSs) have been constantly developed with various capacities, mobile coverage, and mobility models, the level of heterogeneity in public safety networks (PSNs) has been increasing. Since disasters and emergencies require the ad hoc PSN deployments, dynamic mBS placement and movement algorithm is one of the most important decisions to provide the critical communication channels for first responders (FRs). In this paper, we propose a heterogeneous mBS placement algorithm in an ad hoc public safety network. We define different classes of mobile base stations that have varying performance characteristics and consider three different FRs mobility models. Our proposed algorithm applies the modern clustering technique to deal with the characteristics of different kinds of mBSs.