Please use this identifier to cite or link to this item:
|Title:||Reduced power expenditure in the minimum latency transmission scheduling problem||Authors:||Charalambous, Themistoklis
Deliparaschos, Kyriakos M.
|Issue Date:||2014||Publisher:||IEEE Computer Society||Source:||6th International Symposium on Communications, Control and Signal Processing, 2014, Athens, Greece, 21-23 May||Abstract:||In large networks due to the large number of transmissions it is unlikely that a slot will be used only by a single wireless node. In this paper, a Cutting Plane approach is proposed in order to combine the minimum latency transmission scheduling problem with power expenditure minimization. The problem is partitioned into a Master Problem and a Subproblem; the main objective of the Subproblem is to minimize the total power expenditure. The Cutting Plane algorithm used is evaluated with regard to its performance and the outcome is that the power expenditure is reduced significantly, while achieving the minimum latency transmission scheduling. One of the drawbacks of the proposed approach, however, is the fact that although it reduces the power significantly, the computational time required is quite large, pointing to further research towards that direction.||URI:||http://ktisis.cut.ac.cy/jspui/handle/10488/3991||ISBN:||978-147992890-3||DOI:||10.1109/ISCCSP.2014.6877851||Rights:||© IEEE|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
checked on Aug 23, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.