Now showing items 1-18 of 18

    • A Game Theoretical algorithm for joint power and topology control in distributed WSN 

      Closas Gómez, Pau; Pagès Zamora, Alba Maria; Fernández Rubio, Juan Antonio (2009)
      Conference lecture
      Open Access
      In this paper, the issue of network topology control in wireless networks using a fully distributed algorithm is considered. Whereas the proposed distributed algorithm is designed applying game theory concepts to design ...
    • A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices 

      Lass, Michael; Mohr, Stephan; Wiebeler, Hendrik; Kühne, Thomas D.; Plessl, Christian (Association for Computing Machinery (ACM), 2018-07)
      Conference lecture
      Open Access
      We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. Following ...
    • Can frogs find large independent sets in a decentralized way? Yes they can! 

      Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (Springer, 2014)
      Conference report
      Open Access
      The problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility ...
    • Communication-aware sparse patterns for the factorized approximate inverse preconditioner 

      Laut Turón, Sergi; Casas Guix, Marc; Borrell Pol, Ricard (Association for Computing Machinery (ACM), 2022)
      Conference report
      Open Access
      The Conjugate Gradient (CG) method is an iterative solver targeting linear systems of equations Ax=b where A is a symmetric and positive definite matrix. CG convergence properties improve when preconditioning is applied ...
    • Demand-side management via distributed energy generation and storage optimization 

      Atzeni, Italo; García Ordoñez, Luis; Scutari, Gesualdo; Palomar, Daniel P.; Rodríguez Fonollosa, Javier (Institute of Electrical and Electronics Engineers (IEEE), 2013-06)
      Article
      Restricted access - publisher's policy
      Demand-side management, together with the integration of distributed energy generation and storage, are considered increasingly essential elements for implementing the smart grid concept and balancing massive energy ...
    • Design and Implementation of Distributed Algorithms for Their Application in Telematic Services. Use case: Shared Calendar 

      Alonso Belchi, Francesc (Universitat Politècnica de Catalunya, 2014-09-09)
      Master thesis
      Open Access
      [ANGLÈS] In distributed systems arise several issues that are solved using distributed algorithms. The main purpose of this thesis is to develop a system for academic use that allows to implement distributed algorithms and ...
    • Desplegament autònom d'agents en una malla 

      Martínez París, Ciara (Universitat Politècnica de Catalunya, 2008-07-18)
      Master thesis (pre-Bologna period)
      Open Access
      En el present document es proposa un algorisme distribuït per a un sistema amb agents. Aquest sistema consisteix en una malla quadrada, en la qual es mouen un grup d’agents, que anomenem sensors, per dur a terme una ...
    • Distributed graph coloring in wireless ad hoc networks: a light-weight algorithm based on Japanese tree frogs' calling behaviour 

      Hernández Pibernat, Hugo; Blum, Christian (IEEE, 2011)
      Conference report
      Restricted access - publisher's policy
      Graph coloring concerns the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. In this paper we deal with the problem of finding valid colorings of graphs in a distributed ...
    • Distributed locomotion of 2-D lattice-based modular robotic systems 

      Salvador Nomen, Xavier (Universitat Politècnica de Catalunya, 2019-07)
      Bachelor thesis
      Open Access
      In this thesis we have solved the two-dimensional problem of locomotion of modular robots on square lattices in the presence of obstacles of arbitrary forms, for the class of modular robots that follow the model of movement ...
    • Distributed locomotion strategies for lattice-based modular robots 

      Otero Avalle, Daniel (Universitat Politècnica de Catalunya, 2016-06-22)
      Bachelor thesis
      Open Access
      Previous work on locomotion strategies for lattice-based modular robots has provided several algorithms that allow modular robots move over sets of specific obstacles. Nevertheless, there was not yet a general algorithm that ...
    • Distributed partitioning algorithm with application to video-surveillance 

      Paloma Garcia, Inés; Saiz, Carlos (Universitat Politècnica de Catalunya / Università degli Studi di Padova, 2014)
      Bachelor thesis
      Open Access
      How many times have we wanted to control an area and the video-surveillance system does not have the appropriate properties? Nowadays, the video-surveillance has become a responsibility by the necessity to patrol a ...
    • Empirical results on long-lived renaming algorithms 

      Moral Boadas, Sandra; Balcázar Navarro, José Luis (1997-09)
      Research report
      Open Access
      The Long-lived Renaming problem is an important subject in Distributed Algorithms. The Renaming problem consists in providing processes with new names from a hopefully smaller name space. In the long-lived version, only ...
    • How to implement doubly-stochastic matrices for consensus-based distributed algorithms 

      Valcarcel Macua, Sergio; Moreno Leon, Carlos; Samuel Romero, Jhoan; Silva Pereira, Silvana; Zazo Muncharaz, Javier; Pagès Zamora, Alba Maria; López Valcarce, Roberto; Zazo Bello, Santiago (Institute of Electrical and Electronics Engineers (IEEE), 2014)
      Conference report
      Restricted access - publisher's policy
      Doubly-stochastic matrices are usually required by consensus-based distributed algorithms. We propose a simple and efficient protocol and present some guidelines for implementing doubly-stochastic combination matrices even ...
    • Implementation of a distributed algorithm for multi-camera visual feature extraction in a visual sensor network testbed 

      Guillén Arévalo, Alejandro (Universitat Politècnica de Catalunya, 2015-04-18)
      Master thesis (pre-Bologna period)
      Open Access
      Covenantee:   Kungl. Tekniska högskolan. Skolan för elektro- och systemteknik
      [ANGLÈS] Visual analysis tasks, like detection, recognition and tracking, are computationally intensive, and it is therefore challenging to perform such tasks in visual sensor networks, where nodes may be equipped with low ...
    • Manual de introducción al DSS (Distributed System and Protocols Simulator) 

      Moral Boadas, Sandra (1996-10)
      Research report
      Open Access
      DSS es una herramienta que ofrece a los diseñadores de algoritmos distribuidos simulaciones y análisis de sus protocolos. Está compuesto por un entorno en el que se integran las funcionalidades de modelar y crear topologías, ...
    • Performance impact of the grid middleware 

      Carrera Pérez, David; Guitart Fernández, Jordi; Beltran Querol, Vicenç; Torres Viñals, Jordi; Ayguadé Parra, Eduard (American Scientific Publishers, 2006-01)
      Part of book or chapter of book
      Open Access
      The Open Grid Services Architecture (OGSA) defines a new vision of the Grid based on the use of Web Services (Grid Services). The standard interfaces, behaviors and schemes that are consistent with the OGSA specification ...
    • Swarm intelligence techniques for optimization and management tasks insensor networks 

      Hernández Pibernat, Hugo (Universitat Politècnica de Catalunya, 2012-06-11)
      Doctoral thesis
      Open Access
      The main contributions of this thesis are located in the domain of wireless sensor netorks. More in detail, we introduce energyaware algorithms and protocols in the context of the following topics: self-synchronized ...
    • Total order in opportunistic networks 

      Costea, Mihail; Ciobanu, Radu; Marin, Radu Corneliu; Dobre, Ciprian M.; Mavromoustakis, Constandinos X.; Mastorakis, George; Xhafa Xhafa, Fatos (2017-05-25)
      Article
      Open Access
      Opportunistic network applications are usually assumed to work only with unordered immutable messages, like photos, videos, or music files, while applications that depend on ordered or mutable messages, like chat or shared ...