Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
