Advertisement

Application of Simulated Annealing Algorithm to Optimization Deployment of Mobile Wireless Base Stations

Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 169)

Abstract

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.

Keywords

Communication Technology Simulated Annealing Algorithm Wireless Deployment Wireless Layout Mobile Base Transceiver Stations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lambrou, T.P., Panayiotou, C.G.: A testbed for coverage control using mixed wireless sensor networks. J. Net. and Comp. App. 35(2), 527–537 (2012)CrossRefGoogle Scholar
  2. 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
  3. 3.
    Davoodi, M., Mohades, A.: Solving the constrained coverage problem. App. Soft Comp. 11(1), 963–969 (2011)CrossRefGoogle Scholar
  4. 4.
    Nesargi, S., Prakash, R.: Distributed wireless channel allocation in networks with mobile base stations. IEEE Trans. on Vehicular Tech. 51(6), 1407–1421 (2002)CrossRefGoogle Scholar
  5. 5.
    Chu, K., Lin, F.: Survivability and performance optimization of mobile wireless communication networks in the event of base station failure. Comps. & Ele. Engi. 32(1), 50–64 (2006)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Zhao, L., Yao, G., Mark, J.W.: Mobile positioning based on relaying capability of mobile stations in hybrid wireless networks. IEEE Proceedings-Commu. 153(5), 762–770 (2006)CrossRefGoogle Scholar
  7. 7.
    Esnaashari, M., Meybodi, M.R.: A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks. Comp. Net. 54(14), 2410–2438 (2010)MATHCrossRefGoogle Scholar
  8. 8.
    Qi, Y., Jarmuszewski, P., Zhou, Q.M., Certain, M., Chen, C.J.: An efficient TIS measurement technique based on RSSI for wireless mobile stations. IEEE Trans. on Instr. and Measure. 59(9), 2414–2419 (2010)CrossRefGoogle Scholar
  9. 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
  10. 10.
    Tynan, R., Muldoon, C., Hare, O., Grady, M.: Coordinated intelligent power management and the heterogeneous sensing coverage problem. Comp. J. 54(3), 490–502 (2011)CrossRefGoogle Scholar
  11. 11.
    Luo, J., Wang, D., Zhang, Q.: On the double mobility problem for water surface coverage with mobile sensor networks. IEEE Trans. on Para. and Distri. Sys. 23(1), 146–159 (2012)CrossRefGoogle Scholar
  12. 12.
    Vasan, A., Raju, K.S.: Comparative analysis of Simulated Annealing, Simulated Quenching and Genetic Algorithms for optimal reservoir operation. App. Soft Comp. 9(1), 274–281 (2009)CrossRefGoogle Scholar
  13. 13.
    Kirkpatrick, S., Gelatt, C.D.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Cerny, V.: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. J. Opti. Theory and App. 45, 41–51 (1985)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. E. J. Oper. Res. 149(2), 268–281 (2003)MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Saraiva, J.T., Pereira, M.L., Mendes, V.T., Sousa, J.C.: A Simulated Annealing based approach to solve the generator maintenance scheduling problem. Electric Power Sys. Res. 81(7), 1283–1291 (2011)CrossRefGoogle Scholar
  17. 17.
    Tavares, R.S., Martins, T.C., Tsuzuki, M.S.G.: Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning. Exp. Sys. W. App. 38(4), 2951–2965 (2011)CrossRefGoogle Scholar
  18. 18.
    Damodaran, P.: A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Exp. Sys. W. App. 39(1), 1451–1458 (2012)CrossRefGoogle Scholar
  19. 19.
    Rosen, K.H.: Discrete math. and its App. McGraw Hill Press (2006)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Information CenterNational Taiwan Normal UniversityTaipei CityRepublic of China
  2. 2.D-Link CorporationHsinchu CityRepublic of China

Personalised recommendations