skip to main content
article

Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm

Published: 01 November 2012 Publication History

Abstract

This paper considers the design of repeaters network in both flat and mountainous area. The main purpose is to design a network that is not only able to accommodate the communication need of all users in a certain area, but also with lower cost than previous design methods of the network. Considering the propagation and attenuation of radio signals, the problem can be transformed to search for best locations of centers of circles in order to reach maximum coverage percent in the whole area. Applying the Simulated Annealing Algorithm and Monte-Carlo Algorithm, numerical examples are given to show the potential of the proposed techniques. Compared with previous method, our proposed method shows its effectiveness.

References

[1]
M. Crowley, GB3SS Speyside Repeater User Guide, GB3SS Repeater User Guide, September 6, 2005.
[2]
Gary, G.D., The simulcasting technique: an approach to total-area radio coverage. IEEE Trans. Veh. Technol. v28. 117-125.
[3]
Toregas, C., Swaim, R. and ReVelle, C., The location of emergency service facilities. Oper. Res. v19 i6. 1363-1373.
[4]
Optimal solution of set covering/partitioning problems using dual heuristics. Manage. Sci. v36 i6. 674-688.
[5]
Beasley, J.E., Lagrangean heuristics for location problems. European Journal of Operational Research. v65 i3. 383-399.
[6]
Beasley, J.E. and Jornsten, K., Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. v58 i2. 293-300.
[7]
Beasley, J.E. and Chu, P.C., A genetic algorithm for the set covering problem. Eur. J. Oper. Res. v94 i2. 392-404.
[8]
Bautista, J. and Pereira, J., A GRASP algorithm to solve the unicost set covering problem. Comput. Oper. Res. v34 i10. 3162-3173.
[9]
Two-way mobile radio voice/data shared communications system. US. 4131849. 26 Dec 1978.
[10]
{http://en.wikipedia.org/wiki/Repeater}.
[11]
Postolache, O., Girão, P.M., Antunes, S.A. and Tavares, F.A., Global instrumentation network for broadband RF spectrum monitoring, Proceeding of the Conference on Telecommunications-ConfTele. Sta Maria da Feira, Portugal. v1. 1-4.
[12]
Xu, J., Chiu, S.Y. and Glover, F., Optimizing a ring-based private line telecommunication network using tabu search. Manage. Sci. v45 i3. 330-345.
[13]
Computer solutions to minimum cover problems. Oper. Res. v17 i3. 455-465.
[14]
M. Aourid, B. Kaminska, Neural networks for the set covering problem: an application to the test vector compaction, IEEE World Congress on Computational Intelligence Neural Networks, vol. 7, 1994, pp. 4645-4649.
[15]
X. Xu, J. Ma, An efficient simulated annealing algorithm for the minimum vertex cover problem, in: New Issues in Neurocomputing: 13th European Symposium on Artificial Neural Networks, vol. 69, 2006, pp. 913-916.
[16]
Hong, W., Traffic flow forecasting by seasonal SVR with chaotic simulated annealing algorithm. Neurocomputing. v74. 2096-2107.
[17]
A. Doucet, C. Andrieu, W. Fitzgerald, Bayesian filtering for hidden Markov models via Monte Carlo methods, Neural Networks for Signal Processing VIII, in: Proceedings of the 1998 IEEE Signal Processing Society Workshop, 1998, pp. 194-203.
[18]
Quah, K.H. and Quek, C.M., A novel Monte Carlo evaluative selection approach for objective feature selections. IEEE Trans. Neural Networ. v18. 431-448.
[19]
{http://www.dz3w.com/articlescn/rf/101392.html}.
[20]
{http://en.wikipedia.org/wiki/Channel_(communications)}.
[21]
Zhang, L., Cui, N., Liu, M. and Zhao, Y., Asynchronous filtering of discrete-time switched linear systems with average dwell time. IEEE Trans. Circ. Syst. I. v58 i5. 1109-1118.
[22]
Fault-tolerant control for nonlinear Markovian jump systems via proportional and derivative sliding mode observer technique. IEEE Trans. Circ. Syst. I. v58 i11. 2755-2764.
[23]
Zhang, L. and Lam, J., Necessary and sufficient conditions for analysis and synthesis of Markov jump linear systems with incomplete transition descriptions. IEEE Trans. Autom. Control. v55 i7. 1695-1701.
[24]
Liu, M., Ho, D.W.C. and Niu, Y., Stabilization of Markovian jump linear system over networks with random communication delay. Automatica. v45 i2. 416-421.

Cited By

View all
  1. Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Neurocomputing
    Neurocomputing  Volume 97, Issue
    November, 2012
    415 pages

    Publisher

    Elsevier Science Publishers B. V.

    Netherlands

    Publication History

    Published: 01 November 2012

    Author Tags

    1. Monte-Carlo Algorithm
    2. Repeaters network
    3. Simulated Annealing Algorithm
    4. Wireless communication

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media