Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation

  • Authors:
  • Antonio Capone;Giuliana Carello;Ilario Filippini;Stefano Gualandi;Federico Malucelli

  • Affiliations:
  • Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy

  • Venue:
  • Networks - Network Optimization (INOC 2007)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article presents a column generation approach to a resource allocation problem arising in managing Wireless Mesh Networks. The problem consists in routing the given demands over the network and to allocate time resource to pairs of nodes. Half-duplex constraints are taken into account together with the aggregate interference due to simultaneous transmissions, which affects the signal quality. Different problems are considered, according to the assumptions on the transmission power and rate. The resource allocation problem can be formulated as a Mixed Integer Linear Programming (MILP) problem and dealt with a column generation-based approach. The pricing problem, due to signal quality constraints, turns out to be computationally demanding. To tackle these difficulties, besides a classical mathematical programming approach, we have applied a hybrid column generation approach where the pricing subproblem is solved using Constraint Programming. Numerical results show that the two methods are comparable. The results of the column generation are then used to solve heuristically the problem. The obtained results provide very small gaps (between lower bounds and Heuristic solutions) for two of the three considered problems and reasonable gaps for the third problem. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010