On a Class of Covering Problems with Variable Capacities in Wireless Networks
We consider the problem of allocating clients to base stations in wireless networks. Two design decisions are the location of the base stations, and the power levels of the base stations. We model the interference due to the increased power usage resulting in greater serving radius, as capacities that are non-increasing with respect to the covering radius. We consider three models. In the first model the location of the base stations and the clients are fixed, and the problem is to determine the serving radius for each base station so as to serve a set of clients with maximum total profit subject to the capacity constraints of the base stations. In the second model, each client has an associated demand in addition to its profit. A fixed number of facilities have to be opened from a candidate set of locations. The goal is to serve clients so as to maximize the profit subject to the capacity constraints. In the third model the location and the serving radius of the base stations are to be determined. There are costs associated with opening the base stations, and the goal is to open a set of base stations of minimum total cost so as to serve the entire client demand subject to the capacity constraints at the base stations. We show that for the first model the problem is NP-complete even when there are only two choices for the serving radius, and the capacities are 1, 2. For the second model we give a 1/2-ε approximation algorithm. For the third model we give a column generation procedure for solving the standard linear programming model, and a randomized rounding procedure. We establish the efficacy of the column generation based rounding scheme on randomly generated instances.
KeywordsGreedy Algorithm Facility Location Capacity Constraint Knapsack Problem Covering Problem
Unable to display preview. Download preview PDF.
- 2.de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, ch. 5, 3rd edn. Springer (2008) ISBN: 978-3-540-77973-5Google Scholar
- 7.Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problem. In: SODA, pp. 611–620 (2006)Google Scholar
- 10.Holma, H., Toskala, A.: WCDMA for UMTS: HSPA Evolution and LTE, 4th edn. Wiley (2007) ISBN: 978-0470319338Google Scholar
- 12.Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, Revised edn. Wiley (1990) ISBN: 978-0471924203Google Scholar
- 14.Radwan, A., Hassanein, H.: Capacity enhancement in CDMA cellular networks using multi-hop communication. In: Proceedings of the 11th IEEE Symposium on Computers and Communications, June 26-29, pp. 832–837. IEEE (2006)Google Scholar
- 15.Schrijver, A. Combinatorial Optimization, first ed., vol. A, part II. Springer, ch. 21, pp. 337–377. ISBN: 978-3540443896 (2003)Google Scholar
- 16.Tam, Y.H., Hassanein, H.S., Akl, S.G., Benkoczi, R.: Optimal multi-hop cellular architecture for wireless communications. In: Proceedings of the 31st IEEE Conference on Local Computer Networks, pp. 738–745 (November 2006)Google Scholar
- 17.Vondrak, J.: Optimal approximation for the submodular welfare problem in value oracle model. In: STOC, pp. 67–74 (2008)Google Scholar