BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//TUC//Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/Athens
TZNAME:EEST
DTSTART:19700329T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EET
DTSTART:19701025T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CREATED:20221024T091544Z
LAST-MODIFIED:20221024T091544Z
DTSTAMP:20261012T185459Z
UID:1791820499@tuc.gr
SUMMARY:Παρουσίαση Μεταπτυχιακής Εργασίας κα
 ς Χατζηγεωργίου Ρόζας - Σχολή ΗΜΜΥ
LOCATION:
DESCRIPTION:https://www.tuc.gr/el/to-polytechnei
 o/ilektronikes-ypiresies/imerologio/
 imerologio-ekdiloseon-1?tx_tucevents
 2_tuceventsdisplay%5Baction%5D=show&
 tx_tucevents2_tuceventsdisplay%5Bcon
 troller%5D=Event&tx_tucevents2_tucev
 entsdisplay%5Bevent%5D=5856&cHash=68
 a287422dad8671f3dc66ff1795bf8d\nΠΟΛΥ
 ΤΕΧΝΕΙΟ ΚΡΗΤΗΣ\n Σχολή Ηλεκτρολόγων 
 Μηχανικών και Μηχανικών Υπολογιστών\
 n Πρόγραμμα Μεταπτυχιακών Σπουδών\n 
  \n ΠΑΡΟΥΣΙΑΣΗ ΜΕΤΑΠΤΥΧΙΑΚΗΣ ΕΡΓΑΣΙΑ
 Σ \n Ρόζας Χατζηγεωργίου\n με θέμα\n
  Κατανεμημένη Κατανομή Πόρων και Συσ
 χέτιση Χρηστών σε Ασύρματα Δίκτυα με
  Τεχνικές Συμπερασμού\n Inference-Ba
 sed Distributed User Association and
  Resource Allocation in Wireless Net
 works\n  \n Εξεταστική Επιτροπή\n Κα
 θηγητής Μπλέτσας Άγγελος (επιβλέπων)
 \n Καθηγητής Σπυρόπουλος Θρασύβουλος
 \n Αναπληρωτής Καθηγητής Σαμολαδάς Β
 ασίλειος \n  \n Abstract\n This work
  distributively solves the problems 
 of user association and resource all
 ocation in wireless networks. Distri
 buted methods dispense the computati
 onal burden across the terminals of 
 a network and are usually preferred 
 over centralized methods, in which c
 omputing is done at a central locati
 on. First, the belief propagation (B
 P) algorithm is utilized for joint t
 ime and frequency allocation in wire
 less sensor networks; BP is inherent
 ly distributed, due to its message p
 assing nature. In this work, the con
 vergence of BP for the resource allo
 cation problem is re-visited from a 
 control-theory approach; performance
  evaluation is also provided for two
  methods, namely restarting and pert
 urbed BP. Next, the problem of energ
 y efficient user association on the 
 downlink of heterogeneous networks i
 s solved in a distributed, inference
 -based manner. The problem is first 
 expressed as a linear program (LP). 
 Max product BP is a distributed, mes
 sage passing algorithm which can be 
 utilized to obtain the solution of t
 he LP, under certain conditions. Con
 sidering the loopy nature of the est
 ablished graphical model, it is impo
 rtant that convergence and correctne
 ss of the max product algorithm is g
 uaranteed. Therefore, the problem is
  relaxed, fixing the number of users
  per base station and the number of 
 active base stations; then it is pro
 ved that max product BP converges wi
 th arbitrary initialization to the s
 olution of the LP, in a finite numbe
 r of iterations. Complexity is also 
 quantified and expressed as a functi
 on of the number of active base stat
 ions and serving users. Finally, num
 erical results compare the performan
 ce of the proposed distributed algor
 ithm with state-of-the-art. The resu
 lts show that the proposed approach 
 offers higher geometric mean of ener
 gy efficiency compared to previous w
 ork.\n
STATUS:CONFIRMED
ORGANIZER;RSVP=FALSE;CN=TUC;CUTYPE=TUC:mailto:webmaster@tuc.gr
DTSTART:20221026T130000
DTEND:20221026T140000
TRANSP:OPAQUE
CLASS:DEFAULT
END:VEVENT
END:VCALENDAR