Application of Simulated Annealing Algorithm to Optimization Deployment of Mobile Wireless Base Stations
Deployment of mobile wireless base (transceiver) stations (MBTS, vehicles) is expensive, with the wireless provider often offering a basic coverage of BTS in a normal communication data flow. However, during a special festival celebration or a popular outdoor concert in a big city, the quality of the wireless connection would be insufficient. In this situation, the wireless service providers always increase the number of MBTS to improve the density of nets and speed up the data flow of communication. This research intended to construct an integer programming (IP) model to minimize the density gap between wireless request and supply. The solver used was an SA algorithm. In order to validate, the proposed approach was compared to other famous heuristics, such as Random with Tabu and Ransom Search; and it was found that SA outperformed RS by an average of 18%. This result suggested a reduction of the density gap between wireless request and supply by 18% if an MBTS company’s allocation of transceiver stations is optimal, and an SA algorithm is used.
KeywordsCommunication Technology Simulated Annealing Algorithm Wireless Deployment Wireless Layout Mobile Base Transceiver Stations
Unable to display preview. Download preview PDF.
- 2.Cheng, P., Cao, X., Bai, J., Sun, Y.: On optimizing sensing quality with guaranteed coverage in autonomous mobile sensor network. Comp. Comm. (2011) (in press)Google Scholar
- 9.Hayashi, N., Ushio, T., Kanazawa, T.: Potential game theoretic approach to power-aware mobile sensor coverage problem. IEICE Trans. on Fundamentals of Ele. Comm. and Comp. Sci. E94A(3), 929–936 (2011)Google Scholar
- 19.Rosen, K.H.: Discrete math. and its App. McGraw Hill Press (2006)Google Scholar