Next Article in Journal
Wireless Sensor Network-Based Greenhouse Environment Monitoring and Automatic Control System for Dew Condensation Prevention
Previous Article in Journal
Design and Development of a Run-Time Monitor for Multi-Core Architectures in Cloud Computing
Open AccessArticle

Optimal Rate Allocation in Cluster-Tree WSNs

Telecommunications and Systems Engineering Department, Universitat Autònoma de Barcelona, UAB Campus, 08193 Cerdanyola del Vall`es, Spain
IT, Multimedia and Telecommunications Department, Universitat Oberta de Catalunya, Rambla Poblenou, 156, 08018 Barcelona, Spain
World Sensing S.L., Baixada Gomis, 1, 08023 Barcelona, Spain
Author to whom correspondence should be addressed.
Sensors 2011, 11(4), 3611-3639;
Received: 26 January 2011 / Revised: 21 March 2011 / Accepted: 23 March 2011 / Published: 25 March 2011
(This article belongs to the Section Physical Sensors)
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 signalling and computational complexity is controlled. View Full-Text
Keywords: wireless sensor networks; contention free access; fair time slot allocation; distributed optimization; reduced signalling wireless sensor networks; contention free access; fair time slot allocation; distributed optimization; reduced signalling
Show Figures

Graphical abstract

MDPI and ACS Style

Morell, A.; Vicario, J.L.; Vilajosana, X.; Vilajosana, I.; Seco-Granados, G. Optimal Rate Allocation in Cluster-Tree WSNs. Sensors 2011, 11, 3611-3639.

AMA Style

Morell A, Vicario JL, Vilajosana X, Vilajosana I, Seco-Granados G. Optimal Rate Allocation in Cluster-Tree WSNs. Sensors. 2011; 11(4):3611-3639.

Chicago/Turabian Style

Morell, Antoni; Vicario, Jose Lopez; Vilajosana, Xavier; Vilajosana, Ignasi; Seco-Granados, Gonzalo. 2011. "Optimal Rate Allocation in Cluster-Tree WSNs" Sensors 11, no. 4: 3611-3639.

Find Other Styles

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Search more from Scilit
Back to TopTop