Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/92343
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Morell, Antoni | - |
dc.contributor.author | Lopez Vicario, Jose | - |
dc.contributor.author | Vilajosana, Xavier | - |
dc.contributor.author | Vilajosana, Xavier | - |
dc.contributor.author | Seco-Granados, Gonzalo | - |
dc.contributor.other | Universitat Autònoma de Barcelona (UAB) | - |
dc.contributor.other | WorldSensing S.L. | - |
dc.contributor.other | Universitat Oberta de Catalunya. Estudis d'Informàtica, Multimèdia i Telecomunicació | - |
dc.date.accessioned | 2019-03-20T08:58:39Z | - |
dc.date.available | 2019-03-20T08:58:39Z | - |
dc.date.issued | 2011-03-25 | - |
dc.identifier.citation | Morell, 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.issn | 1424-8220MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/92343 | - |
dc.description.abstract | In 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.iso | eng | - |
dc.publisher | Sensors | - |
dc.relation.ispartof | Sensors, 2011, 11(4) | - |
dc.relation.uri | https://www.mdpi.com/1424-8220/11/4/3611/pdf | - |
dc.rights | CC BY | - |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | - |
dc.subject | wireless sensor networks | en |
dc.subject | reduced signalling | en |
dc.subject | reducción de la señal | es |
dc.subject | reducció del senyal | ca |
dc.subject | distributed optimization | en |
dc.subject | optimización distribuida | es |
dc.subject | optimització distribuïda | ca |
dc.subject | distribución del tiempo | es |
dc.subject | fair time slot allocation | en |
dc.subject | distribució del temps | ca |
dc.subject | contention free access | en |
dc.subject | contención de libre acceso | es |
dc.subject | contenció de lliure accés | ca |
dc.subject | redes de sensores inalámbricos | es |
dc.subject | xarxes de sensors sense fils | ca |
dc.subject.lcsh | Detectors | en |
dc.title | Optimal rate allocation in cluster-tree WSNs | - |
dc.type | info:eu-repo/semantics/article | - |
dc.subject.lemac | Detectors | ca |
dc.subject.lcshes | Detectores | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
dc.identifier.doi | 10.3390/s110403611 | - |
dc.gir.id | AR/0000002504 | - |
dc.type.version | info:eu-repo/semantics/publishedVersion | - |
Aparece en las colecciones: | Articles cientÍfics Articles |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
optimal.pdf | 513,6 kB | Adobe PDF | Visualizar/Abrir |
Comparte:
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons