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

Ya Cai, Yuanqing Xia*, Li Dai, Chi Xiao, Jiaxiang Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)9-15
Number of pages7
JournalNeurocomputing
Volume97
DOIs
Publication statusPublished - 15 Nov 2012

Keywords

  • Monte-Carlo Algorithm
  • Repeaters network
  • Simulated Annealing Algorithm
  • Wireless communication

Fingerprint

Dive into the research topics of 'Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm'. Together they form a unique fingerprint.

Cite this