Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 158 results
  • Optimum node placement in wireless opportunistic routing networks

     Cerdà Alabern, Llorenç; Darehshoorzadeh, Amir; Pla Boscà, Vicent
    Ad hoc networks
    Date of publication: 2013-11
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    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. © 2013 Elsevier B.V. All rights reserved.

  • 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 Jimenez, Boris; Guerrero Zapata, Manel
    International journal of Ad Hoc and ubiquitous computing
    Date of publication: 2013-01
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    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.

  • Access to the full text
    Opportunistic routing in wireless mesh networks  Open access

     Darehshoorzadeh, Amir; Cerdà Alabern, Llorenç; Pla Boscà, Vicent
    Date of publication: 2013-05
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Opportunistic Routing (OR) has been proposed as a way to increase the performance of wireless networks by exploiting its broadcast nature. In OR, instead of pre-selecting a single specific node to be the next-hop as a forwarder for a packet, multiple nodes can potentially be selected as the next-hop forwarder. Thus the source can use multiple potential paths to deliver the packets to the destination. More specially, when the current node transmits a packet, all the candidates that receive the packet successfully will coordinate with each other to determine which one would actually forward the packet according to some criteria, while the other nodes will simply discard the packet. In this chapter, we survey the state of the art in OR, then focus on the candidates selection algorithms and carry out a comparative performance evaluation of the most relevant proposals appeared in the literature.

    Opportunistic Routing (OR) has been proposed as a way to increase the performance of wireless networks by exploiting its broadcast nature. In OR, instead of pre-selecting a single specific node to be the next-hop as a forwarder for a packet, multiple nodes can potentially be selected as the next-hop forwarder. Thus the source can use multiple potential paths to deliver the packets to the destination. More specially, when the current node transmits a packet, all the candidates that receive the packet successfully will coordinate with each other to determine which one would actually forward the packet according to some criteria, while the other nodes will simply discard the packet. In this chapter, we survey the state of the art in OR, then focus on the candidates selection algorithms and carry out a comparative performance evaluation of the most relevant proposals appeared in the literature.

    Postprint (author’s final draft)

  • Channel Assignment protocols for Multi-Radio Multi-Channel Wireless Mesh Netwworks  Open access

     Amiri Nezhad, Maryam
    Defense's date: 2013-01-30
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    La creciente demanda de grandes redes inalámbricas de bajo coste (desde campus universitarios hasta grandes áreas de una ciudad) ha motivado un alto interés en comunicaciones multi salto para redes inalámbricas mesh basadas en el reciente estándar IEEE 802.11s.¿Channel Assignment¿ (CA), o asignación de canal, es un mecanismo que selecciona los mejores canales para un nodo individual o para toda la red con la intención de incrementar la capacidad de dicha red. CA ha sido exhaustivamente investigada para redes inalámbricas multi-rádio, pero aún presenta muchas dificultades en cuanto a su implementación. A pesar de que IEEE 802.11s introduce un nuevo marco para el enrutamiento y reenvío de tramas a nivel de enlace, la arquitectura multi-canal recibe mucha menos atención debido a todos los problemas pendientes de resolver debidos a la complejidad de operar a través de múltiples frecuencias simultáneamente.Esta tesis doctoral proporciona una posible solución a estos problemas con un mecanismo de asignación de canales eficiente.Empezamos proponiendo un nuevo CA estático partiendo del hecho que no todos los enlaces inalámbricos son útiles. Nuestro mecanismo elimina de la topología de red aquellos enlaces que considera demasiado débiles mejorando así el rendimiento de la red a través de una asignación de canales de radio más diversa.Con el objetivo de diseñar un CA distribuido, proponemos una nueva formulación de CA que utiliza la teoría de juegos, la cual es aplicable a escenarios realistas con información imperfecta en cada nodo. Hemos propuesto un protocolo para CAs distribuidas e híbridas basado en esta formulación. El CA propuesto consigue que los nodos inalámbricos sean capaces de adaptarse a los imprevisibles cambios de un entorno inalámbrico.También hemos investigado los tipos de protocolos CA que pueden ser adaptados al IEEE 802.11s y mejorar el ¿network good-put¿ en términos de ¿data delivery ratio¿ y ¿end-to-end delay¿.

    The increasing demand for large and low cost wireless coverage, ranging from campus to city wide areas, has motivated a high interest in multi-hop communications with Wireless Mesh Networks (WMN) based on IEEE 802.11s as the most recent and significant standard. Channel Assignment (CA) is mechanism which selects the best channels for an individual wireless node or the entire network aiming to increase the capacity of the network. Channel assignment has been extensively researched for multi-radio WMNs, but it is still very challenging when it comes to its implementation. Although IEEE 802.11s introduces new inter-working, routing and wireless frame forwarding at the link layer, the multi channel architecture receives less attention due to many unsolved challenges that arises while mesh service set works over multiple frequencies. This research work tries to give a solution to the needs of designing an efficient channel assignment mechanism. As a result we have proposed a new static channel assignment based on the fact that not all wireless links are practically useful. Our mechanism prunes the network topology by removing weak wireless links and improves the network performance by reaching a more diverse channel-radio assignation solution. Toward designing a distributed channel assignment we propose a new game theory based formulation of channel assignment which is applicable to a realistic scenario with imperfect information at each router. We have proposed a distributed and hybrid channel assignment protocol based on the game formulation. The proposed channel assignment makes wireless router to be able to follow the unpredictable changes in the wireless environment. We also investigated the types of channel assignment protocols which can be adapted to the IEEE 802.11s based mesh network and improve the network good-put in terms of data delivery ratio and end-to-end delay.

  • Utility based channel assignment: a centralized channel assignment mechanism for multi radio multi channel wireless mesh networks

     Amiri Nezhad, Maryam; Cerdà Alabern, Llorenç; Guerrero Zapata, Manel
    Scientific research and essays
    Date of publication: 2012-09-06
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Topology patterns of a community network: Guifi.net

     Vega D'Aurelio, Davide; Cerdà Alabern, Llorenç; Navarro Moldes, Leandro; Meseguer Pallares, Roque
    IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
    Presentation's date: 2012-10
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Opportunistic Routing in Wireless Mesh Networks  Open access

     Darehshoorzadeh, Amir
    Defense's date: 2012-07-23
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Advances in communication and networking technologies are rapidly making ubiquitous network connectivity a reality. In recent years, Wireless Mesh Networks (WMNs) have already become very popular and been receiving an increasing amount of attention by the research community. Basically, a WMN consists of simple mesh routers and mesh clients, where mesh routers form the backbone of WMN. Due to the limited transmission range of the radio, many pairs of nodes in WMN may not be able to communicate directly, hence they need other intermediate nodes to forward packets for them. Routing in such networks is an important issue and it poses great challenges. Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of WMNs by exploiting its broadcast nature. In OR, in contrast to traditional routing, instead of pre-selecting a single specic node to be the next-hop as a forwarder for a packet, an ordered set of nodes (referred to as candidates) is selected as the potential next-hop forwarders. Thus, the source can use multiple potential paths to deliver the packets to the destination. More specically, when the current node transmits a packet, all the candidates that successfully receive it will coordinate with each other to determine which one will actually forward it, while the others will simply discard the packet. This dissertation studies the properties, performance, maximum gain, candidate selection algorithms and multicast delivery issues about Opportunistic Routing in WMNs. Firstly, we focus on the performance analysis of OR by proposing a Discrete Time Markov Chain (DTMC). This model can be used to evaluate OR in terms of expected number of transmissions from the source to the destination. Secondly, we apply our Markov model to compare relevant candidate selection algorithms that have been proposed in the literature. They range from non-optimum, but simple, to optimum, but with a high computational cost. Thirdly, the set of candidates which a node uses and priority order of them have a signicant impact on the performance of OR. Therefore, using a good metric and algorithm to select and order the candidates are key factors in designing an OR protocol. As the next contribution we propose a new metric that measures the expected distance progress of sending a packet using a set of candidates. Based on this metric we propose a candidate selection algorithm which its performance is very close to the optimum algorithm although our algorithm runs much faster. Fourthly, we have investigated the maximum gain that can be obtained using OR. We have obtained some equations that yield the distances of the candidates in OR such that the per transmission progress towards the destination is maximized. Based on these equations we have proposed a novel candidate selection algorithm. Our new algorithm only needs the geographical location of nodes. The performance of our proposal is very close to the optimum candidate selection algorithm although our algorithm runs much faster. Finally, using OR to support multicast is an other issue that we have investigated in this thesis. We do so by proposing a new multicast protocol which uses OR. Unlike traditional multicast protocols, there is no designated next-hop forwarder for each destination in our protocol, thus the delivery ratio is maximized by taking advantage of spatial diversity.

  • Selected topics in opportunistic routing in wireless networks

     Darehshoorzadeh, Amir; Cerdà Alabern, Llorenç
    Date of publication: 2012-11-09
    Book

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Oportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of Wireless Mesh Networks. In OR, in contrast to traditional routing, instead of pre-selecting a single specific node to be the next-hop as a forwarder for a packet, an ordered set of nodes, called candidates, is selected. When the current node transmits a packet, all the candidates that successfully receive it will coordinate with each other to determine which one will actually forward it, while the others will simply discard the packet. This book is a research approach to OR. Analytic models and simulation are used to investigate main issues in OR. These include practical ones, as the selection of candifates and theoretical ones, as the maximum performance that may be achieved using OR.

  • Access to the full text
    Should next generation wireless mesh networks consider dynamic channel access?  Open access

     Amiri Nezhad, Maryam; Bellalta Jimenez, Boris; Guerrero Zapata, Manel; Cerdà Alabern, Llorenç
    Baltic Congress on Future Internet Communications
    Presentation's date: 2012
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    In today’s computer architectures, many scientific applications are considered to be memory bound. The memory wall, i.e. the large disparity between a processor’s speed and the required time to access off-chip memory, is a yet-to-be-solved problem that can greatly reduce performance and make us underutilise the processors capabilities. Many different approaches have been proposed to tackle this problem, such as the addition of a large cache hierarchy, multithreading or speculative data prefetching. Most of these approaches rely on the prediction of the application’s future behaviour, something that should not be necessary as this information is known by the programmer and is located in the application itself. Instead of designing hardware that attempts to guess the future, the goal should be to provide the programmer with the hardware support required to decide when the data is transferred and where is it transferred to. With this goal in mind, we introduce the Data Transfer Engine, a runtime-assisted, software prefetcher that exploits the information provided by the programmer in order to place data in the cache hierarchy close to the processor that will make use of it. The DTE can not only significantly reduce stall time due to cache misses but, more importantly, it allows us to design new computer architectures that are able to tolerate very high memory latencies.

  • Distance progress based opportunistic routing for wireless mesh networks

     Darehshoorzadeh, Amir; Cerdà Alabern, Llorenç
    International Wireless Communications and Mobile Computing Conference
    Presentation's date: 2012
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Opportunistic Routing (OR) has been proposed to improve 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 as the next-hop potential forwarders. The candidate selection is a key issue in OR and many algorithms have been proposed in the literature. In this paper, we define a new metric for candidate selection based on the expected distance progress of sending a packet under OR. By using this metric we propose a hop-by-hop candidate selection and prioritization algorithm that we call Distance Progress Based Opportunistic Routing , DPOR. In contrast to other algorithms, in DPOR each node selects its candidates set independently, without considering the other nodes¿ candidates sets. DPOR only relies on the neighbors¿ geographic position of forwarder and the links delivery probability between forwarder and its neighbors. We compare our proposal with four other relevant candidate selection algorithms. Our results show that DPOR performance is almost the same as optimum candidate selection algorithm, while DPOR requires less information and run much faster.

    Opportunistic Routing (OR) has been proposed to improve 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 as the next-hop potential forwarders. The candidate selection is a key issue in OR and many algorithms have been proposed in the literature. In this paper, we define a new metric for candidate selection based on the expected distance progress of sending a packet under OR. By using this metric we propose a hop-by-hop candidate selection and prioritization algorithm that we call Distance Progress Based Opportunistic Routing , DPOR. In contrast to other algorithms, in DPOR each node selects its candidates set independently, without considering the other nodes’ candidates sets. DPOR only relies on the neighbors’ geographic position of forwarder and the links delivery probability between forwarder and its neighbors. We compare our proposal with four other relevant candidate selection algorithms. Our results show that DPOR performance is almost the same as optimum candidate selection algorithm, while DPOR requires less information and run much faster

  • On the topology characterization of Guifi.net

     Cerdà Alabern, Llorenç
    IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
    Presentation's date: 2012-10-09
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Modeling and comparison of candidate selection algorithms in opportunistic routing

     Darehshoorzadeh, Amir; Cerdà Alabern, Llorenç
    Computer networks
    Date of publication: 2011-09-15
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    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 forward it. Most of the research in OR has been ddressed to investigate candidate selection algorithms. In this paper we compare a selected group of 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 candidate sets are likely to be updated frequently.

  • COOPERACIÓN Y OPORTUNISMO EN REDES DE ACCESO INALÁMBRICAS Y HETEROGÉNEAS

     Cerdà Alabern, Llorenç; Guerrero Zapata, Manel; Morillo Pozo, Julian David; Garcia Vidal, Jorge; Barcelò Ordinas, José María
    Participation in a competitive project

     Share

  • Community Networks Testbed for the Future Internet

     Freitag, Felix; León Gutiérrez, Xavier; Meseguer Pallares, Roque; Lopez Berga, Ester; Vega D'Aurelio, Davide; Cerdà Alabern, Llorenç; Navarro Moldes, Leandro
    Participation in a competitive project

     Share

  • Adaptive channel assignment for wireless mesh networks using game theory

     Amiri Nezhad, Maryam; Cerdà Alabern, Llorenç
    IEEE International Workshop on Enabling Technologies and Standards for Wireless Mesh Networking
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • A new multicast opportunistic routing protocol for wireless networks

     Darehshoorzadeh, Amir; Cerdà Alabern, Llorenç
    Workshop on Performance Evaluation of Cognitive Radio Networks
    Presentation's date: 2011-05-13
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • 2009SGR-1167 (Grupo Consolidado y Financiado de Investigación)

     Garcia Vidal, Jorge; Trullols Cruces, Oscar; Barcelò Ordinas, José María; Guerrero Zapata, Manel; Cerdà Alabern, Llorenç; Morillo Pozo, Julian David
    Participation in a competitive project

     Share

  • On the performance modeling of opportunistic routing

     Cerdà Alabern, Llorenç; Pla Boscà, Vicent; Darehshoorzadeh, Amir
    International Workshop on Mobile Opportunistic Networking
    Presentation's date: 2010-02-02
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In this paper we propose a discrete time Markov model to assess the improvement that may be achieved using opportunistic routing. We show that our model can be used to compute the probability distribution and moments of the number of transmissions needed to send a packet from the source to the destination in a variety of scenarios. We use our model to compute some opportunistic routing performance measures in a network with a shadowing radio prop- agation model with different network topologies, and varying the maximum number of candidates used by the opportunistic routing algorithm. Our model can be easily extended to evaluate other aspects of opportunistic routing not covered in this paper. Therefore, we believe that our model yields a simple, yet flexible and powerful tool to evaluate opportunistic routing protocols.

  • Utility based channel assignment mechanism for multi radio mesh networks

     Amiri Nezhad, Maryam; Cerdà Alabern, Llorenç
    ACM International Workshop on Mobility Management and Wireless Access
    Presentation's date: 2010-10-18
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Candidate selection algorithms in opportunistic routing

     Darehshoorzadeh, Amir; Cerdà Alabern, Llorenç
    ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks
    Presentation's date: 2010-10-20
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • On the maximum performance in opportunistic routing

     Cerdà Alabern, Llorenç; Darehshoorzadeh, Amir; Pla, Vicent
    IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks
    Presentation's date: 2010-06-15
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Quality of service through bandwidth reservation on multirate ad hoc wireless networks

     Paoliello Guimarães, Rafael; Cerdà Alabern, Llorenç; Barcelò Ordinas, José María; Garcia Vidal, Jorge; Voorhaen, Michael; Blondia, Chris
    Ad hoc networks
    Date of publication: 2009-03
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • XARXES DE COMPUTADORS I SISTEMES DISTRIBUÏTS

     Navarro Moldes, Leandro; Guerrero Zapata, Manel; Barcelò Ordinas, José María; Morillo Pozo, Julian David; Cerdà Alabern, Llorenç; Trullols Cruces, Oscar; Garcia Vidal, Jorge
    Participation in a competitive project

     Share

  • Estructura de redes de computadores

     Iñigo Griera, Jordi; Barcelò Ordinas, José María; Cerdà Alabern, Llorenç; Peig Olive, Enric; Abella Fuentes, Jaume; Corral Torruella, Guiomar
    Date of publication: 2009-01-01
    Book

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Quality of service on ad-hoc wireless networks  Open access

     PAOLIELLO GUIMARAES, RAFAEL
    Defense's date: 2008-07-14
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Over the last years, Mobile Ad-hoc Networks (MANETs) have captured the attention of the research community. The flexibility and cost savings they provide, due to the fact that no infrastructure is needed to deploy a MANET, is one of the most attractive possibilities of this technology. However, along with the flexibility, lots of problems arise due to the bad quality of transmission media, the scarcity of resources, etc. Since real-time communications will be common in MANETs, there has been an increasing motivation on the introduction of Quality of Service (QoS) in such networks. However, many characteristics of MANETs make QoS provisioning a difficult problem.In order to avoid congestion, a reservation mechanism that works together with a Connection Admission Control (CAC) seems to be a reasonable solution. However, most of the QoS approaches found in literature for MANETs do not use reservations. One reason for that, is the difficulty on determining the available bandwidth at a node. This is needed to decide whether there are enough resources to accommodate a new connection.This thesis proposes a simple, yet effective, method for nodes in a CSMA-based MANET to compute their available bandwidth in a distributed way. Based on this value, a QoS reservation mechanism called BRAWN (Bandwidth Reservation over Ad-hoc Networks) is introduced for multirate MANETs, allowing bandwidth allocation on a per flow basis. By multirate we refer to those networks where wireless nodes are able to dynamically switch among several link rates. This allows nodes to select the highest possible transmission rate for exchanging data, independently for each neighbor.The BRAWN mechanism not only guarantees certain QoS levels, but also naturally distributes the traffic more evenly among network nodes (i.e. load balancing). It works completely on the network layer, so that no modifications on lower layers are required, although some information about the network congestion state could also be taken into account if provided by the MAC (Medium Access Control) layer. The thesis analyzes the applicability of the proposed reservation mechanism over both proactive and reactive routing protocols, and extensions to such protocols are proposed whenever needed in order to improve their performance on multirate networks. On mobile scenarios, BRAWN also achieves high QoS provisioning levels by letting the nodes to periodically refresh QoS reservations. This extension of the protocol for mobile nodes is referred as BRAWN-R (BRAWN with Refreshments).Summarizing, the outstanding features of the reservation mechanism proposed by this thesis are: (i) Multirate, i.e. it allows wireless nodes to choose among different transmission rates, in order to accommodate to different channel conditions. (ii) Targeted to CSMA-based wireless MAC protocols, e.g. 802.11. (iii) Reservation based, allowing the network nodes to pro-actively protect ongoing QoS flows, and applying an effective CAC. (iv) Adaptive to topology changes introduced by the mobility of the nodes, re-routing QoS flows to more efficient paths. (v) Feasible and simple to implement over existing MANET routing protocols (as it is shown by the prototype presented at the end of the study).

  • TSI2007-66869-C02-01 "Integración de Redes Ad Hoc, Mesh y Celulares"

     Garcia Vidal, Jorge; Guerrero Zapata, Manel; Barcelò Ordinas, José María; Morillo Pozo, Julian David; Cerdà Alabern, Llorenç; Alaei, Mohammad; Fusté Vilella, David; Trullols Cruces, Oscar
    Participation in a competitive project

     Share

  • A Periodic Refreshment Method for Resource Reservation in Mobile Ad-hoc Networks

     PAOLIELLO GUIMARAES, RAFAEL; Cerdà Alabern, Llorenç
    IFIP Wireless Days Conference 2008
    Presentation's date: 2008-11-24
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • BRAWN: Bandwidth Reservation over Ad-hoc Wireless Networks

     Guimaraes, Rafael; Cerdà Alabern, Llorenç
    Date: 2008-03
    Report

     Share Reference managers Reference managers Open in new window

  • Improving reactive routing on wireless multirate ad-hoc network

     Guimaraes, Rafael; Cerdà Alabern, Llorenç
    13th European Wireless 2007 (EW2007)
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • La Docencia de Redes de Computadoras y Sistemas Distribuidos para Ingenieros Informáticos

     Garcia Vidal, Jorge; Cerdà Alabern, Llorenç; Barcelò Ordinas, José María; Guerrero Zapata, Manel; Morillo Pozo, Julian David
    CEDI 2007 II Congreso Español de Informática
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • L'assignatura Xarxes de Computadors i Aplicacions

     Cerdà Alabern, Llorenç
    Jornades de Docència del Departament d'Arquitectura de Computadors. 10 Anys de Jornades
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Eina par a l'avaluació via web de les pràctiques de laboratori

     Cerdà Alabern, Llorenç; Barcelò Ordinas, José María
    Jornades de Docència del Departament d'Arquitectura de Computadors. 10 Anys de Jornades
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Las clases de problemas de la asignatura STD

     Barcelò Ordinas, José María; Cerdà Alabern, Llorenç; Cruellas Ibarz, Juan Carlos; Garcia Vidal, Jorge
    Jornades de Docència del Departament d'Arquitectura de Computadors. 10 Anys de Jornades
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Qualidade de serviço em redes ad-hoc através de reserva distribuída de recursos

     Paoliello-Guimaraes, Rafael; Cerdà Alabern, Llorenç
    XII Seminario Apec
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Adaptive QoS Reservation Scheme for Ad-hoc Networks

     Guimaraes, R; Cerdà Alabern, Llorenç
    Lecture notes in computer science
    Date of publication: 2007-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • Adaptive QoS Reservation Scheme for Ad-hoc Networks

     Cerdà Alabern, Llorenç
    Third Workshop on Wireless and Mobility
    Presentation's date: 2006-06-07
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Bandwidth Reservation On Wireless Networks with RTS/CTS Signalling

     Guimarães, Rafael; Cerdà Alabern, Llorenç
    European Wireless Conference
    Presentation's date: 2006-04-02
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Adaptive QoS Reservation Scheme for Ad-Hoc Networks

     PAOLIELLO GUIMARAES, RAFAEL; Cerdà Alabern, Llorenç
    Third Workshop on Wireless and Mobility
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • DRAP: Dual-Queue Rate-Controlled Access Point for Multimedia Communications in WLAN Hotspots

     González, Rubén; Cerdà Alabern, Llorenç
    Fifth IASTED International Conference on Communication Systems and Networks (CSN)
    Presentation's date: 2006-08-28
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Adaptive QoS Reservation Scheme for Ad-hoc Networks

     Guimaraes, Rafael; Cerdà Alabern, Llorenç
    Third Workshop on Wireless and Mobility
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Xarxes de Computadors, Conceptes bàsics

     Cerdà Alabern, Llorenç
    Date of publication: 2006-10
    Book

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • On the QoS Support for Voice Over 802,11 WLANs with TCP Backgroun

     Alvaro, R; Cerdà Alabern, Llorenç
    Date: 2006-03
    Report

     Share Reference managers Reference managers Open in new window

  • An Enhanced Bandwidht Reservation / Scheme for Ad-hoc Networks

     Paoliello, R; Cerdà Alabern, Llorenç; Morillo Pozo, Julian David; Garcia Vidal, Jorge
    Date: 2006-11
    Report

     Share Reference managers Reference managers Open in new window

  • A DRAM/SRAM Memory Scheme for Fast Packet Buffers

     Garcia Vidal, Jorge; March, M; Cerdà Alabern, Llorenç; Corbal, J; Valero Cortes, Mateo
    IEEE transactions on computers
    Date of publication: 2006-05
    Journal article

     Share Reference managers Reference managers Open in new window

  • Reservation Scheme Satisfying Bandwidth QoS Constraints for Multirate Ad-hoc Networks

     Cerdà Alabern, Llorenç
    IST Mobile & Wireless Communications Summit
    Presentation's date: 2005-06-19
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • WIDENS: Wireless Ad-Hoc Network for Public Safety

     Barcelò Ordinas, José María; Cerdà Alabern, Llorenç; Garcia Vidal, Jorge
    IST Mobile & Wireless Communications Summit
    Presentation's date: 2005-06-19
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Redes Inalámbricas de Emergencia Pública, el Proyecto WIDENS

     Guimarães, Rafael; Morillo, Julián; Cerdà Alabern, Llorenç; Barcelò Ordinas, José María; Garcia Vidal, Jorge
    XV Jornadas TELECOM I+D
    Presentation's date: 2005-11-22
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A Reservation Scheme Satisfying Bandwidth QoS Constraints for Multirate Ad-hoc Networks

     Cerdà Alabern, Llorenç; Voorhaen, Michael; Guimaraes, Rafael; Barcelò Ordinas, José María; Garcia Vidal, Jorge; Morillo, Julián; BLONDIA, CHRIS
    IST Mobile & Wireless Communications Summit
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • QoS Management in WIDENS Terminodes

     Cerdà Alabern, Llorenç; Guimaraes, Rafael; Morillo Pozo, Julian David; Barcelò Ordinas, José María; Garcia Vidal, Jorge; Pérez Neira, Ana Isabel; Realp, Marc; Voorhaen, Michael; BLONDIA, CHRIS; Knopp, R; Nikaein, N
    2nd EVEREST Workshop on "Trends in Radio Resource Management",
    Presentation's date: 2005-11-16
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window