The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A rede de rádio cognitiva (CRN) fornece uma maneira eficaz de melhorar a eficiência e a flexibilidade no uso do espectro. Devido à coexistência de usuário secundário (SU) e usuário primário (PU), o gerenciamento de interferências é uma questão crítica a ser abordada se quisermos colher todos os benefícios. Neste artigo, consideramos o problema de gerenciamento conjunto de interferências e alocação de recursos em um CRN ad hoc multicanal. Formulamos o problema como um jogo de formação de coalizão sobreposta para maximizar a taxa de soma dos links SU e, ao mesmo tempo, garantir a qualidade de serviço (QoS) dos links PU. No jogo, cada link SU pode tomar uma decisão autônoma e pode participar de uma ou mais coalizões cooperativas simultaneamente para maximizar seu retorno. Para obter a solução do jogo formulado, é proposto um algoritmo distribuído e auto-organizado para realizar a formação de coalizões. Analisamos as propriedades do algoritmo e mostramos que os links SU podem cooperar para alcançar uma estrutura de coalizão final estável. Comparado com as abordagens existentes, o esquema proposto alcança uma melhoria de desempenho apreciável em termos da taxa de soma dos links SU, o que é demonstrado pelos resultados da simulação.
Ke WANG
Southeast University
Wei HENG
Southeast University
Xiang LI
Southeast University
Jing WU
Southeast University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Ke WANG, Wei HENG, Xiang LI, Jing WU, "Interference Management and Resource Allocation in Multi-Channel Ad Hoc Cognitive Radio Network" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 3, pp. 320-327, March 2021, doi: 10.1587/transcom.2020EBP3103.
Abstract: Cognitive radio network (CRN) provides an effective way of improving efficiency and flexibility in spectrum usage. Due to the coexistence of secondary user (SU) and primary user (PU), managing interference is a critical issue to be addressed if we are to reap the full benefits. In this paper, we consider the problem of joint interference management and resource allocation in a multi-channel ad hoc CRN. We formulate the problem as an overlapping coalition formation game to maximize the sum rate of SU links while guaranteeing the quality of service (QoS) of PU links. In the game, each SU link can make an autonomous decision and is allowed to participate in one or more cooperative coalitions simultaneously to maximize its payoff. To obtain the solution of the formulated game, a distributed, self-organizing algorithm is proposed for performing coalition formation. We analyze the properties of the algorithm and show that SU links can cooperate to reach a final stable coalition structure. Compared with existing approaches, the proposed scheme achieves appreciable performance improvement in terms of the sum rate of SU links, which is demonstrated by simulation results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020EBP3103/_p
Copiar
@ARTICLE{e104-b_3_320,
author={Ke WANG, Wei HENG, Xiang LI, Jing WU, },
journal={IEICE TRANSACTIONS on Communications},
title={Interference Management and Resource Allocation in Multi-Channel Ad Hoc Cognitive Radio Network},
year={2021},
volume={E104-B},
number={3},
pages={320-327},
abstract={Cognitive radio network (CRN) provides an effective way of improving efficiency and flexibility in spectrum usage. Due to the coexistence of secondary user (SU) and primary user (PU), managing interference is a critical issue to be addressed if we are to reap the full benefits. In this paper, we consider the problem of joint interference management and resource allocation in a multi-channel ad hoc CRN. We formulate the problem as an overlapping coalition formation game to maximize the sum rate of SU links while guaranteeing the quality of service (QoS) of PU links. In the game, each SU link can make an autonomous decision and is allowed to participate in one or more cooperative coalitions simultaneously to maximize its payoff. To obtain the solution of the formulated game, a distributed, self-organizing algorithm is proposed for performing coalition formation. We analyze the properties of the algorithm and show that SU links can cooperate to reach a final stable coalition structure. Compared with existing approaches, the proposed scheme achieves appreciable performance improvement in terms of the sum rate of SU links, which is demonstrated by simulation results.},
keywords={},
doi={10.1587/transcom.2020EBP3103},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - Interference Management and Resource Allocation in Multi-Channel Ad Hoc Cognitive Radio Network
T2 - IEICE TRANSACTIONS on Communications
SP - 320
EP - 327
AU - Ke WANG
AU - Wei HENG
AU - Xiang LI
AU - Jing WU
PY - 2021
DO - 10.1587/transcom.2020EBP3103
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2021
AB - Cognitive radio network (CRN) provides an effective way of improving efficiency and flexibility in spectrum usage. Due to the coexistence of secondary user (SU) and primary user (PU), managing interference is a critical issue to be addressed if we are to reap the full benefits. In this paper, we consider the problem of joint interference management and resource allocation in a multi-channel ad hoc CRN. We formulate the problem as an overlapping coalition formation game to maximize the sum rate of SU links while guaranteeing the quality of service (QoS) of PU links. In the game, each SU link can make an autonomous decision and is allowed to participate in one or more cooperative coalitions simultaneously to maximize its payoff. To obtain the solution of the formulated game, a distributed, self-organizing algorithm is proposed for performing coalition formation. We analyze the properties of the algorithm and show that SU links can cooperate to reach a final stable coalition structure. Compared with existing approaches, the proposed scheme achieves appreciable performance improvement in terms of the sum rate of SU links, which is demonstrated by simulation results.
ER -