Please use this identifier to cite or link to this item:
Title: Optimal rate allocation in cluster-tree WSNs
Author: Morell Pérez, Antoni
López Vicario, José
Vilajosana i Guillén, Xavier
Vilajosana Guillén, Ignasi
Seco Granados, Gonzalo
Others: Universitat Autònoma de Barcelona
WorldSensing S.L.
Universitat Oberta de Catalunya. Estudis d'Informàtica, Multimèdia i Telecomunicació
Keywords: wireless sensor networks
reduced signalling
distributed optimization
fair time slot allocation
contention free access
Issue Date: 25-Mar-2011
Publisher: Sensors
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
Also see:
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.
Language: English
ISSN: 1424-8220MIAR
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
optimal.pdf513.6 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons