Portal de Periódicos da CAPES

Repeater Coordination Using Optimism Algorithm

2011; Elsevier BV; Volume: 15; Linguagem: Inglês

10.1016/j.proeng.2011.08.530

1877-7058

Chungen Xu, Yuhang Dou, Hanlin Yang, Xing Sun,

Wireless Communication Networks Research

An optimization algorithm for repeater coordination is developed. Using a repeater with the system of CTCSS, much more low-power users can communicate with one another in situations where direct user-to-user contact would not be possible. Since the locations of these repeaters are arbitrary, the problem of repeater coordination in a circular flat area with minimum number of repeaters is difficult. But by using the completely seamless coverage theory and the hexagonal grid partition method, we can determine 14 optional repeater locations in two topological structures. Considering the necessary constraint conditions, we transfer this problem into the optimization planning problem.