Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Integer programming models for maximizing parallel transmissions in wireless networks

In English

Författare

  • Yuan Li
  • Michal Pioro

Summary, in English

In radio communications, a set of links that can transmit in parallel with a tolerable interference is called a compatible set. Finding a compatible set with maximum weighted revenue of the parallel transmissions is an important subproblem in wireless network management. For the subproblem, there are two basic approaches to express the signal to interference plus noise ratio (SINR) within integer programming, differing in the number of variables and the quality of the upper bound given by linear relaxations. To our knowledge, there is no systematic study comparing the effectiveness of the two approaches. The contribution of the paper is two-fold. Firstly, we present such a comparison, and, secondly, we introduce matching inequalities improving the upper bounds as compared to the two basic approaches. The matching inequalities are generated within a branch-and-cut algorithm using a minimum odd-cut procedure based on the Gomory-Hu algorithm. The paper presents results of extensive numerical studies illustrating our statements and findings.

Publiceringsår

2013

Språk

Engelska

Sidor

197-204

Publikation/Tidskrift/Serie

Electronic Notes in Discrete Mathematics

Volym

41

Dokumenttyp

Artikel i tidskrift

Förlag

Elsevier

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • branch-and-cut
  • matching polytope
  • Gomory-Hu algorithm
  • SINR

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1571-0653