Επίλυση του προβλήματος χρονοπρογραμματισμού μετάδοσης σε ασύρματα δίκτυα με συσκευές διακριτών τιμών ισχύος με τη χρήση παράλληλου προγραμματισμού σε περιβάλλον OpenCL
Date Issued
May 2015
Author(s)
Abstract
In this thesis we investigated the minimum latency transmission scheduling problem with power expenditure minimization under the sphere of a physical model. Our research is a continuation of the research of Charalambous et al., 2013. In that paper the authors made the assumption that the transmission power is taking positive values into a continuous space. Nevertheless, in reality, mobile devices are actually transmitting into discrete power values and based on that we alter their algorithm. The modification of the algorithm into taking only discrete values for power has reduced the potential solutions and resulted in a significant decrease of the computational time needed for solving the problem. In addition the algorithm was implemented in OpenCL environment in order to take into advantage the parallel programming. The results of our research were encouraging and our algorithm performed better than the already implemented algorithms in CPLEX. We are extremely confident that with further improvements our algorithm could be applicable in large wireless networks.
File(s)![Thumbnail Image]()
Name
Ελευθερίου Αντρέας ABSTRACT.pdf
Size
252.32 KB
Format
Adobe PDF
Checksum (MD5)
4ca8bfb7cf701aa5fb64690ebed4b9b3