Abstract
Two adaptive dedicated channel allocation algorithms, namely dynamic dedicated channel partitioning ( ${D^2}CP$ ) and dynamic dedicated channel partitioning with cooperation ( ${D^2}CP{-}C$ ), were proposed in [1] to improve the system throughput of ultra-dense networks (UDN). However, due to the incorrect use of the geometric–arithmetic mean inequality theorem, the average system throughput could not be guaranteed to be optimal. In this letter, we study the proposed ${D^2}CP$ and ${D^2}CP{-}C$ algorithms in UDN and deduce the average system throughput. Consequently, we prove that the equal resource allocation strategy proposed in [1] is strictly not optimal.
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.
