Abstract

We present new frequency allocation schemes for wireless networks and show that they outperform all other published work. Two categories of schemes are presented: 1) those purely based on measurements and 2) those that use site-specific knowledge, which refers to knowledge of building layouts, the locations and electrical properties of access points (APs), users, and physical objects. In our site-specific knowledge-based algorithms, a central network controller communicates with all APs and has site-specific knowledge so that it can <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">priori</i> predict the received power from any transmitter to any receiver. Optimal frequency assignments are based on predicted powers to minimize interference and maximize throughput. In our measurement-based algorithms, clients periodically report <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">in</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">situ</i> interference measurements to their associated APs; then, the APs' frequency allocations are adjusted based on the reported measurements. Unlike other work, we minimize interference seen by both <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">users</i> and <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">APs</i> , use a <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">physical</i> model rather than a <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">binary</i> model for interference, and mitigate the impact of rogue interference. Our algorithms consistently yield high throughput gains, irrespective of the network topology, AP activity level, number of APs, rogue interferers, and available channels. Our algorithms outperform the best published work by 18.5%, 97.6%, and 1180% for median, 25th percentile, and 15th percentile user throughputs, respectively.

Full Text
Paper version not known

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 call

Disclaimer: 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.