An effective algorithm for access wireless network cost optimization
Weijie Yuan, S. Subramanian, Payam Maveddat · 2002
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.