Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038 | ||
| Έτος | 2022 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | R. Chatzigeorgiou, P. Alevizos and A. Bletsas, "Evaluation of inference algorithms for distributed channel allocation in wireless networks," in Proceedings of the 11th International Conference on Modern Circuits and Systems Technologies (MOCAST 2022), Bremen, Germany, 2022, doi: 10.1109/MOCAST54814.2022.9837490. https://doi.org/10.1109/MOCAST54814.2022.9837490 | ||
| Εμφανίζεται στις Συλλογές |
Resource allocation in wireless networks, i.e., assigning time and frequency slots over specific terminals under spatio-temporal constraints, is a fundamental and challenging problem. Belief Propagation/message passing (inference) algorithms have been proposed for constraint satisfaction problems (CSP), since they are inherently amenable to distributed implementation. This work compares two message passing algorithms for time and frequency allocation, satisfying signal-to-interference-and-noise-ratio, half-duplex-radio operation and routing constraints. The first method periodically checks whether the constraints are satisfied locally and restarts specific messages, when the local constraints (encoded in corresponding factors) are not satisfied. The second method stochastically perturbs Belief Propagation, using Gibbs sampling. The methods are evaluated, based on how often they fail to converge to a valid (i.e., constraint-satisfying) allocation, coined as outage probability. Numerical results demonstrate that, as the maximum number of iterations increase, both methods decrease the outage probability. However, the restarting method offers faster convergence to a valid CSP solution. Future work will focus on next generation 5/6G wireless networks.
Copyright © DIAS 2013
