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

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.

[1]  Peng Shi,et al.  Fault-Tolerant Control for Nonlinear Markovian Jump Systems via Proportional and Derivative Sliding Mode Observer Technique , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Wei-Chiang Hong,et al.  Traffic flow forecasting by seasonal SVR with chaotic simulated annealing algorithm , 2011, Neurocomputing.

[3]  Yugang Niu,et al.  Stabilization of Markovian jump linear system over networks with random communication delay , 2009, Autom..

[4]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[5]  Jiefeng Xu,et al.  Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search , 1999 .

[6]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[7]  G.D. Gray,et al.  The simulcasting technique: An approach to total-area radio coverage , 1979, IEEE Transactions on Vehicular Technology.

[8]  Jun Ma,et al.  An efficient simulated annealing algorithm for the minimum vertex cover problem , 2006, Neurocomputing.

[9]  Hiok Chai Quek,et al.  MCES: A Novel Monte Carlo Evaluative Selection Approach for Objective Feature Selections , 2007, IEEE Transactions on Neural Networks.

[10]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[11]  Ye Zhao,et al.  Asynchronous Filtering of Discrete-Time Switched Linear Systems With Average Dwell Time , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  R. Roth,et al.  Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..

[13]  James Lam,et al.  Necessary and Sufficient Conditions for Analysis and Synthesis of Markov Jump Linear Systems With Incomplete Transition Descriptions , 2010, IEEE Transactions on Automatic Control.

[14]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[15]  Christophe Andrieu,et al.  Bayesian filtering for hidden Markov models via Monte Carlo methods , 1998, Neural Networks for Signal Processing VIII. Proceedings of the 1998 IEEE Signal Processing Society Workshop (Cat. No.98TH8378).

[16]  Joaquín Bautista,et al.  A GRASP algorithm to solve the unicost set covering problem , 2007, Comput. Oper. Res..

[17]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[18]  M. Aourid,et al.  Neural networks for the set covering problem: an application to the test vector compaction , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).