PaMeLA: A joint channel assignment and routing algorithm for multi-radio multi-channel wireless mesh networks with grid topology (Contributo in atti di convegno)

Type
Label
  • PaMeLA: A joint channel assignment and routing algorithm for multi-radio multi-channel wireless mesh networks with grid topology (Contributo in atti di convegno) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/MOBHOC.2009.5336997 (literal)
Alternative label
  • Claudio Cicconetti, Vanessa Gardellin, Luciano Lenzini, Enzo Mingozzi (2009)
    PaMeLA: A joint channel assignment and routing algorithm for multi-radio multi-channel wireless mesh networks with grid topology
    in MASS 2009, Macau, China
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Claudio Cicconetti, Vanessa Gardellin, Luciano Lenzini, Enzo Mingozzi (literal)
Pagina inizio
  • 199 (literal)
Pagina fine
  • 207 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.scopus.com/inward/record.url?eid=2-s2.0-74249091153&partnerID=q2rCbXpz (literal)
Note
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • IIT-CNR, Università di Pisa, Intecs (literal)
Titolo
  • PaMeLA: A joint channel assignment and routing algorithm for multi-radio multi-channel wireless mesh networks with grid topology (literal)
Abstract
  • The performance of multi-radio multi-channel Wireless Mesh Networks (WMNs) based on the IEEE 802.11 technology depends significantly on how the channels are assigned to the radios and how traffic is routed between the access points and the gateways. In this paper we propose an algorithmic approach to this problem, for which no conclusive solution has been put forward in the literature so far. The core of our scheme, called PaMeLA, consists of splitting the overall Joint Channel Assignment and Routing (JCAR) problem into a number of local optimization subproblems, one for every node of the WMN, that are solved sequentially. Any sub-problem is formulated as an Integer Linear optimization Problem (ILP), whose optimal solution can be found using branch-and-cut in a reasonable amount of time. The final solution is obtained after a post-processing phase. In its current form, the algorithm is tailored to suit WMNswith a single gateway in a square-grid topology, which is of practical interest in many application scenarios. PaMeLA is compared through detailed packetlevel simulation with several state-of-the-art JCAR algorithms and it is shown to attain better performance, in terms of the packet loss rate. ©2009 IEEE. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it