Optimal rate allocation in cluster-tree WSNs

Antoni Morell, Jose Lopez Vicario, Xavier Vilajosana, Ignasi Vilajosana, Gonzalo Seco-Granados

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)


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. © 2011 by the authors; licensee MDPI, Basel, Switzerland.
Original languageEnglish
Pages (from-to)3611-3639
Issue number4
Publication statusPublished - 1 Apr 2011


  • Contention free access
  • Distributed optimization
  • Fair time slot allocation
  • Reduced signaling
  • Wireless sensor networks


Dive into the research topics of 'Optimal rate allocation in cluster-tree WSNs'. Together they form a unique fingerprint.

Cite this