کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
407306 | 678137 | 2012 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm](/preview/png/407306.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 97, 15 November 2012, Pages 9–15
Journal: Neurocomputing - Volume 97, 15 November 2012, Pages 9–15
نویسندگان
Ya Cai, Yuanqing Xia, Li Dai, Chi Xiao, Jiaxiang Wu,