Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/10609/92343
Registre complet de metadades
Camp DCValorLlengua/Idioma
dc.contributor.authorMorell, Antoni-
dc.contributor.authorLopez Vicario, Jose-
dc.contributor.authorVilajosana, Xavier-
dc.contributor.authorVilajosana, Xavier-
dc.contributor.authorSeco-Granados, Gonzalo-
dc.contributor.otherUniversitat Autònoma de Barcelona (UAB)-
dc.contributor.otherWorldSensing S.L.-
dc.contributor.otherUniversitat Oberta de Catalunya. Estudis d'Informàtica, Multimèdia i Telecomunicació-
dc.date.accessioned2019-03-20T08:58:39Z-
dc.date.available2019-03-20T08:58:39Z-
dc.date.issued2011-03-25-
dc.identifier.citationMorell, A., López Vicario, J., Vilajosana, X., Vilajosana Guillén, I. & Seco-Granados, G. (2011). Optimal Rate Allocation in Cluster-Tree WSNs. Sensors, 11(4), 3611-3639. doi: 10.3390/s110403611-
dc.identifier.issn1424-8220MIAR
-
dc.identifier.urihttp://hdl.handle.net/10609/92343-
dc.description.abstractIn this paper, we propose a solution to the problem of guaranteed time slot allocation in cluster-tree WSNs. Our design uses the so-called Network Utility Maximization (NUM) approach as far as we aim to provide a fair distribution of the available resources. From the point of view of implementation, we extend here the authors' proposed Coupled Decompositions Method (CDM) in order to compute the NUM problem inside the cluster tree topology and we prove the optimality of this new extended version of the method. As a result, we obtain a distributed solution that reduces the total amount of signalling information in the network up to a factor of 500 with respect to the classical techniques, that is, primal and dual decomposition. This is possible because the CDM finds the optimal solution with a small number of iterations. Furthermore, when we compare our solution to the standard-proposed First Come First Serve (FCFS) policy, we realize that FCFS becomes pretty unfair as the traffic load in the network increases and thus, a fair allocation of resources can be considered whenever the price to pay in terms of signaling and computational complexity is controlled.en
dc.language.isoeng-
dc.publisherSensors-
dc.relation.ispartofSensors, 2011, 11(4)-
dc.relation.urihttps://www.mdpi.com/1424-8220/11/4/3611/pdf-
dc.rightsCC BY-
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/es/-
dc.subjectwireless sensor networksen
dc.subjectreduced signallingen
dc.subjectreducción de la señales
dc.subjectreducció del senyalca
dc.subjectdistributed optimizationen
dc.subjectoptimización distribuidaes
dc.subjectoptimització distribuïdaca
dc.subjectdistribución del tiempoes
dc.subjectfair time slot allocationen
dc.subjectdistribució del tempsca
dc.subjectcontention free accessen
dc.subjectcontención de libre accesoes
dc.subjectcontenció de lliure accésca
dc.subjectredes de sensores inalámbricoses
dc.subjectxarxes de sensors sense filsca
dc.subject.lcshDetectorsen
dc.titleOptimal rate allocation in cluster-tree WSNs-
dc.typeinfo:eu-repo/semantics/article-
dc.subject.lemacDetectorsca
dc.subject.lcshesDetectoreses
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess-
dc.identifier.doi10.3390/s110403611-
dc.gir.idAR/0000002504-
dc.type.versioninfo:eu-repo/semantics/publishedVersion-
Apareix a les col·leccions:Articles cientÍfics
Articles

Arxius per aquest ítem:
Arxiu Descripció MidaFormat 
optimal.pdf513,6 kBAdobe PDFThumbnail
Veure/Obrir
Comparteix:
Exporta:
Consulta les estadístiques

Aquest ítem està subjecte a una llicència de Creative Commons Llicència Creative Commons Creative Commons