Abstract
We present an effective backhaul transport optimization algorithm for wireless networks and its implementations. The algorithm minimizes transport cost of wireless networks by multiplexing and chaining base transceiver stations (BTSs) to their base station controllers (BSCs) or switches. The algorithm guarantee certain level of network redundancy while minimizing transport cost. We assume that the locations of BTSs and BSCs are given, and the amount of traffic from each BTS is known. Upon this information the algorithm can determine the optimum chaining strategy among BTSs, MUX locations and the number of MUXs at each location, and the optimum connectivity scheme between BTS and MUX locations such that transport cost of the network is minimized. The implementations indicate that our optimization algorithm can significantly reduce backhaul cost of wireless networks with certain guarantees in network redundancy.
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.
