<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038"><efrbr-work:titleOfTheWork>Evaluation of inference algorithms for distributed channel allocation in wireless networks</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038"><efrbr-expression:titleOfTheExpression>Evaluation of inference algorithms for distributed channel allocation in wireless networks</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2024-12-06</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2022</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>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.</efrbr-expression:summarizationOfContent><efrbr-expression:contextForTheExpression>The research work was supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the “First Call for H.F.R.I. Research Projects to support Faculty members and Researchers and the Procurement of High-cost research equipment” (Project #: 2846).</efrbr-expression:contextForTheExpression><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="conference name">11th International Conference on Modern Circuits and Systems Technologies</efrbr-expression:note><efrbr-expression:note type="proceedings title">Proceedings of the 11th International Conference on Modern Circuits and Systems Technologies</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~rchatzigeorgiou"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Chatzigeorgiou Roza
            Χατζηγεωργιου Ροζα
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~palevizos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Alevizos Panagiotis
            Αλεβιζος Παναγιωτης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~abletsas"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Bletsas Aggelos
            Μπλετσας Αγγελος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="https://v2.sherpa.ac.uk/id/publisher/38"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Institute of Electrical and Electronics Engineers
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="6E6CA5C3-25E5-411D-AAF5-470B4E09670B"><efrbr-concept:termForTheConcept>
            Resource Allocation
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="7AC4F7E1-5DFC-491D-9F7D-2CD2EEB0B164"><efrbr-concept:termForTheConcept>
            Constraint Satisfaction
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="EA5AC7A6-D38C-4CC0-B9CD-05D71076DD2D"><efrbr-concept:termForTheConcept>
            Message Passing
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="39F17CC9-32D3-421B-8768-C26C22A2A7B2"><efrbr-concept:termForTheConcept>
            Wireless Networks
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="person" targetURI="http://users.isc.tuc.gr/~rchatzigeorgiou"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="person" targetURI="http://users.isc.tuc.gr/~rchatzigeorgiou" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="person" targetURI="http://users.isc.tuc.gr/~palevizos" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="person" targetURI="http://users.isc.tuc.gr/~abletsas" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="person" targetURI="https://v2.sherpa.ac.uk/id/publisher/38" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="concept" targetURI="6E6CA5C3-25E5-411D-AAF5-470B4E09670B"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="concept" targetURI="7AC4F7E1-5DFC-491D-9F7D-2CD2EEB0B164"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="concept" targetURI="EA5AC7A6-D38C-4CC0-B9CD-05D71076DD2D"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/8465196E-A57A-433C-8450-56EA631A1038" targetEntity="concept" targetURI="39F17CC9-32D3-421B-8768-C26C22A2A7B2"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>