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
Rangkaian radio kognitif (CRN) menyediakan cara yang berkesan untuk meningkatkan kecekapan dan fleksibiliti dalam penggunaan spektrum. Disebabkan kewujudan bersama pengguna sekunder (SU) dan pengguna utama (PU), mengurus gangguan merupakan isu kritikal yang perlu ditangani jika kita ingin meraih faedah sepenuhnya. Dalam makalah ini, kami mempertimbangkan masalah pengurusan gangguan bersama dan peruntukan sumber dalam CRN ad hoc berbilang saluran. Kami merumuskan masalah itu sebagai permainan pembentukan gabungan yang bertindih untuk memaksimumkan kadar jumlah pautan SU sambil menjamin kualiti perkhidmatan (QoS) pautan PU. Dalam permainan, setiap pautan SU boleh membuat keputusan autonomi dan dibenarkan untuk mengambil bahagian dalam satu atau lebih gabungan koperasi secara serentak untuk memaksimumkan hasilnya. Untuk mendapatkan penyelesaian permainan yang dirumuskan, algoritma penganjuran sendiri yang diedarkan dicadangkan untuk melaksanakan pembentukan gabungan. Kami menganalisis sifat algoritma dan menunjukkan bahawa pautan SU boleh bekerjasama untuk mencapai struktur gabungan stabil terakhir. Berbanding dengan pendekatan sedia ada, skim yang dicadangkan mencapai peningkatan prestasi yang ketara dari segi kadar jumlah pautan SU, yang ditunjukkan oleh hasil simulasi.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -