Distributed OFDMA Resource and Power Allocation Using Gibbs Sampling Methods

In this paper, we present a distributed resource and power allocation scheme for multiple-resource wireless cellular networks. The global optimization of multi-cell multi-link resource allocation problem is known NP-hard in the general case. We use Gibbs sampling based algorithms to perform a distributed optimization that would lead to the global optimum of the problem. The objective of this paper is to show how to use the Gibbs sampling (GS) algorithm and its variant the Metropolis-Hasting (MH) algorithm. We also propose an enhanced method of the MH algorithm, based on a priori-known target state distribution, which improves the convergence speed without increasing the complexity. Furthermore, we study different temperature cooling strategies and investigate their impact on the network optimization and convergence speed. Simulation results have also shown the effectiveness of the proposed methods.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00862527
Author Garcia, Virgile, Chen, Chung Shue, Zhou, Yiqing, Shi, Jinglin
Maintainer CCSD
Last Updated May 9, 2026, 10:14 (UTC)
Created May 9, 2026, 10:14 (UTC)
Identifier hal-00862527
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Chinese Academy of Sciences [Changchun Branch] (CAS)
creator Garcia, Virgile
date 2013-10-10T00:00:00
harvest_object_id a016d6d1-0e66-47a8-97d3-fae2d3159234
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-01-19T00:00:00
set_spec type:REPORT