Pasar al contenido principal

COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEAS

TIN2010-21378-C02-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

A semi-dynamic, game based and interference aware channel assignment for multi-radio multi-channel wireless mesh networks

  • Amiri Nezhad, Maryam
  • Cerdà Alabern, Llorenç
  • Bellalta, Boris
  • Guerrero Zapata, Manel
Channel assignment (CA) has been extensively researched for multi-radio wireless mesh networks (WMNs), but it is still very challenging when it comes to its implementation. In this paper we propose a semi-dynamic and distributed CA mechanism called semi-dynamic interference aware channel assignment (SICA) based on game theory formulation. SICA is an interference aware, distributed CA which preserves the network connectivity without relying on a common channel nor central node for coordination between mesh routers. SICA applies a real time learner algorithm which assumes that nodes do not have perfect information about the network topology. To the best of our knowledge this is the first game formulation of CA which takes the co-channel interference into account. We have simulated SICA and compared against other channel assignment mechanisms proposed in the literature. Simulation results show that SICA outperforms other mechanisms., This work was supported by the Spanish government and Generalitat de Catalunya through projects TIN2010-21378-C02-01 and 2009-SGR-1167, respectively, and by the European Commission through the NoE EuroNF.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modeling and comparison of candidate selection algorithms in opportunistic routing

  • Darehshoorzadeh, A.
  • Cerdà-Alabern, L.
  • Pla, Vicent|||0000-0002-0894-9494
Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multihop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forwards it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we propose a discrete time Markov chain to assess the improvement that may be achieved using opportunistic routing. We use our model to compare a selected group of candidate selection algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non-optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidates sets are likely to be updated frequently. © 2011 Elsevier B.V. All rights reserved., This work was supported by the Spanish government through projects TIN2010-21378-C02-01 and TIN2010-21378-C02-02, by the Generalitat de Catalunya through project 2009-SGR-1167, and by the European Commission through the NoE EuroNF.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimum Node Placement in Wireless Opportunistic Routing Networks

  • Cerdá Alabern, Llorenç
  • Darehshoorzadeh, Amir
  • Pla, Vicent|||0000-0002-0894-9494
In recent years there has been a growing interest in opportunistic routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. In contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor¿s transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What is the maximum performance that can be obtained using opportunistic routing? To answer this question we use an analytical model that allows to compute the optimal position of the nodes, such that the progress towards the destination is maximized. We use this model to compute bounds to the minimum expected number of transmissions that can be achieved in a network using opportunistic routing., This work was supported by the Spanish Ministerio de Ciencia e Innovacion through the Projects TIN2010-21378-C02-01 and TIN2010-21378-C02-02 and by the Generalitat de Catalunya through Project 2009-SGR-1167.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A semi-dynamic, game based and interference aware channel assignment for multi-radio multi-channel wireless mesh networks

  • Amiri Nezhad, Maryam
  • Cerdà Alabern, Llorenç
  • Bellalta, Boris
  • Guerrero Zapata, Manel
Channel assignment (CA) has been extensively researched for multi-radio wireless mesh networks (WMNs), but it is still very challenging when it comes to its implementation. In this paper we propose a semi-dynamic and distributed CA mechanism called semi-dynamic interference aware channel assignment (SICA) based on game theory formulation. SICA is an interference aware, distributed CA which preserves the network connectivity without relying on a common channel nor central node for coordination between mesh routers. SICA applies a real time learner algorithm which assumes that nodes do not have perfect information about the network topology. To the best of our knowledge this is the first game formulation of CA which takes the co-channel interference into account. We have simulated SICA and compared against other channel assignment mechanisms proposed in the literature. Simulation results show that SICA outperforms other mechanisms., This work was supported by the Spanish government and Generalitat de Catalunya through projects TIN2010-21378-C02-01 and 2009-SGR-1167, respectively, and by the European Commission through the NoE EuroNF.