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
본 논문에서는 숨겨진 노드와 노출된 노드 문제를 해결하기 위해 TDD(Time Division Duplexing) 모드에서 동작하는 OFDMA(Orthogonal Frequency Division Multiple Access) 기반 애드혹 및 셀룰러 네트워크를 위한 새로운 분산형 DSA(Dynamic Sub-Carrier Assignment) 알고리즘을 제안합니다. 미디어 액세스 제어(MAC)에서. 이 방법은 동일 채널 간섭(CCI)을 줄여 네트워크의 전체 처리량을 증가시킵니다. 다중 경로 페이딩 채널의 시간 및 주파수 선택성과 TDD가 제공하는 채널 상호성을 완전히 활용하면 CCI는 감소하고 처리량은 증가할 수 있습니다. 채널의 시간 및 주파수 선택성은 일반적으로 이동 통신의 주요 문제입니다. 그러나 TDD 모드의 OFDMA 기반 네트워크에 대한 채널 할당과 관련하여 채널의 시간 및 주파수 선택성은 간섭을 줄이는 열쇠입니다. 제안된 채널 할당 메커니즘에서는 이 송신기를 잠재적인 피해자 수신기에 연결하는 부반송파의 해당 채널이 심하게 페이드되는 경우에만 송신기와 수신기 간의 데이터 전송을 위해 여러 부반송파 클러스터가 할당됩니다. 또한 제안된 알고리즘은 완전히 분산된 방식으로 작동하므로 네트워크 자체 구성뿐만 아니라 임시 및 다중 홉 통신을 효과적으로 지원할 수 있습니다. 수치 결과는 주어진 서비스 품질에 대해 제안된 접근 방식으로 얻은 처리량이 임시 지리적 시나리오의 모든 전제 조건에서 기존 방법의 처리량보다 높다는 것을 보여줍니다.
Van-Duc NGUYEN
Harald HAAS
Kyandoghere KYAMAKYA
Jean-Chamerlain CHEDJOU
Tien-Hoa NGUYEN
Seokho YOON
Hyunseung CHOO
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.
부
Van-Duc NGUYEN, Harald HAAS, Kyandoghere KYAMAKYA, Jean-Chamerlain CHEDJOU, Tien-Hoa NGUYEN, Seokho YOON, Hyunseung CHOO, "Decentralized Dynamic Sub-Carrier Assignment for OFDMA-Based Adhoc and Cellular Networks" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 12, pp. 3753-3764, December 2009, doi: 10.1587/transcom.E92.B.3753.
Abstract: In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3753/_p
부
@ARTICLE{e92-b_12_3753,
author={Van-Duc NGUYEN, Harald HAAS, Kyandoghere KYAMAKYA, Jean-Chamerlain CHEDJOU, Tien-Hoa NGUYEN, Seokho YOON, Hyunseung CHOO, },
journal={IEICE TRANSACTIONS on Communications},
title={Decentralized Dynamic Sub-Carrier Assignment for OFDMA-Based Adhoc and Cellular Networks},
year={2009},
volume={E92-B},
number={12},
pages={3753-3764},
abstract={In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.},
keywords={},
doi={10.1587/transcom.E92.B.3753},
ISSN={1745-1345},
month={December},}
부
TY - JOUR
TI - Decentralized Dynamic Sub-Carrier Assignment for OFDMA-Based Adhoc and Cellular Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3753
EP - 3764
AU - Van-Duc NGUYEN
AU - Harald HAAS
AU - Kyandoghere KYAMAKYA
AU - Jean-Chamerlain CHEDJOU
AU - Tien-Hoa NGUYEN
AU - Seokho YOON
AU - Hyunseung CHOO
PY - 2009
DO - 10.1587/transcom.E92.B.3753
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2009
AB - In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.
ER -