Abstract
In this paper we first present a uniformity property that characterises optimal channel assignments for networks arranged as cellular or square grids. Then, we present optimal channel assignments for cellular and square grids; these assignments exhibit a high value for δ1 - the separation between channels assigned to adjacent stations. We prove an upper bound on δ1 for such optimal channel assignments. This upper bound is greater than the value of δ1 exhibited by our assignments. Based on empirical evidence, we conjecture that the value our assignments exhibit is a tight upper bound on δ1.
Sign-in/Register to access full text options 
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.
