Optimal Rate Allocation in Cluster-Tree WSNs
AbstractIn 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Morell, A.; Vicario, J.L.; Vilajosana, X.; Vilajosana, I.; Seco-Granados, G. Optimal Rate Allocation in Cluster-Tree WSNs. Sensors 2011, 11, 3611-3639.
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.