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
Sensors 2011, 11(4), 3611-3639; doi:10.3390/s110403611
Article

Optimal Rate Allocation in Cluster-Tree WSNs

1,* , 1
,
2
,
3
 and
1
1 Telecommunications and Systems Engineering Department, Universitat Autònoma de Barcelona, UAB Campus, 08193 Cerdanyola del Vall`es, Spain 2 IT, Multimedia and Telecommunications Department, Universitat Oberta de Catalunya, Rambla Poblenou, 156, 08018 Barcelona, Spain 3 World Sensing S.L., Baixada Gomis, 1, 08023 Barcelona, Spain
* Author to whom correspondence should be addressed.
Received: 26 January 2011 / Revised: 21 March 2011 / Accepted: 23 March 2011 / Published: 25 March 2011
(This article belongs to the Section Physical Sensors)
View Full-Text   |   Download PDF [514 KB, uploaded 21 June 2014]   |  

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 signalling and computational complexity is controlled.
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
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
RIS
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.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert