Position optimization for Moving Access Points
Wireless communication systems have penetrated into almost all parts of human live. They have become essential and pervasive and do affect both personal and professional aspects of our lives. While most types of wireless networks, such as cellular mobile communication networks, have been exhaustively studied and optimized, in order to handle various situations, there are also contexts, which require efficient handling, e.g. moving hotspots, areas that have lost their infrastructure and areas with hard morphology. The motivation for this work is the efficient handling of these important contexts by the use of Moving Access Points (MAPs). MAPs are capable of autonomously moving and establishing a radio network in short time, with limited centralized management. The radio network provides wireless access to users (based on femtocell concept), is based on ad-hoc connectivity (self-adapting mesh network concept), and has some elements acting as gateways to a wide-area infrastructure. The main purpose of this paper is to find the optimal position of the MAPs i.e. the ones which require minimum movement and telecommunication cost. In order to achieve this goal, an innovative algorithm that combines the well known Simulated Annealing algorithm with the Ant Colony Optimization, is proposed. Finally, the operation of the algorithm is validated through two indicative scenarios, where it is compared to the single Simulated Annealing and the Brute Force method, respectively.